Joint Routing and Deployment of a Fleet of Container Vessels

Alvarez, J. Fernando

doi:10.1057/mel.2009.5

Cited by 155 publications

(76 citation statements)

References 24 publications

(24 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Constraint (9) and Constraint (12) enforce flow conservation at each port on each ship route. Constraint (10) represents that containers originating from a given port O should not return to the same port.…”

Section: Constraintsmentioning

confidence: 99%

Liner Shipping Fleet Deployment with Sustainable Collaborative Transportation

Sun

Weng

2016

Sustainability

View full text Add to dashboard Cite

Facing sharp competition in the market for shipping companies, it is necessary to make reasonable and efficient decisions to optimize the container shipping line network so as to improve the shipping efficiency and reduce the transportation cost, as well as to realize the transportation sustainability. Therefore, the liner ship fleet deployment problem with collaborative transportation is proposed in this paper. This problem is formulated as a mixed-integer linear programming model that takes collaborative transportation into consideration. The model includes fixed cost, variable cost, berth cost, transport cost, penalty, compensation cost, and so on. To achieve the sustainable development of collaborative transportation, the shipping companies could make a selection between the internal routes and the external routes to serve each task by comparing the distance between the above routes. A real Asia-Europe-Oceania numerical experiment shows that the proposed sustainable collaborative transportation model can be efficiently solved by C++ calling ILOG CPLEX. Results demonstrate that the optimized shipping line network with sustainable collaborative transportation can improve the service efficiency, as well as the service level of shipping companies.

show abstract

Section: Constraintsmentioning

confidence: 99%

Liner Shipping Fleet Deployment with Sustainable Collaborative Transportation

Sun

Weng

2016

Sustainability

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

“…Rana and Vickson [16], Christiansen and Nygreen [5], Fagerholt [8], Agarwal and Ergun [1] and Alvarez [2] allow for several visits to a port. The allowance of several visits to a port is, in all the mentioned papers (with the exception of [1]) achieved by combining simple routes.…”

Section: Literature Reviewmentioning

confidence: 99%

“…In the recent paper by Agarwal and Ergun [1], the authors solve larger problems by using a heuristic based on Benders' Decomposition and compare it to a similar solution method which uses column generation. Recently an article on liner shipping network design optimization has been publish by Alvarez [2] using tabu search and column generation. The model has transhipment costs as part of the overall cost evaluation.…”

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

Joint Routing and Deployment of a Fleet of Container Vessels

Cited by 155 publications

References 24 publications

Liner Shipping Fleet Deployment with Sustainable Collaborative Transportation

Liner Shipping Fleet Deployment with Sustainable Collaborative Transportation

Reversing port rotation directions in a container liner shipping network

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

Contact Info

Product

Resources

About