The Generalized Arc Routing Problem

This paper focuses on the generalized arc routing problem. This problem is stated on an undirected graph in which some clusters are defined as pairwise-disjoint connected subgraphs, and a route is sought that traverses at least one edge of each cluster. Broadly speaking, the generalized arc routing...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:TOP Ročník 25; číslo 3; s. 497 - 525
Hlavní autoři: Aráoz, Julián, Fernández, Elena, Franquesa, Carles
Médium: Journal Article Publikace
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2017
Springer Nature B.V
Springer
Témata:
90 Operations research, mathematical programming
90B Operations research and management science
90C Mathematical programming
Arc routing
Branch and cut
Business and Management
Classificació AMS
Clusters
CPLEX
Economic Theory/Quantitative Economics/Mathematical Methods
Economics
Facets
Finance
Graph theory
Industrial and Production Engineering
Inequalities
Insurance
Investigació operativa
Management
Matemàtiques i estadística
Mathematical programming
Operations research
Operations Research/Decision Theory
Optimization
Original Paper
Polyhedral modeling
Programació (Matemàtica)
Programming (Mathematics)
Routing
Statistics for Business
Traveling salesman problem
TSP
Valid inequalities
Àrees temàtiques de la UPC
TSP
Arc routing
98B09
Operations research
Polyhedral modeling
Facets
CPLEX
Routing
Valid inequalities
Branch and cut
Mathematical programming
ISSN:1134-5764, 1863-8279
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper focuses on the generalized arc routing problem. This problem is stated on an undirected graph in which some clusters are defined as pairwise-disjoint connected subgraphs, and a route is sought that traverses at least one edge of each cluster. Broadly speaking, the generalized arc routing problem is the arc routing counterpart of the generalized traveling salesman problem, where the set of vertices of a given graph is partitioned into clusters and a route is sought that visits at least one vertex of each cluster. A mathematical programming formulation that exploits the structure of the problem and uses only binary variables is proposed. Facets and families of valid inequalities are presented for the polyhedron associated with the formulation and the corresponding separation problem studied. The numerical results of a series of computational experiments with an exact branch and cut algorithm are presented and analyzed.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1134-5764
1863-8279
DOI:10.1007/s11750-017-0437-4