Simulated Annealing – An Annotated Bibliography

Collins, Nick

doi:10.1080/01966324.1988.10737242

Cited by 162 publications

(57 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A variety of cooling 'schedules' have been suggested in [41] and [78]. Though simulated annealing was originally meant for optimizing deterministic functions, the framework has been extended to the case of stochastic simulations [2].…”

Section: Simulated Annealingmentioning

confidence: 99%

Simulation optimization: a review of algorithms and applications

et al. 2014

View full text Add to dashboard Cite

Simulation Optimization (SO) refers to the optimization of an objective function subject to constraints, both of which can be evaluated through a stochastic simulation. To address specific features of a particular simulation-discrete or continuous decisions, expensive or cheap simulations, single or multiple outputs, homogeneous or heterogeneous noise-various algorithms have been proposed in the literature. As one can imagine, there exist several competing algorithms for each of these classes of problems. This document emphasizes the difficulties in simulation optimization as compared to mathematical programming, makes reference to state-of-the-art algorithms in the field, examines and contrasts the different approaches used, reviews some of the diverse applications that have been tackled by these methods, and speculates on future directions in the field.

show abstract

Section: Simulated Annealingmentioning

confidence: 99%

Simulation optimization: a review of algorithms and applications

et al. 2014

View full text Add to dashboard Cite

show abstract

“…The procedure is stopped if the length of the current Hamiltonian cycle was not altered during several temperature steps. Expositions of general issues for the development of simulated annealing procedures can be found in Aarts and Korst (1989) and Johnson, Aragon, McGeoch and Scheron (1991), a bibliography is given in Collins, Eglese and Golden (1988).…”

Section: Simulated Annealingmentioning

confidence: 99%

Traveling Salesman Problem

Hoffman

Padberg

Rinaldi

2013

Encyclopedia of Operations Research and Management Science

196

View full text Add to dashboard Cite

This paper presents a self-contained introduction into algorithmic and computational aspects of the traveling salesman problem and of related problems, along with their theoretical prerequisites as seen from the point of view of an operations researcher who wants to solve practical problem instances.Extensive computational results are reported on most of the algorithms described. Optimal solutions are reported for instances with sizes up to several thousand nodes as well as heuristic solutions with provably very high quality for larger instances.

show abstract

“…Further information on SA can be found in a variety of sources (Collins et al, 1988;Van Laarhoven and Aarts, 1989;Aarts and Korst, 1989).…”

Section: Equationmentioning

confidence: 99%

Local search: A guide for the information retrieval practitioner

MacFarlane

Tuson

2009

Information Processing & Management

View full text Add to dashboard Cite

This is the unspecified version of the paper.This version of the publication may differ from the final published version. Permanent repository link AbstractThere are a number of combinatorial optimisation problems in information retrieval in which the use of local search methods are worthwhile. The purpose of this paper is to show how local search can be used to solve some well known tasks in Information Retrieval (IR), how previous research in the field is piecemeal, bereft of a structure and methodologically flawed, and to suggest more rigorous ways of applying local search methods to solve IR problems. We provide a Query based taxonomy for analysing the use of local search in IR tasks and an overview of issues such as fitness functions, statistical significance and test collections when conducting experiments on combinatorial optimisation problems. The paper gives a guide on the pitfalls and problems for IR practitioners who wish to use local search to solve their research issues, and gives practical advice on the use of such methods. The Query based taxonomy is a novel structure which can be used by the IR practitioner in order to examine the use of local search in IR.

show abstract

Simulated Annealing – An Annotated Bibliography

Abstract: SYNOPTIC ABSTRACTThe results of an extensive Simulated Annealing algorithm for reported. The papers and books are with particular reference to the employed. literature survey of the optimization problems are classified and annotated, type of cooling schedule

Cited by 162 publications

References 17 publications

Simulation optimization: a review of algorithms and applications

Simulation optimization: a review of algorithms and applications

Traveling Salesman Problem

Local search: A guide for the information retrieval practitioner

Contact Info

Product

Resources

About