Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of The International MultiConference of Engineers and Computer Scientists 2011 |
| Volume | 2 |
| Publisher | Newswood Ltd. |
| Publication date | 2011 |
| Pages | 1379-1384 |
| ISBN (Print) | 978-988-19251-2-1 |
| Publication status | Published - 2011 |
| Event | International MultiConference of Engineers and Computer Scientists 2011 - Hong Kong, Hong Kong Duration: 16 Mar 2011 → 18 Mar 2011 |
Conference
| Conference | International MultiConference of Engineers and Computer Scientists 2011 |
|---|---|
| Country/Territory | Hong Kong |
| City | Hong Kong |
| Period | 16/03/2011 → 18/03/2011 |
Keywords
- Path-based
- International trade
- Decomposition methods
- Vehicle Routing Problems.
- Computer science
- Transportation cost
- Sub-problems
- Path-based models
- Dynamic programming
- Design
- Network design
- Liner shipping
- Engineers
- Network design problems
- Green logistics
- Problem size
- Constant pressures
- Transport solution
- Column generation
- Mathematical programming