Abstract
A memetic algorithm for tackling multiobjective optimization problems is presented. The algorithm employs the proven local search strategy used in the Pareto archived evolution strategy (PAES) and combines it with the use of a population and recombination. Verification of the new algorithm is carried out by testing it on a set of multiobjective 0/1 knapsack problems. On each problem instance, comparison is made between the new memetic algorithm, the (1+1)-PAES local searcher, and the strength Pareto evolutionary algorithm (SPEA) of Zitzler and Thiele.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the IEEE Conference on Evolutionary Computation, ICEC|Proc IEEE Conf Evol Comput Proc ICEC |
| Place of Publication | Piscataway, NJ, United States |
| Publisher | IEEE |
| Pages | 325-332 |
| Number of pages | 7 |
| Volume | 1 |
| Publication status | Published - 2000 |
| Event | Proceedings of the 2000 Congress on Evolutionary Computation CEC 00 - California, CA, USA Duration: 1 Jul 2000 → … |
Conference
| Conference | Proceedings of the 2000 Congress on Evolutionary Computation CEC 00 |
|---|---|
| City | California, CA, USA |
| Period | 1/07/00 → … |