Busca avançada
Ano de início
Entree


A New Family of Route Formulations for Split Delivery Vehicle Routing Problems

Texto completo
Autor(es):
Balster, Isaac ; Bulhoes, Teobaldo ; Munari, Pedro ; Pessoa, Artur Alves ; Sadykov, Ruslan
Número total de Autores: 5
Tipo de documento: Artigo Científico
Fonte: TRANSPORTATION SCIENCE; v. N/A, p. 21-pg., 2023-08-14.
Resumo

We propose a new family of formulations with route-based variables for the split delivery vehicle routing problem with and without time windows. Each formulation in this family is characterized by the maximum number of different demand quantities that can be delivered to a customer during a vehicle visit. As opposed to previous formulations in the literature, the exact delivery quantities are not always explicitly known in this new family. The validity of these formulations is ensured by an exponential set of nonrobust constraints. Additionally, we explore a property of optimal solutions that enables us to determine a minimum delivery quantity based on customer demand and vehicle capacity, and this number is often greater than one. We use this property to reduce the number of possible delivery quantities in our formulations, improving the solution times of the computationally strongest formulation in the family. Furthermore, we propose new variants of nonrobust cutting planes that strengthen the formulations, namely limited memory subset-row covering inequalities and limited-memory strong k-path inequalities. Finally, we develop a branch-cut-and-price (BCP) algorithm to solve our formulations enriched with the proposed valid inequalities, which resorts to state-of-the-art algorithmic enhancements. We show how to effectively manage the nonrobust cuts when solving the pricing problem that dynamically generates route variables. Numerical results indicate that our formulations and BCP algorithm establish new state-of-the-art results for the variant with time windows, as many benchmark instances with 50 and 100 customers are solved to optimality for the first time. Several instances of the variant without time windows are solved to proven optimality for the first time. (AU)

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: 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