A benders decomposition algorithm for a bid generation problem in the procurement of Three-echelon transportation services
Authors:
- Xiaohui LyuXLXiaohui Lyu
- Haoxun ChenHCHaoxun Chen
- Nengmin WangNWNengmin Wang
- Zhen YangZYZhen Yang
- 9 June 2023
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 158
Abstract
No abstract availableKeywords
This publication has 44 references indexed in Scilit:
- Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complexComputers & Operations Research, 2013
- An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logisticsComputers & Operations Research, 2012
- The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based HeuristicsTransportation Science, 2011
- Decision support for truckload carriers in one-shot combinatorial auctionsTransportation Research Part B: Methodological, 2009
- Benders decomposition for the uncapacitated multiple allocation hub location problemComputers & Operations Research, 2008
- A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problemComputers & Operations Research, 2005
- Auctions with bidder-determined allowable combinationsEuropean Journal of Operational Research, 2005
- Combinatorial Auctions for Transportation Service Procurement: The Carrier PerspectiveTransportation Research Record: Journal of the Transportation Research Board, 2003
- A multicut algorithm for two-stage stochastic linear programsEuropean Journal of Operational Research, 1988
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962