An ALNS metaheuristic for the family multiple traveling salesman problem
Authors:
- Claudio B. CunhaCCClaudio B. Cunha
- Dieferson Flori MassarottoDMDieferson Flori Massarotto
- Sergio Luiz FornazzaSFSergio Luiz Fornazza
- André Bergsten MendesAMAndré Bergsten Mendes
- 28 June 2024
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 169
Abstract
No abstract availableKeywords
Funding Information
- National Council for Scientific and Technological Development (306485/2023-0)
This publication has 37 references indexed in Scilit:
- An adaptive large neighborhood search metaheuristic for the Generalized Bin Packing problem with incompatible categoriesComputers & Industrial Engineering, 2023
- A matheuristic approach for the family traveling salesman problemJournal of Heuristics, 2023
- The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methodsNetworks, 2022
- The family traveling salesman problem with incompatibility constraintsNetworks, 2021
- New hybrid heuristic algorithm for the clustered traveling salesman problemComputers & Industrial Engineering, 2018
- An Adaptive Large Neighborhood Search for an E-grocery Delivery Routing ProblemComputers & Operations Research, 2016
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problemComputers & Operations Research, 2012
- The prize collecting traveling salesman problemNetworks, 1989
- The traveling salesman problem, edited by E. L. Lawler, J. K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, John Wiley & sons, chichester, 1985, 463 ppNetworks, 1989
- The symmetric clustered traveling salesman problemEuropean Journal of Operational Research, 1985