نتایج جستجو برای: simulated annealing algorithm sa

تعداد نتایج: 900894  

2002
Dong-Keun Kim Byung-Tae Jang Chi-Jung Hwang

In this paper, we considered a planar perspective transformation between images with overlapping region. It is based on the rectangle-to-quadrilateral mapping and normalized correlations. Initially, the global translation is determined by using a block matching. And to find the correspondence points maximizing correlation in overlapping region by the perspective transformation, we used simulate...

1999
Edmund K. Burke Graham Kendall

In [6] solutions for the nesting problem are produced using the No Fit Polygon (NFP), simulated annealing (SA) and a new evaluation method. It showed that SA could out perform hill climbing, thus suggesting that evolutionary approaches produce better solutions than a standard search algorithm. In this paper this work is developed. Genetic algorithms (GA) and tabu search (TS) are compared with t...

Journal: :International Journal on Artificial Intelligence Tools 2007
Yunsong Guo Andrew Lim Brian Rodrigues Liang Yang

In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborhood Search (NS) based on the structure of the problem. We also used a modified SA algorithm, which gives better results than the traditional SA and developed an effective heuristic for the problem: Squeaky Wheel Optimiz...

2017
Guillermo Cabrera Juan P. Riquelme Claudio Cubillos Ricardo Soto

The Probabilistic Traveling Salesman Problem (PTSP) is a variation of the well known Traveling Salesman Problem (TSP). This problem arises when the information about customers demand is not available at the moment of the tour generation and/or the tour re-calculating cost is too elevated. In this article, a Hybrid Algorithm combining Particle Swarm Optimization (PSO) and Simulated Annealing (SA...

Journal: :Expert Syst. Appl. 2010
Wei-Chiang Hong Yucheng Dong Li-Yueh Chen Chien-Yuan Lai

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

Journal: :Stochastic Processes and their Applications 2001

2017
Yuting Lu Yongquan Zhou

In this paper, a hybrid algorithm of binary lightning search algorithm and simulated annealing (BLSA-SA) is proposed to optimize the design of multilayer microwave absorbers for normal incidence. The multilayer absorber is designed to find a set of coatings that minimize the reflection coefficient over the desired frequency. The design problem is translated into solving the binary problem. Thre...

Journal: :JCP 2014
Jiayi Du Xiangsheng Kong Xin Zuo Lingyan Zhang Aijia Ouyang

Reconfigurable system on chip is well known for its flexibility for high performance embedded systems. The hardware/software (HW/SW) partitioning is the most important phase during the design of reconfigurable system on chip. A great many different algorithms have been adopted for solving the hardware/software partitioning problem. Shuffled Frog Leaping Algorithm (SFLA) is popular for its simpl...

2011
Qingye Jiang Guojie Song Gao Cong Yu Wang Wenjun Si Kunqing Xie

The problem of influence maximization, i.e., mining top-k influential nodes from a social network such that the spread of influence in the network is maximized, is NP-hard. Most of the existing algorithms for the problem are based on greedy algorithm. Although greedy algorithm can achieve a good approximation, it is computational expensive. In this paper, we propose a totally different approach...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید