Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/325133 
Year of Publication: 
2020
Citation: 
[Journal:] EURO Journal on Transportation and Logistics (EJTL) [ISSN:] 2192-4384 [Volume:] 9 [Issue:] 2 [Article No.:] 100009 [Year:] 2020 [Pages:] 1-15
Publisher: 
Elsevier, Amsterdam
Abstract: 
Increasing competition and expectations from customers pressures carriers to further improve efficiency. Forming collaborations is essential for carriers to reach their targeted efficiency levels. In this study, we investigate an auction mechanism to facilitate collaboration amongst carriers while maintaining autonomy for the individual carriers. Multiple auction implementations are evaluated. As the underlying decision problem (which is a traditional vehicle routing problem) is known to be NP-hard, this auction mechanism has an important inherent complexity. Therefore, we use fast and efficient algorithms for the vehicle routing problem to ensure that the auction can be used in operational decision making. Numerical results are presented, indicating that the auction achieves a savings potential better than the thus far reported approaches in the literature. Managerial insights are discussed, particularly related to the properties of the auction and value of the information.
Subjects: 
Vehicle routing problem
Horizontal collaboration
Auction
Algorithms
Request exchange
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by-nc-nd Logo
Document Type: 
Article

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.