Skip to main content

Reasoning About Order Crossover in Genetic Algorithms

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13344))

Abstract

The formal modeling and verification of algorithms is a challenging task, but it is a necessary requirement for the proof of correctness. Evolutionary computation and theorem proving approach of formal methods are two different domains in theoretical computer science. Using Prototype Verification System (PVS), this paper presents a method of formal specification, reasoning and verification for order crossover operator in Genetic Algorithms (GAs) and their rudimentary properties. Order crossover operator is first formally specified in PVS specification language. Some other operators used in the definitions of order crossover are also specified. PVS theorem prover is then used to prove some properties of order crossover and operators.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   99.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

Learn about institutional subscriptions

Notes

  1. 1.

    We have used the symbol o for concatenation according to PVS syntax.

References

  1. Kochenderfer, M.J., Wheeler, T.A.: Algorithms for Optimization. MIT Press, Cambridge (2019)

    MATH  Google Scholar 

  2. Holland, H.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  3. Hasan, O., Tahar, S.: Formal verification methods. In: Encyclopedia of Information Science and Technology, 3rd edn., pp 7162–7170. IGI Global (2015)

    Google Scholar 

  4. Nawaz, M.S., Malik, M., Li, Y., Sun, M., Lali, M.I.: A survey on theorem provers in formal methods, CoRR, abs/1902.03028 (2019)

    Google Scholar 

  5. Owre, S., Shankar, N., Rushby, J.M., Stringer-Calvert, D.W.J.: PVS version 2.4, system guide, prover guide, PVS language reference (2001)

    Google Scholar 

  6. Uchibori, A., Endou, N.: Basic properties of genetic algorithms. J. Formal. Math. 8, 151–160 (1999)

    Google Scholar 

  7. Nawaz, M.S., Lali, M.I., Pasha, M.A.: Formal verification of crossover operator in genetic algorithms using Prototype Verification System (PVS). In: Proceedings of International Conference on Emerging Technologies, pp. 1–6 (2013)

    Google Scholar 

  8. Aguado, F., Doncel, J.L., Molinelli, J.M., Perez, G., Vidal, C.: Genetic algorithms in Coq: generalization and formalization of the crossover operator. J. Formal. Reason. 1, 25–37 (2008)

    MathSciNet  MATH  Google Scholar 

  9. Bertot, Y., Casteran, P.: Interactive Theorem Proving and Program Development: Coq’Art: The Calculus of Inductive Construction. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-662-07964-5

  10. Aguado, F., Doncel, J.L., Molinelli, J.M., Pérez, G., Vidal, C., Vieites, A.: Certified genetic algorithms: crossover operators for permutations. In: Moreno Díaz, R., Pichler, F., Quesada Arencibia, A. (eds.) EUROCAST 2007. LNCS, vol. 4739, pp. 282–289. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-75867-9_36

    Chapter  Google Scholar 

  11. Zhang, J., Kang, M., Li, X., Liu, G.Y.: Bio-inspired genetic algorithms with formalized crossover operators for robotic applications. Front. Neurorobot. 11, 56 (2017)

    Article  Google Scholar 

  12. Slind, K., Norrish, M.: A brief overview of HOL4. In: Proceedings of Theorem Proving in Higher-Order Logic, pp. 28–32 (2008)

    Google Scholar 

  13. Nawaz, M.S., Sun, M.: A formal design model for genetic algorithms operators and its encoding in PVS. In: Proceedings of International Conference on Big Data and Internet of Things, pp 186–190 (2018)

    Google Scholar 

  14. Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice Hall International, Englewood Cliffs (1998)

    MATH  Google Scholar 

  15. Noor, S., Lali, M.I., Nawaz, M.S.: Solving job shop scheduling problem with genetic algorithms. Sci. Int. 27, 3367–3371 (2015)

    Google Scholar 

  16. Mitchell, M.: An Introduction to Genetic Algorithms (Complex Adaptive Systems). A Bradford Book, England (1998)

    Google Scholar 

  17. De Jong, A.: An analysis of the behavior of a class of genetic adaptive systems. Ph.D thesis, Ann Arbor, MI, USA (1975)

    Google Scholar 

  18. Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)

    Google Scholar 

  19. Hong,W., Nawaz, M.S., Zhang, X., Li, Y., Sun, M.: Using Coq for formal modeling and verification of timed connectors. In: Proceedings of Software Engineering and Formal Methods Workshops, pp. 558–573 (2018)

    Google Scholar 

  20. Nawaz, M.S., Sun, M., Fouriner-Viger, P.: Proof searching in PVS using simulated annealing. In: Proceedings of International Conference on Swarm Intelligence, pp. 253–262 (2021)

    Google Scholar 

  21. Nawaz, M.S., Sun, M., Fouriner-Viger, P.: Proof guidance in PVS with sequential pattern mining. In: Proceedings of International Conference on Fundamentals of Software Engineering, pp. 45–60 (2019)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Philippe Fournier-Viger .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nawaz, M.S., Noor, S., Fournier-Viger, P. (2022). Reasoning About Order Crossover in Genetic Algorithms. In: Tan, Y., Shi, Y., Niu, B. (eds) Advances in Swarm Intelligence. ICSI 2022. Lecture Notes in Computer Science, vol 13344. Springer, Cham. https://doi.org/10.1007/978-3-031-09677-8_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-09677-8_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-09676-1

  • Online ISBN: 978-3-031-09677-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics