Name
Abstract | ||
|---|---|---|
Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of BE with evolutionary algorithms endowed with tabu search. The resulting memetic algorithm (MA) uses BE as a mechanism for recombining solutions, providing the best possible child from the parental set. This MA is applied to the maximum density still life problem. Experimental tests indicate that the MA provides optimal or near-optimal results at an acceptable computational cost. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11730095_7 | EvoCOP |
Keywords | Field | DocType |
bucket elimination,memetic algorithm,experimental test,variable elimination,maximum density,constraint satisfaction problem,exact technique,evolutionary algorithm,life problem,acceptable computational cost,constraint satisfaction,tabu search | Memetic algorithm,Constraint satisfaction,Variable elimination,Mathematical optimization,Search algorithm,Evolutionary algorithm,Algorithm,Combinatorial optimization,Constraint satisfaction problem,Tabu search,Mathematics | Conference |
Volume | ISSN | ISBN |
3906 | 0302-9743 | 3-540-33178-6 |
Citations | PageRank | References |
3 | 0.40 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| José E. Gallardo | 1 | 57 | 6.99 |
| Carlos Cotta | 2 | 441 | 36.10 |
| Antonio Fernández | 3 | 801 | 49.47 |