Local search for a cargo assembly planning problem

Gleb Belov, Natashia Boland, Martin W P Savelsbergh, Peter J. Stuckey

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

Abstract

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. We compare against (an extended version of) a greedy heuristic for the same problem.

Original languageEnglish
Title of host publicationIntegration of AI and OR Techniques in Constraint Programming
Subtitle of host publication11th International Conference, CPAIOR 2014, Cork, Ireland, May 19-23, 2014, Proceedings
EditorsHelmut Simonis
Place of PublicationCham Switzerland
PublisherSpringer
Pages159-175
Number of pages17
ISBN (Print)9783319070452, 9783319070469
DOIs
Publication statusPublished - 2014
Externally publishedYes
EventInternational Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems 2014 - Cork, Ireland
Duration: 19 May 201423 May 2014
Conference number: 11th
http://www.springer.com/la/book/9783319070452 (Conference Proceedings)

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume8451
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems 2014
Abbreviated titleCPAIOR 2014
CountryIreland
CityCork
Period19/05/1423/05/14
Internet address

Keywords

  • adaptive greedy
  • constraint programming
  • large neighbourhood search
  • packing
  • resource constraint
  • scheduling
  • visibility horizon

Cite this

Belov, G., Boland, N., Savelsbergh, M. W. P., & Stuckey, P. J. (2014). Local search for a cargo assembly planning problem. In H. Simonis (Ed.), Integration of AI and OR Techniques in Constraint Programming : 11th International Conference, CPAIOR 2014, Cork, Ireland, May 19-23, 2014, Proceedings (pp. 159-175). (Lecture Notes in Computer Science ; Vol. 8451 ). Cham Switzerland : Springer. https://doi.org/10.1007/978-3-319-07046-9_12
Belov, Gleb ; Boland, Natashia ; Savelsbergh, Martin W P ; Stuckey, Peter J. / Local search for a cargo assembly planning problem. Integration of AI and OR Techniques in Constraint Programming : 11th International Conference, CPAIOR 2014, Cork, Ireland, May 19-23, 2014, Proceedings. editor / Helmut Simonis . Cham Switzerland : Springer, 2014. pp. 159-175 (Lecture Notes in Computer Science ).
@inproceedings{1bb578f0f7744d5ea8a4d26430867647,
title = "Local search for a cargo assembly planning problem",
abstract = "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. We compare against (an extended version of) a greedy heuristic for the same problem.",
keywords = "adaptive greedy, constraint programming, large neighbourhood search, packing, resource constraint, scheduling, visibility horizon",
author = "Gleb Belov and Natashia Boland and Savelsbergh, {Martin W P} and Stuckey, {Peter J.}",
year = "2014",
doi = "10.1007/978-3-319-07046-9_12",
language = "English",
isbn = "9783319070452",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "159--175",
editor = "{Simonis }, {Helmut }",
booktitle = "Integration of AI and OR Techniques in Constraint Programming",

}

Belov, G, Boland, N, Savelsbergh, MWP & Stuckey, PJ 2014, Local search for a cargo assembly planning problem. in H Simonis (ed.), Integration of AI and OR Techniques in Constraint Programming : 11th International Conference, CPAIOR 2014, Cork, Ireland, May 19-23, 2014, Proceedings. Lecture Notes in Computer Science , vol. 8451 , Springer, Cham Switzerland , pp. 159-175, International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems 2014, Cork, Ireland, 19/05/14. https://doi.org/10.1007/978-3-319-07046-9_12

Local search for a cargo assembly planning problem. / Belov, Gleb; Boland, Natashia; Savelsbergh, Martin W P; Stuckey, Peter J.

Integration of AI and OR Techniques in Constraint Programming : 11th International Conference, CPAIOR 2014, Cork, Ireland, May 19-23, 2014, Proceedings. ed. / Helmut Simonis . Cham Switzerland : Springer, 2014. p. 159-175 (Lecture Notes in Computer Science ; Vol. 8451 ).

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

TY - GEN

T1 - Local search for a cargo assembly planning problem

AU - Belov, Gleb

AU - Boland, Natashia

AU - Savelsbergh, Martin W P

AU - Stuckey, Peter J.

PY - 2014

Y1 - 2014

N2 - 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. We compare against (an extended version of) a greedy heuristic for the same problem.

AB - 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. We compare against (an extended version of) a greedy heuristic for the same problem.

KW - adaptive greedy

KW - constraint programming

KW - large neighbourhood search

KW - packing

KW - resource constraint

KW - scheduling

KW - visibility horizon

UR - http://www.scopus.com/inward/record.url?scp=84902477775&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-07046-9_12

DO - 10.1007/978-3-319-07046-9_12

M3 - Conference Paper

SN - 9783319070452

SN - 9783319070469

T3 - Lecture Notes in Computer Science

SP - 159

EP - 175

BT - Integration of AI and OR Techniques in Constraint Programming

A2 - Simonis , Helmut

PB - Springer

CY - Cham Switzerland

ER -

Belov G, Boland N, Savelsbergh MWP, Stuckey PJ. Local search for a cargo assembly planning problem. In Simonis H, editor, Integration of AI and OR Techniques in Constraint Programming : 11th International Conference, CPAIOR 2014, Cork, Ireland, May 19-23, 2014, Proceedings. Cham Switzerland : Springer. 2014. p. 159-175. (Lecture Notes in Computer Science ). https://doi.org/10.1007/978-3-319-07046-9_12