Skip to main content

Multi-objective Evolutionary Algorithms for Solving the Optimization Problem of the Surface Mounting

  • Conference paper
  • First Online:
Advanced Mechanical Science and Technology for the Industrial Revolution 4.0 (FZU 2016)

Abstract

The multi-objective particle swarm optimization (MOPSO) is tested by the four ZDT problems. According to the simulation, the MOPSO can locate the global Pareto front (PF) on any instance. Moreover, a three-objective mathematical model is established to verify the ability of MOPSO when solving the practical engineering problems. The simulations show that, compared with the NSGA-II, the MOPSO is able to obtain better optimization results in a short period.

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

Access this chapter

Institutional subscriptions

References

  1. O. Schütze, V.A.S. Hernández, H. Trautmann, et al., The hypervolume based directed search method for multi-objective optimization problems. J. Heuristics 1–28 (2016)

    Google Scholar 

  2. J.D. Schaffer, Multiple Objective Optimization with Vector Evaluated Genetic Algorithms. International Conference on Genetic Algorithms. (Pittsburgh, Pa, USA, July. 1985), 93–100

    Google Scholar 

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

    Article  Google Scholar 

  4. E. Zitzler, M. Laumanns, L. Thiele, SPEA2: Improving the strength Pareto evolutionary algorithm. Europe. 3242(103), 95–100 (2001)

    Google Scholar 

  5. M. Raghuwanshi, O. Kakde, Survey on multiobjective evolutionary and real coded genetic algorithms, in The Asia Pacific Symposium on Intelligent and Evolutionary Systems, (2004), 151–163

    Google Scholar 

  6. C.M. Fonseca, P.J. Fleming, Genetic algorithms for multiobjective optimization: formulation discussion and generalization, in International Conference on Genetic Algorithms. (Morgan Kaufmann Publishers Inc. 1999), 416–423

    Google Scholar 

  7. N. Srinivas, K. Deb, Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evol. Comput. 2(3), 221–248 (1993)

    Article  Google Scholar 

  8. K. Deb, A. Pratap, S. Agarwal et al., A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)

    Article  Google Scholar 

  9. M. Gong, L. Jiao, H. Du et al., Multiobjective immune algorithm with nondominated neighbor-based selection. Evol. Comput. 16(2), 225–255 (2008)

    Article  Google Scholar 

  10. Y.M. Chen, C.T. Lin, A particle swarm optimization approach to optimize component placement in printed circuit board assembly. Int. J. Adv. Manuf. Technol. 35(5–6), 610–620 (2007)

    Article  Google Scholar 

  11. E. Zitzler, K. Deb, L. Thiele, Comparison of multiobjective evolutionary algorithms: empirical results. Evol. Comput. 8(2), 173–195 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Guangyu Zhu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ju, X., Zhu, G., Chen, S. (2018). Multi-objective Evolutionary Algorithms for Solving the Optimization Problem of the Surface Mounting. In: Yao, L., Zhong, S., Kikuta, H., Juang, JG., Anpo, M. (eds) Advanced Mechanical Science and Technology for the Industrial Revolution 4.0. FZU 2016. Springer, Singapore. https://doi.org/10.1007/978-981-10-4109-9_30

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-4109-9_30

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-4108-2

  • Online ISBN: 978-981-10-4109-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics