Minimizing the maximum travel time in a combined model of facility location and network design

Ivan Contreras, Elena Fernández and Gerhard Reinelt

Omega, 2012, vol. 40, issue 6, pages 847-860

Abstract: This paper presents a combined Facility Location/Network Design Problem which simultaneously considers the location of facilities and the design of its underlying network so as to minimize the maximum customer-facility travel time. The model generalizes the classical p-center problem and has various applications in regional planning, distribution, telecommunications, emergency systems, and other areas. Two mixed integer programming formulations are presented and compared. Several valid inequalities are derived for the most promising of these formulations to strengthen its LP relaxation bound and to reduce the enumeration tree. Numerical results of a series of computational experiments for instances with up to 100 nodes and 500 candidate links are reported.

Keywords: Facility location; Network design; Integer programming; Valid inequalities (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations Track citations by RSS feed

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0305048312000175
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:eee:jomega:v:40:y:2012:i:6:p:847-860

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Omega is edited by B. Lev

More articles in Omega from Elsevier
Series data maintained by Wendy Shamier ().