1971
DOI: 10.1287/trsc.5.1.64
|View full text |Cite
|
Sign up to set email alerts
|

Integer Programming Methods for a Vessel Scheduling Problem

Abstract: In a previous paper, Appelgren (Appelgren, L. 1969. A column generation algorithm for a ship scheduling problem. Trans. Sci. 3 53–68.), a decomposition algorithm for a class of vessel scheduling problems was presented. In some problems, the algorithm gives fractional solutions that cannot be interpreted as feasible schedules. This paper treats two integer programming methods that can be used to resolve these cases. The cutting plane method that was first tested was abandoned because it was not able to solve al… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
29
0
1

Year Published

1974
1974
2017
2017

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 84 publications
(30 citation statements)
references
References 4 publications
0
29
0
1
Order By: Relevance
“…A general review is given by Christiansen et al (2004), Christiansen et al (2013), and Christiansen and Fagerholt (2014). Appelgren (1969Appelgren ( , 1971 addressed the problem of tramp shipping for a fleet of cargo ships. The problem of these research papers is to assign an optimal loading sequence of cargoes to each ship during a given time.…”
Section: Problem Statement and Review Of The Literature In Tramp Shipmentioning
confidence: 99%
“…A general review is given by Christiansen et al (2004), Christiansen et al (2013), and Christiansen and Fagerholt (2014). Appelgren (1969Appelgren ( , 1971 addressed the problem of tramp shipping for a fleet of cargo ships. The problem of these research papers is to assign an optimal loading sequence of cargoes to each ship during a given time.…”
Section: Problem Statement and Review Of The Literature In Tramp Shipmentioning
confidence: 99%
“…63-68). This induced Appelgren to combine the present approach with integer programming methods, with a three-level method as the result 189 9.2.4 A THREE-LEVEL METHOD Here we will just outline the method developed in Appelgren (1971); some details will not be given, since their inclusion would make the discussion somewhat technical.…”
Section: Infimal Subproblemmentioning
confidence: 99%
“…Each ship can handle a given set of cargoes, each characterized by size, loading dates, origin, and destination. The discussion is based on the work of Appelgren (1969Appelgren ( , 1971. The problem was originally formulated as a network in its arc-chain form, and column generation was applied to it.…”
Section: Introduction and Overviewmentioning
confidence: 99%
“…Very little work has been done on ship scheduling and routing with focus on the whole supply chain. 3 The classical papers by Appelgren 4,5 that cover optimization methods for ship scheduling are among the first papers to appear in the area of ship scheduling. More recent work can be found in the papers of Fagerholt 6 and Fagerholt and Christiansen.…”
Section: Introductionmentioning
confidence: 99%