Search Swinburne Research Bank
This object has not yet been indexed by the background indexing service.
Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/62465
|Download PDF (Published version) (Adobe Acrobat PDF, -1 bytes)|
- Using constraint satisfaction in genetic algorithms
- Kowalczyk, Ryszard
- Existing methods to handle constraints in genetic algorithms (GA) are often computationally expensive or problem domain specific. In this paper, an approach to handle constraints in GA with the use of constraint satisfaction principles is proposed to overcome those drawbacks. Each chromosome representing a set of constrained variables in GA is interpreted as an instance of the same constraint satisfaction problem represented by a constraint network. Dynamic constraint consistency checking and constraint propagation is performed during the main GA simulation process. Unfeasible solutions are detected and eliminated from the search space at early stages of GA simulation process without requiring the problem specific representation or generation operators to provide feasible solutions. Constraint satisfaction is applied actively in GA during initialization, crossover and mutation operations to advantage.
- Publication type
- Conference paper
- Proceedings of the Australian and New Zealand Conference on Intelligent Information Systems, Adelaide, Australia, 18-20 November 1996 / V. L. Narasimhan and L. C. Jain (eds.), pp. 272-275
- Publication year
- Publisher URL
- Copyright © 1996 IEEE. Published version of the paper reproduced here in accordance with the copyright policy of the publisher. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.