Utilizando a busca tabu na resolução do problema de roteamento de veículos

AUTOR(ES)

Etiene Pozzobom Lazzeris Simas

DATA DE PUBLICAÇÃO

2007

RESUMO

This work presents the Vehicle Routing Problem where only the vehicle capacity constraint is considered. The aim of this problem is to service a set of clients through the generation of least cost routs which respect the vehicle capacity constraint. To create the solutions of this problem an application will be developed using the Tabu Search meta-heuristics. The Tabu Search allows that intensification and diversifications strategies guide the search of good solutions. In this application two types of movements to generate the neighborhood were defined: the vertex relocation and the vertex exchange between routs. The results obtained in this application will be compared with the results obtained by classical heuristics and by results obtained from other papers that use Tabu Search to approach the Vehicle Routing Problem

ASSUNTO(S)

computação ciencia da computacao análise combinatória veículo algoritmo problema otimização busca tabu roteamento

Documentos Relacionados

• Busca tabu para o problema de roteamento dinamico de veiculos com janelas de tempo
• Busca tabu aplicada ao problema de roteamento periodico de veiculos
• Desenvolvimento e aplicação de algoritmos adaptativos de busca tabu para a resolução de Problemas de Roteamento de Veículos Periódicos (PRVP).
• Algoritmos para a resolução do problema de estoque e roteamento de veiculos
• A tabu search for the vehicle routing problem with pickup and delivery