Metaheuristic, models and software for the heterogeneous fleet pickup and delivery problem with split loads

Autor(es)

Gasque, Diogenes ; Munari, Pedro

• Tipo de documento: Artigo Científico
• Fonte: JOURNAL OF COMPUTATIONAL SCIENCE; v. 59, p. 13-pg., 2022-03-01.

Resumo

This paper addresses a rich variant of the vehicle routing problem (VRP) that involves pickup and delivery activities, customer time windows, heterogeneous fleet, multiple products and the possibility of splitting a customer demand among several routes. This variant generalizes traditional VRP variants by incorporating features that are commonly found in practice. We present two mixed-integer programming models and propose a metaheuristic based on Adaptive Large Neighborhood Search for the addressed problem. Additionally, to facilitate the use of the proposed approaches in real-world decision-making, we develop an open-source, publicly available web interface that allows one to set and solve VRP variants with the mentioned features. Computational experiments using benchmark instances with up to 150 customers show that the approaches can be used to obtain good-quality solutions in a reasonable time frame in practice. (AU)

• Processo FAPESP: 19/23596-2 - Problemas de roteamento de veículos ricos: modelos e algoritmos para variantes determinísticas e estocásticas
• Beneficiário: Pedro Augusto Munari Junior
• Modalidade de apoio: Auxílio à Pesquisa - Regular
• Processo FAPESP: 13/07375-0 - CeMEAI - Centro de Ciências Matemáticas Aplicadas à Indústria
• Beneficiário: Francisco Louzada Neto
• Modalidade de apoio: Auxílio à Pesquisa - Centros de Pesquisa, Inovação e Difusão - CEPIDs
• Processo FAPESP: 16/24763-1 - Formulações e métodos de solução para o problema de coleta e entrega com janelas de tempo, frota heterogênea e múltiplos produtos
• Beneficiário: Diógenes Henrique Frazzato Gasque
• Modalidade de apoio: Bolsas no Brasil - Mestrado