Guided local search and its application to the traveling salesman problem
From MaRDI portal
Publication:1808420
DOI10.1016/S0377-2217(98)00099-XzbMath0937.90094OpenAlexW2166166917WikidataQ94086017 ScholiaQ94086017MaRDI QIDQ1808420
Christos Voudouris, Edward P. K. Tsang
Publication date: 24 November 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00099-x
Related Items
A guided local search heuristic for the capacitated arc routing problem ⋮ ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms ⋮ Ant colony optimization for solving an industrial layout problem ⋮ Problems of discrete optimization: challenges and main approaches to solve them ⋮ A guided local search metaheuristic for the team orienteering problem ⋮ Applying the attribute based hill climber heuristic to the vehicle routing problem ⋮ Fast neighborhood search for two- and three-dimensional nesting problems ⋮ Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem ⋮ An efficient implementation of a static move descriptor-based local search heuristic ⋮ Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes ⋮ Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics ⋮ Space and time allocation in a shipyard assembly hall ⋮ Hybrid Metaheuristics: An Introduction ⋮ The vehicle routing problem with time windows and flexible delivery locations ⋮ Applying topological data analysis to local search problems ⋮ A penalty-based multi-objectivization approach for single objective optimization ⋮ Heuristics for a project management problem with incompatibility and assignment costs ⋮ A combinatorial approach for enhancing the performance of TH-PPM UWB systems: chaotic vs. classical codes sequences ⋮ Instance-specific multi-objective parameter tuning based on fuzzy logic ⋮ A survey of repair methods used as constraint handling techniques in evolutionary algorithms ⋮ An iterated local search algorithm for a place scheduling problem ⋮ Combining VNS with constraint programming for solving anytime optimization problems ⋮ Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem ⋮ Path planning on a cuboid using genetic algorithms ⋮ A survey on optimization metaheuristics ⋮ Solving the one-dimensional bin packing problem with a weight annealing heuristic ⋮ A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem ⋮ Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art ⋮ A truck and drones model for last-mile delivery: a mathematical model and heuristic approach ⋮ Consistent neighborhood search for combinatorial optimization ⋮ Inequality constraint handling in genetic algorithms using a boundary simulation method ⋮ Active guided evolution strategies for large-scale vehicle routing problems with time windows ⋮ Fast and high precision algorithms for optimization in large-scale genomic problems ⋮ On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm ⋮ A guided local search procedure for the multi-compartment capacitated arc routing problem ⋮ Facility location with tree topology and radial distance constraints ⋮ Optimal in-store fulfillment policies for online orders in an omni-channel retail environment ⋮ An iterated local search algorithm for the vehicle routing problem with backhauls ⋮ Translational packing of arbitrary polytopes ⋮ Solving the irregular strip packing problem via guided local search for overlap minimization ⋮ Heuristics for container loading of furniture ⋮ Two-dimensional packing problems: a survey ⋮ Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem ⋮ Automatic production planning of press brakes for sheet metal bending ⋮ The multiobjective multidimensional knapsack problem: a survey and a new approach ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis ⋮ Upper and lower bounding strategies for the generalized minimum spanning tree problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A modified Lin--Kernighan traveling-salesman heuristic
- An improved annealing scheme for the QAP
- The traveling salesman problem: An overview of exact and approximate algorithms
- Large-step Markov chains for the TSP incorporating local search heuristics
- Some experiments with simulated annealing techniques for packing problems
- The traveling salesman. Computational solutions for RSP applications
- Tabu search performance on the symmetric travelling salesman problem
- Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
- Greedy randomized adaptive search procedures
- Future paths for integer programming and links to artificial intelligence
- Combining simulated annealing with local search heuristics
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- TSPLIB—A Traveling Salesman Problem Library
- Tabu Search—Part I
- Tabu Search—Part II
- Fast Algorithms for Geometric Traveling Salesman Problems
- Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP
- A Method for Solving Traveling-Salesman Problems
- Computer Solutions of the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Solving vehicle routing problems using constraint programming and metaheuristics
