Ship Scheduling with Recurring Visits and Visit Separation Requirements

Mikkel M. Sigurd (), Nina L. Ulstein (), Bjørn Nygreen () and David M. Ryan ()
Additional contact information
Mikkel M. Sigurd: University of Copenhagen
Nina L. Ulstein: Norwegian University of Science and Technology
Bjørn Nygreen: Norwegian University of Science and Technology
David M. Ryan: University of Auckland

Chapter Chapter 8 in Column Generation, 2005, pp 225-245 from Springer

Abstract: 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.

Keywords: Column Generation; Master Problem; Planning Period; Short Path Problem; Price Problem (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (7)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-25486-9_8

Ordering information: This item can be ordered from
http://www.springer.com/9780387254869

DOI: 10.1007/0-387-25486-2_8

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().