Skip to Main content Skip to Navigation
Journal articles

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

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.
Document type :
Journal articles
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02502564
Contributor : Daniel Gavrysiak <>
Submitted on : Monday, March 9, 2020 - 12:48:18 PM
Last modification on : Tuesday, March 10, 2020 - 1:36:02 AM

Identifiers

Collections

ROSAS | UTT | CNRS

Citation

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

Share

Metrics

Record views

68