Cargo assembly planning

Smith, Olivia J.

doi:10.1007/s13676-014-0048-2

Cited by 15 publications

(24 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The starting point for this work is the model developed in [15] for stockyard planning. The model is described in the next subsection and summarised in Subsection 2.2.…”

Section: Cargo Assembly Planning: Overviewmentioning

confidence: 99%

“…The model is described in the next subsection and summarised in Subsection 2.2. We consider a number of constraints beyond those in [15], which are discussed in Subsection 2.3.…”

Section: Cargo Assembly Planning: Overviewmentioning

confidence: 99%

“…Based on the above description of the problem, we summarize the important features of the model studied in [15], which is taken as the basic model here.…”

Section: The Basic Modelmentioning

confidence: 99%

“…Gulzynsky et al [4] present stockyard management technology which combines greedy construction, enumeration, and integer programming. The closest work to what we describe here is that of Savelsbergh and Smith [15], who propose a greedy algorithm with partial lookahead and truncated tree search using geometric properties of the space-time layouts, for the same stockyard planning problem. We propose a Constraint Programming (CP)-based approach and directly compare it with and extend theirs.…”

Section: Introductionmentioning

confidence: 99%

“…We propose a Constraint Programming (CP)-based approach and directly compare it with and extend theirs. The core of our paper, namely the basic CP model and comparison with [15], was presented in the CPAIOR'14 paper [3].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Local Search for a Cargo Assembly Planning Problem

Belov

Boland

Stuckey

2014

Integration of AI and OR Techniques in Constraint Programming

View full text Add to dashboard Cite

We consider a real-world cargo assembly planning problem arising in a coal supply chain. The cargoes are built on the stockyard at a port terminal from coal delivered by trains. Then the cargoes are loaded onto vessels. Only a limited number of arriving vessels is known in advance. The goal is to minimize the average delay time of the vessels over a long planning period. We model the problem in the MiniZinc constraint programming language and design a large neighbourhood search scheme. The effects of various optional constraints are investigated. Some of the optional constraints expand the model's scope toward a system view (berth capacity, port channel). An adaptive scheme for a greedy heuristic from the literature is proposed and compared to the constraint programming approach.

show abstract

“…The starting point for this work is the model developed in [15] for stockyard planning. The model is described in the next subsection and summarised in Subsection 2.2.…”

Section: Cargo Assembly Planning: Overviewmentioning

confidence: 99%

“…The model is described in the next subsection and summarised in Subsection 2.2. We consider a number of constraints beyond those in [15], which are discussed in Subsection 2.3.…”

Section: Cargo Assembly Planning: Overviewmentioning

confidence: 99%

“…Based on the above description of the problem, we summarize the important features of the model studied in [15], which is taken as the basic model here.…”

Section: The Basic Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations