Computationally Manageable Combinational Auctions
Management Science
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Integer Programming for Combinatorial Auction Winner Determination
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Combinatorial Auctions
Variable neighborhood search and local branching
Computers and Operations Research
A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions
Management Science
Supplier behavior modeling and winner determination using parallel MDP
Expert Systems with Applications: An International Journal
An interactive approach for multi-attribute auctions
Decision Support Systems
A public procurement combinatorial auction mechanism with quality assignment
Decision Support Systems
Shipper decision support for the acceptance of bids during the procurement of transport services
ICCL'11 Proceedings of the Second international conference on Computational logistics
| Hi-index | 0.01 |
As part of its social policy, the government of Chile provides more than 1.8 million meals daily to public schoolchildren under the authority of Junta Nacional de Auxilio Escolar y Becas (JUNAEB), the state agency responsible for the program, at an annual cost of 360 million dollars. The service is provided by private firms chosen through an annual public auction. In order to capture economies of scale, a combinatorial auction design is implemented, allowing suppliers to bid on different sets of geographical units within the country. The bid evaluation process must solve multiple scenarios of a difficult combinatorial optimization model. To date, more than 2 billion dollars have been awarded under this methodology. In this paper, we describe the 2006 auction process and report that solution times can be significantly improved if the scenarios are solved in an appropriate order and the optimal solution to one scenario is employed as the initial solution of another. Results reflecting these improvements are given for real instances of the 2006 auction.