NAGIOS: RODERIC FUNCIONANDO

On the Distance-Constrained Close Enough Arc Routing Problem

Repositori DSpace/Manakin

IMPORTANT: Aquest repositori està en una versió antiga des del 3/12/2023. La nova instal.lació está en https://roderic.uv.es/

On the Distance-Constrained Close Enough Arc Routing Problem

dc.contributor.author	Corberán Salvador, Ángel
dc.contributor.author	Plana Andani, Isaac
dc.contributor.author	Reula Martín, Miguel
dc.contributor.author	Sanchis Llopis, José María
dc.date.accessioned	2023-10-04T08:36:05Z
dc.date.available	2023-10-05T04:45:05Z
dc.date.issued	2021	es_ES
dc.identifier.citation	Ángel Corberán, Isaac Plana, Miguel Reula, José M. Sanchis, On the Distance-Constrained Close Enough Arc Routing Problem, European Journal of Operational Research, Volume 291, Issue 1, 2021, Pages 32-51, ISSN 0377-2217.	es_ES
dc.identifier.uri	https://hdl.handle.net/10550/90019
dc.description.abstract	Arc routing problems consist basically of finding one or several routes traversing a given set of arcs and/or edges that must be serviced. The Close-Enough Arc Routing Problem, or Generalized Directed Rural Postman Problem, does not assume that customers are located at specific arcs, but can be serviced by traversing any arc of a given subset. Real-life applications include routing for meter reading, in which a vehicle equipped with a receiver travels a street network. If the vehicle gets within a certain distance of a meter, the receiver collects its data. Therefore, only a few streets which are close enough to the meters need to be traversed. In this paper we study the generalization of this problem to the case in which a fleet of vehicles is available. This problem, the Distance-Constrained Close Enough Arc Routing Problem, consists of finding a set of routes with minimum total cost such that their length does not exceed a maximum distance. In this article, we propose a new formulation for the Distance-Constrained Close Enough Arc Routing Problem and present some families of valid inequalities that we use in a branch-and-cut algorithm for its solution. Extensive computational experiments have been performed on a set of benchmark instances and the results are compared with those obtained with other heuristic and exact methods.	es_ES
dc.language.iso	en	es_ES
dc.publisher	Elsevier	es_ES
dc.subject	routing	es_ES
dc.subject	distance constraints	es_ES
dc.subject	close-enough	es_ES
dc.subject	rural postman	es_ES
dc.subject	branch and cut	es_ES
dc.title	On the Distance-Constrained Close Enough Arc Routing Problem	es_ES
dc.type	journal article	es_ES
dc.subject.unesco	UNESCO::CIENCIAS ECONÓMICAS	es_ES
dc.identifier.doi	10.1016/j.ejor.2020.09.012	es_ES
dc.accrualmethod	S	es_ES
dc.embargo.terms	0 days	es_ES
dc.type.hasVersion	VoR	es_ES
dc.rights.accessRights	open access	es_ES