A Non-standard Genetic Algorithm Approach to Solve Constrained School Timetabling Problems

@inproceedings{Fernndez2003ANG,
  title={A Non-standard Genetic Algorithm Approach to Solve Constrained School Timetabling Problems},
  author={Cristina Fern{\'a}ndez and Matilde Santos Pe{\~n}as},
  booktitle={EUROCAST},
  year={2003}
}
In this paper a non-standard constructive approach is described to solve problems of timetabling, so necessary in every school and university. Genetic Algorithms have been used, but adapting them to the characteristics of the problem under consideration. Hard constrains, feasible timetables, have been considered in the problem formulation, forcing us to define a particular population generation and a new guided mutation operator. It has been proved that modified genetic algorithms can be very… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
8 Citations
4 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Desgin and implementation of a timetable system using a genetic algorithm

  • Agostinho C Rosa
  • Proceedings of the 2 nd Int . Conf . on the…
  • 1997

Experimentas on networks of employee tiemtabling problems

  • M. W. Carter, G.
  • Proceedings of the 2 nd Int . Conf . on the…
  • 1997

Laporte : Recent Developments in Practical Course Timetabling

  • T. B. Cooper, J. H. Kingston, E. K. Burke, D. G. Elliman, F. R.
  • Proceedings of the 2 nd Int . Conf . on the…
  • 1997

Weare : A genetic algorithm based university timetabling system

  • A. M. dos Santos, L. S. Ochi
  • Proceedings of the 2 nd East - West International…
  • 1994

Similar Papers

Loading similar papers…