Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Genetic algorithms and highly constrained problems: The time-table case

  • Genetic Algorithms
  • Conference paper
  • First Online:
Parallel Problem Solving from Nature (PPSN 1990)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Colorni, A., Dorigo, M., Maniezzo, V. "Genetic Algorithms: A New Approach to the Time Table Problem", NATO-ASI School on Combinatorial Optimization, Ankara, Turkey, 1990.

    Google Scholar 

  2. Davis, L., Ritter, F. "Schedule Optimization with Probabilistic Search", Proc. 3rd IEEE Conference on Artificial Intelligence Applications, February 1987, Orlando, Florida.

    Google Scholar 

  3. De Jong, K.A., Spears, W.M. "Using Genetic Algorithms to Solve NP-Complete Problems", Proc. 3rd Int. Conf. on Genetic Algorithms and their Application, June 1989, George Mason University.

    Google Scholar 

  4. de Werra, D. "An Introduction to Timetabling", European Journal of Operational Research, Vol. 19, pag.151–162.

    Google Scholar 

  5. Dorigo, M. "Genetic Algorithms: The State of the Art and Some Research Proposal", Technical Report No. 89-058, Politecnico di Milano, Italy.

    Google Scholar 

  6. Even,S., Itai,A., Shamir,A. "On the Complexity of Timetable and Multicommodity Flow Problems", SIAM Journal of Computing, Vol.5, No.4.

    Google Scholar 

  7. Garey, M.R., Johnson, D.S. "Computers and Intractability", W.H.Freeman & Company.

    Google Scholar 

  8. Hertz A., de Werra D. "Informatique et horaires scolaires", Output, Vol.12, pag.53–56.

    Google Scholar 

  9. Mühlenbein, H. "Parallel Genetic Algorithms, Population Genetics and Combinatorial Optimization", Proc. 3rd Int. Conf. on Genetic Algorithms and their Application, June 1989, George Mason University.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Elettronica, Politecnico di Milano, via Ponzio 34/5, 20133, Milano, Italy

    Alberto Colorni, Marco Dorigo & Vittorio Maniezzo

Authors
  1. Alberto Colorni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marco Dorigo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vittorio Maniezzo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hans-Paul Schwefel Reinhard Männer

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Colorni, A., Dorigo, M., Maniezzo, V. (1991). Genetic algorithms and highly constrained problems: The time-table case. In: Schwefel, HP., Männer, R. (eds) Parallel Problem Solving from Nature. PPSN 1990. Lecture Notes in Computer Science, vol 496. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029731

Download citation

  • DOI: https://doi.org/10.1007/BFb0029731

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54148-6

  • Online ISBN: 978-3-540-70652-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation