Simulated annealing: A tool for operational research

European Journal of Operational Research

Volumn 46, Issue 3, 1990, Pages 271-281

  Eglese, R W ^a  

^a LANCASTER UNIVERSITY MANAGEMENT SCHOOL   (United Kingdom)

Author keywords

heuristics; optimisation; Simulated annealing

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; MANAGEMENT SCIENCE - OPTIMIZATION; MATHEMATICAL TECHNIQUES - HEURISTIC; PROBABILITY - THEORY; SOLIDS - ANNEALING;

ALGORITHM PERFORMANCE; HEURISTIC ALGORITHM; MARKOV CHAINS THEORY; OPTIMIZATION PROBLEM SOLUTION; SA ALGORITHM; SIMULATED ANNEALING (SA);

OPERATIONS RESEARCH;

EID: 0025449198     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(90)90001-R     Document Type: Review

References (36)

1. Statistical cooling: A general approach to combinatorial optimization problems
2. A neuromorphic VLSI learning system
3. Simulated annealing methods with general acceptance probabilities
4. A Parallel Simulated Annealing Algorithm for the Placement of Macro-Cells
5. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
6. Some experiments with simulated annealing for colouring graphs
7. Simulated Annealing – An Annotated Bibliography
8. Combinatorial optimization using simulated annealing
9. An improved annealing scheme for the QAP
10. Conference seminar timetabling
11. On the convergence of stationary distributions in simulated annealing algorithms
12. Optoelectronic analogs of self-programming neural nets: architecture and methodologies for implementing fast stochastic learning by simulated annealing
13. New approaches for heuristic search: A bilateral linkage with artificial intelligence
14. Simulated annealing without rejected moves
15. A new simulated annealing algorithm for standard cell placement
16. Cooling schedules for optimal annealing
17. Using tabu search techniques for graph colouring
18. Approximating the permanent
19. Optimization by simulated annealing
20. Theoretical and computational aspects of simulated annealing
21. New upper bounds for the football pool problem for 6, 7 and 8 matches
22. Convergence of an annealing algorithm
23. Randomized heuristics for NP-hard problems
24. A controlled search simulated annealing method for the general jobshop scheduling problem
25. Equation of state calculations by fast computing machines
26. Convergence and Finite-Time Behavior of Simulated Annealing
27. Probabilistic hill climbing algorithms: Properties and applications
28. The time complexity of maximum matching by simulated annealing
29. Simulated Simulated Annealing
30. The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
31. Applying Stochastic Algorithms to a Locomotive Scheduling Problem