Hybrid genetic algorithm for the open capacitated arc routing problem

Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/353473

Type:	Artigo
Title:	Hybrid genetic algorithm for the open capacitated arc routing problem
Author:	Arakaki, Rafael Kendy Usberti, Fábio Luiz
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 subjec
Subject:	Problema de roteamento em arcos Algoritmos genéticos Meta-heurística Arc routing problem Genetic algorithms Metaheuristic
Country:	Reino Unido
Editor:	Elsevier
Rights:	fechado
Identifier DOI:	10.1016/j.cor.2017.09.020
Address:	https://www.sciencedirect.com/science/article/pii/S0305054817302502
Date Issue:	2018
Appears in Collections:	IC - Artigos e Outros Documentos

Files in This Item:

File	Size	Format
000414884300017.pdf	1.06 MB	Adobe PDF	View/Open