Bounding the probability of success of stochastic methods for global optimization

DOI10.1016/0898-1221(93)90275-ZzbMath0806.90103OpenAlexW2015287501MaRDI QIDQ1802488

Afonso G. Ferreira, Janez Žerovnik

Publication date: 21 July 1993

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(93)90275-z

zbMATH Keywords

simulated annealingnear-optimal solutionsparallel implementations of simulated annealing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Simulated annealing and tabu search in the long run: A comparison on QAP tasks ⋮ Problems of discrete optimization: challenges and main approaches to solve them ⋮ Local search with memory: Benchmarking RTS ⋮ Parallel local search ⋮ Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\) ⋮ The method of global equilibrium search ⋮ Global equilibrium search applied to the unconstrained binary quadratic optimization problem ⋮ Improved lower bound on the Shannon capacity of \(C_7\) ⋮ Performance analysis of cyclical simulated annealing algorithms ⋮ Random restarting versus simulated annealing

Cites Work

• Optimization by Simulated Annealing
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• Convergence and finite-time behavior of simulated annealing
• Unnamed Item