The cycle basis of a graph arises in a wide range of engineering problems and has a variety of applications. Minimal and optimal cycle bases reduce the time and memory required for most of such applications. One of the important applications of cycle basis in civil engineering is its use in the force method to frame analysis to generate sparse flexibility matrices, which is needed for optimal a...

We applied simulated annealing algorithm to nurse scheduling problem. For time complexity problem of simulated annealing, we suggested an efficient transition rule using cost matrix for simulated annealing. The experimental results showed that the suggested method generated a nurse scheduling faster in time and better in quality compared to traditional simulated annealing.

We present an in-depth study of the simulated annealing approach to the scheduling of serial multiproduct batch processes under the assumption of a permutation schedule. Four versions of the simulated annealing algorithm are studied based on two move acceptance criteria, the Metropolis algorithm and the Glauber algorithm, and two annealing schedules, the exponential schedule and the Aarts and v...

1. Complexities of Problems and Algorithms 2. Introduction to Global Search Methods 3. Contribution of Statistical Physics and Thermodynamics 4. The Simulated Annealing Algorithm 4.1.The Simulated Annealing Algorithm 4.2.Model Calibration and Algorithm Convergence 5. Examples of Problems Solved Thanks to Simulated Annealing 5.1.The Quadratic Assignment Problem 5.2.The Travelling Salesman Proble...

introduction several methods have been developed to aid in selecting a network of biodiversity protected areas. one of these methods is artificial intelligence which includes a number of different computer algorithms that use an objective function to find the best solution. an algorithm is a mathematical process or a set of rules used for problem solving. recently, site selection algorithms hav...

This paper deals with a new algorithm of a parallel simulated annealing HGSA which includes genetic crossover operations. The genetic crossover is used as an enhancement of the origin parallel simulated annealing PSA which allows to recombine solutions produced by individual simulate annealing processes at fixed time intervals. It is found that the proposed algorithm can speed—up the search the...

This paper presents a new simulated annealing algorithm to solve constrained multi-global optimization problems. To compute all global solutions in a sequential manner, we combine the function stretching technique with the adaptive simulated annealing variant. Constraint-handling is carried out through a nondifferentiable penalty function. To benchmark our penalty stretched simulated annealing ...

In this paper, the author proposes the application of a genetic algorithm and simulated annealing to solve the network planning problem. Compared with other optimisation methods, genetic algorithm and simulated annealing are suitable for traversing large search spaces since they can do this relatively rapidly and because the use of mutation diverts the method away from local minima, which will ...