Skip to main content

Fusion of Many-Objective Non-dominated Solutions Using Reference Points

  • Conference paper
  • First Online:
Evolutionary Multi-Criterion Optimization (EMO 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10173))

Included in the following conference series:

Abstract

With recent advancements of multi- or many-objective optimization algorithms, researchers and decision-makers are increasingly faced with the dilemma of choosing the best algorithm to solve their problems. In this paper, we propose a simple hybridization of population-based multi- or many-objective optimization algorithms called fusion of non-dominated fronts using reference points (FNFR) to gain combined benefits of several algorithms. FNFR combines solutions from multiple optimization algorithms during or after several runs and extracts well-distributed solutions from a large set of non-dominated solutions using predefined structured reference points or user-defined reference points. The proposed FNFR is applied to non-dominated solutions obtained by the Generalized Differential Evolution Generation 3 (GDE3), Speed-constrained Multi-objective Particle Swarm Optimization (SMPSO), and the Strength Pareto Evolutionary Algorithm 2 (SPEA2) on seven unconstrained many-objective test problems with three to ten objectives. Experimental results show FNFR is an effective way for combining and extracting (fusion) of well-distributed non-dominated solutions among a large set of solutions. In fact, the proposed method is a solution-level hybridization approach. FNFR showed promising results when selecting well-distributed solutions around a specific region of interest.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Nwankwor, E., Nagar, A.K., Reid, D.: Hybrid differential evolution and particle swarm optimization for optimal well placement. Comput. Geosci. 17(2), 249–268 (2013)

    Article  Google Scholar 

  2. Mirjalili, S., Hashim, S.Z.M.: A new hybrid PSOGSA algorithm for function optimization. In: 2010 International Conference on Computer and Information Application (ICCIA), pp. 374–377 (2010)

    Google Scholar 

  3. Elhossini, A., Areibi, S., Dony, R.: Strength Pareto particle swarm optimization and hybrid EA-PSO for multi-objective optimization. Evol. Comput. 18, 127–156 (2010)

    Article  Google Scholar 

  4. Tang, L., Wang, X.: A hybrid multiobjective evolutionary algorithm for multiobjective optimization problems. IEEE Trans. Evol. Comput. 17(1), 20–45 (2013)

    Article  Google Scholar 

  5. Wang, Y., Cai, Z., Zhou, Y., Fan, Z.: Constrained optimization based on hybrid evolutionary algorithm and adaptive constraint-handling technique. Struct. Multi. Design Optim. 37, 395–413 (2009)

    Article  Google Scholar 

  6. Zăvoianu, A.-C., Lughofer, E., Bramerdorfer, G., Amrhein, W., Klement, E.P.: DECMO2: a robust hybrid and adaptive multi-objective evolutionary algorithm. Soft. Comput. 19, 3551–3569 (2015)

    Article  Google Scholar 

  7. Zhao, S.-Z., Suganthan, P.N.: Multi-objective evolutionary algorithm with ensemble of external archives. Int. J. Innovative Comput. Inf. Control 6, 1713–1726 (2010)

    Google Scholar 

  8. Qu, B.Y., Suganthan, P.N.: Constrained multi-objective optimization algorithm with an ensemble of constraint handling methods. Eng. Optim. 43(4), 403–416 (2011)

    Article  MathSciNet  Google Scholar 

  9. Zhao, S.-Z., Suganthan, P.N., Zhang, Q.: Decomposition-based multiobjective evolutionary algorithm with an ensemble of neighborhood sizes. IEEE Trans. Evol. Comput. 16, 442–446 (2012)

    Article  Google Scholar 

  10. Tan, K.C., Chew, Y., Lee, L.H.: A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems. Eur. J. Oper. Res. 172, 855–885 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  11. Xia, W., Wu, Z.: An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Comput. Ind. Eng. 48(2), 409–425 (2005)

    Article  Google Scholar 

  12. Tavakkoli-Moghaddam, R., Rahimi-Vahed, A., Mirzaei, A.H.: A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness. Inf. Sci. 177, 5072–5090 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  13. Karthikeyan, S., Asokan, P., Nickolas, S., Page, T.: A hybrid discrete firefly algorithm for solving multi-objective flexible job shop scheduling problems. Int. J. Bio-Inspired Comput. 7, 386–401 (2015)

    Article  Google Scholar 

  14. Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE Trans. Evol. Comput. 18, 577–601 (2014)

    Article  Google Scholar 

  15. Das, I., Dennis, J.E.: Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM J. Optim. 8, 631–657 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kukkonen, S., Lampinen, J.: GDE3: the third evolution step of generalized differential evolution. In: The 2005 IEEE Congress on Evolutionary Computation, pp. 443–450 (2005)

    Google Scholar 

  17. Nebro, A.J., Durillo, J.J., Garcia-Nieto, J., Coello, C.C., Luna, F., Alba, E.: Smpso: a new pso-based metaheuristic for multi-objective optimization. In: 2009 IEEE Symposium on Computational Intelligence in Miulti-criteria Decision-Making, pp. 66–73 (2009)

    Google Scholar 

  18. Zitzler, E., Laumanns, M., Thiele, L., Zitzler, E., Zitzler, E., Thiele, L. et al.: SPEA2: improving the strength pareto evolutionary algorithm. Ed: Eidgenössische Technische Hochschule Zürich (ETH), Institut für Technische Informatik und Kommunikationsnetze (TIK) (2001)

    Google Scholar 

  19. Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable multi-objective optimization test problems. In: Proceedings of the Congress on Evolutionary Computation (CEC-2002), (Honolulu, USA), pp. 825–830 (2002)

    Google Scholar 

  20. Huband, S., Barone, L., While, L., Hingston, P.: A scalable multi-objective test problem toolkit. In: Evolutionary Multi-criterion Optimization, pp. 280–295 (2005)

    Google Scholar 

  21. Yang, S., Li, M., Liu, X., Zheng, J.: A grid-based evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 17, 721–736 (2013)

    Article  Google Scholar 

  22. Jain, H., Deb, K.: An evolutionary many-objective optimization algorithm using reference-point based nondominated sorting approach, part II: handling constraints and extending to an adaptive approach. IEEE Trans. Evol. Comput. 18, 602–622 (2014)

    Article  Google Scholar 

  23. Ibrahim, A., Rahnamayan, S., Vargas Martin, M., Deb, K.: 3D-RadVis: visualization of pareto front in many-objective optimization. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 736–745 (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Amin Ibrahim .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Ibrahim, A., Rahnamayan, S., Martin, M.V., Deb, K. (2017). Fusion of Many-Objective Non-dominated Solutions Using Reference Points. In: Trautmann, H., et al. Evolutionary Multi-Criterion Optimization. EMO 2017. Lecture Notes in Computer Science(), vol 10173. Springer, Cham. https://doi.org/10.1007/978-3-319-54157-0_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-54157-0_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-54156-3

  • Online ISBN: 978-3-319-54157-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics