A Branch and Cut algorithm for the container shipping network design problem Line

@inproceedings{Reinhardt2017ABA,
  title={A Branch and Cut algorithm for the container shipping network design problem Line},
  author={Blander Reinhardt and Brian Kallehauge and David Pisinger},
  year={2017}
}
The network design problem in liner shipping is of increasin g importance in a strongly competitive market where potential cost reductions can influence market share a nd profits significantly. In this paper the network design and fleet assignment problems are combined in to a mixed integer linear programming model minimizing the overall cost. To better reflect the real -life situation we take into account the cost of transhipment, a heterogeneous fleet, route dependant capac ities, and… CONTINUE READING
9 Citations
27 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Joint routing and deployment of a fleet of co ntainer vessels.Maritime

  • J. F. Alvarez
  • Economics & Logistics,
  • 2009
Highly Influential
6 Excerpts

Containerisation

  • T. Notteboom, J. Rodrigue
  • box lo gistics and global supply chains: The…
  • 2008
Highly Influential
4 Excerpts

Optimal fleet design in a ship routing probl em

  • K. Fagerholt
  • International Transactions in Operational…
  • 1999
Highly Influential
4 Excerpts

A novel modeling approach for the fle t deployment problem within a short-term planning horizon

  • S. Gelareh, Q. Meng
  • Transportation Research Part E , 46:76–89
  • 2010
2 Excerpts

Joint routing and deployment of a fleet of container vessels

  • M. Jünger Ascheuer, G. Reinelt
  • Maritime Economics & Logistics
  • 2009

Maritime transportation

  • M. Christiansen, K. Fagerholt, B. Nygreen, D. Ronen
  • C. Barnhart and G. Laporte, editors, Handbook in…
  • 2007
1 Excerpt

Similar Papers

Loading similar papers…