Mostra el registre d'ítem simple
Minimizing the maximum travel time in a combined model of facility location and network design
dc.contributor.author | Contreras Aguilar, Iván |
dc.contributor.author | Fernández Aréizaga, Elena |
dc.contributor.author | Reineltc, Gerhard |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa |
dc.date.accessioned | 2012-08-28T10:21:34Z |
dc.date.created | 2012-12 |
dc.date.issued | 2012-12 |
dc.identifier.citation | Contreras, I.; Fernández, E.; Reineltc, G. Minimizing the maximum travel time in a combined model of facility location and network design. "Omega: the international journal of management science", Desembre 2012, vol. 40, núm. 6, p. 847-860. |
dc.identifier.issn | 0305-0483 |
dc.identifier.uri | http://hdl.handle.net/2117/16394 |
dc.description.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. |
dc.format.extent | 14 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa |
dc.subject.lcsh | Network design |
dc.subject.lcsh | Integer programming |
dc.subject.other | Facility location |
dc.subject.other | Valid inequalities |
dc.title | Minimizing the maximum travel time in a combined model of facility location and network design |
dc.type | Article |
dc.subject.lemac | Xarxes -- Disseny |
dc.subject.lemac | Programació -- Algorismes |
dc.contributor.group | Universitat Politècnica de Catalunya. PROMALS - Grup de Recerca en Programació Matemática, Logística i Simulació |
dc.identifier.doi | 10.1016/j.omega.2012.01.006 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | http://www.sciencedirect.com/science/article/pii/S0305048312000175 |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 10254252 |
dc.description.version | Postprint (published version) |
dc.date.lift | 10000-01-01 |
local.citation.author | Contreras, I.; Fernández, E.; Reineltc, G. |
local.citation.publicationName | Omega: the international journal of management science |
local.citation.volume | 40 |
local.citation.number | 6 |
local.citation.startingPage | 847 |
local.citation.endingPage | 860 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [30]
-
Articles de revista [718]