A note on the effect of neighborhood structure in simulated annealing

DOI10.1016/0305-0548(91)90059-ZzbMath0741.90052MaRDI QIDQ1184445

Jeffrey B. Goldberg, Ronald G. Askin, Kah Mun Cheh

Publication date: 28 June 1992

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

simulated annealingtraveling salesmanquadratic assignmentheuristicneighborhood search algorithmstochastic quadratic selection

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (7)

Heuristics for search sequencing under time-dependent probabilities of existence ⋮ Metaheuristics: A bibliography ⋮ A systematic procedure for setting parameters in simulated annealing algorithms ⋮ A robust simulated annealing based examination timetabling system. ⋮ Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines ⋮ Simulated annealing in the presence of noise ⋮ A feedback algorithm for determining search parameters for Monte Carlo optimization

Uses Software

• TimberWolf

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.
• A Dynamic Programming Approach to Sequencing Problems
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Using simulated annealing to solve routing and location problems
• Simulated annealing methods with general acceptance probabilities
• Equation of State Calculations by Fast Computing Machines
• Solution of a Large-Scale Traveling-Salesman Problem
• A Method for Solving Traveling-Salesman Problems
• A man-machine approach toward solving the traveling salesman problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: A note on the effect of neighborhood structure in simulated annealing