Metaheuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows and Step Cost Functions

Autor(es)

Manguino, Joao L., V ; Ronconi, Debora P. ; LallaRuiz, E ; Mes, M ; Voss, S

• Tipo de documento: Artigo Científico
• Fonte: COMPUTATIONAL LOGISTICS, ICCL 2020; v. 12433, p. 15-pg., 2020-01-01.

Resumo

The vehicle routing problem is a traditional combinatorial problem with practical relevance for a wide range of industries. In the literature, several attributes have been tackled by dedicated methods in order to better reflect real-life situations. This article addresses the fleet size and mix vehicle routing problem with time windows in which companies hire a third-party logistics company. The shipping charges considered in this work are calculated using step cost functions, in which values are determined according to the type of vehicle and the total distance traveled, with fixed values for predefined distance ranges. The problem is solved with three different metaheuristic methods: Variable Neighborhood Search (VNS), Greed Randomized Adaptive Search Procedure (GRASP) and a hybrid proposition that combines both. The methods are examined through a computational comparative analysis in 168 benchmark instances from the literature, small-sized instances with known optimal solution, and 3 instances based on a real problem from the civil construction industry. The numerical experiments show that the proposed methods are efficient and show strong performance in different scenarios. (AU)

• Processo FAPESP: 16/01860-1 - Problemas de corte, empacotamento, dimensionamento de lotes, programação da produção, roteamento, localização e suas integrações em contextos industriais e logísticos
• Beneficiário: Reinaldo Morabito Neto
• Modalidade de apoio: Auxílio à Pesquisa - Temático
• 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