An exact algorithm for the single liner service design problem with speed optimisation
Nadjib Brahimi,
Ali Cheaitou,
Pierre Cariou and
Dominique Feillet
International Journal of Production Research, 2021, vol. 59, issue 22, 6809-6832
Abstract:
This paper models a single liner service design and operations problem. The model selects the ports to be included, their sequence, the sailing speed of vessels, the number of vessels and the amounts of cargo to transport by the service. The objective is to maximise profit. First, a relaxation with a mixed-integer nonlinear programming (MINLP) formulation is proposed. We show how to obtain the optimal speed value. Once this value is obtained, the mathematical programming formulation becomes a mixed-integer linear program (MILP). Then, a two-step exact algorithm is presented to solve the problem. Using real data, the optimal solution was found in less than 1 min for small-size problems and in few hours for relatively large-size problems. More tests were carried out on randomly generated data sets with up to 25 ports. The results of these tests are rather promising, and they enabled us to identify the performance limits of the algorithm.
Date: 2021
References: Add references at CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2020.1828636 (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:tprsxx:v:59:y:2021:i:22:p:6809-6832
Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20
DOI: 10.1080/00207543.2020.1828636
Access Statistics for this article
International Journal of Production Research is currently edited by Professor A. Dolgui
More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().