AbstractThe paper considers an arrangement for exchanging transportation requests to facilitate collaboration among independent carriers. The goal is to maximize the total profit without decreasing the individual profit of the carriers. Two solution approaches are developed for this problem involving decentralized control and auction based exchange mechanisms. The results are compared with those obtained without collaboration and by a centralized control. They indicate that horizontal collaboration pays off even in highly competitive environments.
Solutions to the request reassignment problem in collaborative carrier networks
Transportation Research Part E: Logistics and Transportation Review ; 46 , 5 ; 627-638
2009-12-08
12 pages
Article (Journal)
Electronic Resource
English
Solutions to the request reassignment problem in collaborative carrier networks
Online Contents | 2010
|Task reassignment in Shuffle/Exchange networks
Tema Archive | 1985
|Genetic Algorithm Approach to Aircraft Gate Reassignment Problem
British Library Online Contents | 1999
|An airport gate reassignment problem with gate closures
Elsevier | 2023
|