Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

Banner header
69.063 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • GNOM - Grup d'Optimització Numèrica i Modelització
  • Articles de revista
  • View Item
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • GNOM - Grup d'Optimització Numèrica i Modelització
  • Articles de revista
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A branch-and-cut algorithm for the multidepot rural postman problem

Thumbnail
View/Open
170515-MDRP.pdf (880,8Kb)
 
10.1287/trsc.2017.0783
 
  View UPCommons Usage Statistics
  LA Referencia / Recolecta stats
Includes usage data since 2022
Cita com:
hdl:2117/126907

Show full item record
Fernández Aréizaga, ElenaMés informacióMés informació
Laporte, Gilbert
Rodríguez Pereira, JessicaMés informacióMés informacióMés informació
Document typeArticle
Defense date2018-03
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder
ProjectOPTIMIZACION DISCRETA PARA PROBLEMAS INTEGRADOS EN LOGISTICA Y TRANSPORTE (MINECO-MTM2015-63779-R)
MODELOS Y METODOS DE PROGRAMACION MATEMATICA Y SUS APLICACIONES SUS APLICACIONES (MINECO-MTM2012-36163-C06-05)
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.
CitationFernandez, 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. 
URIhttp://hdl.handle.net/2117/126907
DOI10.1287/trsc.2017.0783
ISSN0041-1655
Publisher versionhttps://pubsonline.informs.org/doi/abs/10.1287/trsc.2017.0783?journalCode=trsc
Collections
  • GNOM - Grup d'Optimització Numèrica i Modelització - Articles de revista [107]
  • Departament d'Estadística i Investigació Operativa - Articles de revista [790]
  View UPCommons Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
170515-MDRP.pdf880,8KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Metadata under:Metadata under CC0
  • Contact Us
  • Send Feedback
  • Privacy Settings
  • Inici de la pàgina