Busca avançada
Ano de início
Entree


A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery

Texto completo
Autor(es):
Ferreira, Kamyla Maria ; de Queiroz, Thiago Alves ; Munari, Pedro ; Toledo, Franklina Maria Bragion
Número total de Autores: 4
Tipo de documento: Artigo Científico
Fonte: European Journal of Operational Research; v. 316, n. 2, p. 20-pg., 2024-03-28.
Resumo

We address the Green Vehicle Routing Problem with Two -Dimensional Loading Constraints and Split Delivery (G2L-SDVRP), which extends the split delivery vehicle routing problem to include customer demands represented by two-dimensional, rectangular items. We aim to minimize carbon dioxide (CO 2 ) emissions instead of travel distance, a critical issue in contemporary logistics activities. The CO 2 emission rate is proportional to fuel consumption and measured in terms of the vehicle's total weight and traveled distance. We propose the first metaheuristic for the G2L-SDVRP, based on a variable neighborhood search approach that designs effective routes and guarantees the feasibility of loading constraints using various strategies, such as lower bound procedures, the open space heuristic, and a constraint programming model. We evaluate the performance of our approach through computational experiments using benchmark and newly created instances. The results indicate that the proposed approach is effective. It achieves improved solutions for 21 out of 60 instances in relatively short computing times when compared to existing methods for the G2L-SDVRP. Furthermore, our approach is competitive on benchmark instances of a related variant, namely the Capacitated Vehicle Routing Problem with Two -Dimensional Loading Constraints, improving the best-known solutions for 50 out of 180 instances. (AU)

Processo FAPESP: 22/05803-3 - Problemas de corte, empacotamento, dimensionamento de lotes, programação da produção, roteamento e 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: 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: 22/10303-0 - Problema de roteamento de veículos com restrições de empacotamento, entrega fracionada e emissão de poluentes: modelos e algoritmos
Beneficiário:Kamyla Maria Ferreira
Modalidade de apoio: Bolsas no Brasil - Pós-Doutorado