Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem

DOI10.1007/978-3-030-68520-1_4zbMath1471.90172OpenAlexW3131202049MaRDI QIDQ5011679

Laura Pozzi, Jacopo Pierotti, Lorenzo Ferretti, J. Theresia van Essen

Publication date: 27 August 2021

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: http://resolver.tudelft.nl/uuid:f71c7230-629c-4d72-9f4e-3bd0a502eb78

zbMATH Keywords

Hamiltonian cycletravelling salesman problemmetaheuristiciterated local searchbalanced travelling salesman problem

Mathematics Subject Classification ID

Applications of statistics in engineering and industry; control charts (62P30) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• VRP

Cites Work

• A hybrid algorithm for the DNA sequencing problem
• Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem
• Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
• Guided local search and its application to the traveling salesman problem
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
• Some Simple Applications of the Travelling Salesman Problem
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Technical Note—Clustering a Data Array and the Traveling-Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item