Please use this identifier to cite or link to this item:
Haass, Rasmus
Buer, Tobias
Year of Publication: 
Series/Report no.: 
Bremen Computational Logistics Group Working Papers 1
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.
liner shipping
network design
combinatorial auction
variable neighborhood search
Document Type: 
Working Paper
Social Media Mentions:

Files in This Item:

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.