By Topic

Evolutionary solutions to a highly constrained combinatorial problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Piola, R. ; Dipartimento di Inf., Torino Univ., Italy

Scheduling under constraints is a NP-problem which is found in many practical applications such as the job shop scheduling and the construction of the time table for a public transportation system or for the educational courses of a school. However, many sub-optimal algorithms have been developed for this problem, starting from different approaches going from the more classical ones proposed by operational research and graph theory to evolutive algorithms. Three evolutive algorithms: a simple genetic algorithm (D.E. Goldberg, 1989); a complex genetic algorithm (A. Colorni et al., 1990); and stochastic hill climbing (T. Back, 1991 and M. Herdy, 1990) are compared and evaluated on a particular instance of the time table problem. The selected test case consists of constructing the time table for a school where a set 6 constraints must be simultaneously satisfied

Published in:

Evolutionary Computation, 1994. IEEE World Congress on Computational Intelligence., Proceedings of the First IEEE Conference on

Date of Conference:

27-29 Jun 1994