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

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

2007
Z. G. Wang M. Rahman Y. S. Wong K. S. Neo

In this paper, a new hybrid of genetic algorithm (GA) and simulated annealing (SA), referred to as GSA, is presented. In this algorithm, SA is incorporated into GA to escape from local optima. The concept of hierarchical parallel GA is employed to parallelize GSA for the optimization of multimodal functions. In addition, multi-niche crowding is used to maintain the diversity in the population o...

2006
Samuel Xavier-de-Souza Johan A.K. Suykens Joos Vandewalle Désiré Bollé

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

2014
Z H Che Tzu-An Chiang Y C Kuo Zhihua Cui

In consideration of capacity constraints, fuzzy defect ratio, and fuzzy transport loss ratio, this paper attempted to establish an optimized decision model for production planning and distribution of a multiphase, multiproduct reverse supply chain, which addresses defects returned to original manufacturers, and in addition, develops hybrid algorithms such as Particle Swarm Optimization-Genetic ...

Gholam-Abass Barani Kourosh Qaderi Marzieh Mohammadi,

Earth dam is a structure as homogeneous or non-homogeneous forms for raising water level or water supply. Earth dam consist of different parts that one of the main parts is clay core. Choosing an optimal non permeable core which causes reduction of seepage through dam body and also being stable is necessary. The objective of this research is to optimize the geometry of earth dam clay core such ...

H. Z. Aashtiani and B. Hejazi,

Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm. ...

2013
Kohei Arai

Category decomposition method for un-mixing of mixels (Mixed Pixels) which is acquired with spaceborne based visible to near infrared radiometers by means of Maximum Entropy Method (MEM) with parameter estimation based on Simulated Annealing: SA is proposed. Through simulation studies with spectral characteristics of the ground cover targets which are derived from spectral library and actual re...

2006
P. J. Mohapatra P. K. Nanda Dileep Panjwani

In this paper color image segmentation is accomplished using MRF model. The problem is formulated as a pixel labeling and the true labels are modeled as the MRF model. The observed color image is assumed to be the degraded version of the true labels. We assume the degradation to be Gaussian distribution. The label estimates are obtained by using Bayesian framework and MAP criterion. The (I1, I2...

2013
Kohei Arai

Method for noise suppressing edge enhancement based on genetic algorithm taking into account complexity of target images measured with fractal dimension is proposed. Through experiments with satellite remote sensing imagery data with additive noise, it is found that the proposed method shows appropriate edge enhancing performance with suppressing the additive noise in accordance with complexity...

2002
Tomoyuki Hiroyasu Mitsunori Miki Maki Ogura Yuko Okamoto

This paper proposes Parallel Simulated Annealing using Genetic Crossover (PSA/GAc). In this algorithm, there are several processes of Simulated Annealing (SA) working parallel. To exchange information between the solutions, the operation of genetic crossover is performed. Through the continuous test problems, it is found that PSA/GAc can search the solution effectively. The proposed algorithm i...

1995
Thouraya Daouas Khaled Ghédira Jean-Pierre Müller

Because of its highly combinatorial aspect, its dynamic nature and its practical interest for manufacturing systems, the scheduling problem has been widely studied in the literature by various methods: heuristics, constraint propagation techniques, Constraint Satisfaction Problem formalism, simulated annealing, Taboo search, genetic algorithms, neural networks, etc. This paper deals with the Fl...

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

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