We implemented five conversions of simulated annealing (SA) algorithm from sequential-to-parallel forms on high-performance computers and applied them to a set of standard function optimization problems in order to test their performances. According to the experimental results, we eventually found that the traditional approach to parallelizing simulated annealing, namely, parallelizing moves in...

Annealing algorithms have been employed extensively in the past decade to solve myriads of optimization problems. Several intractable problems such as the traveling salesperson problem, graph partitioning, circuit layout, etc. have been solved to get satisfactory results. In this article we survey convergence results known for annealing algorithms. In particular we deal with Simulated Annealing...

Goel’s Okomtou model is based on the Exponential model and simple non-homogeneous Poisson process (NHPP) model. Some optimization technique has been discussed which can be used to optimize the Goel’s Okomtou models. Simulated Annealing (SA) is a heuristic optimization modelling technique that can been applied to solve many difficult problems in the various fields such as scheduling, modelling e...

Quality-of-service routing (QoSR) is to find an optimal path that satisfies multiple constraints simultaneously. As an NPC problem, it is a challenge for the next-generation networks. In this paper, we propose a novel heuristic SA MCOP to the general multi-constrained optimal path problem by extending simulated annealing into Dijkstra’s algorithm. The heuristic first translates multiple QoS wei...

In this paper, we present on a periodic job shop scheduling problem (PJSSP) based on the periodic event scheduling problem (PESP), which is different from cyclic scheduling. The PESP schedules a number of recurring events, such that each pair of events fulfills certain constraints during a given time period. To solve such a hard PJSS problem, we propose a hybrid algorithm, namely EM–SA, which i...

Nowadays, One-Dimensional Cutting Stock Problem (1D-CSP) is used in many industrial processes and re-cently has been considered as one of the most important research topic. In this paper, a metaheuristic algo-rithm based on the Simulated Annealing (SA) method is represented to minimize the trim loss and also to fo-cus the trim loss on the minimum number of large objects. In this method, the 1D-...

This paper presents an efficient simulated annealing (SA) algorithm with a single decision variable to solve the economic load dispatch (ELD) problems. The philosophy involves the introduction of a new decision variable through a prudent mathematical transformation of the relation between the decision variable and the optimal generations. The objectives of ELD problems in electric power generat...

In this paper we describe the use of coupling to interconnect different Simulated Annealing (SA) processes. The objective is to allow cooperative behavior among the processes in order to improve performance. Coupled Simulated Annealing (CSA) permits a high degree of parallelization while delivering much better results than a typical Parallel SA (PSA) algorithm. This is possible due to the intro...

the mathematical modeling of fracture networks is critical for the exploration and development ofnatural resources. fractures can help the production of petroleum, water, and geothermal energy. theyalso greatly influence the drainage and production of methane gas from coal beds. orientation andspatial distribution of fractures in rocks are important factors in controlling fluid flow. the object...

a facility layout problem is concerned with determining the best position of departments, cells, or machines on the plant. an efficient layout contributes to the overall efficiency of operations. it’s been proved that, when system characteristics change, it can cause a significant increase in material handling cost. consequently, the efficiency of the current layout decreases or is lost and it ...