Abstract
This chapter discusses an application of advanced planning support in designing a sea-transport system. The system is designed for Norwegian companies who depend on sea-transport between Norway and Central Europe. They want to achieve faster and more frequent transport by combining tonnage. This requires the possible construction of up to 15 new ships with potential investments of approximately 150 mill US dollars. The problem is a variant of the general pickup and delivery problem with multiple time windows. In addition, it includes requirements for recurring visits, separation between visits and limits on transport lead-time. It is solved by a heuristic branch-and-price algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
Carlyle W.M. and Wood R.K. (2003). Near-Shortest and K-Shortest Simple Paths. Technical Report, Department of Operations Research, Naval Postgraduate School, Monterey, CA 93943, USA.
Cho S.-C. and Perakis A.N. (1996). Optimal liner fleet routing strategies. Maritime Policy & Management, 23:249–259.
Crainic, T.G. and Laporte G. (1997). Planning models for freight transportation. European Journal of Operational Research, 97:409–438.
Christiansen, M. (1999). Decomposition of a combined inventory and time constrained ship routing problem. Transportation Science, 33:3–16.
Christiansen, M., Fagerholt, K. and Ronen, D. (2004). Ship routing and scheduling: Status and perspectives. Transportation Science, 38:1–18.
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.
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.
Dumas, Y., Desrosiers, J., and Soumis, F. (1991). The pickup and delivery problem with time windows. European Journal of Operational Research, 54:7–22.
Fagerholt, K. (1999). Optimal fleet design in a ship routing problem. International Transactions in Operations Research, 6:453–464.
Laporte, G. and Osman, I.H. (1995). Routing problems: A bibliography. Annals of Operations Research, 61:227–262.
Mehlhorn, K. and Ziegelmann, M. (2000). Resource Constrained Shortest Paths. Proc. 8th European Symposium on Algorithms (ESA2000), pp. 326–337, LNCS 1879 Springer, Berlin.
Powell, B.J. and Perakis, A.N. (1997). Fleet deployment optimization for liner shipping: an integer programming model. Maritime Policy & Management, 24:183–192.
Rana, K. and Vickson, R.G. (1991). Routing ships using Lagrangean relaxation and decomposition. Transportation Science, 25:201–214.
Ronen, D. (1983). Cargo ships routing and scheduling: Survey of models and problems. European Journal of Operational Research, 12:119–126.
Ronen, D. (1993). Ship scheduling: The last decade. European Journal of Operational Research, 71:325–333.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Sigurd, M.M., Ulstein, N.L., Nygreen, B., Ryan, D.M. (2005). Ship Scheduling with Recurring Visits and Visit Separation Requirements. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds) Column Generation. Springer, Boston, MA. https://doi.org/10.1007/0-387-25486-2_8
Download citation
DOI: https://doi.org/10.1007/0-387-25486-2_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-25485-2
Online ISBN: 978-0-387-25486-9
eBook Packages: Business and EconomicsBusiness and Management (R0)