dc.contributor | Universidade Estadual de Campinas (UNICAMP) | |
dc.contributor | Universidade Estadual Paulista (Unesp) | |
dc.date.accessioned | 2014-05-20T13:23:31Z | |
dc.date.available | 2014-05-20T13:23:31Z | |
dc.date.created | 2014-05-20T13:23:31Z | |
dc.date.issued | 2011-11-01 | |
dc.identifier | Computers & Operations Research. Oxford: Pergamon-Elsevier B.V. Ltd, v. 38, n. 11, p. 1543-1555, 2011. | |
dc.identifier | 0305-0548 | |
dc.identifier | http://hdl.handle.net/11449/7104 | |
dc.identifier | 10.1016/j.cor.2011.01.012 | |
dc.identifier | WOS:000289604700009 | |
dc.description.abstract | The Open Capacitated Arc Routing Problem (OCARP) is a NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours that services a subset of edges with positive demand under capacity constraints. This problem is related to the Capacitated Arc Routing Problem (CARP) but differs from it since OCARP does not consider a depot, and tours are not constrained to form cycles. Applications to OCARP from literature are discussed. A new integer linear programming formulation is given, followed by some properties of the problem. A reactive path-scanning heuristic, guided by a cost-demand edge-selection and ellipse rules, is proposed and compared with other successful CARP path-scanning heuristics from literature. Computational tests were conducted using a set of 411 instances, divided into three classes according to the tightness of the number of vehicles available; results reveal the first lower and upper bounds, allowing to prove optimality for 133 instances. (C) 2011 Elsevier Ltd. All rights reserved. | |
dc.language | eng | |
dc.publisher | Pergamon-Elsevier B.V. Ltd | |
dc.relation | Computers & Operations Research | |
dc.relation | 2.962 | |
dc.relation | 1,916 | |
dc.rights | Acesso restrito | |
dc.source | Web of Science | |
dc.subject | Arc routing | |
dc.subject | Computational complexity | |
dc.subject | Path-scanning heuristic | |
dc.title | The open capacitated arc routing problem | |
dc.type | Artículos de revistas | |