Algoritmo memético paralelo baseado em ilhas com busca local Lin- Kernighan para solução do problema de roteamento de veículos heterogêneos em duas fases inspirado em um modelo de distribuição usado por atacadistas

• Ano de defesa: 2019
• Autor(a) principal: Bevilaqua, André
• Tipo de documento: Tese
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Federal de Uberlândia; Brasil; Programa de Pós-graduação em Engenharia Elétrica
• Palavras-chave em Português: Problema de Roteamento de Veículos em Dois Níveis; Two-Echelon Vehicle Routing Problem; Frotas Heterogêneas; Heterogeneous Fleet; Algoritmo Memético Baseado em Ilhas; Island Based Memetic Algorithm; Lin-Kernighan; Mercado Atacadista; Wholesale Companies; Engenharia elétrica; Electrical Engineering; Veículos; Vehicles; Logística Empresarial; Business Logistics; Algoritmos; Algorithms; Modelagem de Processos; Process Modeling; CNPQ::ENGENHARIAS::ENGENHARIA DE PRODUCAO; CNPQ::ENGENHARIAS::ENGENHARIA DE PRODUCAO::PESQUISA OPERACIONAL; CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO
• Link de acesso: https://repositorio.ufu.br/handle/123456789/25532; http://dx.doi.org/10.14393/ufu.te.2019.5

This thesis deals with a Two-Echelon Fixed Fleet Heterogeneous Vehicle Routing Problem faced by brazilian wholesale companies. Vehicle routing problems with more than one phase consider situations in which freight is moved through some intermediate facilities (e.g., cross-docks or distribution centers) before reaching its destination. The first phase of the problem dealt here is to choose a first-level vehicle, from an heterogeneous set, that will leave a depot and reach an intermediate uncapacitated facility (satellite) to serve a set of second-level vehicles. After that, it is necessary to define routes for smaller vehicles, also from an heterogeneous set, that will visit a set of customers departing from and returning to a satellite. The solution proposed here is an efficient island based memetic algorithm with a local search procedure based on Lin-Kernighan heuristic. In order to attest the algorithm’s efficiency, first it was tested in single echelon heterogeneous fleet vehicle routing benchmark instances. After that the instances were adapted for two-echelon context and used for validation alongside with real world instances created using normalized real data. Localsolver tool was also executed for comparison purposes. Promising results (which corroborate results obtained on the real problem) and future works are presented and discussed.