| Full text | |
| Author(s): |
Total Authors: 2
|
| Affiliation: | [1] Univ Estadual Campinas, Inst Comp, Av Albert Einstein 1251, BR-13083852 Campinas, SP - Brazil
Total Affiliations: 1
|
| Document type: | Journal article |
| Source: | Computers & Operations Research; v. 90, p. 221-231, FEB 2018. |
| Web of Science Citations: | 8 |
| Abstract | |
The Open Capacitated Arc Routing Problem (OCARP) is an NP-hard arc routing problem where, given an undirected graph, the objective is to find the least cost set of routes that services all edges with positive demand (required edges). The routes are subjected to capacity constraints in relation to edge demands. The OCARP differs from the Capacitated Arc Routing Problem (CARP) since OCARP does not consider a depot and routes are not constrained to form cycles. A hybrid genetic algorithm with feasibilization and local search procedures is proposed for the OCARP. Computational experiments conducted on a set of benchmark instances reveal that the proposed hybrid genetic algorithm achieved the best upper bounds for almost all instances. (C) 2017 Elsevier Ltd. All rights reserved. (AU) | |
| FAPESP's process: | 16/00315-0 - Formulations and Algorithms for Arc Routing Problems |
| Grantee: | Rafael Kendy Arakaki |
| Support Opportunities: | Scholarships in Brazil - Doctorate |