Abstract
This paper investigates the problem of using a genetic algorithm to converge on a small, user-defined subset of acceptable solutions to multiobjective problems, in the Pareto-optimal (P-O) range. The paper initially explores exactly why separate objectives can cause problems in a genetic algorithm (GA). A technique to guide the GA to converge on the subset of acceptable solutions is then introduced.
The paper then describes the application of six multiobjective techniques (three established methods and three new, or less commonly used methods) to four test functions. The previously unpublished distribution of solutions produced in the P-O range(s) by each method is described. The distribution of solutions and the ability of each method to guide the GA to converge on a small, user-defined subset of P-O solutions is then assessed, with the conclusion that two of the new multiobjective ranking methods are most useful.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bentley, P. J., 1996, Generic Evolutionary Design of Solid Objects using a Genetic Algorithm. Ph.D. Thesis, University of Huddersfield, Huddersfield, UK.
Dowsland, K. A., 1995, Simulated Annealing Solutions for Multi-Objective Scheduling and Timetabling. Applied Decision Technologies (ADT 95), London, 205-219.
Fonseca, C. M, & Fleming, P. J., 1995a,. An Overview of Evolutionary Algorithms in Multiobjective Optimization. Evolutionary Computation, 3:1, 1-16.
Fonseca, C. M., & Fleming, P. J., 1995b, Multiobjective Genetic Algorithms Made Easy: Selection, Sharing and Mating Restriction. Genetic Algorithms in Engineering Systems: Innovations and Applications, Sheffield, 45-52.
Linkens, D. A. & Nyongesa, H. O., 1993, A Distributed Genetic Algorithm for Multivariable Fuzzy Control. IEE Colloquium on Genetic Algorithms for Control Systems Engineering, Digest No. 199/130, 9/1-9/3.
Marett, R. & Wright, M., 1995, The Value of Distorting Subcosts When Using Neighbourhood Search Techniques for Multi-objective Combinatorial Problems. Applied Decision Technologies, London, 189-202.
Goldberg, D. E., 1989, Genetic Algorithms in Search, Optimization & Machine Learning. Addison-Wesley.
Holland, J. H., 1992, Genetic Algorithms. Scientific American, 66-72.
Horn, J. & Nafpliotis, N., 1993, Multiobjective Optimisation Using the Niched Pareto Genetic Algorithm. Illinois Genetic Algorithms laboratory (IlliGAL), report no. 93005.
Ryan, C., 1994, Pygmies and Civil Servants. Advances in Genetic Programming, MIT Press.
Schaffer, J. D., 1984, Some experiments in machine learning using vector evaluated genetic algorithms. PhD dissertation, Vanderbilt University, Nashville, USA.
Schaffer, J. D., 1985, Multiple Objective Optimization with Vector Evaluated Genetic Algorithms. Genetic Algorithms and Their Applications: Proceedings of the First International Conference on Genetic Algorithms, 93-100.
Srinivas, N. & Deb, K., 1995, Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms. Evolutionary Computation, 2:3, 221–248.
Sun, Y. & Wang, Z., 1992, Interactive Algorithm of Large Scale Multiobjective 0-1 Linear Programming. Sixth IFAC/IFORS/IMACS Symposium on Large Scale Systems, Theory and Applications, 83-86.
Syswerda, G. & Palmucci, J., 1991, The Application of Genetic Algorithms to Resource Scheduling. Genetic Algorithms: Proceedings of the Fourth International Conference, Morgan Kaufmann, 502-508.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag London
About this paper
Cite this paper
Bentley, P.J., Wakefield, J.P. (1998). Finding Acceptable Solutions in the Pareto-Optimal Range using Multiobjective Genetic Algorithms. In: Chawdhry, P.K., Roy, R., Pant, R.K. (eds) Soft Computing in Engineering Design and Manufacturing. Springer, London. https://doi.org/10.1007/978-1-4471-0427-8_25
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0427-8_25
Publisher Name: Springer, London
Print ISBN: 978-3-540-76214-0
Online ISBN: 978-1-4471-0427-8
eBook Packages: Springer Book Archive