Logic-based Benders decomposition for the heterogeneous fixed fleet vehicle routing problem with time windows
Authors:
- Ramon Faganello FachiniRFRamon Faganello Fachini
- Vinícius Amaral ArmentanoVAVinícius Amaral Armentano
- 1 October 2020
- journal article
- research article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 148
Abstract
No abstract availableKeywords
Funding Information
- Fundação de Amparo à Pesquisa do Estado de São Paulo
- Conselho Nacional de Desenvolvimento Científico e Tecnológico
This publication has 56 references indexed in Scilit:
- The vehicle routing problem: A taxonomic reviewComputers & Industrial Engineering, 2009
- A branch‐and‐price‐based large neighborhood search algorithm for the vehicle routing problem with time windowsNetworks, 2009
- A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windowsExpert Systems with Applications, 2009
- Scatter search for the fleet size and mix vehicle routing problem with time windowsCentral European Journal of Operations Research, 2007
- The fleet size and mix vehicle routing problem with time windowsJournal of the Operational Research Society, 1999
- A heuristic column generation method for the heterogeneous fleet VRPRAIRO - Operations Research, 1999
- The Vehicle Scheduling Problem with Multiple Vehicle TypesJournal of the Operational Research Society, 1988
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962