Cooperative Liner Shipping Network Design by Means of a Combinatorial Auction

Rasmus Haass and Tobias Buer

No 1, Bremen Computational Logistics Group Working Papers from University of Bremen, Computational Logistics Junior Research Group

Abstract: A liner shipping network design problem is considered which includes ship scheduling and cargo routing decisions. The question is how to enable loose cooperation of multiple liner shippers for jointly solving this profit maximizing network design problem. A variable neighborhood search matheuristic is developed to compute a network for each liner shipper. To coordinate the planning process of multiple liner shippers, a combinatorial auction is proposed. To evaluated the mechanism a computational study is performed which shows that cooperation is in many cases possible and beneficial. As the proposed joint planning mechanism requires less exchange of sensitive information compared to a centralized approach, it enables looser forms of cooperation during network design.

Keywords: liner shipping; network design; combinatorial auction; variable neighborhood search (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.econstor.eu/bitstream/10419/142133/1/BCLG-WP1_2014.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:zbw:bclgwp:1

Access Statistics for this paper

More papers in Bremen Computational Logistics Group Working Papers from University of Bremen, Computational Logistics Junior Research Group Contact information at EDIRC.
Bibliographic data for series maintained by ZBW - Leibniz Information Centre for Economics ().