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

58.714 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.

On the collaboration uncapacitated arc routing problem

Thumbnail
View/Open
CUARP.pdf (387,0Kb)
Share:
 
 
10.1016/j.cor.2015.10.001
 
  View Usage Statistics
Cita com:
hdl:2117/81939

Show full item record
Fernández Aréizaga, ElenaMés informacióMés informació
Fontana, Dario
Speranza, M. Grazia
Document typeArticle
Defense date2016-03-01
Rights accessOpen Access
Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain
Abstract
This paper introduces a new arc routing problem for the optimization of a collaboration scheme among carriers. This yields to the study of a profitable uncapacitated arc routing problem with multiple depots, where carriers collaborate to improve the profit gained. In the first model the goal is the maximization of the total profit of the coalition of carriers, independently of the individual profit of each carrier. Then, a lower bound on the individual profit of each carrier is included. This lower bound may represent the profit of the carrier in the case no collaboration is implemented. The models are formulated as integer linear programs and solved through a branch-and-cut algorithm. Theoretical results, concerning the computational complexity, the impact of collaboration on profit and a game theoretical perspective, are provided. The models are tested on a set of 971 instances generated from 118 benchmark instances for the Privatized Rural Postman Problem, with up to 102 vertices. All the 971 instances are solved to optimality within few seconds.
CitationFernandez, E., Fontana, D., Speranza, M. On the collaboration uncapacitated arc routing problem. "Computers & operations research", 01 Març 2016, vol. 67, p. 120-131. 
URIhttp://hdl.handle.net/2117/81939
DOI10.1016/j.cor.2015.10.001
ISSN0305-0548
Collections
  • GNOM - Grup d'Optimització Numèrica i Modelització - Articles de revista [97]
  • Departament d'Estadística i Investigació Operativa - Articles de revista [628]
Share:
 
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
CUARP.pdf387,0KbPDFView/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
  • Contact Us
  • Send Feedback
  • Inici de la pàgina