Skip to main content

Application and Research of Shortest Time Limit-Resource Leveling Optimization Problem Based on a New Modified Evolutionary Programming

  • Conference paper
Computational Intelligence and Intelligent Systems (ISICA 2012)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 316))

Included in the following conference series:

  • 2211 Accesses

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Mitsuo, M., Cheng, R.: Genetic Algorithms and Engineering Optimization. Tsinghua University Press, Beijing (2004)

    Google Scholar 

  2. Fogel, L.J., Owens, A.J., Walsh, M.J.: Artificial intelligence through simulated evolution. Wiley, New York (1966)

    MATH  Google Scholar 

  3. Ambati, B.K., Ambati, J., Mokhtar, M.M.: Heuristic combinatorial optimization by simulated Darwinian evolution: a polynomial time algorithm for the traveling salesman problem. Biological Cybemetics (1991)

    Google Scholar 

  4. Fogel, D.B.: System identification through simulated evolution: a machine learning approach to modeling. Ginn, Neeham Heights (1991)

    Google Scholar 

  5. Fogel, D.B., Fogel, L.J., Atmar, J.W.: Meta-evolutionary programming. In: Proceedings of 25th Asilomar Conference on Signals, Systems and Computers (1991)

    Google Scholar 

  6. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, Heidelberg (1996)

    Book  MATH  Google Scholar 

  7. Yib, P., Pao, Y.-H.: Combinatorial optimization with use of guided evolutionary simu-lated annealing. IEEE Trans. on Neural Networks (1995)

    Google Scholar 

  8. Li, X., Tan, W., Kang, L.S.: Research on balanced resource optimization based on genetic algorithm. Computer Engineering and Design, Beijing (2008)

    Google Scholar 

  9. Zhou, K., Jun, T.X., Xu, J.: A mathematical model and genetic algorithm for re-source optimization. J. Huazhong Univ. of Sci. & Tech. (Nature Science Edition), Wuhan (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Luo, Y., Tang, J., Xu, S., Zhu, L., Li, X. (2012). Application and Research of Shortest Time Limit-Resource Leveling Optimization Problem Based on a New Modified Evolutionary Programming. In: Li, Z., Li, X., Liu, Y., Cai, Z. (eds) Computational Intelligence and Intelligent Systems. ISICA 2012. Communications in Computer and Information Science, vol 316. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34289-9_65

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34289-9_65

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34288-2

  • Online ISBN: 978-3-642-34289-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics