Robust Optimization for the Connected Facility Location Problem |
| |
| Institution: | Merrick School of Business, University of Baltimore, Baltimore, Maryland, USA;Smith School of Business, University of Maryland, College Park, Maryland, USA;Instituto de Matemáticas, Unidad Juriquilla, Universidad Nacional Autónoma de México;Instituto de Matemáticas, Universidad Nacional Autónoma de México;UMDI-Facultad de Ciencias, Universidad Nacional Autónoma de México;Instituto de Matemáticas, Unidad Juriquilla, Universidad Nacional Autónoma de México;Instituto de Matematicas, UNAM-Juriquilla, Querétaro, México;Departamento de Computação, Universidade Federal do Ceará, Campus do Pici, Bloco 910, 60440-554 Fortaleza, CE, Brazil;Department of Computer Science, “Sapienza” University of Rome, Italy;Conicet, Dto de Matemática FCE-UNLP La Plata, Argentina;Dto de Matemática FCE-UNLP La Plata, Argentina;CONICET/Universidad Nacional de La Plata, Argentina |
| |
| Abstract: | In this paper we present a robust optimization (RO) model for the Connected Facility Location (ConFL) problem within the framework introduced by Bertsimas and Sim Bertsimas, D. and M. Sim, Robust discrete optimization and network flows, Mathematical Programming 98 (2003), pp. 49–71], and show how to use a heuristic in conjunction with a lower bounding mechanism to rapidly find high-quality solutions. The use of a heuristic and a lower bound mechanism within this RO approach decreases significantly its computational time and broadens its applicability to other NP-hard problems. Here we present some of our computational results that attest to the efficiency of the approach, particularly on the Robust ConFL problem. |
| |
| Keywords: | robust optimization connected facility location heuristic |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
