| AMGA: an archive-based micro genetic algorithm for multi-objective optimization |
| Full text |
Pdf
(303 KB)
|
Source
|
Genetic And Evolutionary Computation Conference
archive
Proceedings of the 10th annual conference on Genetic and evolutionary computation
table of contents
Atlanta, GA, USA
SESSION: Evolutionary multiobjective optimization papers
table of contents
Pages 729-736
Year of Publication: 2008
ISBN:978-1-60558-130-9
|
|
Authors
|
|
Santosh Tiwari
|
Clemson University, Clemson, SC, USA
|
|
Patrick Koch
|
Engineous Software Inc., Cary, NC, USA
|
|
Georges Fadel
|
Clemson University, Clemson, SC, USA
|
|
Kalyanmoy Deb
|
Indian Institute of Technology Kanpur, Kanpur, UNK, India
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 14, Downloads (12 Months): 70, Citation Count: 0
|
|
|
ABSTRACT
In this paper, we propose a new evolutionary algorithm for multi-objective optimization. The proposed algorithm benefits from the existing literature and borrows several concepts from existing multi-objective optimization algorithms. The proposed algorithm employs a new kind of selection procedure which benefits from the search history of the algorithm and attempts to minimize the number of function evaluations required to achieve the desired convergence. The proposed algorithm works with a very small population size and maintains an archive of best and diverse solutions obtained so as to report a large number of non-dominated solutions at the end of the simulation. Improved formulation for some of the existing diversity preservation techniques is also proposed. Certain implementation aspects that facilitate better performance of the algorithm are discussed. Comprehensive benchmarking and comparison of the proposed algorithm with some of the state-of-the-art multi-objective evolutionary algorithms demonstrate the improved search capability of the proposed algorithm.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
R. Dawkins. The Selfish Gene. Oxford University Press, New York, 1976.
|
| |
3
|
N. Eldredge. Macro-Evolutionary Dynamics: Species, Niches and Adaptive Peaks. McGraw-Hill, New York, 1989.
|
| |
4
|
|
| |
5
|
|
| |
6
|
|
| |
7
|
C. A. Coello. A comprehensive survey of evolutionary-based multiobjective optimization techniques. Knowledge Information Systems, 1(3):269--308, 1999.
|
| |
8
|
E. Zitzler, M. Laumanns, and L. Thiele. SPEA2: Improving the strength pareto evolutionary algorithm for multiobjective optimization. In Proceedings of the EUROGEN2001 Conference, pages 95--100, 2001.
|
| |
9
|
|
| |
10
|
K. Deb, S. Agrawal, A. Pratap, and T. Meyarivan. A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2):182--197, 2002.
|
| |
11
|
S. Watanabe, T. Hiroyasu, and M. Miki. NCGA: Neighborhood cultivation genetic algorithm for multi-objective optimization problems. In Proceedings of the Genetic and Evolutionary Computation Conference GECCO 2002, pages 458--465, 2002.
|
| |
12
|
G. G. Yen and L. Haiming. Dynamic multiobjective evolutionary algorithm: adaptive cell-based rank and density estimation. IEEE Transactions on Evolutionary Computation, 7(3):253--274, June 2003.
|
| |
13
|
M. Kim, T. Hiroyasu, and M. Mikiand S. Watanabe. SPEA2+: Improving the performance of the strength pareto evolutionary algorithm 2. In Parallel Problem Solving from Nature PPSN VIII, pages 742--751, 2004.
|
| |
14
|
S. Y. Ho, L. S. Shu, and J. H. Chen. Intelligent evolutionary algorithms for large parameter optimization problems. IEEE Transactions on Evolutionary Computation, 8(6):522--541, 2004.
|
| |
15
|
|
| |
16
|
K. Deb and S. Tiwari. Omni-optimizer, a generic evolutionary algorithm for single and multi-objective optimization. European Journal of Operational Research, 185(3):1062--1087, 2008.
|
| |
17
|
H. Eskandari, C. D. Geiger, and G. B. Lamont. Fastpga: A dynamic population sizing approach for solving expensive multiobjective optimization problems. In Evolutionary Multiobjective Optimization Conference EMO-2007, pages 141--155. LNCS 4403 Springer-Verlag Berlin Heidelberg, 2007.
|
| |
18
|
Y. Sensor. Pareto optimality in multi-objective problems. Applied Mathematics and Optimization, 4(1):41--59, March 1977.
|
| |
19
|
Y. Sensor. Pareto optimality in multi-objective problems. Applied Mathematics and Optimization, 4(1):41--59, March 1977.
|
| |
20
|
S. Kukkonen and K. Deb. Improved pruning of non-dominated solutions based on crowding distance for bi-objective optimization problems. Technical Report 7, Indian Institute of Technology Kanpur, India, 2006.
|
| |
21
|
S. Kukkonen and K. Deb. A fast and effective method for pruning of non-dominated solutions in many-objective problems. Technical Report 4, Indian Institute of Technology Kanpur, India, 2007.
|
| |
22
|
K. Deb and R. B. Agrawal. Simulated binary crossover for continuous search space. Complex Systems, 9(2):115--148, 1995.
|
| |
23
|
K. Deb and M. Goyal. A combined genetic adaptive search (geneas) for engineering design. Computer Science and Informatics, 26(4):30--45, 1996.
|
| |
24
|
M. T. Jenson. Reducing the run-time complexity of multiobjective eas: The nsga-ii and other algorithms. IEEE Transactions on Evolutionary Computation, 7(5):503--515, 2003.
|
| |
25
|
Juan J. Durillo, Antonio J. Nebro, Francisco Luna, Bernabe Dorronsoro, and Enrique Alba. jmetal: a java framework for developing multi-objective optimization metaheuristics. Technical report, E. T. s. Ingenieria Informatica Campus de Teatinos 29071 Malaga Spain, 2006.
|
| |
26
|
K. Deb, L. Thiele, M. Laumanns, and E. Zitzler. Scalable multi-objective optimization problems. In Proceedings of IEEE Congress on Evolutionary Computation, volume 1, pages 825{830, Honolulu, HI, USA, 12--17 May 2002.
|
|