A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods

DOI10.1016/j.ejor.2017.07.024zbMath1374.90332OpenAlexW2734835295MaRDI QIDQ1681325

Peng Zhang

Publication date: 23 November 2017

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2017.07.024

zbMATH Keywords

traveling salesman problemhybrid algorithmarbitrary neighbourhoodsboundary-based encoding schemeclose-enough

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem ⋮ A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance ⋮ On hub location problems in geographically flexible networks ⋮ Results for the close-enough traveling salesman problem with a branch-and-bound algorithm ⋮ The generalized close enough traveling salesman problem ⋮ An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem ⋮ Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem ⋮ Spatial coverage in routing and path planning problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Thirty years of heterogeneous vehicle routing
• Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
• Parameter setting in evolutionary algorithms.
• The Euclidean traveling salesman problem is NP-complete
• Genetic algorithms and traveling salesman problems
• An empirical study of a new metaheuristic for the traveling salesman problem
• A model for warehouse order picking
• A two-dimensional mapping for the traveling salesman problem
• Approximation algorithms for the Geometric Covering Salesman Problem
• A novel discretization scheme for the close enough traveling salesman problem
• An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
• A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
• Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• Approximation algorithms for TSP with neighborhoods in the plane
• Genetic Algorithms and the Optimal Allocation of Trials
• TSP with neighborhoods of varying size
• Some polynomially solvable subcases of the detailed routing problem in VLSI design