Price-setting based Combinatorial Auction Approach for Carriers' Collaboration in Less than Truckload Transportation
In collaborative logistics, multiple carriers may form an alliance to optimize their transportation operations through sharing transportation requests and vehicle capacities. In this paper, we study a carriers’ collaboration problem in less than truckload transportation with pickup and delivery requests. After formulating the problem as a mixed integer programming model, an iterative price-setting based combinatorial auction approach based on Lagrangian relaxation is proposed. Numerical experiments on randomly generated instances demonstrate the effectiveness of the approach.
Paper
Full text
Price-setting based Combinatorial Auction Approach for Carriers' Collaboration in Less than Truckload Transportation
Semantic Scholar · Business · 2011
Abstract
In collaborative logistics, multiple carriers may form an alliance to optimize their transportation operations through sharing transportation requests and vehicle capacities. In this paper, we study a carriers’ collaboration problem in less than truckload transportation with pickup and delivery requests. After formulating the problem as a mixed integer programming model, an iterative price-setting based combinatorial auction approach based on Lagrangian relaxation is proposed. Numerical experiments on randomly generated instances demonstrate the effectiveness of the approach.