Fine-grained parallel genetic algorithms
Proceedings of the third international conference on Genetic algorithms
An evolutionary approach to combinatorial optimization problems
CSC '94 Proceedings of the 22nd annual ACM computer science conference on Scaling up : meeting the challenge of complexity in real-world computing applications: meeting the challenge of complexity in real-world computing applications
Parallel Genetic Simulated Annealing: A Massively Parallel SIMD Algorithm
IEEE Transactions on Parallel and Distributed Systems
Scheduling Algorithms
An Analysis of the Effects of Neighborhood Size and Shape on Local Selection Algorithms
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Sequential and distributed evolutionary algorithms for combinatorial optimization problems
Recent advances in intelligent paradigms and applications
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 6 - Volume 07
Two models of parallel ACO algorithms for the minimum tardy task problem
International Journal of High Performance Systems Architecture
| Hi-index | 0.00 |
The paper describes the comparison of three evolutionary algorithms for solving combinatorial optimization problems. In particular, a generational, a steady-state and a cellular genetic algorithm were applied to the maximum cut problem, the error correcting code design problem, and the minimum tardy task problem. The results obtained in this work are better than the ones previously reported in the literature in all cases except for one problem instance. The high quality results were achieved although no problem-specific changes of the evolutionary algorithms were made other than in the fitness function. The constraints for the minimum tardy task problem were taken into account by incorporating a graded penalty term into the fitness function. The generational and steady-state algorithms yielded very good results although they sampled only a tiny fraction of the search space.