The capacitated arc routing problem. A heuristic algorithm
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2099/3985
Tipus de documentArticle
Data publicació1990
EditorUniversitat Politècnica de Catalunya. Centre de Càlcul
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 2.5 Espanya
Abstract
In this paper we consider the Capacitated Arc Routing Problem, in which a fleet of K vehicles, all of them based on a specific vertex (the depot) and with a known capacity Q, must service a subset of the edges of the graph, with minimum total cost and such that the load assigned to each vehicle does not exceed its capacity.
A heuristic algorithm for this problem is proposed consisting of: the selection of K centers, the construction of K connected graphs with associated loads not exceeding the vehicle capacities, the resolution of a General Assignment Problem, if necessary, to get a complete assignment of edges to vehicles and finally the construction of the routes by solving heuristically a Rural Postman Problem for each vehicle. Computational results on graphs up to 50 vertices and 97 edges are included. On average, the feasible solution is within 6,4% of the best known lower bound.
CitacióBenavent, Enrique; Campos, V.; Corberán, Ángel; Mota, Enrique. "The capacitated arc routing problem. A heuristic algorithm". Qüestiió. 1990, vol. 14, núm. 1-3
ISSN0210-8054 (versió paper)
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
article.pdf | 533,0Kb | Visualitza/Obre |