Collaborative transportation planning of less-than-truckload freight

Authors:
Xin Wang;Herbert Kopfer
Affiliations:
Chair of Logistics, University of Bremen, Bremen, Germany 28359;Chair of Logistics, University of Bremen, Bremen, Germany 28359
Venue:
OR Spectrum
Year:
2014

Citing 10
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
An optimal solution procedure for the multiple tour maximum collection problem using column generation

Computers and Operations Research - Special issue on the traveling salesman problem
A heuristic for the pickup and delivery traveling salesman problem

Computers and Operations Research
VRP with Time Windows

The vehicle routing problem
VRP with pickup and delivery

The vehicle routing problem
A Metaheuristic for the Pickup and Delivery Problem with Time Windows

ICTAI '01 Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence
Scheduling Transportation of Live Animals to Avoid the Spread of Diseases

Transportation Science
Traveling Salesman Problems with Profits

Transportation Science
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
Lane-Exchange Mechanisms for Truckload Carrier Collaboration

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Collaborative transportation planning (CTP) within a coalition of small and medium-sized freight carriers can be used as a powerful instrument to improve the operational efficiency of the coalition members. In such coalitions, transportation requests from different carriers are exchanged in order to reduce the total fulfillment costs. In this paper, the CTP for a set of independent carriers exchanging less-than-truckload transportation requests is considered. The realistic restriction that all collaborating partners have only limited capacities in their fleets is included in the consideration. To keep their autonomy, coalition members keep their sensitive information including customer payments and cost structures unexposed during CTP. A new decentralized request exchange mechanism for CTP is proposed while only vehicle routes are considered for exchange. It is tested on some newly generated instances and the CTP solutions are compared with those obtained by isolated planning without collaboration and those obtained by a heuristic approach for the centralized planning problem. The results indicate that our mechanism is very efficient and effective in terms of realizing potential cost-savings by CTP, even when capacity limitations and restrictions on the exposure of information are explicitly considered.