Search Space Filling and Shrinking Based to Solve Constraint Optimization Problems

详细信息    查看全文

• 作者：Yi Hong ; Qingsheng Ren ; Jin Zeng ; Ying Zhang
• 刊名：Lecture Notes in Computer Science
• 出版年：2005
• 出版时间：2005
• 年：2005
• 卷：3644
• 期：1
• 页码：p.986
• 全文大小：249 KB
• 刊物类别：Computer Science
• 刊物主题：Artificial Intelligence and Robotics
  Computer Communication Networks
  Software Engineering
  Data Encryption
  Database Management
  Computation by Abstract Devices
  Algorithm Analysis and Problem Complexity
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1611-3349

文摘

Genetic algorithm (GA) is an effective method to tackle combinatorial optimization problems. Since the limitation of encoding method, the search space of GA should be regular. Unfortunately, for constraint optimizations, this precondition is unsatisfied. To obtain a regular search space, a commonly used method is penalty functions. But the setting of a good penalty function is difficult. In this paper, a novel algorithm, called search space filling and shrinking algorithm (SSFSA), is proposed. SSFSA first seeks a smaller search space which covers all the feasible domains, then fills the unfeasible search space to acquire a regular search space. Search space shrinking diminishes the search space, so shortens the searching time. Search space filling repairs the irregular search space, and makes GA execute effectively. Experimental results show that SSFSA outperforms penalty methods’.