http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Strategic Alliance with Competitors in the Electric Vehicle Market: Tesla Motor’s Case
Cheong, Taesu,Song, Sang Hwa,Hu, Chao Hindawi Limited 2016 Mathematical problems in engineering Vol.2016 No.-
<P>We investigate how the choice of coopetition of the simultaneous pursuit of collaboration and competition dynamically impacts both the participating firms and also the other self-developing ones in the same market. A conceptual framework of mathematical models obtained from the arguments and insights in the literature is used to undertake an in-depth study through a multiperiod analysis from 2013 to 2020 of an exemplar case of coopetition, the two concurrently ongoing coopetition partnerships in the US electric vehicle (EV) market, the Tesla Motors-Daimler AG alliance and the Tesla Motors-Toyota alliance and the other firms which are not involved in coopetition.</P>
정태수(Taesu Cheong) 한국SCM학회 2010 한국SCM학회지 Vol.10 No.2
In the paper, we present a variable neighborhood search (VNS)-based heuristic for the Periodic Vehicle Routing Problem (PVRP). The PVRP generalizes the classical Vehicle Routing Problem (VRP) by extending the planning horizon from a single day to multiple days. The proposed algorithm in this paper is based on concepts of VNS and local improvement heuristics. Computational results are presented for the 32 benchmark instances from literature, and the solutions generated by the proposed method are compared with best-known solutions so far. The results indicate that the proposed approach has produced competitive quality of solutions with benchmark results, and for 12 out of the 32 instances, the proposed approach produced equal or improved solutions.
A Multiperiod Vehicle Lease Planning for Urban Freight Consolidation Network
Yang, Woosuk,Cheong, Taesu,Song, Sang Hwa Hindawi Limited 2015 Mathematical problems in engineering Vol.2015 No.-
<P>This paper considers a multiperiod vehicle lease planning problem for urban freight consolidation centers (UFCCs) in the urban freight transport network where short-term-leased and long-term-leased vehicles are hired together. The objective is to allocate the two kinds of leased vehicles optimally for direct transportation services from the associated origin node to the associated UFCC or from the associated UFCC to the associated destinations so as to satisfy a given set of period-to-period freight demands over a given planning horizon at total minimum vehicle allocation cost subject to demand-dependent transportation time restriction. The problem is formulated as an integer programming model and proven to be NP-hard in a strong sense. Thus, a Lagrangian heuristic is proposed to find a good solution efficiently. Numerical experiments show that the proposed algorithm finds good lower and upper bounds within reasonable time.</P>