On the collaboration uncapacitated arc routing problem

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

ver descrição completa

Detalhes bibliográficos
Autores: Fernández Aréizaga, Elena|||0000-0003-4714-0257, Fontana, Dario, Speranza, M. Grazia
Formato: artículo
Fecha de publicación:2016
País:España
Recursos:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/81939
Acesso em linha:https://hdl.handle.net/2117/81939
https://dx.doi.org/10.1016/j.cor.2015.10.001
Access Level:acceso abierto
Palavra-chave:Programming (Mathematics)
Arc routing
Collaboration
Programació (Matemàtica)
Classificació AMS::90 Operations research, mathematical programming::90C Mathematical programming
Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Programació matemàtica
id ES_05c45f19cdc84629aa375d56d1f59aeb
oai_identifier_str oai:upcommons.upc.edu:2117/81939
network_acronym_str ES
network_name_str España
repository_id_str
spelling On the collaboration uncapacitated arc routing problemFernández Aréizaga, Elena|||0000-0003-4714-0257Fontana, DarioSperanza, M. GraziaProgramming (Mathematics)Arc routingCollaborationProgramació (Matemàtica)Classificació AMS::90 Operations research, mathematical programming::90C Mathematical programmingÀrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Programació matemàticaThis 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.Peer Reviewed20162016-03-0120162016-01-25journal articlehttp://purl.org/coar/resource_type/c_6501AMhttp://purl.org/coar/version/c_ab4af688f83e57aainfo:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/2117/81939https://dx.doi.org/10.1016/j.cor.2015.10.001reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2http://creativecommons.org/licenses/by-nc-nd/3.0/es/info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/819392026-05-27T15:37:01Z
dc.title.none.fl_str_mv On the collaboration uncapacitated arc routing problem
title On the collaboration uncapacitated arc routing problem
spellingShingle On the collaboration uncapacitated arc routing problem
Fernández Aréizaga, Elena|||0000-0003-4714-0257
Programming (Mathematics)
Arc routing
Collaboration
Programació (Matemàtica)
Classificació AMS::90 Operations research, mathematical programming::90C Mathematical programming
Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Programació matemàtica
title_short On the collaboration uncapacitated arc routing problem
title_full On the collaboration uncapacitated arc routing problem
title_fullStr On the collaboration uncapacitated arc routing problem
title_full_unstemmed On the collaboration uncapacitated arc routing problem
title_sort On the collaboration uncapacitated arc routing problem
dc.creator.none.fl_str_mv Fernández Aréizaga, Elena|||0000-0003-4714-0257
Fontana, Dario
Speranza, M. Grazia
author Fernández Aréizaga, Elena|||0000-0003-4714-0257
author_facet Fernández Aréizaga, Elena|||0000-0003-4714-0257
Fontana, Dario
Speranza, M. Grazia
author_role author
author2 Fontana, Dario
Speranza, M. Grazia
author2_role author
author
dc.subject.none.fl_str_mv Programming (Mathematics)
Arc routing
Collaboration
Programació (Matemàtica)
Classificació AMS::90 Operations research, mathematical programming::90C Mathematical programming
Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Programació matemàtica
topic Programming (Mathematics)
Arc routing
Collaboration
Programació (Matemàtica)
Classificació AMS::90 Operations research, mathematical programming::90C Mathematical programming
Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Programació matemàtica
description 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.
publishDate 2016
dc.date.none.fl_str_mv 2016
2016-03-01
2016
2016-01-25
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
AM
http://purl.org/coar/version/c_ab4af688f83e57aa
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/81939
https://dx.doi.org/10.1016/j.cor.2015.10.001
url https://hdl.handle.net/2117/81939
https://dx.doi.org/10.1016/j.cor.2015.10.001
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2

http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2

http://creativecommons.org/licenses/by-nc-nd/3.0/es/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869402876468527104
score 15,301603

Registos relacionados