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

DOI10.1007/978-3-030-68520-1_4MaRDI QIDQ5011679zbMATH OpenOpenAlexFDO

Authors Jacopo Pierotti, Lorenzo Ferretti, Laura Pozzi, 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

balanced travelling salesman problemHamiltonian cycleiterated local searchmetaheuristictravelling 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)

Recommendations

• Analysis of random restart and iterated improvement for global optimization with application to the traveling salesman problem
• New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
• An iterated local search heuristic for the capacitated prize-collecting travelling salesman problem
• A memetic random key algorithm for the balanced travelling salesman problem
• Guided local search and its application to the traveling salesman problem
• An iterated local search for the traveling salesman problem with release dates and completion time minimization
• On the performance of local search for the biobjective traveling salesman problem

Cites work

• A hybrid algorithm for the DNA sequencing problem
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
• An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
• Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem
• Guided local search and its application to the traveling salesman problem
• scientific article; zbMATH DE number 177832 (Why is no real title available?)
• scientific article; zbMATH DE number 1975100 (Why is no real title available?)
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
• Some Simple Applications of the Travelling Salesman Problem
• Technical Note—Clustering a Data Array and the Traveling-Salesman Problem
• The granular tabu search and its application to the vehicle-routing problem
• The Planar Hamiltonian Circuit Problem is NP-Complete

Cited in

(2)

• Analysis of random restart and iterated improvement for global optimization with application to the traveling salesman problem
• Mixed integer programming formulations for the balanced traveling salesman problem with a lexicographic objective

Describes a project that uses

Uses Software

• VRP

This page was built for publication: Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5011679)