Designing optimal routes in a liner shipping problem

Kjetil Fagerholt *

Maritime Policy & Management, 2004, vol. 31, issue 4, 259-268

Abstract: A real liner shipping problem of deciding optimal weekly routes for a given fleet of ships is considered and a solution method for solving the problem is proposed. First, all feasible routes for each ship are generated together with the cost and the duration for each route. The routes are given as input to an integer programming (IP) problem. By solving the IP problem, routes for each ship are selected such that total transportation costs are minimized and the demand at each port is satisfied. The total duration for the routes that are selected for a given ship must not exceed one week. The real liner shipping problem is solved together with four randomly generated test problems. The computational results show that proposed solution method is suitable for designing optimal routes in several liner shipping problems.

Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (49)

Downloads: (external link)
http://hdl.handle.net/10.1080/0308883042000259819 (text/html)
Access to full text is restricted to subscribers.

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:taf:marpmg:v:31:y:2004:i:4:p:259-268

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TMPM20

DOI: 10.1080/0308883042000259819

Access Statistics for this article

Maritime Policy & Management is currently edited by Dr Kevin Li and Heather Leggate McLaughlin

More articles in Maritime Policy & Management from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().