Um algoritmo híbrido para o problema de roteamento de veículos com frotas heterogêneas
This paper aims to propose a hybrid meta-heuristics for the Heterogeneous Fleet Vehicle Routing Problem (HVRP), which is a combinatorial optimization problem NP-hard, and is characterized by the use of a limited fleet consists of different vehicles with different capacities. The hybrid method develo...
| Autor: | |
|---|---|
| Tipo de recurso: | tesis de maestría |
| Estado: | Versión publicada |
| Fecha de publicación: | 2011 |
| País: | Brasil |
| Institución: | Universidade Federal do Rio Grande do Norte (UFRN) |
| Repositorio: | Repositório Institucional da UFRN |
| Idioma: | portugués |
| OAI Identifier: | oai:repositorio.ufrn.br:123456789/15007 |
| Acceso en línea: | https://repositorio.ufrn.br/jspui/handle/123456789/15007 |
| Access Level: | acceso abierto |
| Palabra clave: | Roteamento de veículos Frotas heterogêneas Meta-heurística híbrida Algoritmo memético Vocabulary building. Vehicle routing Hybrid meta-heuristic Memetic algorithm CNPQ::ENGENHARIAS::ENGENHARIA DE PRODUCAO |
| Sumario: | This paper aims to propose a hybrid meta-heuristics for the Heterogeneous Fleet Vehicle Routing Problem (HVRP), which is a combinatorial optimization problem NP-hard, and is characterized by the use of a limited fleet consists of different vehicles with different capacities. The hybrid method developed makes use of a memetic algorithm associated with the component optimizer Vocabulary Building. The resulting hybrid meta-heuristic was implemented in the programming language C + + and computational experiments generated good results in relation to meta-heuristic applied in isolation, proving the efficiency of the proposed method. |
|---|