A New Multi-swarm Particle Swarm Optimization for Robust Optimization Over Time

  • Danial Yazdani
  • Trung Thanh Nguyen
  • Juergen Branke
  • Jin Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10200)

Abstract

Dynamic optimization problems (DOPs) are optimization problems that change over time, and most investigations in this area focus on tracking the moving optimum efficiently. However, continuously tracking a moving optimum is not practical in many real-world problems because changing solutions frequently is not possible or very costly. Recently, another practical way to tackle DOPs has been suggested: robust optimization over time (ROOT). In ROOT, the main goal is to find solutions that can remain acceptable over an extended period of time. In this paper, a new multi-swarm PSO algorithm is proposed in which different swarms track peaks and gather information about their behavior. This information is then used to make decisions about the next robust solution. The main goal of the proposed algorithm is to maximize the average number of environments during which the selected solutions’ quality remains acceptable. The experimental results show that our proposed algorithm can perform significantly better than existing work in this aspect.

Keywords

Robust optimization over time Robust optimization Dynamic optimization Benchmark problems Tracking moving optima Particle swarm optimization Multi-swarm algorithm 

Notes

Acknowledgements

This work is supported by a Dean Scholarship by the Faculty of Engineering and Technology, Liverpool John Moores University, and is partially supported by a T-TRIG project by the UK Department for Transport, a Newton Institutional Links project by the UK BEIS via the British Council, a Newton Research Collaboration Programme (3) by the UK BEIS via the Royal Academy of Engineering, and a Seed-corn project funded by the Chartered Institute of Logistics and Transport.

References

  1. 1.
    Nguyen, T.T., Yang, S., Branke, J.: Evolutionary dynamic optimization: a survey of the state of the art. Swarm Evol. Comput. 6, 1–24 (2012)CrossRefGoogle Scholar
  2. 2.
    Yu, X., Jin, Y., Tang, K., Yao, X.: Robust optimization over time – a new perspective on dynamic. In: IEEE Congress on Evolutionary Computation, pp. 1–6 (2010)Google Scholar
  3. 3.
    Fu, H., Sendhoff, B., Tang, K., Yao, X.: Characterizing environmental changes in robust optimization over time. In: IEEE Congress on Evolutionary Computation, pp. 1–8 (2012)Google Scholar
  4. 4.
    Jin, Y., Tang, K., Yu, X., Sendhoff, B., Yao, X.: A framework for finding robust optimal solutions over time. Memetic Comput. 5(1), 3–18 (2013)CrossRefGoogle Scholar
  5. 5.
    Fu, H., Sendhoff, B., Tang, K., Yao, X.: Finding robust solutions to dynamic optimization problems. In: Esparcia-Alcázar, A.I. (ed.) EvoApplications 2013. LNCS, vol. 7835, pp. 616–625. Springer, Heidelberg (2013). doi: 10.1007/978-3-642-37192-9_62CrossRefGoogle Scholar
  6. 6.
    Fu, H., Sendhoff, B., Tang, K., Yao, X.: Robust optimization over time: problem difficulties and benchmark problems. IEEE Trans. Evol. Comput. 19(5), 731–745 (2015)CrossRefGoogle Scholar
  7. 7.
    Blackwell, T., Branke, J.: Multiswarms, exclusion, and anti-convergence in dynamic environments. IEEE Trans. Evol. Comput. 10(4), 459–472 (2006)CrossRefGoogle Scholar
  8. 8.
    Yazdani, D., Nasiri, B., Sepas-Moghaddam, A., Meybodi, M.R.: A novel multi-swarm algorithm for optimization in dynamic environments based on particle swarm optimization. Appl. Soft Comput. 13(4), 2144–2158 (2013)CrossRefGoogle Scholar
  9. 9.
    Branke, J.: Memory enhanced evolutionary algorithms for changing optimization problems. In: IEEE Congress on Evolutionary Computation, pp. 1875–1882 (1999)Google Scholar
  10. 10.
    Eberhart, R.C., Shi, Y.: Comparing inertia weights and constriction factors in particle swarm optimization. IEEE Congress Evolut. Comput. 1, 84–88 (2001)Google Scholar
  11. 11.
    Yang, S., Li, C.: A clustering particle swarm optimizer for locating and tracking multiple optima in dynamic environments. IEEE Trans. Evol. Comput. 14(6), 959–974 (2010)CrossRefGoogle Scholar
  12. 12.
    Guo, Y., Chen, M., Fu, H., Liu, Y.: Find robust solutions over time by two-layer multi-objective optimization method. IEEE Congress on Evolutionary Computation, pp. 1528–1535 (2014)Google Scholar
  13. 13.
    Kennedy, J., Eberhart, R.: Particle swarm optimization. IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948 (1995)Google Scholar
  14. 14.
    Nguyen, T.T., Yao, X.: Dynamic time-linkage problems revisited. In: Giacobini, M., Brabazon, A., Cagnoni, S., Caro, Gianni, A., Ekárt, A., Esparcia-Alcázar, A.I., Farooq, M., Fink, A., Machado, P. (eds.) EvoWorkshops 2009. LNCS, vol. 5484, pp. 735–744. Springer, Heidelberg (2009). doi: 10.1007/978-3-642-01129-0_83CrossRefGoogle Scholar
  15. 15.
    Nguyen, T.T.: Continuous dynamic optimisation using evolutionary algorithms. Ph.D. thesis, University of Birmingham (2011)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Danial Yazdani
    • 1
  • Trung Thanh Nguyen
    • 1
  • Juergen Branke
    • 2
  • Jin Wang
    • 1
  1. 1.School of Engineering, Technology and Maritime Operations, Liverpool Logistics, Offshore and Marine Research InstituteLiverpool John Moores UniversityLiverpoolUK
  2. 2.Warwich Business SchoolUniversity of WarwickCoventryUK

Personalised recommendations