A path based model for a green liner shipping network design problem
Publication: Research - peer-review › Article in proceedings – Annual report year: 2011
Standard
A path based model for a green liner shipping network design problem. / Jepsen, Mads Kehlet; Brouer, Berit Dangaard; Plum, Christian Edinger Munk; Pisinger, David; Sigurd, Mikkel M.
In: Proceedings of The International MultiConference of Engineers and Computer Scientists 2011. Vol. 2 Newswood Ltd., 2011. p. 1379-1384.Publication: Research - peer-review › Article in proceedings – Annual report year: 2011
Harvard
APA
CBE
MLA
Vancouver
Author
Bibtex
}
RIS
TY - GEN
T1 - A path based model for a green liner shipping network design problem
A1 - Jepsen,Mads Kehlet
A1 - Brouer,Berit Dangaard
A1 - Plum,Christian Edinger Munk
A1 - Pisinger,David
A1 - Sigurd,Mikkel M.
AU - Jepsen,Mads Kehlet
AU - Brouer,Berit Dangaard
AU - Plum,Christian Edinger Munk
AU - Pisinger,David
AU - Sigurd,Mikkel M.
PB - Newswood Ltd.
PY - 2011
Y1 - 2011
N2 - Liner shipping networks are the backbone of international trade providing low transportation cost, which is a major driver of globalization. These networks are under constant pressure to deliver capacity, cost effectiveness and environmentally conscious transport solutions. This article proposes a new path based MIP model for the Liner shipping Network Design Problem minimizing the cost of vessels and their fuel consumption facilitating a green network. The proposed model reduces problem size using a novel aggregation of demands. A decomposition method enabling delayed column generation is presented. The subproblems have similar structure to Vehicle Routing Problems, which can be solved using dynamic programming.
AB - Liner shipping networks are the backbone of international trade providing low transportation cost, which is a major driver of globalization. These networks are under constant pressure to deliver capacity, cost effectiveness and environmentally conscious transport solutions. This article proposes a new path based MIP model for the Liner shipping Network Design Problem minimizing the cost of vessels and their fuel consumption facilitating a green network. The proposed model reduces problem size using a novel aggregation of demands. A decomposition method enabling delayed column generation is presented. The subproblems have similar structure to Vehicle Routing Problems, which can be solved using dynamic programming.
KW - Path-based
KW - International trade
KW - Decomposition methods
KW - Vehicle Routing Problems.
KW - Computer science
KW - Transportation cost
KW - Sub-problems
KW - Path-based models
KW - Dynamic programming
KW - Design
KW - Network design
KW - Liner shipping
KW - Engineers
KW - Network design problems
KW - Green logistics
KW - Problem size
KW - Constant pressures
KW - Transport solution
KW - Column generation
KW - Mathematical programming
SN - 978-988-19251-2-1
VL - 2
BT - Proceedings of The International MultiConference of Engineers and Computer Scientists 2011
T2 - Proceedings of The International MultiConference of Engineers and Computer Scientists 2011
SP - 1379
EP - 1384
ER -