Mostra el registre d'ítem simple
A branch-and-cut algorithm for the multidepot rural postman problem
dc.contributor.author | Fernández Aréizaga, Elena |
dc.contributor.author | Laporte, Gilbert |
dc.contributor.author | Rodríguez Pereira, Jessica |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa |
dc.date.accessioned | 2019-01-16T08:55:56Z |
dc.date.available | 2019-03-01T01:30:33Z |
dc.date.issued | 2018-03 |
dc.identifier.citation | Fernandez, E., Gilbert, L., Rodríguez-Pereira, J. A branch-and-cut algorithm for the multidepot rural postman problem. "Transportation science", Març 2018, vol. 52, núm. 2, p. 353-369. |
dc.identifier.issn | 0041-1655 |
dc.identifier.uri | http://hdl.handle.net/2117/126907 |
dc.description.abstract | This paper considers the Multidepot Rural Postman Problem, an extension of the classical Rural Postman Problem in which there are several depots instead of only one. The aim is to construct a minimum cost set of routes traversing each required edge of the graph, where each route starts and ends at the same depot. The paper makes the following scientific contributions: (i) It presents optimality conditions and a worst case analysis for the problem; (ii) It proposes a compact integer linear programming formulation containing only binary variables, as well as a polyhedral analysis; (iii) It develops a branch-and-cut algorithm that includes several new exact and heuristic separation procedures. Instances involving up to four depots, 744 vertices, and 1,315 edges are solved to optimality. These instances contain up to 140 required components and 1,000 required edges. |
dc.format.extent | 17 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi numèrica |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica aplicada a les ciències |
dc.subject.lcsh | Numerical analysis |
dc.subject.lcsh | Programming (Mathematics) |
dc.subject.other | arc routing |
dc.subject.other | worst-case analysis |
dc.subject.other | branch-and-cut |
dc.subject.other | multi-depot rural postman problem |
dc.subject.other | polyhedral analysis |
dc.title | A branch-and-cut algorithm for the multidepot rural postman problem |
dc.type | Article |
dc.subject.lemac | Anàlisi numèrica |
dc.subject.lemac | Programació (Matemàtica) |
dc.contributor.group | Universitat Politècnica de Catalunya. GNOM - Grup d'Optimització Numèrica i Modelització |
dc.identifier.doi | 10.1287/trsc.2017.0783 |
dc.description.peerreviewed | Peer Reviewed |
dc.subject.ams | Classificació AMS::65 Numerical analysis::65K Mathematical programming, optimization and variational techniques |
dc.subject.ams | Classificació AMS::90 Operations research, mathematical programming::90C Mathematical programming |
dc.relation.publisherversion | https://pubsonline.informs.org/doi/abs/10.1287/trsc.2017.0783?journalCode=trsc |
dc.rights.access | Open Access |
local.identifier.drac | 22422037 |
dc.description.version | Postprint (author's final draft) |
dc.relation.projectid | info:eu-repo/grantAgreement/MINECO//MTM2015-63779-R/ES/OPTIMIZACION DISCRETA PARA PROBLEMAS INTEGRADOS EN LOGISTICA Y TRANSPORTE/ |
dc.relation.projectid | info:eu-repo/grantAgreement/MINECO//MTM2012-36163-C06-05/ES/MODELOS Y METODOS DE PROGRAMACION MATEMATICA Y SUS APLICACIONES SUS APLICACIONES/ |
local.citation.author | Fernandez, E.; Gilbert, L.; Rodríguez-Pereira, J. |
local.citation.publicationName | Transportation science |
local.citation.volume | 52 |
local.citation.number | 2 |
local.citation.startingPage | 353 |
local.citation.endingPage | 369 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [104]
-
Articles de revista [719]