A Combinatorial Auction for Transportation Matching Service: Formulation and Adaptive Large Neighborhood Search Heuristic
Open Access
- 27 September 2017
- book chapter
- Published by Springer Nature
- p. 127-142
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Bid price optimization for truckload carriers in simultaneous transportation procurement auctionsTransportation Research Part B: Methodological, 2015
- Price-setting based combinatorial auction approach for carrier collaboration with pickup and delivery requestsOperational Research, 2014
- Transportation service procurement in periodic sealed double auctions with stochastic demand and supplyTransportation Research Part B: Methodological, 2013
- Collaborative transportation planning of less-than-truckload freightOR Spectrum, 2013
- Solutions to the request reassignment problem in collaborative carrier networksTransportation Research Part E: Logistics and Transportation Review, 2010
- Solving Truckload Procurement Auctions Over an Exponential Number of BundlesTransportation Science, 2009
- An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time WindowsTransportation Science, 2006
- A tabu search heuristic for the static multi-vehicle dial-a-ride problemTransportation Research Part B: Methodological, 2003
- A Metaheuristic for the Pickup and Delivery Problem with Time WindowsInternational Journal on Artificial Intelligence Tools, 2003
- The First Use of a Combined-Value Auction for Transportation ServicesInterfaces, 2002