.png){kind=icon}
返回
Solving multiple scenarios in a combinatorial auction
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2008.12.006.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2008 Elsevier Ltd. All rights reserved.
Keyword:
Combinatorial auction
Integer programming
Public policy
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Alginate surfactant derivatives as an ecofriendly corrosion inhibitor for carbon steel in acidic environments.png)
RSC Advances
RSC AdvancesIF0
PREAI
分享收藏
Therapeutic effect of DNA vaccine encoding the 60-kDa-heat shock protein from Paracoccidoides brasiliensis on experimental paracoccidioidomycosis in miceVaccine
VaccineIF0
PREAI
分享收藏
查看更多内容