You are in the accessibility menu

Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorUsberti, Fabio Luiz-
dc.contributor.authorFranca, Paulo Morelato-
dc.contributor.authorMorelato Franca, Andre Luiz-
dc.identifier.citationComputers & Operations Research. Oxford: Pergamon-Elsevier B.V. Ltd, v. 38, n. 11, p. 1543-1555, 2011.-
dc.description.abstractThe 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.en
dc.description.sponsorshipConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)-
dc.publisherPergamon-Elsevier B.V. Ltd-
dc.sourceWeb of Science-
dc.subjectArc routingen
dc.subjectComputational complexityen
dc.subjectPath-scanning heuristicen
dc.titleThe open capacitated arc routing problemen
dc.contributor.institutionUniversidade Estadual de Campinas (UNICAMP)-
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)-
dc.description.affiliationUniv Estadual Campinas, Sch Elect & Comp Engn, BR-13083852 Campinas, SP, Brazil-
dc.description.affiliationSão Paulo State Univ, Dept Math Stat & Comp, BR-19060900 Presidente Prudente, SP, Brazil-
dc.description.affiliationUnespSão Paulo State Univ, Dept Math Stat & Comp, BR-19060900 Presidente Prudente, SP, Brazil-
dc.rights.accessRightsAcesso restrito-
dc.relation.ispartofComputers & Operations Research-
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.