2017
DOI: 10.1007/s00291-017-0480-4
|View full text |Cite
|
Sign up to set email alerts
|

Tramp ship routing and scheduling with voyage separation requirements

Abstract:  Users may download and print one copy of any publication from the public portal for the purpose of private study or research.  You may not further distribute the material or use it for any profit-making activity or commercial gain  You may freely distribute the URL identifying the publication in the public portal If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 20 publications
(10 citation statements)
references
References 25 publications
0
10
0
Order By: Relevance
“…The fourth is that the authors brought no evidence on the possibility of solving large problems when more cargoes and ships are added. Bakkehaug et al (2016) and Vilhelmsen et al (2017) have developed a similar model to schedule the voyages of a fleet of ships considering a minimum time spread between some voyages. The former has used the Adaptive Large Neighborhood Search (ALNS) heuristic to solve the problem, while the latter has used a Decomposition approach with Dynamic Programming algorithm for column generation.…”
Section: Problem Statement and Review Of The Literature In Tramp Shipmentioning
confidence: 99%
“…The fourth is that the authors brought no evidence on the possibility of solving large problems when more cargoes and ships are added. Bakkehaug et al (2016) and Vilhelmsen et al (2017) have developed a similar model to schedule the voyages of a fleet of ships considering a minimum time spread between some voyages. The former has used the Adaptive Large Neighborhood Search (ALNS) heuristic to solve the problem, while the latter has used a Decomposition approach with Dynamic Programming algorithm for column generation.…”
Section: Problem Statement and Review Of The Literature In Tramp Shipmentioning
confidence: 99%
“…The overall problem is solved by the branch-and-bound method. Vilhelmsen et al (2017) has used a decomposition model with dynamic programming algorithm to solve a shipping problem by column generation. The model focuses on the time spread between voyages in response to a charter party clause, which requires the voyages to be "fairly evenly spread".…”
Section: Upscaling In Timementioning
confidence: 99%
“…Laake and Zhang (2013), Vilhelmsen et al (2015) have developed a linear model to handle the case where multiple cargoes can be carried simultaneously on board each ship. Bakkehaug et al (2016) and Vilhelmsen et al (2017) have developed a model to schedule the voyages of a fleet of ships considering a minimum time spread between some voyages. The former has used the adaptive large neighborhood search (ALNS) heuristic to solve the problem, while the latter has used a decomposition approach with dynamic programming algorithm for column generation.…”
Section: Cargo Ship Profitability Capacity and Speedmentioning
confidence: 99%