close
Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3911))

  • 961 Accesses

  • 3 Citations

Abstract

In the paper a new library for construction of evolutionary algorithms is presented. The library offers greater flexiblity than other known libraries of this type due to application of C# interfaces. The process of construction of an evolutionary program with the use of the library is discussed. The results of the practical evaluation of this library on a set of instances of the job shop problem are presented.

The research has been partially supported by the Ministry of Science and Information Society Technologies of Poland, grant no. 4T11C 03925.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Beasley, J.E.: OR-Library, see Web page, http://msmcga.ms.ic.ac.uk/info.html

  2. Blazewicz, J., Domschke, W., Pesch, E.: The job-shop scheduling problem: Conventional and new solution techniques. Euro. J. Optl Res. 93, 1–33 (1996)

    Article  MATH  Google Scholar 

  3. Blazewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Wȩglarz, J.: Scheduling Computer and Manufacturing Processes, 2nd edn. Springer, Heidelberg (2001)

    Book  MATH  Google Scholar 

  4. Calégari, P., Coray, G., Hertz, A., Kobler, D., Kuonen, P.: A taxonomy of evolutionary algorithms in combinatorial optimization. Journal of Heuristics 5, 145–158 (1999)

    Article  MATH  Google Scholar 

  5. Emmerich, M., Hosenberg, R.: TEA - a C++ library for the design of evolutionary algorithms, report CI-106/01, SFB 531, University of Dortmund (2001)

    Google Scholar 

  6. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman (1979)

    Google Scholar 

  7. Jain, A.S., Meeran, S.: Deterministic job-shop scheduling: Past, present and future. Euro. J. Optl Res. 113, 390–434 (1999)

    Article  MATH  Google Scholar 

  8. Koza, J.R.: Genetic programming. In: Williams, J.G., Kent, A. (eds.) Encyclopaedia of Computer Science and Technology, pp. 29–43. Dekker (1998)

    Google Scholar 

  9. Luke, S., et al.: A Java-based evolutionary computation and genetic programming research system, see Web page http://cs.gmu.edu/~eclab/projects/ecj/

  10. Michalewicz, Z.: Genetic algoritms + data structures = evolutionary programs. Springer, Heidelberg (1994)

    Book  MATH  Google Scholar 

  11. Onak, T.: Evolutionary algorithms and their selected applications, M.S. Thesis, Faculty of Mathematics and Computer Science, Adam Mickiewicz University (in Polish) (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gawiejnowicz, S., Onak, T., Suwalski, C. (2006). A New Library for Evolutionary Algorithms. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2005. Lecture Notes in Computer Science, vol 3911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11752578_50

Download citation

Keywords

Publish with us

Policies and ethics