Busca avançada
Ano de início
Entree
(Referência obtida automaticamente do Web of Science, por meio da informação sobre o financiamento pela FAPESP e o número do processo correspondente, incluída na publicação pelos autores.)

An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery

Texto completo
Autor(es):
Ferreira, Kamyla Maria [1] ; de Queiroz, Thiago Alves [2] ; Bragion Toledo, Franklina Maria [1]
Número total de Autores: 3
Afiliação do(s) autor(es):
[1] ICMC USP, Inst Math & Comp Sci, Av Trabalhador Sao Carlense 400, Cx Postal 668, BR-13560970 Sao Carlos, SP - Brazil
[2] Fed Univ Catalao, Inst Math & Technol, Av Dr Lamartine Pinto de Avelar 1120, BR-75704020 Catalao, Go - Brazil
Número total de Afiliações: 2
Tipo de documento: Artigo Científico
Fonte: Computers & Operations Research; v. 136, DEC 2021.
Citações Web of Science: 0
Resumo

This paper presents a study about the Capacitated Vehicle Routing Problem with Two-Dimensional Loading Constraints (2L-CVRP) and its three variants: allowing split delivery (2L-SDVRP), with green requirements (G2L-CVRP), and integrating split delivery with green requirements (G2L-SDVRP). When considering split delivery, a customer can be served by more than one vehicle. The green variant takes into consideration the CO2 emission. Our objective is to analyze the cost benefits obtained with the aggregation of split delivery and the reduction of CO2 emission. Mathematical models are presented for each variant, and instances are solved with a branch-andcut approach. We develop a tailored procedure to address the packing subproblem, including the computation of lower bounds, a constructive-based heuristic, and a constraint programming formulation. Computational experiments performed on literature instances and newly created ones show that the proposed approach can outperform previous results. Besides that, the green variant has solutions with low emissions of CO2. The variant with split delivery has solutions with lower cost but at the expense of higher computing time. (AU)

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: 18/07240-0 - Incerteza em problemas de cortes e empacotamentos: planeamento robusto e replaneamento otimizado na produção e nos transportes
Beneficiário:Franklina Maria Bragion de Toledo
Modalidade de apoio: Auxílio à Pesquisa - Regular