ASSORTMENT OF SOLUTIONS FOR VARIABLE TASKS IN MULTI-OBJECTIVE PROBLEMS

Gideon Avigad, Erella Eisenstadt, Uri Ben Hanan

2009

Abstract

In the same manner that species are associated with variants in order to survive, and that human communities, apparently in order to survive, are built up from people with different skills and professions, we suggest in this paper to select a set of diverse solutions in order to optimally solve Multi-Objective Problems (MOPs). As a set, the solutions may cover a wider range of capabilities within the multi-objective space than is possible for an individual member of the set. The diversity within the set is a key issue of this paper and hereinafter designated as an assortment. In the paper, we suggest a computational tool that supports the selection of such an assortment. The selection is posed as an auxiliary MOP of cost versus variability. The cost is directly related to the size of the assortment, whereas the variability is related to the ability of the assortment to cover the objective space. A previously treated problem is adopted and utilized in order to explain and demonstrate the approach.

References

  1. Avigad G., Eisenstadt, E., and Goldvard A., Report no Br.11709, at http://mech.braude.ac.il/gideonavigad/
  2. Avigad, G., Moshaiov, A., Set-based Concept Selection in Multi-objective Problems: Optimality versus Variability Approach, Journal of Engineering Design, Vol. 20(3) pp: 217 - 242, 2009
  3. Bensaid, N. and Matheieu, P. An Autonomous Agent System to Simulatea Set of Robots Exploring a Labyrinth, In the proceedings of 11th International FLAIRS Conference, pp: 384-388, Sanibel, Florida May, 17-20, 1998.
  4. Boer, P., Szyszko, K., and Vermeulen, R. Spreading the risk of extinction by genetic diversity in populations of the carabid beetle, Netherlands Journal of Zoology, 43, 242-259, 1993.
  5. Booy, G. et al., Genetic Diversity and the Survival of Populations. J. Planet Biology 2, 379-395, 2000.
  6. Deb, K., Pratap, A., Agarwal, S., and Meyarivan, T. A Fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Transactions on Evolutionary Computation, 6(2):182-197, April 2002.
  7. Deb K., Multi-objective optimization using evolutionary algorithms. J. Wiley & Sons, Ltd, 2001.
  8. Goldberg, D.E., Genetic algorithms in search, optimization and machine learning, Addison-Wesley, 1989.
  9. Marler, R.T., and Arora, J.S. Survey of multi-objective optimization methods for engineering, Structural Multidisciplinary Optimization, 26: 369-395, 2004.
  10. Mattson, C. A., and Messac, A. Pareto frontier Based concept selection under uncertainty, with visualization, Optimization and Engineering, 6: 85- 115, 2005.
  11. Mayr E. 1982. The growth of biological thought: diversity, evolution and inheritance. Harvard, Cambs. p567 et seq.
  12. Pareto, V. 1906: Manuale di Economica Politica, Societa Editrice Libraria. Milan; translated into English by A.S. Schwier as Manual of Political Economy, edited by A.S. Schwier and A.N. Page, 1971. New York: A.M. Kelley
  13. Van Veldhuizen, D.A., and Lamont, G.B. Multiobjective evolutionary algorithms: analyzing the State-of-theArt, Evolutionary Computation, 8(2): 125-147, 2000.
  14. Zitzler, E., Thiele, L.: Multiobjective Optimization Using Evolutionary Algorithms-A Comparative Study. In Eiben, A.E., ed.: Parallel Problem Solving from Nature V, Amsterdam, Springer-Verlag 292-301, 1998.
  15. Zitzler, E., L. Thiele, M. Laumanns, C. M. Fonseca, and V. G. da Fonseca (2003). Performance assessment of multiobjective optimizers: An analysis and review. IEEE Transactions on Evolutionary Computation 7(2), 117-132, 2003.
  16. Zitzler, E., and Kunzli, S. Indicator-Based Selection in Multiobjective Search, Proceedings of the 8th International Conference on Parallel Problem Solving from Nature (PPSN VIII) September 2004, Birmingham, UK
Download


Paper Citation


in Harvard Style

Avigad G., Eisenstadt E. and Ben Hanan U. (2009). ASSORTMENT OF SOLUTIONS FOR VARIABLE TASKS IN MULTI-OBJECTIVE PROBLEMS . In Proceedings of the International Joint Conference on Computational Intelligence - Volume 1: ICEC, (IJCCI 2009) ISBN 978-989-674-014-6, pages 269-276. DOI: 10.5220/0002277902690276


in Bibtex Style

@conference{icec09,
author={Gideon Avigad and Erella Eisenstadt and Uri Ben Hanan},
title={ASSORTMENT OF SOLUTIONS FOR VARIABLE TASKS IN MULTI-OBJECTIVE PROBLEMS},
booktitle={Proceedings of the International Joint Conference on Computational Intelligence - Volume 1: ICEC, (IJCCI 2009)},
year={2009},
pages={269-276},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002277902690276},
isbn={978-989-674-014-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Joint Conference on Computational Intelligence - Volume 1: ICEC, (IJCCI 2009)
TI - ASSORTMENT OF SOLUTIONS FOR VARIABLE TASKS IN MULTI-OBJECTIVE PROBLEMS
SN - 978-989-674-014-6
AU - Avigad G.
AU - Eisenstadt E.
AU - Ben Hanan U.
PY - 2009
SP - 269
EP - 276
DO - 10.5220/0002277902690276