Decentralized Combinatorial Auctions for Dynamic and Large-Scale Collaborative Vehicle Routing

被引:5
作者
Los, Johan [1 ]
Schulte, Frederik [1 ]
Gansterer, Margaretha [2 ]
Hartl, Richard F. [3 ]
Spaan, Matthijs T. J. [4 ]
Negenborn, Rudy R. [1 ]
机构
[1] Delft Univ Technol, Dept Maritime & Transport Technol, Mekelweg 2, NL-2628 CD Delft, Netherlands
[2] Univ Klagenfurt, Dept Operat Energy & Environm Management, Univ Str 65-67, A-9020 Klagenfurt, Austria
[3] Univ Vienna, Dept Business Decis & Analyt, Oskar Morgenstern Pl 1, A-1090 Vienna, Austria
[4] Delft Univ Technol, Dept Software Technol, Van Mourik Broekmanweg 6, NL-2628 XE Delft, Netherlands
来源
COMPUTATIONAL LOGISTICS, ICCL 2020 | 2020年 / 12433卷
关键词
Collaborative vehicle routing; Collaborative transportation; Platform-based transportation; Combinatorial auctions; Multi-Agent System; Bundling; Logistics; Dynamic Pickup and Delivery Problem; CARRIER COLLABORATION; TRUCKLOAD PICKUP; DELIVERY;
D O I
10.1007/978-3-030-59747-4_14
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
While collaborative vehicle routing has a significant potential to reduce transportation costs and emissions, current approaches are limited in terms of applicability, unrealistic assumptions, and low scalability. Centralized planning generally assumes full information and full control, which is often unacceptable for individual carriers. Combinatorial auctions with one central auctioneer overcome this problem and provide good results, but are limited to small static problems. Multi-agent approaches have been proposed for large dynamic problems, but do not directly take the advantages of bundling into account. We propose an approach where participants can individually outsource orders, while a platform can suggest bundles of the offered requests to improve solutions. We consider bundles of size 2 and 3 and show that travel costs can be decreased with 1.7% compared to the scenario with only single order auctions. Moreover, experiments on data from a Dutch transportation platform company show that large-scale collaboration through a platform results in system-wide savings of up to 79% for 1000 carriers.
引用
收藏
页码:215 / 230
页数:16
相关论文
共 27 条
[1]   Solutions to the request reassignment problem in collaborative carrier networks [J].
Berger, Susanne ;
Bierwirth, Christian .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2010, 46 (05) :627-638
[2]  
Bo Dai, 2011, Logistics Research, V3, P101, DOI 10.1007/s12159-011-0046-9
[3]   Efficient insertion heuristics for vehicle routing and scheduling problems [J].
Campbell, AM ;
Savelsbergh, M .
TRANSPORTATION SCIENCE, 2004, 38 (03) :369-378
[4]   Price-setting based combinatorial auction approach for carrier collaboration with pickup and delivery requests [J].
Dai, Bo ;
Chen, Haoxun ;
Yang, Genke .
OPERATIONAL RESEARCH, 2014, 14 (03) :361-386
[5]   The Shared Customer Collaboration Vehicle Routing Problem [J].
Fernandez, Elena ;
Roca-Riu, Mireia ;
Speranza, M. Grazia .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 265 (03) :1078-1093
[6]   Impacts of auction settings on the performance of truckload transportation marketplaces [J].
Figliozzi, MA ;
Mahmassani, HS ;
Jaillet, P .
FREIGHT ANALYSIS, EVALUATION, AND MODELING: 2005 THOMAS B. DEEN DISTINGUISHED LECTURE, 2005, (1906) :89-96
[7]  
Figliozzi MA, 2004, TRANSPORT RES REC, P10
[8]   The value of information in auction-based carrier collaborations [J].
Gansterer, Margaretha ;
Hartl, Richard F. ;
Savelsbergh, Martin .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2020, 221 (221)
[9]  
Gansterer M, 2020, TOP, V28, P1, DOI 10.1007/s11750-020-00541-6
[10]   Centralized bundle generation in auction-based collaborative transportation [J].
Gansterer, Margaretha ;
Hartl, Richard F. .
OR SPECTRUM, 2018, 40 (03) :613-635