optimization routines for difficult optimization problems. This paper compares SIMANN to the DFP algorithm on another optimization …This paper describes SIMANN, a Fortran and GAUSS implementation of the simulated annealing algorithm. The Fortran code … was used in "Global Optimization of Statistical Functions with Simulated Annealing" (Goffe, Ferrier, and Rogers 1994). In …

In this paper, a hybrid meta-heuristic algorithm, based on imperialistic competition algorithm (ICA), harmony search … (HS), and simulated annealing (SA) is presented. The body of the proposed hybrid algorithm is based on ICA. The proposed … hybrid algorithm inherits the advantages of the process of harmony creation in HS algorithm to improve the exploitation phase …

capability of Genetic Programming (GP), and linked simulation-optimization for recreating the flux history of the unknown …

In this paper, we introduce four new benchmark problems, which are based on rather common optimization issues of water … performance of a genetic algorithm and a simulated annealing code in finding their optimal solutions. Results show that the … proposed set of benchmark problems is useful for evaluating heuristic optimization codes in the field of water resources …

a heuristic approach based on simulated annealing. Annealing algorithms are random local search optimization algorithms …

A model for the design of detention basin systems is presented that interfaces a simulated annealing (SA) optimization … optimization model is based upon the simulated annealing method to optimize the size and location of detention basin system …

An optimization procedure has been developed for branching storm and sanitary sewer systems with a pre … the optimization procedure. The total cost of the storm sewer system that was obtained with this optimal design procedure … an extra step and implementing an optimization technique during the design phase. Use of Excel should enhance the …

estimation. In adaptive MCMC, the past iterations are used to tune the proposal distribution of the algorithm. The same … adaptation mechanisms can be used in Simulated Annealing (SA), a popular optimization method based on MCMC. The difficulty in … is proposed. The approach is based on the Adaptive Metropolis algorithm of Haario et al. (Bernoulli 7 …

The partitioning of random graphs is investigated numerically using “simulated annealing” and “extremal optimization …”. While generally in an NP-hard problem, it is shown that the optimization of the graph partitions is particularly difficult … “simulated annealing” is found to diverge in the thermodynamic limit. On the other hand, “extremal optimization”, a new general …