Network Design and Allocation Mechanisms for Carrier Alliances in Liner Shipping

TLDR

Decentralized systems feature operators with varying cooperation and self‑interest. The study investigates how carriers in liner shipping form alliances and use mathematical programming and game theory to design mechanisms that guide them toward optimal collaborative strategies. The mechanism integrates large‑scale network design and capacity allocation, using side payments derived from mathematical programming and game theory to incentivize carriers to act in the alliance’s best interest while maximizing individual profits. Computational results indicate the mechanism facilitates sustainable carrier alliances.

Abstract

Many real-world systems operate in a decentralized manner, where individual operators interact with varying degrees of cooperation and self motive. In this paper, we study transportation networks that operate as an alliance among different carriers. In particular, we study alliance formation among carriers in liner shipping. We address tactical problems such as the design of large-scale networks (that result from integrating the service networks of different carriers in an alliance) and operational problems such as the allocation of limited capacity on a transportation network among the carriers in the alliance. We utilize concepts from mathematical programming and game theory and design a mechanism to guide the carriers in an alliance to pursue an optimal collaborative strategy. The mechanism provides side payments to the carriers, as an added incentive, to motivate them to act in the best interest of the alliance while maximizing their own profits. Our computational results suggest that the mechanism can be used to help carriers form sustainable alliances.