Fast Generation of Near-Optimal Plans for Eco-Efficient Stowage of Large Container Vessels

Dario Pacino; Rune Møller Jensen; Alberto Delgado-Ortegon; Tom Bebbington

Fast Generation of Near-Optimal Plans for Eco-Efficient Stowage of Large Container Vessels

Dario Pacino, Rune Møller Jensen, Alberto Delgado-Ortegon, Tom Bebbington

Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

Abstract

Eco-Efficient stowage plans that are both competitive and sustainable have become a priority for the shipping industry. Stowage planning is NP-hard and is a challenging optimization problem in practice. We propose a new 2-phase approach that generates near-optimal stowage plans and fulfills industrial time and quality requirements. Our approach combines an integer programming model for assigning groups of containers to storage areas of the vessel over multiple ports, and a constraint programming and local search procedure for stowing individual containers.

Originalsprog	Engelsk
Titel	ICCL (2011). Proceedings of the International Conference on Computer Languages
Antal sider	15
Forlag	Springer
Publikationsdato	19 sep. 2011
Sider	286-301
ISBN (Trykt)	978-3-642-24263-2
Status	Udgivet - 19 sep. 2011

Emneord

Eco-efficient stowage plans
Shipping industry optimization
Integer programming
Constraint programming
NP-hard problems

Citationsformater

@inproceedings{1f482ed6f99f4380ad8134472e0a2e77,

title = "Fast Generation of Near-Optimal Plans for Eco-Efficient Stowage of Large Container Vessels",

abstract = "Eco-Efficient stowage plans that are both competitive and sustainable have become a priority for the shipping industry. Stowage planning is NP-hard and is a challenging optimization problem in practice. We propose a new 2-phase approach that generates near-optimal stowage plans and fulfills industrial time and quality requirements. Our approach combines an integer programming model for assigning groups of containers to storage areas of the vessel over multiple ports, and a constraint programming and local search procedure for stowing individual containers.",

keywords = "Eco-efficient stowage plans, Shipping industry optimization, Integer programming, Constraint programming, NP-hard problems, Eco-efficient stowage plans, Shipping industry optimization, Integer programming, Constraint programming, NP-hard problems",

author = "Dario Pacino and Jensen, {Rune M{\o}ller} and Alberto Delgado-Ortegon and Tom Bebbington",

note = "Is this a conference contribution? In Proceedings of ICCL'2011. pp.286~301 Kindly change into conference contribution template in PURE and fill in corresponding publication data Volume, isbn, .... mangler (jcg)",

year = "2011",

month = sep,

day = "19",

language = "English",

isbn = "978-3-642-24263-2",

pages = "286--301",

booktitle = "ICCL (2011). Proceedings of the International Conference on Computer Languages",

publisher = "Springer",

address = "Germany",

}

Fast Generation of Near-Optimal Plans for Eco-Efficient Stowage of Large Container Vessels. / Pacino, Dario; Jensen, Rune Møller; Delgado-Ortegon, Alberto et al.
ICCL (2011). Proceedings of the International Conference on Computer Languages. Springer, 2011. s. 286-301.

Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

TY - GEN

T1 - Fast Generation of Near-Optimal Plans for Eco-Efficient Stowage of Large Container Vessels

AU - Pacino, Dario

AU - Jensen, Rune Møller

AU - Delgado-Ortegon, Alberto

AU - Bebbington, Tom

N1 - Is this a conference contribution? In Proceedings of ICCL'2011. pp.286~301 Kindly change into conference contribution template in PURE and fill in corresponding publication data Volume, isbn, .... mangler (jcg)

PY - 2011/9/19

Y1 - 2011/9/19

N2 - Eco-Efficient stowage plans that are both competitive and sustainable have become a priority for the shipping industry. Stowage planning is NP-hard and is a challenging optimization problem in practice. We propose a new 2-phase approach that generates near-optimal stowage plans and fulfills industrial time and quality requirements. Our approach combines an integer programming model for assigning groups of containers to storage areas of the vessel over multiple ports, and a constraint programming and local search procedure for stowing individual containers.

AB - Eco-Efficient stowage plans that are both competitive and sustainable have become a priority for the shipping industry. Stowage planning is NP-hard and is a challenging optimization problem in practice. We propose a new 2-phase approach that generates near-optimal stowage plans and fulfills industrial time and quality requirements. Our approach combines an integer programming model for assigning groups of containers to storage areas of the vessel over multiple ports, and a constraint programming and local search procedure for stowing individual containers.

KW - Eco-efficient stowage plans

KW - Shipping industry optimization

KW - Integer programming

KW - Constraint programming

KW - NP-hard problems

KW - Eco-efficient stowage plans

KW - Shipping industry optimization

KW - Integer programming

KW - Constraint programming

KW - NP-hard problems

M3 - Article in proceedings

SN - 978-3-642-24263-2

SP - 286

EP - 301

BT - ICCL (2011). Proceedings of the International Conference on Computer Languages

PB - Springer

ER -

Fast Generation of Near-Optimal Plans for Eco-Efficient Stowage of Large Container Vessels

Abstract

Emneord

Fingeraftryk

Citationsformater