Skip to main content

Advertisement

Springer Nature Link
Log in

An improved estimation of distribution algorithm for multi-objective optimization problems with mixed-variable

  • Review
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

Multi-objective evolutionary algorithms face many challenges in optimizing mixed-variable multi-objective problems, such as quantization error, low search efficiency of discontinuous discrete variables, and difficulty in coding non-integer discrete variables. To overcome these challenges, this paper proposes a mixed-variable multi-objective evolutionary algorithm based on estimation of distribution algorithm (MVMO-EDA). Compared with traditional multi-objective evolutionary algorithms, MVMO-EDA has the following improvements: (1) instead of crossover and mutation, statistics and sampling are used to generate offspring, which can avoid the quantization error caused by crossover and mutation operations; (2) using index coding for discrete variables to improve the search efficiency; and (3) a scalable histogram probability distribution model and two crowding distance-based diversity maintenance strategies are used to improve the global optimization ability. The performance of the proposed MVMO-EDA is evaluated on the modified ZDT and DTLZ benchmark sets with mixed-variable, and the results show that MVMO-EDA has a competitive performance both in convergence and diversity.

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

Access this article

Log in via an institution

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Feyzioglu A, Kar AK (2017) Axiomatic design approach for nonlinear multiple objective optimizaton problem and robustness in spring design. Cybern Inf Technol 17(1):63–71

    Google Scholar 

  2. Geoffrion AM (1968) Proper efficiency and the theory of vector maximization. J Math Anal Appl 22(3):618–630

    Article  MathSciNet  MATH  Google Scholar 

  3. Charnes A, Cooper WW (1957) Management models and industrial applications of linear programming. Manage Sci 4(3):274–275

    MathSciNet  MATH  Google Scholar 

  4. Haimes YY, Lasdon LS, Wismer DA (1971) On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Trans Syst Man Cybern 1(3):296–297

    MathSciNet  MATH  Google Scholar 

  5. Ben-Tal A (1980) Characterization of pareto and lexicographic optimal solutions. Springer 177:1–11

    MathSciNet  MATH  Google Scholar 

  6. Dantzig G, Fulkerson R, Johnson S (1954) Solution of a large-scale traveling salesman problem. Oper Res 2(4):393–410

    MathSciNet  MATH  Google Scholar 

  7. Gomory RE (1958) Outline of an algorithm for integer solutions to linear programs. Bull Am Math Soc 64(5):275–278

    Article  MathSciNet  MATH  Google Scholar 

  8. Land AH, Doig AG (1960) An automatic method for solving discrete programming problems. Springer 28(3):497–520

    MathSciNet  MATH  Google Scholar 

  9. Balas E (1979) Disjunctive Programming Annals of Discrete Mathematics 5(2): 3-51

  10. Schaffer JD (1985) Some experiments in machine learning using vector evaluated genetic algorithms. Electr Eng 3:31–37

    Google Scholar 

  11. Deb K, Agrawal S, Pratap A, Meyarivan T (2000) A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. Int Conf Parallel Problem Solv from Nat 1917:849–858

    Google Scholar 

  12. Zhang Q (2007) MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans on Evolutionary Comput 11(6):712–731

    Article  Google Scholar 

  13. Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans Evol Comput 3(4):257–271

    Article  Google Scholar 

  14. Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength pareto evolutionary algorithm. Tech Rep Gloriastrasse 5:1–21

    Google Scholar 

  15. Mz A, Lei WA, Wl B, Bo HA, Dl A, Qw A (2021) Many-objective evolutionary algorithm with adaptive reference vector. Inf Sci 563:70–90

    Article  MathSciNet  Google Scholar 

  16. Gu Q, Wang R, Xie H, Li X, Xiong N (2021) Modified non-dominated sorting genetic algorithm iii with fine final level selection. Appl Intell 51(5):1–34

    Google Scholar 

  17. Jiang S, Yang S (2017) Evolutionary dynamic multiobjective optimization: benchmarks and algorithm comparisons. IEEE Trans Cybern 47(1):198–211

    Article  Google Scholar 

  18. Tong W, Chowdhury S, Messac A (2016) A multi-objective mixed-discrete particle swarm optimization with multi-domain diversity preservation. Struct Multidiscip Optim 53(3):1–18

    Article  MathSciNet  Google Scholar 

  19. Shenlin Y, Wei L, Xiaochao Q et al (2019) Multi objective optimization of system effectiveness based on complex simulation. Control Dec 36(3):1–10

    Google Scholar 

  20. Larranga P, Lozano JA (2001) Estimation of distribution algorithms: a new tool for evolutionary computation. Kluwer Acad Publ 2:344–360

    Google Scholar 

  21. Xuejun Z, Deng P, Anling W et al (2000) Implementation of Pareto genetic algorithm for mixed variable multi-objective optimization design. J Shanghai Jiaotong Univ 34(3):411–414

    Google Scholar 

  22. Chuang-Xin G, Jia-Sheng H, Bin Y, Yi-Jia C (2004) Swarm intelligence for mixed-variable design optimization. Zhejiang Univ 5(7):851–860

    Article  Google Scholar 

  23. Zhou J, Dong SB, Tang DY (2018) Task scheduling algorithm in cloud computing based on invasive tumor growth optimization. Chin J Comput 41(6):1140–1155

    Google Scholar 

  24. Dhingra AK, Lee BH (2010) A genetic algorithm approach to single and multiobjective structural optimization with discrete–continuous variables International. J for Numerical Methods Eng 37(23):4059–4080

    Article  MATH  Google Scholar 

  25. Chen J, Chen G, Guo W (2009) A discrete PSO for multi-objective optimization in VLSI floorplanning. Adv Comput Intell 5821:400–410

    Google Scholar 

  26. Khokhar ZO, Vahabzadeh H, Ziai A, Wang G, Menon C (2010) On the performance of the pareto set pursuing (PSP) method for mixed-variable multi-objective design optimization. J Mech Des 132(7):1–11

    Article  Google Scholar 

  27. Chowdhury S, Jie Z, Messac A (2012) Avoiding Premature convergence in a mixed-discrete particle swarm optimization (MDPSO) algorithm. Struct Struct Dyn Mater Conf 1678:1–20

    Google Scholar 

  28. Mokarram V, Banan MR (2018) A new pso-based algorithm for multi-objective optimization with continuous and discrete design variables. Struct Multidipl Optim 57(2):509–533

    Article  MathSciNet  Google Scholar 

  29. Yang SL et al (2021) Multi-objective optimization of system effectiveness based on complex and expensive simulation. Control Dec 36(3):589–598

    Google Scholar 

  30. Wang F, Li Y, Zhou A, Tang K (2019) An estimation of distribution algorithm for mixed-variable newsvendor problems. IEEE Trans Evol Comput 99:1–15

    Google Scholar 

  31. Muhlenbein H, Paass G (1996) From recombination of genes to the estimation of distributions I binary parameters. Parallel Problem Solving From Nat -PPSN IV 1141(19):178–187

    Article  Google Scholar 

  32. Hauschild M, Pelikan M (2011) An introduction and survey of estimation of distribution algorithms. Swarm Evol Comput 1(3):111–128

    Article  Google Scholar 

  33. Baluja S, Caruana R (1995) Removing the genetics from the standard genetic algorithm. Machine Learning Proceedings 1995. Elsevier, pp 38–46. https://doi.org/10.1016/B978-1-55860-377-6.50014-1

    Chapter  Google Scholar 

  34. Muhlenbein H (1997) The equation for response to selection and its use for prediction. Evolut Comput 5(3):303–346

    Article  Google Scholar 

  35. Harik G (1998) The compact genetic algorithm. In: Proceedings of the IEEE Conference on Evolutionary Computation, 3(4): 287–297

  36. Harik GR, Lobo FG, Sastry K (2006) Linkage learning via probabilistic modeling in the extended compact genetic algorithm (ECGA). Scalable Optimiz via Prob Model 33:39–61

    Article  MATH  Google Scholar 

  37. Muhlenbein H, Mahnig T (1999) FDA–a scalable evolutionary algorithm for the optimization of additively decomposed functions. Evol Comput 7(4):353–376

    Article  Google Scholar 

  38. Pelikan M (1999) BOA: The Bayesian optimization algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp 525–532

  39. Bonet J, Jr C, Viola PA (1997) MIMIC: Finding Optima by Estimating Probability Densities. In: Advances in Neural Information Processing Systems, pp 424–430

  40. Baluja S, Davies S (1997) Using Optimal Dependency-Trees for Combinatorial Optimization: Learning the Structure of the Search Space. In: Proceedings of the 14th International Conference on Machine Learning, pp 30–38

  41. Pelikan M, Muehlenbein H, et al (1998) The bivariate marginal distribution algorithm. In: advances in soft computing - engineering design and manufacturing, pp 521–535

  42. Zhong J, Zhang J, Fan Z (2010) MP-EDA: a robust estimation of distribution algorithm with multiple probabilistic models for global continuous optimization. Adv Neural Inf Process Syst 6457:85–94

    Google Scholar 

  43. MiquélezBengoetxea TE, Larrañaga P (2004) Evolutionary computations based on bayesian classifiers. Int J Appl Math Comput 14:101–115

    MathSciNet  Google Scholar 

  44. Dong W, Chen T, Tino P et al (2013) Scaling up estimation of distribution algorithms for continuous optimization. IEEE Trans Evol Comput 17(6):797–822

    Article  Google Scholar 

  45. Sanyang ML, Kabán A (2019) Large-scale estimation of distribution algorithms with adaptive heavy tailed random projection ensembles. J Comput Sci Technol 34(6):1241–1257

    Article  Google Scholar 

  46. Zhang Q, Zhou A, Jin Y (2008) RM-MEDA: a regularity model-based multiobjective estimation of distribution algorithm. IEEE Trans Evol Comput 12(1):41–63

    Article  Google Scholar 

  47. Wang Y, Xiang J, Cai Z (2012) A regularity model-based multiobjective estimation of distribution algorithm with reducing redundant cluster operator. Appl Soft Comput 12(11):3526–3538

    Article  Google Scholar 

  48. Yin ZA, Ggw A, Kl B, Wcy C, Mj D, Jd A (2020) Enhancing moea/d with information feedback models for large-scale many-objective optimization. Inf Sci 522:1–16

    Article  MathSciNet  Google Scholar 

  49. Li QQ, Chu QX, Chang YL, Dong J (2019) Tri-objective compact log-periodic dipole array antenna design using MOEA/D-GPSO. IEEE Trans Antennas Propag 68(4):2714–2723

    Article  Google Scholar 

  50. Wang F, Liao F, Li Y, Wang H (2021) A new prediction strategy for dynamic multi-objective optimization using Gaussian mixture model. Inf Sci 580:331–351

    Article  MathSciNet  Google Scholar 

  51. Peng X, Gao X (2009) A hybrid multi-objective optimal approach to multiple ucavs coordinated planning. Int Conf Intell Human-Mach Syst Cybern 2:23–28

    Google Scholar 

  52. Adra FS, Fleming JP (2011) Diversity management in evolutionary many-objective optimization. IEEE Trans Evol Comput 15(2):183–195

    Article  Google Scholar 

  53. Czyzżak P, Adrezej J (1998) Pareto simulated annealing: a metaheuristic technique for multiple-objective combinatorial optimization. J Multi Criteria Dec Anal 7(1):34–47

    Article  Google Scholar 

