| Texto completo | |
| Autor(es): |
Ferreira, Kamyla Maria
;
Archetti, Claudia
;
Delle Donne, Diego
;
Morabito, Reinaldo
;
Munari, Pedro
Número total de Autores: 5
|
| Tipo de documento: | Artigo Científico |
| Fonte: | EURO JOURNAL ON TRANSPORTATION AND LOGISTICS; v. 14, p. 12-pg., 2025-02-25. |
| Resumo | |
This paper introduces the Green Commodity constrained Split Delivery Vehicle Routing Problem (GC-SDVRP), which involves designing efficient and environmentally friendly delivery routes that reduce the CO2 emissions associated with transporting multiple commodities. In this problem, different commodities demanded by a customer can be delivered by one or more vehicles, if beneficial, which poses additional modeling and solution challenges. We propose a relaxed formulation that provides a lower bound on the optimal value of the GC-SDVRP, and adapt two other formulations from the literature to address this problem. Additionally, we develop a branch-and-cut (BC) method based on two of these formulations, and introduce a procedure for deriving feasible solutions to the GC-SDVRP from solutions obtained with the relaxed formulations. The results of computational experiments performed on benchmark instances indicate the superior performance of the BC method based on the proposed formulation. Furthermore, they show that, contrary to the traditional objective of minimizing distance, the GC-SDVRP is significantly easier to solve to optimality and can reduce CO2 emissions by 2.59% compared to the problem that minimizes total travel distance. Our investigation also reveals that increasing vehicle capacity improves solution quality in the GC-SDVRP, while split delivery can enable further reductions in CO2 emissions. Finally, although increasing the number of commodities imposes challenges in solving the problem, the possibility of split delivery mitigates its impact on the value of the final solution, indicating that an increase in the number of commodities does not necessarily result in higher CO2 emissions. (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: | 23/07988-3 - Problema de roteamento de veículos com restrições de múltiplas mercadorias, entrega fracionada e emissão de poluentes: formulações e métodos exatos |
| Beneficiário: | Kamyla Maria Ferreira |
| Modalidade de apoio: | Bolsas no Exterior - Estágio de Pesquisa - Pós-Doutorado |
| 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: | 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 |