Ship scheduling with recurring visits and visit separation requirements

Column Generation

Volumn , Issue , 2005, Pages 225-245

  Sigurd, Mikkel M ^a   Ulstein, Nina L ^b   Nygreen, Bjørn ^b   Ryan, David M ^c  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

^b NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

^c UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 57149143790     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/0-387-25486-2_8     Document Type: Chapter

References (17)

1. Barnhart C, Johnson E.L., Nemhauser G.L., Savelsberg M.W.P., and Vance P.H. (1998). Branch-and-price: Column generation for solving huge integer programs. Operations Research, 46:316-329.
2. Carlyle W.M. and Wood R.K. (2003). Near-Shortest and Shortest Simple Paths. Technical Report, Department of Operations Research, Naval Postgraduate School, Monterey, CA 93943, USA.
3. Cho S.-C. and Perakis A.N. (1996). Optimal liner fleet routing strategies. Maritime Policy & Management, 23:249-259.
4. Crainic, T.G. and Laporte G. (1997). Planning models for freight transportation. European Journal of Operational Research, 97:409-438.
5. Christiansen, M. (1999). Decomposition of a combined inventory and time constrained ship routing problem. Transportation Science, 33:3-16.
6. Christiansen, M., Fagerholt, K. and Ronen, D. (2004). Ship routing and scheduling: Status and perspectives. Transportation Science, 38:1-18.
7. Cordeau, J.-F. Gendreau, M., and Laporte, G. (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks, 30:105-119.
8. Desrosiers, J., Dumas, Y., Solomon, M., and Soumis, F. (1995). Time constrained routing and scheduling. In: Network Routing (M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser, eds.), volume 8, Handbooks in Operations Research and Management Science, pp. 35-139, North-Holland, Amsterdam.
9. Dumas, Y., Desrosiers, J., and Soumis, F. (1991). The pickup and delivery problem with time windows. European Journal of Operational Research, 54:7-22.
10. Fagerholt, K. (1999). Optimal fleet design in a ship routing problem. International Transactions in Operations Research, 6:453-464.
11. Laporte, G. and Osman, LH. (1995). Routing problems: A bibliography. Annals of Operations Research, 61:227-262.
12. Mehlhorn, K. and Ziegelmann, M. (2000). Resource Constrained Shortest Paths. Proc. 8th European Symposium on Algorithms (ESA2000), pp. 326-337, LNCS 1879 Springer, Berlin.
13. Powell, B.J. and Perakis, A.N. (1997). Fleet deployment optimization for liner shipping: an integer programming model. Maritime Policy & Management, 24:183-192.
14. Rana, K. and Vickson, R.G. (1991). Routing ships using Lagrangean relaxation and decomposition. Transportation Science, 25:201-214.
15. Ronen, D. (1983). Cargo ships routing and scheduling: Survey of models and problems. European Journal of Operational Research, 12:119-126.
16. Ronen, D. (1993). Ship scheduling: The last decade. European Journal of Operational Research, 71:325-333.
17. Ryan, D.M. and Foster, B.A. (1981). An integer programming approach to scheduling. In: Computer Scheduling of Public Transport (A. Wren, ed.), North-Holland Publishing Company.