Download references

Funding

This work was supported by the Key Field Special Project of Guangdong Provincial Department of Education with No.2021ZDZX1029. And it was also supported by Guangdong Basic and Applied Basic Research Foundation under No. Grant 2022A1515011447.

Author information

Authors and Affiliations

  1. College of Mathematics and Informatics, South China Agricultural University, Guangzhou, 51006, China

    Wenxiang Wang, Kangshun Li & Hassan Jalil

  2. School of Computer Science, Guangdong University of Science and Technology, Dongguan, 523000, China

    Kangshun Li

  3. School of Software Engineering, Shenzhen Institute of Information Technology, Shenzhen, 518172, China

    Hui Wang

Authors
  1. Wenxiang Wang
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Kangshun Li
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Hassan Jalil
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Hui Wang
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Kangshun Li.

Ethics declarations

Conflict of interest

We declare that we have no financial and personal relationships with other people or organizations that can inappropriately influence our work, there is no professional or other personal interest of any nature or kind in any product, service and/or company that could be construed as influencing the position presented in, or the review of, the manuscript entitled, “An Improved Estimation of Distribution Algorithm for Multi-objective Optimization Problems with Mixed-Variable.”

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, W., Li, K., Jalil, H. et al. An improved estimation of distribution algorithm for multi-objective optimization problems with mixed-variable. Neural Comput & Applic 34, 19703–19721 (2022). https://doi.org/10.1007/s00521-022-07695-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-022-07695-3

Keywords