Mostra el registre d'ítem simple
The capacitated arc routing problem. A heuristic algorithm
dc.contributor.author | Benavent, Enrique |
dc.contributor.author | Campos, V. |
dc.contributor.author | Corberán, Ángel |
dc.contributor.author | Mota, Enrique |
dc.date.accessioned | 2007-12-04T19:24:52Z |
dc.date.available | 2007-12-04T19:24:52Z |
dc.date.issued | 1990 |
dc.identifier.citation | 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 |
dc.identifier.issn | 0210-8054 (versió paper) |
dc.identifier.uri | http://hdl.handle.net/2099/3985 |
dc.description.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. |
dc.format.extent | 16 p. |
dc.language.iso | eng |
dc.publisher | Universitat Politècnica de Catalunya. Centre de Càlcul |
dc.rights | Attribution-NonCommercial-NoDerivs 2.5 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/2.5/es/ |
dc.subject.lcsh | Operations research |
dc.subject.other | Distribution |
dc.subject.other | Heuristics |
dc.subject.other | Routing |
dc.title | The capacitated arc routing problem. A heuristic algorithm |
dc.type | Article |
dc.subject.lemac | Investigació operativa |
dc.subject.ams | Classificació AMS::90 Operations research, mathematical programming::90B Operations research and management science |
dc.rights.access | Open Access |
local.ordre | 7 |
local.personalitzacitacio | true |