A carregar...
Publicação
Heuristic method for a mixed capacitated arc routing problem : A refuse collection application
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 373.26 KB | Adobe PDF |
Autores
Orientador(es)
Resumo(s)
The capacitated arc routing problem (CARP) is known to be NP-hard. The aim of this paper is to present a new heuristic method to generate feasible solutions to an extended CARP on mixed graphs, inspired by the household refuse collection problem in Lisbon. Computational experience was done to compare the method with some well-known existing heuristics, generalised for a different extended CARP by Lacomme et al. [Fast algorithm for general arc routing problems, Presented at IFORS 2002 Conference, Edinburgh, UK], namely, the Path-Scanning, the Augment-Merge and the Ulusoy’s algorithms. The results reveal a good performance of the proposed heuristic method. Generally providing a good use of the vehicles capacity, the resulting sets of feasible trips may also be considered good. The test instances involve more than 300 randomly generated test problems with dimensions of up to 400 nodes and 1220 links.
Descrição
Palavras-chave
Routing Heuristics Algorithms
Contexto Educativo
Citação
Mourão, M. Cândida and Lígia Amado .(2005). “Heuristic method for a mixed capacitated arc routing problem : A refuse collection application”. European Journal of Operational Research, Vol. 160, No. 1: pp. 139-153 (Search PDF in 2023).
Editora
Elsevier