Abstract
We present an optimisation-based solution approach for a real ship planning problem,which is a combination of a variant of the multi-vehicle pickup and delivery problemwith time windows (m-PDPTW), and a multi-inventory model. This problem involves thedesign of a set of minimum cost routes for a fleet of heterogeneous ships servicing a set ofproduction and consumption harbours with a single product (ammonia). The production andinventory information at each harbour, together with the ship capacities and the location ofthe harbours, determine the number of possible arrivals at each harbour during the planningperiod, the time windows for start of service and the load quantity intervals at each arrival.We call this problem the inventory pickup and delivery problem with time windows -IPDPTW. In the mathematical programming model, we duplicate some of the variables anduse a Dantzig - Wolfe decomposition approach. Then the IPDPTW decomposes into a sub-problemfor each harbour and each ship. By synchronising the solutions from both types ofsubproblems, we get extra constraints in the master problem as compared to the masterproblem for the m-PDPTW discussed in the literature. The LP-relaxation of the masterproblem is solved by column generation, where the columns represent ship routes or harbourvisit sequences. Finally, this iterative solution process is embedded in a branch-and-boundsearch to make the solution integer optimal. Our computational results indicate that theproposed method works for the real planning problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L.H. Appelgren, A column generation algorithm for a ship scheduling problem, Transportation Science 3(1969)53–68.
L.H. Appelgren, Integer programming methods for a vessel scheduling problem, Transportation Science 5(1971)64–78.
J.E. Beasley, Fixed routes, Journal of the Operational Research Society 35(1984)49 –55.
G.G. Brown, G.W. Graves and D. Ronen, Scheduling ocean transportation of crude oil, Management Science 33(1987)335–346.
M. Christiansen, Inventory and time constrained ship routing. A mathematical programming approach, Ph.D. Thesis, Department of Economics and Technology Management, Norwegian University of Science and Technology, Trondheim, Norway, 1996.
M. Christiansen and B. Nygreen, Commercial subroutine libraries for mathematical programming used to solve some special binary programs by use of column generation and branch and bound, Proceedings of the Nordic Operations Research Conference, Iceland, 1995.
N. Christofides and J.E. Beasley, The period routing problem, Networks 14(1984)237 –256.
N. Christofides, A. Mingozzi and P. Toth, State-space relaxation procedures for the computation of bounds to routing problems, Networks 11(1981)145–164.
M. Desrochers, J. Desrosiers and M. Solomon, A new optimization algorithm for the vehicle routing problem with time windows, Operations Research 40(1992)342–354.
M. Desrochers and F. Soumis, A reoptimization algorithm for the shortest path problem with time windows, European Journal of Operational Research 35(1988)242–254.
J. Desrosiers, Y. Dumas, M.M. Solomon and F. Soumis, Time constrained routing and scheduling, in: Handbooks in Operations Research and Management Science, vol. 8: Network Routing, eds. M.O. Ball, T.L. Magnanti, C.L. Monma and G.L. Nemhauser, North-Holland, Amsterdam, 1995, pp. 35–139
J. Desrosiers, F. Soumis and M. Desrochers, Routing with time windows by column generation, Networks 14(1984)545–565.
M. Dror and M. Ball, Inventory/routing: Reduction from an annual to a short-period problem, Naval Research Logistics 34(1987)891–905.
Y. Dumas, J. Desrosiers and F. Soumis, The pickup and delivery problem with time windows, European Journal of Operational Research 54(1991)7–22.
EDS, SCICONIC User Guide, Version 2.3, Milton Keynes, England, 1993.
M.L. Fisher and M.B. Rosenwein, An interactive optimization system for bulk-cargo ship scheduling, Naval Research Logistics 36(1989)27–42.
B. Golden and E. Wasil, Computerized vehicle routing in the soft drink industry, Operations Research 35(1987)6–17.
I. Ioachim, S. Gélinas, F. Soumis and J. Desrosiers, A dynamic programming algorithm for the shortest path problem with time windows and linear node costs, GERAD and Ecole Polytechnique, Montréal, Canada, H3T1V6, 1996.
A.W.J. Kolen, A.H.G. Rinnooy Kan and H.W.J.M. Trienekens, Vehicle routing with time windows, Operations Research 35(1987)266–273.
A. Langevin, M. Desrochers, J. Desrosiers and F. Soumis, A two-commodity flow formulation for the traveling salesman and makespan problems with time windows, Networks 23(1993)631 –640.
R.C. Larson, Transporting sludge to the 106-mile site: An inventory/routing model for fleet sizing and logistics system design, Transportation Science 22(1988)186–198.
D.M. Miller, An interactive, computer-aided ship scheduling system, European Journal of Operational Research 32(1987)363–379.
D. Ronen, Short-term scheduling of vessels for shipping bulk or semi-bulk commodities originating in a single area, Operations Research 34(1986)164–173.
R.A. Russell and W. Igo, An assignment routing problem, Networks 9(1979)1 –17.
Rights and permissions
About this article
Cite this article
Christiansen, M., Nygreen, B. A method for solving ship routing problemswith inventory constraints. Annals of Operations Research 81, 357–378 (1998). https://doi.org/10.1023/A:1018921527269
Issue Date:
DOI: https://doi.org/10.1023/A:1018921527269