This paper presents a simulated annealing (SA)-based algorithm for fast and robust block motion estimation. To reduce computational complexity, the existing fast search algorithms move iteratively toward the winning point based only on a finite set of checking points in every stage. Despite the efficiency of these algorithms, the search process is easily trapped into local minima, especially fo...

The capacitated clustering problem (CCP) is the problem in which a given set of weighted objects is to be partitioned into clusters so that the total weight of objects in each cluster is less than a given value (cluster 'capacity'). The objective is to minimize the total scatter of objects from the 'centre' of the cluster to which they have been allocated. A simple constructive heuristic, a R-i...

-In this paper, multi-objective optimal placement (MOOP) of multi-type flexible AC transmission systems (FACTS) devices for Thailand power system is proposed. Four types of FACTS devices are used: thyristor-controlled series capacitor (TCSC), thyristor-controlled phase shifter (TCPS), unified power flow controller (UPFC), and static var compensator (SVC). The problem is decomposed into the opti...

This paper presents the formulation and application of a strategy for the determination of an optimal trajectory for a multiple robotic configuration. Genetic Algorithm (GA) and Simulated Annealing (SA) have been used as the optimization techniques and results obtained from them compared. First, the motivation for multiple robot control and the current state-of-art in the field of cooperating r...

We developed minimal perfect hash functions for a variety of datasets using the probabilistic process of simulated annealing (SA). The SA solution structure is a tree representing an annealed program (algorithm). This solution structure is similar to the structure used in genetic programming. When executed, the SA program produces multiple hash functions for the given data set. An initial hash ...

The present paper focus on the improvement of the efficiency of structural optimization, in typical structural optimization problems there may be many locally minimum configurations. For that reason, the application of a global method, which may escape from the locally minimum points, remain essential. In this paper, a new hybrid simulated annealing algorithm for large scale global optimization...

Keywords: Demand forecasting Genetic algorithm–simulated annealing (GA–SA) Support vector regression (SVR) Autoregressive integrated moving average (ARIMA) General regression neural networks (GRNN) Third generation (3G) mobile phone a b s t r a c t Taiwan is one of the countries with higher mobile phone penetration rate in the world, along with the increasing maturity of 3G relevant products, t...

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...