scholarly journals Evolutionary Computation in Constraint Satisfaction

10.5772/8047 ◽  
2010 ◽  
Author(s):  
Madalina Ionita ◽  
Mihaela Breaban ◽  
Cornelius Croitoru
Keyword(s):  
Evolutionary Computation ◽  
Constraint Satisfaction

Evolving Combinatorial Problem Instances That Are Difficult to Solve

2006 ◽  
Vol 14 (4) ◽  
pp. 433-462 ◽  
Author(s):  
Jano I. van Hemert
Keyword(s):  
Evolutionary Computation ◽  
Structural Properties ◽  
Constraint Satisfaction ◽  
Travelling Salesman Problem ◽  
Combinatorial Problem ◽  
Boolean Satisfiability ◽  
Combinatorial Optimisation ◽  
Travelling Salesman ◽  
Binary Constraint ◽  
Problem Instances

This paper demonstrates how evolutionary computation can be used to acquire difficult to solve combinatorial problem instances. As a result of this technique, the corresponding algorithms used to solve these instances are stress-tested. The technique is applied in three important domains of combinatorial optimisation, binary constraint satisfaction, Boolean satisfiability, and the travelling salesman problem. The problem instances acquired through this technique are more difficult than the ones found in popular benchmarks. In this paper, these evolved instances are analysed with the aim to explain their difficulty in terms of structural properties, thereby exposing the weaknesses of corresponding algorithms.

Architecture for High Speed Evolutionary Computation

2003 ◽  
Vol 123 (4) ◽  
pp. 723-733
Author(s):  
Masaya Yoshikawa ◽  
Tetuya Imai ◽  
Tomoyuki Kodama ◽  
Hironori Yamauchi ◽  
Hidekazu Terai
Keyword(s):  
Evolutionary Computation ◽  
High Speed
Sign in / Sign up

Export Citation Format

Share Document