6 December 2002 Exploring the Pareto frontier using multisexual evolutionary algorithms: an application to a flexible manufacturing problem
Author Affiliations +
Abstract
In multi-objective optimization (MOO) problems we need to optimize many possibly conflicting objectives. For instance, in manufacturing planning we might want to minimize the cost and production time while maximizing the product's quality. We propose the use of evolutionary algorithms (EAs) to solve these problems. Solutions are represented as individuals in a population and are assigned scores according to a fitness function that determines their relative quality. Strong solutions are selected for reproduction, and pass their genetic material to the next generation. Weak solutions are removed from the population. The fitness function evaluates each solution and returns a related score. In MOO problems, this fitness function is vector-valued, i.e. it returns a value for each objective. Therefore, instead of a global optimum, we try to find the Pareto-optimal or non-dominated frontier. We use multi-sexual EAs with as many genders as optimization criteria. We have created new crossover and gender assignment functions, and experimented with various parameters to determine the best setting (yielding the highest number of non-dominated solutions.) These experiments are conducted using a variety of fitness functions, and the algorithms are later evaluated on a flexible manufacturing problem with total cost and time minimization objectives.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Stefano R. Bonissone, Stefano R. Bonissone, Raj Subbu, Raj Subbu, } "Exploring the Pareto frontier using multisexual evolutionary algorithms: an application to a flexible manufacturing problem", Proc. SPIE 4787, Applications and Science of Neural Networks, Fuzzy Systems, and Evolutionary Computation V, (6 December 2002); doi: 10.1117/12.455866; https://doi.org/10.1117/12.455866
PROCEEDINGS
13 PAGES


SHARE
RELATED CONTENT

Improved genetic algorithm for fast path planning of USV
Proceedings of SPIE (December 13 2015)
A genetic algorithm for replica server placement
Proceedings of SPIE (January 13 2012)
Ameliorated GA approach for base station planning
Proceedings of SPIE (September 30 2011)
Evolutionary computation and data mining
Proceedings of SPIE (October 12 2000)

Back to Top