Metaheuristics are the most exciting development in approximate optimization techniques of
the last two decades. They have had widespread successes in attacking a variety of difficult …

Simulated Annealing is one of the most classic metaheuristics. Its simplicity and good results
over a wide range of problems have made it a highly popular tool, with hundreds of …

The precise nature of the examination timetabling problem differs from institution to
institution. Thus any general solution method must be suitably flexible and this paper is …

A joint inversion of regionalized phase and group velocities of fundamental mode Rayleigh
waves is performed by means of a simulated annealing scheme which makes use of some …

This paper describes the problem of examination timetables at the University of Technology
of Compiègne and the solutions we devised. The problem we faced was drawing up a week …

This paper presents the on‐chip evolution system of combinational logic circuits by a new
hybrid algorithm known as improved genetic‐simulated annealing algorithm (IGASA). IGASA …

Metaheuristic algorithms are solution approaches to solve optimization problems by
repeating some algorithmic steps while searching the solution space. The strategy of the …

This paper discusses the application of simulated annealing (SA) based meta-heuristics to
self-organized orthogonal resource allocation problems in small cell networks (SCN) s, for …

Two seismic source studies usingteleseismic data are performed by Simulated Annealing
(SA), a non-linear inversion method. The Very FastSimulated Annealing (VFSA) algorithm is …

Ohmic dissipation in conductive media considerably limits the penetrative power of high-
frequency electromagnetic imaging methods and implies that deep regions can be probed …