An auction for collaborative vehicle routing: Models and algorithms

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, the authors 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, the authors 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.


  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01744462
  • Record Type: Publication
  • Files: TRIS
  • Created Date: May 14 2020 3:05PM