Evolution of Constraint Satisfaction Strategies in Examination Timetabling

Evolution of Constraint Satisfaction Strategies in Examination Timetabling (0)

by Hugo Terashima-Marín , Peter Ross

Venue:	Proceedings of the Genetic and Evolutionary Computation Conference (GECCO99
Citations:	33 - 1 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Evolution of Constraint Satisfaction Strategies in Examination Timetabling	INFERENCE
AUTHOR NAME	Hugo Terashima-Marín	user correction - Legacy Corrections
AUTHOR NAME	Peter Ross	user correction - Legacy Corrections
AUTHOR AFFIL	Division of Informatics,; The University of Edinburgh	user correction - Legacy Corrections
AUTHOR ADDR	80 South Bridge,; Edinburgh EH1 1HN (UK)	user correction - Legacy Corrections
ABSTRACT	This paper describes an investigation of solving Examination Timetabling Problems (ETTPs) with Genetic Algorithms (GAs) using a non-direct chromosome representation based on evolving the configuration of Constraint Satisfaction methods. There are two aims. The first is to circumvent the problems posed by a direct chromosome representation for the ETTP that consists of an array of events in which each value represents the timeslot which the corresponding event is assigned to. The second is to show that the adaptation of particular features in both the instance of the problem to be solved and the strategies used to solve it provides encouraging results for real ETTPs. There is much scope for investigating such approaches further, not only for the ETTP, but also for other related scheduling problems.	user correction - Legacy Corrections
YEAR	0	user correction - Legacy Corrections
VENUE	Proceedings of the Genetic and Evolutionary Computation Conference (GECCO99	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	635--642	INFERENCE
CITATIONS	17 found	ParsCit 1.0