Determining Optimal Transport Routes of Inland Waterway Container Ships

The transport routes of chartered container ships or tows in inland waterway transport are investigated in this paper. The optimal values of parameters that influence the efficient utilization of these ships or tows or business success of a container shipping company with available container ships of this kind in its fleet are also determined. These parameters include size of container ship on a certain route, number of containers loaded or unloaded at each port on a route, ship speed, realized revenues, costs and profit, and others. The proposed model helps in evaluating whether an inland waterway container ship or tow should be chartered or not. The optimal values of all parameters, based on the developed mixed-integer linear programming model, are determined by using LINGO, specialized software for mathematical programming.

[1]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[2]  Ke Liu,et al.  Allocation of empty containers between multi-ports , 2007, Eur. J. Oper. Res..

[3]  Rob Konings Development of Container Barge Transport on Small Waterways: From Increasing Scale to Increasing Scope , 2004 .

[4]  Rob Konings Hub-and-spoke networks in container-on-barge transport , 2006 .

[5]  Krishan Rana,et al.  A Model and Solution Algorithm for Optimal Routing of a Time-Chartered Containership , 1988, Transp. Sci..

[6]  Rob Konings,et al.  Opportunities to improve container barge handling in the port of Rotterdam from a transport network perspective , 2007 .

[7]  N. L. Schwartz Discrete Programs for Moving Known Cargos from Origins to Destinations on Time at Minimum Bargeline Fleet Cost , 1968 .

[8]  Roger R. Crane,et al.  The Scheduling of a Barge Line , 1959 .

[9]  Todd C. Whyte,et al.  A simulation-based software system for barge dispatching and boat assignment in inland waterways , 2005, Simul. Model. Pract. Theory.

[10]  Krishan Rana,et al.  Routing Container Ships Using Lagrangean Relaxation and Decomposition , 1991, Transp. Sci..

[11]  Chuen-Yih Chen,et al.  A Two-Stage Stochastic Network Model and Solution Methods for the Dynamic Empty Container Allocation Problem , 1998, Transp. Sci..

[12]  Todd C. Whyte,et al.  Clustering Techniques in Barge Transportation , 2002 .

[13]  Michel Gendreau,et al.  Dynamic and Stochastic Models for the Allocation of Empty Containers , 1993, Oper. Res..

[14]  Marius M. Solomon,et al.  The Tug Fleet Size Problem for Barge Line Operations: A Polynomial Algorithm , 1987, Transp. Sci..

[15]  Akio Imai,et al.  The container shipping network design problem with empty container repositioning , 2007 .

[16]  Todd C. Whyte,et al.  Grouping and Assignment of Barges , 2002 .