Welcome to the InfoSci Platform
Pareto Artificial Life Algorithm for Multi-Objective Optimization

Pareto Artificial Life Algorithm for Multi-Objective Optimization

Jin-Dae Song, Bo-Suk Yang
Copyright: © 2011 |Volume: 4 |Issue: 2 |Pages: 18
ISSN: 1938-7857|EISSN: 1938-7865|EISBN13: 9781466600041|DOI: 10.4018/jitr.2011040104
Cite Article Cite Article

MLA

Song, Jin-Dae, and Bo-Suk Yang. "Pareto Artificial Life Algorithm for Multi-Objective Optimization." JITR vol.4, no.2 2011: pp.43-60. http://doi.org/10.4018/jitr.2011040104

APA

Song, J. & Yang, B. (2011). Pareto Artificial Life Algorithm for Multi-Objective Optimization. Journal of Information Technology Research (JITR), 4(2), 43-60. http://doi.org/10.4018/jitr.2011040104

Chicago

Song, Jin-Dae, and Bo-Suk Yang. "Pareto Artificial Life Algorithm for Multi-Objective Optimization," Journal of Information Technology Research (JITR) 4, no.2: 43-60. http://doi.org/10.4018/jitr.2011040104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Most engineering optimization uses multiple objective functions rather than single objective function. To realize an artificial life algorithm based multi-objective optimization, this paper proposes a Pareto artificial life algorithm that is capable of searching Pareto set for multi-objective function solutions. The Pareto set of optimum solutions is found by applying two objective functions for the optimum design of the defined journal bearing. By comparing with the optimum solutions of a single objective function, it is confirmed that the single function optimization result is one of the specific cases of Pareto set of optimum solutions.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.