The container shipping network design problem with empty container repositioning

Shintani, Koichi; Imai, Akio; Nishimura, Etsuko; Papadimitriou, Stratos

doi:10.1016/j.tre.2005.05.003

Cited by 293 publications

(146 citation statements)

References 21 publications

Supporting

Mentioning

114

Contrasting

Unclassified

Order By: Relevance

“…Most studies on liner shipping services require fixed port rotations as input of the models (Dong and Song, 2009;Bell et al, 2011;Qi and Song, 2012;Song and Dong, 2012;Wang and Meng, 2012b;Brouer et al, 2013;Wang et al, 2013b). One line of literature relevant to the optimization of port rotation directions is port rotation design, which is usually referred to as liner ship route design or liner shipping network design; for example, Shintani et al (2007), Agarwal and Ergun (2008), Alvarez (2009), Meng et al (2012, Reinhardt and Pisinger (2012). Nevertheless, none of these studies explicitly investigate the impact of the directions of port rotations.…”

Section: Literature Reviewmentioning

confidence: 99%

Reversing port rotation directions in a container liner shipping network

Wang

Meng

2013

Transportation Research Part B: Methodological

View full text Add to dashboard Cite

Reversing port rotation directions of ship routes is a practical alteration of container liner shipping networks. The port rotation directions of ship routes not only affect the transit time of containers, as has been recognized by the literature, but also the shipping capacity and transshipment cost. This paper aims to obtain the optimal port rotation directions that minimize the generalized network-wide cost including transshipment cost, slotpurchasing cost and inventory cost. A mixed-integer linear programming model is proposed for the optimal port rotation direction optimization problem and it nests a minimum cost multi-commodity network flow model. The proposed model is applied to a liner shipping network operated by a global liner shipping company. Results demonstrate that real-case instances could be efficiently solved and significant cost reductions are gained by optimization of port rotation directions. AbstractReversing port rotation directions of ship routes is a practical alteration of container liner shipping networks. The port rotation directions of ship routes not only affect the transit time of containers, as has been recognized by the literature, but also the shipping capacity and transshipment cost. This paper aims to obtain the optimal port rotation directions that minimize the generalized network-wide cost including transshipment cost, slot-purchasing cost and inventory cost. A mixed-integer linear programming model is proposed for the optimal port rotation direction optimization problem and it nests a minimum cost multicommodity network flow model. The proposed model is applied to a liner shipping network operated by a global liner shipping company. Results demonstrate that real-case instances could be efficiently solved and significant cost reductions are gained by optimization of port rotation directions.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Reversing port rotation directions in a container liner shipping network

Wang

Meng

2013

Transportation Research Part B: Methodological

View full text Add to dashboard Cite

show abstract

“…Therefore older articles such as Rana and Vickson [16] do not include transhipment in their route planning. The model solved in [16] was extended in the recent work by Shintani et al [19], where the restrictive visiting order of Rana and Vickson [16] is relaxed as to represent a more realistic set of routes. Moreover, the repositioning of empty containers is included by Shintani et al [19].…”

Section: Literature Reviewmentioning

confidence: 99%

“…The model solved in [16] was extended in the recent work by Shintani et al [19], where the restrictive visiting order of Rana and Vickson [16] is relaxed as to represent a more realistic set of routes. Moreover, the repositioning of empty containers is included by Shintani et al [19]. To solve the problem presented in [19] a genetic algorithm is used, however, transhipment is not considered.…”

Section: Literature Reviewmentioning

confidence: 99%

A branch and cut algorithm for the container shipping network design problem

2011

View full text Add to dashboard Cite

The network design problem in liner shipping is of increasing importance in a strongly competitive market where potential cost reductions can influence market share and profits significantly. In this paper the network design and fleet assignment problems are combined into a mixed integer linear programming model minimizing the overall cost. To better reflect the real-life situation we take into account the cost of transhipment, a heterogeneous fleet, route dependant capacities, and butterfly routes. To the best of our knowledge it is the first time an exact solution method to the problem considers transhipment cost. The problem is solved with branch-and-cut using clover and transhipment inequalities. Computational results are reported for instances with up to 15 ports.

show abstract

“…In Wang and Meng (2013) the effects of reversing the port call sequence on transshipment, inventory holding, and slot purchasing costs are studied. Shintani et al (2007) and Meng and Wang (2011) take into account the need for repositioning empty containers during network design.…”

Section: Introductionmentioning

confidence: 99%

Cooperative liner shipping network design by means of a combinatorial auction

Buer

Haass

2017

Flex Serv Manuf J

View full text Add to dashboard Cite

Standard-Nutzungsbedingungen:Die Dokumente auf EconStor dürfen zu eigenen wissenschaftlichen Zwecken und zum Privatgebrauch gespeichert und kopiert werden.Sie dürfen die Dokumente nicht für öffentliche oder kommerzielle Zwecke vervielfältigen, öffentlich ausstellen, öffentlich zugänglich machen, vertreiben oder anderweitig nutzen.Sofern die Verfasser die Dokumente unter Open-Content-Lizenzen (insbesondere CC-Lizenzen) zur Verfügung gestellt haben sollten, gelten abweichend von diesen Nutzungsbedingungen die in der dort genannten Lizenz gewährten Nutzungsrechte. Terms of use: Documents in ABSTRACTA liner shipping network design problem is considered which includes ship scheduling and cargo routing decisions. The question is how to enable loose cooperation of multiple liner shippers for jointly solving this profit maximizing network design problem. A variable neighborhood search matheuristic is developed to compute a network for each liner shipper. To coordinate the planning process of multiple liner shippers, a combinatorial auction is proposed.To evaluated the mechanism a computational study is performed which shows that cooperation is in many cases possible and beneficial. As the proposed joint planning mechanism requires less exchange of sensitive information compared to a centralized approach, it enables looser forms of cooperation during network design.

show abstract

The container shipping network design problem with empty container repositioning

Cited by 293 publications

References 21 publications

Reversing port rotation directions in a container liner shipping network

Reversing port rotation directions in a container liner shipping network

A branch and cut algorithm for the container shipping network design problem

Cooperative liner shipping network design by means of a combinatorial auction

Contact Info

Product

Resources

About