Show simple item record

dc.contributor.authorFernández Aréizaga, Elena
dc.contributor.authorFontana, Dario
dc.contributor.authorSperanza, M. Grazia
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa
dc.date.accessioned2016-01-25T09:33:18Z
dc.date.available2019-03-01T01:30:27Z
dc.date.issued2016-03-01
dc.identifier.citationFernandez, E., Fontana, D., Speranza, M. On the collaboration uncapacitated arc routing problem. "Computers & operations research", 01 Març 2016, vol. 67, p. 120-131.
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/2117/81939
dc.description.abstractThis 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.
dc.format.extent12 p.
dc.language.isoeng
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Programació matemàtica
dc.subject.lcshProgramming (Mathematics)
dc.subject.otherArc routing
dc.subject.otherCollaboration
dc.titleOn the collaboration uncapacitated arc routing problem
dc.typeArticle
dc.subject.lemacProgramació (Matemàtica)
dc.contributor.groupUniversitat Politècnica de Catalunya. GNOM - Grup d'Optimització Numèrica i Modelització
dc.identifier.doi10.1016/j.cor.2015.10.001
dc.description.peerreviewedPeer Reviewed
dc.subject.amsClassificació AMS::90 Operations research, mathematical programming::90C Mathematical programming
dc.rights.accessOpen Access
local.identifier.drac17409062
dc.description.versionPostprint (author's final draft)
local.citation.authorFernandez, E.; Fontana, D.; Speranza, M.
local.citation.publicationNameComputers & operations research
local.citation.volume67
local.citation.startingPage120
local.citation.endingPage131


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

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