Combining simulated annealing with local search heuristics

DOI10.1007/BF02601639zbMath0851.90097OpenAlexW2072339136WikidataQ120693799 ScholiaQ120693799MaRDI QIDQ1919834

Olivier C. Martin, Steve W. Otto

Publication date: 28 July 1996

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02601639

zbMATH Keywords

simulated annealinglocal searchmeta-heuristic

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (24)

Embedded local search approaches for routing optimization ⋮ A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows ⋮ Metaheuristics for the single machine weighted quadratic tardiness scheduling problem ⋮ COMBINING HELPFUL SETS AND PARALLEL SIMULATED ANNEALING FOR THE GRAPH-PARTITIONING PROBLEM∗ ⋮ METAHEURISTIC APPROACHES FOR THE MULTILEVEL RESOURCE-CONSTRAINED LOT-SIZING PROBLEM WITH SETUP AND LEAD TIMES ⋮ Heuristics for the mirrored traveling tournament problem ⋮ Metaheuristics: A bibliography ⋮ Coupling ant colony systems with strong local searches ⋮ Unscented hybrid simulated annealing for fast inversion of tunnel seismic waves ⋮ Hybrid Metaheuristics: An Introduction ⋮ MPILS: an automatic tuner for MILP solvers ⋮ A Metaheuristic Approach to Compute Pure Nash Equilibria ⋮ A multi-hybrid algorithm with shrinking population adaptation for constraint engineering design problems ⋮ A direct stochastic algorithm for global search ⋮ An implementation of the iterated tabu search algorithm for the quadratic assignment problem ⋮ A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles ⋮ A survey on optimization metaheuristics ⋮ An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion ⋮ Stochastic optimization with adaptive restart: a framework for integrated local and global learning ⋮ Iterated local search for the quadratic assignment problem ⋮ Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem ⋮ Guided local search and its application to the traveling salesman problem ⋮ Nature's way of optimizing ⋮ Using the method of conditional expectations to supply an improved starting point for CCLS

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• ``Neural computation of decisions in optimization problems
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• Evolution algorithms in combinatorial optimization
• Large-step Markov chains for the TSP incorporating local search heuristics
• The PVM concurrent computing system: Evolution, experiences, and trends
• On the magnetisation of the ground states in two dimensional Ising spin glasses
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Application of statistical mechanics to NP-complete problems in combinatorial optimisation
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
• TSPLIB—A Traveling Salesman Problem Library
• An Efficient Heuristic Procedure for Partitioning Graphs
• Computer Solutions of the Traveling Salesman Problem
• A Review of the Placement and Quadratic Assignment Problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Combining simulated annealing with local search heuristics