Modelling path flows for a combined ship routing and inventory management problem

Annals of Operations Research

Volumn 82, Issue , 1998, Pages 391-412

  Christiansen, Marielle ^a   Nygreen, Bjørn ^a  

^a NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032337356     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018979107222     Document Type: Article

References (16)

1. G.G. Brown, G.W. Graves and D. Ronen, Scheduling ocean transportation of crude oil, Management Science 33(1987)335-346.
2. 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.
3. M. Christiansen, Decomposition of a combined inventory and time constrained ship routing problem, Transportation Science, to appear.
4. M. Christiansen and B. Nygreen, A method for solving ship routing problems with inventory constraints, Annals of Operations Research 81(1998)357-378.
5. N. Christofides, A. Mingozzi and P. Toth, State-space relaxation procedures for the computation of bounds to routing problems, Networks 11(1981)145-164.
6. 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.
7. M. Desrochers and F. Soumis, A generalized permanent labelling algorithm for the shortest path problem with time windows, INFOR 26(1988)191-211.
8. 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.
9. J. Desrosiers, Y. Dumas, M.M. Solomon and F. Soumis, Time constrained routing and scheduling, in: Handbooks in Operations Research and Management Science 8, Network Routing, North-Holland, Amsterdam, 1995, pp. 35-139.
10. M. Dror and M. Ball, Inventory/routing: Reduction from an annual to a short-period problem, Naval Research Logistics 34(1987)891-905.
11. Y. Dumas, J. Desrosiers and F. Soumis, The pickup and delivery problem with time windows, European Journal of Operational Research 54(1991)7-22.
12. EDS, SCICONIC User Guide, Version 2.3, Milton Keynes, England, 1993.
13. A. Federgruen and D. Simchi-Levi, Analysis of vehicle routing and inventory-routing problems, in: Handbooks in Operations Research and Management Science 8, Network Routing, North-Holland, Amsterdam, 1995, pp. 297-373.
14. M.L. Fisher and M.B. Rosenwein, An interactive optimization system for bulk-cargo ship scheduling, Naval Research Logistics 36(1989)27-42.
15. 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.
16. 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.