Advanced search
Start date
Betweenand


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

Full text
Author(s):
Ferreira, Kamyla Maria ; de Queiroz, Thiago Alves ; Munari, Pedro ; Toledo, Franklina Maria Bragion
Total Authors: 4
Document type: Journal article
Source: European Journal of Operational Research; v. 316, n. 2, p. 20-pg., 2024-03-28.
Abstract

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)

FAPESP's process: 22/05803-3 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings
Grantee:Reinaldo Morabito Neto
Support Opportunities: Research Projects - Thematic Grants
FAPESP's process: 19/23596-2 - Rich vehicle routing problems: models and algorithms for deterministic and stochastic variants
Grantee:Pedro Augusto Munari Junior
Support Opportunities: Regular Research Grants
FAPESP's process: 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry
Grantee:Francisco Louzada Neto
Support Opportunities: Research Grants - Research, Innovation and Dissemination Centers - RIDC
FAPESP's process: 22/10303-0 - Vehicle routing problem with loading, split-delivery and pollutant emission constraints: models and algorithms
Grantee:Kamyla Maria Ferreira
Support Opportunities: Scholarships in Brazil - Post-Doctoral