In this paper, we propose an improved hybrid genetic algorithm (IHGA). It uses a robust local improvement procedure as well as an effective restart mechanism that is based on so-called 'shift mutations'. IHGA has been applied to the well-known combinatorial optimization problem, the quadratic assign
โฆ LIBER โฆ
New hybrid genetic algorithms for the frequency assignment problem
โ Scribed by Alabau, M.; Idoumghar, L.; Schott, R.
- Book ID
- 114532024
- Publisher
- IEEE
- Year
- 2002
- Tongue
- English
- Weight
- 347 KB
- Volume
- 48
- Category
- Article
- ISSN
- 0018-9316
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
An improved hybrid genetic algorithm: ne
โ
Alfonsas Misevicius
๐
Article
๐
2004
๐
Elsevier Science
๐
English
โ 229 KB
Algorithms for the generalized weighted
โ
Muรฑoz, David F.; Muรฑoz, Diego F.
๐
Article
๐
2012
๐
Elsevier Science
๐
English
โ 838 KB
Designing genetic algorithms for the sta
โ
Amaral, J.N.; Tumer, K.; Ghosh, J.
๐
Article
๐
1995
๐
Institute of Electrical and Electronics Engineers
โ 837 KB
Compounded genetic algorithms for the qu
โ
Zvi Drezner
๐
Article
๐
2005
๐
Elsevier Science
๐
English
โ 152 KB
Hybrid Genetic Algorithms for a Rosterin
โ
A. Monfroglio
๐
Article
๐
1996
๐
John Wiley and Sons
๐
English
โ 676 KB
Hybrid Genetic Algorithms are described for a large-size real-life rostering problem (railway workers' job scheduling and roster optimization). The new algorithm uses an order-based representation which encodes as a chromosome the list of job units to schedule. First, a greedy algorithm is considere
A hybrid Hopfield network-genetic algori
โ
Salcedo-Sanz, S.; Xin Yao
๐
Article
๐
2004
๐
IEEE
๐
English
โ 439 KB