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

Full description

Saved in:
Bibliographic Details
Published in:Computers & operations research Vol. 67; pp. 120 - 131
Main Authors: Fernández, Elena, Fontana, Dario, Speranza, M. Grazia
Format: Journal Article Publication
Language:English
Published: New York Elsevier Ltd 01.03.2016
Pergamon Press Inc
Subjects:
90 Operations research, mathematical programming
90C Mathematical programming
Algorithms
Arc routing
Benchmarking
Carriers
Classificació AMS
Collaboration
Complexity theory
Cooperation
Game theory
Investigació operativa
Lower bounds
Matemàtiques i estadística
Maximization
Operations research
Optimization
Programació (Matemàtica)
Programming (Mathematics)
Route optimization
Studies
Àrees temàtiques de la UPC
Arc routing
Collaboration
ISSN:0305-0548, 1873-765X, 0305-0548
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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. •New arc routing problem introduced to handle a collaboration scheme among carriers.•We introduce two variants of the Collaboration Uncapacitated Arc Routing Problem.•Increasing collaboration will increase profits collecting.•We introduce a large set of benchmark instances.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2015.10.001