Nothing Special   »   [go: up one dir, main page]

Skip to main content

Multivariant Optimization Algorithm with Bimodal-Gauss

  • Conference paper
  • First Online:
Simulated Evolution and Learning (SEAL 2017)

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

Included in the following conference series:

Abstract

In multimodal problems, there is a trade-off between exploration and exploitation. Exploration contributes to move quickly toward the area where better solutions existed but is not beneficial for improving the quality of intermediate solution. Exploitation do well in refine the intermediate solution but increase the risk of being trapped into local optimum. Considering the trade-off and advantage of exploration and exploitation, a local search strategy based on bimodal-gauss was embedded into multivariant optimization algorithm by increasing the probability of locating global optima in solving multimodal optimization problems. The performances of the proposed method were compared with that of other multimodal optimization algorithms based on benchmark functions and the experimental results show the superiority of the proposed method. Convergence process of each subgroup was analyzed based on convergence curve.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Similar content being viewed by others

References

  1. Li, X., Epitropakis, M., Deb, K., Engelbrecht, A.: Seeking multiple solutions: an updated survey on niching methods and their applications. IEEE Trans. Evol. Comput. 1–21 (2016)

    Google Scholar 

  2. Liang, J.J., Qin, A.K., Suganthan, P.N., Baskar, S.: Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans. Evol. Comput. 10, 281–295 (2006)

    Article  Google Scholar 

  3. Peng, F., Tang, K., Chen, G., Yao, X.: Population-based algorithm portfolios for numerical optimization. IEEE Trans. Evol. Comput. 14, 782–800 (2010)

    Article  Google Scholar 

  4. Tang, K., Peng, F., Chen, G., Yao, X.: Population-based algorithm portfolios with automated constituent algorithms selection. Inf. Sci. 279, 94–104 (2014)

    Article  Google Scholar 

  5. Yang, Q., Chen, W.N., Li, Y., Chen, C.L.P.: Multimodal estimation of distribution algorithms. IEEE Trans. Cybern. 47, 636–650 (2016)

    Article  Google Scholar 

  6. Fang, W., Zhou, J.H.: A random drift particle swarm optimization with frequent coverage strategy. Control Decis. (2017). doi:10.13195/j.kzyjc.2016.0000

  7. Tang, K., Yang, P., Yao, X.: Negatively correlated search. IEEE J. Sel. Areas Commun. 34, 542–550 (2016)

    Article  Google Scholar 

  8. Li, L., Tang, K.: History-based topological speciation for multimodal optimization. IEEE Trans. Evol. Comput. 19, 136–150 (2015)

    Article  Google Scholar 

  9. Li, J., Zheng, S., Tan, Y.: The effect of information utilization: introducing a novel guiding spark in the fireworks algorithm. IEEE Trans. Evol. Comput. 21, 153–166 (2017)

    Article  Google Scholar 

  10. Yang, P., Tang, K., Lu, X.: Improving estimation of distribution algorithm on multimodal problems by detecting promising areas. IEEE Trans. Cybern. 45, 1438 (2015)

    Article  Google Scholar 

  11. Yang, Q., Chen, W.N., Yu, Z., Gu, T., Li, Y., Zhang, H., et al.: Adaptive multimodal continuous ant colony optimization. IEEE Trans. Evol. Comput. 21, 191–205 (2017)

    Article  Google Scholar 

  12. Zhang, Y., Gong, Y.J., Zhang, H., Gu, T.L., Zhang, J.: Towards fast niching evolutionary algorithms: a locality sensitive hashing-based approach. IEEE Trans. Evol. Comput. 13, 1–15 (2016)

    Google Scholar 

  13. Fieldsend, J.E.: Running up those hills: multi-modal search with the niching migratory multi-swarm optimiser. In: IEEE Congress on Evolutionary Computation-CEC 2014, pp. 2593–2600. IEEE (2014)

    Google Scholar 

  14. Li, B.L., Chen, J.H., Shi, X.L., et al.: On the convergence of multivariant optimization algorithm. Appl. Soft Comput. 48, 230–239 (2016)

    Article  Google Scholar 

  15. Liang, J.J., Suganthan, P.N., Deb, K.: Novel composition test functions for numerical global optimization. In: IEEE Congress on Swarm Intelligence Symposium-SIS2005, pp. 68–75. IEEE (2005)

    Google Scholar 

  16. Qu, B.Y., Suganthan, P.N.: Novel multimodal problems and differential evolution with ensemble of restricted tournament selection. In: IEEE Congress on Evolutionary Computation-CEC 2010, pp. 1–7. IEEE (2010)

    Google Scholar 

Download references

Acknowledgement

This work was supported by the National Natural Science Foundation of China (Nos. 61473266, 61305080), the key scientific and technological project of Henan province (No. 172102310334), the Science and Technology Foundation of Henan Educational Committee of China (No. 16A413012), the Special Project of Nanyang Normal University (No. ZX2016010).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jing Liang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Li, B., Liang, J., Yue, C., Qu, B. (2017). Multivariant Optimization Algorithm with Bimodal-Gauss. In: Shi, Y., et al. Simulated Evolution and Learning. SEAL 2017. Lecture Notes in Computer Science(), vol 10593. Springer, Cham. https://doi.org/10.1007/978-3-319-68759-9_75

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-68759-9_75

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-68758-2

  • Online ISBN: 978-3-319-68759-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics