Simulated Annealing

Emile Aarts (), Jan Korst () and Wil Michiels ()
Additional contact information
Emile Aarts: Eindhoven University of Technology
Jan Korst: Philips Research Laboratories
Wil Michiels: NXP

Chapter Chapter 10 in Search Methodologies, 2014, pp 265-285 from Springer

Abstract: Abstract Many problems in engineering, planning and manufacturing can be modeled as that of minimizing or maximizing a cost function over a finite set of discrete variables. This class of so-called combinatorial optimization problems has received much attention over the years and major achievements have been made in its analysis (Ausiello et al.

Keywords: Combinatorial Optimization Problems; Cooling Schedule; Job Shop Scheduling Problem (JSSP); Inhomogeneous Algorithm; Finite-time Implementation (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-6940-7_10

Ordering information: This item can be ordered from
http://www.springer.com/9781461469407

DOI: 10.1007/978-1-4614-6940-7_10

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().