Application and Research of Shortest Time Limit-Resource Leveling Optimization Problem Based on a New Modified Evolutionary Programming
Aiming at the optimization problem of shortest time limit - resource leveling, the paper first introduces Evolutionary Programming (EP) to solve it, and a new modified method based on evolutionary programming is proposed: the mutation operator of EP is improved by using the theory of Simulated An-ne...
Saved in:
Published in | Computational Intelligence and Intelligent Systems pp. 587 - 594 |
---|---|
Main Authors | , , , , |
Format | Book Chapter |
Language | English |
Published |
Berlin, Heidelberg
Springer Berlin Heidelberg
|
Series | Communications in Computer and Information Science |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Aiming at the optimization problem of shortest time limit - resource leveling, the paper first introduces Evolutionary Programming (EP) to solve it, and a new modified method based on evolutionary programming is proposed: the mutation operator of EP is improved by using the theory of Simulated An-nealing (SA), and without using repair operator. Then use Genetic Algorithm (GA), EP and the modified EP to solve this problem, the experimental results indicate that EP can optimize this problem effectively, and EP has better opti-mization performance than GA. The average evolution generation decreased significantly in the modified EP to approach the optimal solution, the variance after optimization decreases 42.64%. |
---|---|
ISBN: | 3642342884 9783642342882 |
ISSN: | 1865-0929 1865-0937 |
DOI: | 10.1007/978-3-642-34289-9_65 |