Price-setting based combinatorial auction approach for carrier collaboration with pickup and delivery requests - Archive ouverte HAL Access content directly
Journal Articles Operational Research Year : 2014

Price-setting based combinatorial auction approach for carrier collaboration with pickup and delivery requests

(1) , (2) , (1)
1
2

Abstract

A carrier collaboration problem with pickup and delivery requests is considered, in which multiple carriers form an alliance to share their pickup and delivery requests and vehicle capacities in order to reduce their transportation costs and consequently increase their profits. A multi-round pricing-setting based combinatorial auction approach is proposed to solve the problem. In each round of the auction, the auctioneer updates the price for serving each request based on Lagrangian relaxation, and each carrier, who is a bidder, determines its requests to be outsourced and the requests to be acquired from other carriers by solving a request selection problem based on the prices. Different price adjustment methods are proposed and compared. Numerical experiments on randomly generated instances demonstrate the effectiveness of the approach.
Not file

Dates and versions

hal-02502564 , version 1 (09-03-2020)

Identifiers

Cite

Bo Dai, Haoxun Chen, Genke Yang. Price-setting based combinatorial auction approach for carrier collaboration with pickup and delivery requests. Operational Research, 2014, 14 (3), pp.361-386. ⟨10.1007/s12351-014-0141-1⟩. ⟨hal-02502564⟩

Collections

CNRS UTT LOSI
19 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More