Skip to main content

Hybridizing a Genetic Algorithm with Local Search and Heuristic Seeding

  • Conference paper
  • First Online:
  • 558 Accesses

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

Abstract

We confront scheduling problems by means of a Genetic Algorithm that is hybridized with a local search method and specialized for a family of problems by seeding with heuristic knowledge. We also report experimental results that demonstrate the effect of both strategies on the GA performance.

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bierwirth, C.: A Generalized Permutation Approach to Jobshop Scheduling with Genetic Algorithms. OR Spectrum, Vol. 17 (1995) 87–92.

    Article  MATH  Google Scholar 

  2. Bierwirth, C, Mattfeld, D.: Production Scheduling and Rescheduling dwdith Genetic Algoritthms. Evolutionary Computation, Vol. 7(1)(1999) 1–17.

    Article  Google Scholar 

  3. Giffler, B. Thomson, G. L.: Algorithms for Solving Production Scheduling Problems. Operations Reseach 8 (1960) 487–503.

    Article  MathSciNet  MATH  Google Scholar 

  4. Matfeld, D. C.: Evolutionary Search and the Job Shop. Investigations on Genetic Algorithms for Production Scheduling. Springer-Verlag, November 1995.

    Google Scholar 

  5. Sadeh, N., Fox, M.S.: Variable and Value Ordering Heuristics for the Job Shop Scheduling Constraint Satisfaction Problem. Artificial Intelligence, Vol. 86 (1996) 1–41.

    Article  Google Scholar 

  6. Taillard, E.: Bechmarcks for basic scheduling problems. European Journal of Operational Research, Vol 64 (1993) 278–285.

    Article  MATH  Google Scholar 

  7. Varela, R., Vela, C. R., Puente, J., Gómez A.: A knowledge-based evolutionary strategy for scheduling problems with bottlenecks. European Journal of Operational Research, Vol 145 (2003) 57–71.

    Article  MathSciNet  MATH  Google Scholar 

  8. Vela, C. R., Varela, R., Puente, J.: Initialization in Genetic Algorithms for Constraint Satisfaction Problems. J. Mira and A. Prieto (eds.), IWANN 2001, LNCS 2084(2001) 693–700.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Puente, J., Vela, C.R., Prieto, C., Varela, R. (2003). Hybridizing a Genetic Algorithm with Local Search and Heuristic Seeding. In: Mira, J., Álvarez, J.R. (eds) Artificial Neural Nets Problem Solving Methods. IWANN 2003. Lecture Notes in Computer Science, vol 2687. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44869-1_42

Download citation

  • DOI: https://doi.org/10.1007/3-540-44869-1_42

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40211-4

  • Online ISBN: 978-3-540-44869-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics