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

Reinhardt, Line Blander; Pisinger, David

doi:10.1007/s10696-011-9105-4

Cited by 107 publications

(57 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to reviews of Christiansen et al (2004), Christiansen et al (2013) and Meng et al (2014), most studies on liner shipping operations focus on network design, ship deployment, and container routing with fixed schedules or without considering the schedules, e.g., Fagerholt (1999), Shintani et al (2007), Gelareh and Meng (2010), Meng and Wang (2010), Bell et al (2011), , Reinhardt and Pisinger (2012), Dong and Song (2012) and Brouer et al (2013a).…”

Section: Literature Reviewmentioning

confidence: 99%

Liner ship route schedule design with port time windows

Wang

Alharbi

Davy

2014

Transportation Research Part C: Emerging Technologies

View full text Add to dashboard Cite

This paper examines a practical tactical liner ship route schedule design problem, which is the determination of the arrival and departure time at each port of call on the ship route. When designing the schedule, the availability of each port in a week, i.e., port time window, is incorporated. As a result, the designed schedule can be applied in practice without or with only minimum revisions. This problem is formulated as a mixedinteger nonlinear nonconvex optimization model. In view of the problem structure, an efficient holistic solution approach is proposed to obtain global optimal solution. The proposed solution method is applied to a trans-Atlantic ship route. The results demonstrate that the port time windows, port handling efficiency, bunker price and unit inventory cost all affect the total cost of a ship route, the optimal number of ships to deploy, and the optimal schedule. problem, which is the determination of the arrival and departure time at each port of call on the ship route. When designing the schedule, the availability of each port in a week, i.e., port time window, is incorporated. As a result, the designed schedule can be applied in practice without or with only minimum revisions. This problem is formulated as a mixed-integer nonlinear non-convex optimization model. In view of the problem structure, an efficient holistic solution approach is proposed to obtain global optimal solution. The proposed * Corresponding author.E-mail addresses: wangshuaian@gmail.com (S. Wang), afma987@uowmail.edu.au (A. Alharbi), pjd@uow.edu.au (P. Davy) 1 solution method is applied to a trans-Atlantic ship route. The results demonstrate that the port time windows, port handling efficiency, bunker price and unit inventory cost all affect the total cost of a ship route, the optimal number of ships to deploy, and the optimal schedule.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Liner ship route schedule design with port time windows

Wang

Alharbi

Davy

2014

Transportation Research Part C: Emerging Technologies

View full text Add to dashboard Cite

show abstract

“…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

“…Imai et al (2009) compare multi port calls versus hub-and-spoke service network structures. Reinhardt and Pisinger (2012) simultaneously take into account network design and fleet assignment and present a sophisticated branch-and-cut approach. Mulder and Dekker (2014) successfully integrated the fleet-and the network-design problem of liner shippers.…”

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

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

Cited by 107 publications

References 21 publications

Liner ship route schedule design with port time windows

Liner ship route schedule design with port time windows

Reversing port rotation directions in a container liner shipping network

Cooperative liner shipping network design by means of a combinatorial auction

Contact Info

Product

Resources

About