Please use this identifier to cite or link to this item:
http://acervodigital.unesp.br/handle/11449/7104
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Usberti, Fabio Luiz | - |
dc.contributor.author | Franca, Paulo Morelato | - |
dc.contributor.author | Morelato Franca, Andre Luiz | - |
dc.date.accessioned | 2014-05-20T13:23:31Z | - |
dc.date.accessioned | 2016-10-25T16:44:31Z | - |
dc.date.available | 2014-05-20T13:23:31Z | - |
dc.date.available | 2016-10-25T16:44:31Z | - |
dc.date.issued | 2011-11-01 | - |
dc.identifier | http://dx.doi.org/10.1016/j.cor.2011.01.012 | - |
dc.identifier.citation | Computers & Operations Research. Oxford: Pergamon-Elsevier B.V. Ltd, v. 38, n. 11, p. 1543-1555, 2011. | - |
dc.identifier.issn | 0305-0548 | - |
dc.identifier.uri | http://hdl.handle.net/11449/7104 | - |
dc.identifier.uri | http://acervodigital.unesp.br/handle/11449/7104 | - |
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. | en |
dc.description.sponsorship | Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) | - |
dc.description.sponsorship | IBM | - |
dc.format.extent | 1543-1555 | - |
dc.language.iso | eng | - |
dc.publisher | Pergamon-Elsevier B.V. Ltd | - |
dc.source | Web of Science | - |
dc.subject | Arc routing | en |
dc.subject | Computational complexity | en |
dc.subject | Path-scanning heuristic | en |
dc.title | The open capacitated arc routing problem | en |
dc.type | outro | - |
dc.contributor.institution | Universidade Estadual de Campinas (UNICAMP) | - |
dc.contributor.institution | Universidade Estadual Paulista (UNESP) | - |
dc.description.affiliation | Univ Estadual Campinas, Sch Elect & Comp Engn, BR-13083852 Campinas, SP, Brazil | - |
dc.description.affiliation | São Paulo State Univ, Dept Math Stat & Comp, BR-19060900 Presidente Prudente, SP, Brazil | - |
dc.description.affiliationUnesp | São Paulo State Univ, Dept Math Stat & Comp, BR-19060900 Presidente Prudente, SP, Brazil | - |
dc.identifier.doi | 10.1016/j.cor.2011.01.012 | - |
dc.identifier.wos | WOS:000289604700009 | - |
dc.rights.accessRights | Acesso restrito | - |
dc.relation.ispartof | Computers & 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.