In this paper we present the results of a research relative to the ascertainment of limits and potentials of genetic algorithms [4, 3, 6] in addressing highly constrained optimization problems, where a minimal change to a feasible solution is very likely to yield an infeasible one. As a test problem, we have chosen the timetable problem (TTP), a problem that is known to be NP-hard [5], which has been intensively investigated for its practical relevance [2, 1]
CITATION STYLE
Colorni, A., Dorigo, M., & Maniezzo, V. (1992). Genetic Algorithms: A New Approach to the Timetable Problem. In Combinatorial Optimization (pp. 235–239). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-77489-8_14
Mendeley helps you to discover research relevant for your work.