文摘
|
The greedy algorithm is a strong local searching algorithm. The genetica lgorithm is generally applied to the global optimization problems. In this paper, we combine the greedy idea and the genetic algorithm to propose the greedy genetic algorithm which incorporates the global exploring ability of the genetic algorithm and the local convergent ability of the greedy algorithm. Experimental results show that greedy genetic algorithm gives much better results than the classical genetic algorithm. |
来源
|
Journal of Systems Science and Complexity
,2005,18(1):102-110 【核心库】
|
关键词
|
Genetic algorithm
;
greedy algorithm
;
greedy genetic algorithm
;
global optimization
|
地址
|
Institute of Systems Science, AMSS, Chinese Academy of Sciences, Key Laboratory of Mathematics Mechanization, CAS, 北京, 100080
|
语种
|
英文 |
文献类型
|
研究性论文 |
ISSN
|
1009-6124 |
学科
|
数学 |
基金
|
中国科学院研究生科学与社会实践专项(创新研究类)项目
;
中国科学院研究生院项目
|
文献收藏号
|
CSCD:1875677
|
|
1.
Z Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs.
Genetic Algorithms + Data Structures = Evolution Programs (Third Edition),1996
|
CSCD被引
1
次
|
|
|
|
2.
Pan Z. Evolutionary Computation(Chinese edition).
Evolutionary Computation(Chinese edition),1998
|
CSCD被引
1
次
|
|
|
|
3.
T Back. Extended selection mechanisms in genetic algorithms.
Proceedings of the Fourth International Conference on Genetic Algorithms,1991
|
CSCD被引
2
次
|
|
|
|
4.
A Szalas. Contractive Mapping Genetic Algorithms and Their Convergence.
Contractive Mapping Genetic Algorithms and Their Convergence. Technical Report 006-1993
|
CSCD被引
1
次
|
|
|
|
5.
R E Smith. an algorithm and analysis.
Proceedings of the Fifth International Conference on Genetic Algorithms,1993:653
|
CSCD被引
1
次
|
|
|
|
6.
J Arabas. GAVaPS-a genetic algorithm with varying population size.
Proceeding of the 1st IEEE International Conference on Evolutionary Computation(ICEC),1994
|
CSCD被引
1
次
|
|
|
|
7.
Y Davidor. An introduction to adaptive optimization algorithms based on principles of nature evolution.
An introduction to adaptive optimization algorithms based on principles of nature evolution, dynamic, genetic and chaotic programming,1992:138-202
|
CSCD被引
1
次
|
|
|
|
8.
H P Schwefel. Numerical Optimization of Computer Models.
Numerical Optimization of Computer Models,1981
|
CSCD被引
22
次
|
|
|
|
9.
D E Goldberg. A note on Boltzman Tournament Selection for genetic algorithms and populationoriented simulated annealing.
Complex Systems,1990,4(4):445-460
|
CSCD被引
8
次
|
|
|
|
10.
Kang L. Luo.
Non-Numerical Parallel Algorithms(1st Volume): Simulated Annealing Algorithm(Chinese edition),1994
|
CSCD被引
1
次
|
|
|
|
11.
R A Ahuja. A Greedy Genetic Algorithm for the Quadratic Assignment Problem.
A Greedy Genetic Algorithm for the Quadratic Assignment Problem,1997
|
CSCD被引
1
次
|
|
|
|
12.
F Glover. Unsuspected Potential.
Statistics and Computing,1994,4:131-140
|
CSCD被引
1
次
|
|
|
|
13.
Aggrwal C C. Optimized crossover for the indepedent set problem.
Research Report,1994
|
CSCD被引
1
次
|
|
|
|
14.
R L Harry. Data Structures & Their Algorithms.
Data Structures & Their Algorithms,1991
|
CSCD被引
1
次
|
|
|
|
15.
J H Holland. University of Michigan Press.
Adaptation in Nature and Artificial Systems,1975
|
CSCD被引
41
次
|
|
|
|
16.
K A De Jong. On using genetic algorithms to search program spaces.
Proceedings of the Second International Conference on Genetic Algorithms,1987:210-216
|
CSCD被引
2
次
|
|
|
|
17.
J D Schaffel. Das.
Proceeding of the 3rd International Conference on Genetic Algorithms,1989:51-60
|
CSCD被引
2
次
|
|
|
|
18.
K A De Jong. On using genetic algorithms to search program spaces.
Proceedings of the Second International Conference on Genetic Algorithms,1987:210-216
|
CSCD被引
2
次
|
|
|
|
19.
J D Schaffel. Das.
Proceeding of the 3rd International Conference on Genetic Algorithms,1989:51-60
|
CSCD被引
2
次
|
|
|
|
20.
D E Goldberg. Genetic Algorithms in Search.
Genetic Algorithms in Search, Optimization and Machine Learning,1989
|
CSCD被引
182
次
|
|
|