Skip to main content
SpringerLink
Log in

A Preference-Based Indicator Selection Hyper-Heuristic for Optimization Problems

  • Conference paper
  • First Online:
Advanced Data Mining and Applications (ADMA 2023)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 14176))

Included in the following conference series:

  • 619 Accesses

Abstract

Heuristics have been effective in solving computationally difficult optimization issues, but because they are often created for certain problem domains, they perform poorly when the challenges are significantly altered. The currently available techniques are either designed to address single- or multi-objective optimization issues solely, or they perform poorly with the same parameters. The multi-domain approach known as hyper-heuristics (HHs) can be used to solve optimization issues with minor variations. Motivated by the notion of utilizing the benefits of low-level heuristics (LLHs) in order to obtain well-distributed and convergent optimum solutions along with taking into account the shortcomings of the work completed in many-objective HHs. For many-objective optimization problems, this paper develops a high-level selection approach that employs indicators by preference and offers a unique selection hyper-heuristic called Preference-based Indicator Selection Hyper-heuristic (PBI-HH). In order to establish fairness between exploration and exploitation, the method makes use of a randomization mechanism and a greedy strategy to address a significant problem faced by HHs. Three well-known many-objective evolutionary algorithms are combined in the unique technique that is being proposed. The efficacy of the proposed strategy is assessed by contrasting it with cutting-edge HHs. PBI-HH performs better or equal to the state-of-the-art HHs on 155 out of 160 cases employing the HV indicator and has the optimal \(\mu \) norm mean values across all datasets.

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

Access this chapter

Log in via an institution
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

References

  1. Adriaensen, S., Ochoa, G., Nowé, A.: A benchmark set extension and comparative study for the hyflex framework. In: 2015 IEEE Congress on Evolutionary Computation (CEC), pp. 784–791. IEEE (2015)

    Google Scholar 

  2. Anwar, A.A., Younas, I.: Optimization of many objective pickup and delivery problem with delay time of vehicle using memetic decomposition based evolutionary algorithm. Int. J. Artif. Intell. Tools 29(01), 2050003 (2020)

    Article  Google Scholar 

  3. Anwar, A.A., Younas, I., Liu, G., Beheshti, A., Zhang, X.: A cricket-based selection hyper-heuristic for many-objective optimization problems. In: Chen, W., Yao, L., Cai, T., Pan, S., Shen, T., Li, X. (eds.) Advanced Data Mining and Applications: 18th International Conference, ADMA 2022, Brisbane, QLD, Australia, November 28–30, 2022, Proceedings, Part II, pp. 310–324. Springer Nature Switzerland, Cham (2022). https://doi.org/10.1007/978-3-031-22137-8_23

    Chapter  Google Scholar 

  4. Asafuddoula, M., Ray, T., Sarker, R.: A decomposition-based evolutionary algorithm for many objective optimization. IEEE Trans. Evol. Comput. 19(3), 445–460 (2014)

    Article  MATH  Google Scholar 

  5. Auger, A., Bader, J., Brockhoff, D., Zitzler, E.: Theory of the hypervolume indicator: optimal \(\mu \)-distributions and the choice of the reference point. In: Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms, pp. 87–102 (2009)

    Google Scholar 

  6. Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., Woodward, J.R.: A classification of hyper-heuristic approaches. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, pp. 449–468. Springer US, Boston, MA (2010). https://doi.org/10.1007/978-1-4419-1665-5_15

    Chapter  Google Scholar 

  7. 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(4), 577–601 (2013)

    Article  Google Scholar 

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

    Article  Google Scholar 

  9. Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable test problems for evolutionary multiobjective optimization. In: Abraham, A., Jain, L., Goldberg, R. (eds.) Evolutionary Multiobjective Optimization, pp. 105–145. Springer-Verlag, London (2005). https://doi.org/10.1007/1-84628-137-7_6

    Chapter  MATH  Google Scholar 

  10. Derigs, U.: Optimization and operations research-Volume IV. EOLSS Publications (2009)

    Google Scholar 

  11. Drake, J.H., Kheiri, A., Özcan, E., Burke, E.K.: Recent advances in selection hyper-heuristics. Eur. J. Oper. Res. 285(2), 405–428 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  12. Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer Berlin Heidelberg, Berlin, Heidelberg (2003)

    Book  MATH  Google Scholar 

  13. Fatemi-Anaraki, S., Mokhtarzadeh, M., Rabbani, M., Abdolhamidi, D.: A hybrid of k-means and genetic algorithm to solve a bi-objective green delivery and pick-up problem. J. Ind. Prod. Eng. 39(2), 146–157 (2022)

    Google Scholar 

  14. Fritsche, G., Pozo, A.: Cooperative based hyper-heuristic for many-objective optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 550–558 (2019)

    Google Scholar 

  15. Fritsche, G., Pozo, A.: The analysis of a cooperative hyper-heuristic on a constrained real-world many-objective continuous problem. In: 2020 IEEE Congress on Evolutionary Computation (CEC), pp. 1–8. IEEE (2020)

    Google Scholar 

  16. Huband, S., Barone, L., While, L., Hingston, P.: A scalable multi-objective test problem toolkit. In: Coello Coello, C.A., Hernández Aguirre, A., Zitzler, E. (eds.) Evolutionary Multi-Criterion Optimization, pp. 280–295. Springer Berlin Heidelberg, Berlin, Heidelberg (2005). https://doi.org/10.1007/978-3-540-31880-4_20

    Chapter  MATH  Google Scholar 

  17. Li, W., Özcan, E., John, R.: A learning automata-based multiobjective hyper-heuristic. IEEE Trans. Evol. Comput. 23(1), 59–73 (2017)

    Article  Google Scholar 

  18. Liefooghe, A., Derbel, B.: A correlation analysis of set quality indicator values in multiobjective optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016, pp. 581–588 (2016)

    Google Scholar 

  19. Masood, A., Chen, G., Zhang, M.: Feature selection for evolving many-objective job shop scheduling dispatching rules with genetic programming. In: 2021 IEEE Congress on Evolutionary Computation (CEC), pp. 644–651. IEEE (2021)

    Google Scholar 

  20. Moea framework. http://moeaframework.org/. Accessed 25 Mar 2023

  21. Perwaiz, U., Younas, I., Anwar, A.A.: Many-objective bat algorithm. Plos one 15(6), e0234625 (2020)

    Google Scholar 

  22. Qin, W., Zhuang, Z., Huang, Z., Huang, H.: A novel reinforcement learning-based hyper-heuristic for heterogeneous vehicle routing problem. Comput. Indust. Eng. 156, 107252 (2021)

    Article  Google Scholar 

  23. Riquelme, N., Von Lücken, C., Baran, B.: Performance metrics in multi-objective optimization. In: 2015 Latin American Computing Conference (CLEI), pp. 1–11. IEEE (2015)

    Google Scholar 

  24. Ross, P.: Hyper-heuristics. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies, pp. 529–556. Springer US, Boston, MA (2005). https://doi.org/10.1007/0-387-28356-0_17

    Chapter  Google Scholar 

  25. Sánchez, M., Cruz-Duarte, J.M., carlos Ortíz-Bayliss, J., Ceballos, H., Terashima-Marin, H., Amaya, I.: A systematic review of hyper-heuristics on combinatorial optimization problems. IEEE Access 8, 128068–128095 (2020)

    Google Scholar 

  26. Senzaki, B.N.K., Venske, S.M., Almeida, C.P.: Hyper-heuristic based NSGA-III for the many-objective quadratic assignment problem. In: Britto, A., Valdivia Delgado, K. (eds.) Intelligent Systems: 10th Brazilian Conference, BRACIS 2021, Virtual Event, November 29 – December 3, 2021, Proceedings, Part I, pp. 170–185. Springer International Publishing, Cham (2021). https://doi.org/10.1007/978-3-030-91702-9_12

    Chapter  Google Scholar 

  27. S. S., V.C., H. S., A.: Nature inspired meta heuristic algorithms for optimization problems. Computing 104, 251–269 (2021). https://doi.org/10.1007/s00607-021-00955-5

  28. Venske, S.M., Almeida, C.P., Delgado, M.R.: Comparing selection hyper-heuristics for many-objective numerical optimization. In: 2021 IEEE Congress on Evolutionary Computation (CEC), pp. 1921–1928. IEEE (2021)

    Google Scholar 

  29. Wang, L., Ng, A.H.C., Deb, K. (eds.): Multi-objective Evolutionary Optimisation for Product Design and Manufacturing. Springer, London (2011). https://doi.org/10.1007/978-0-85729-652-8

    Book  Google Scholar 

  30. Yang, T., Zhang, S., Li, C.: A multi-objective hyper-heuristic algorithm based on adaptive epsilon-greedy selection. Complex Intell. Syst. 7(2), 765–780 (2021)

    Article  Google Scholar 

  31. Zhang, Q., Li, H.: MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712–731 (2007)

    Article  Google Scholar 

Download references

Acknowledgments

Adeem Ali Anwar is the recipient of an iMQRES funded by Macquarie University, NSW (allocation No. 20213183) and Dr. Xuyun Zhang is the recipient of an ARC DECRA (project No. DE210101458) funded by the Australian Government.

Author information

Authors and Affiliations

  1. School of Computing, Faculty of Science and Engineering, Macquarie University, Sydney, NSW, Australia

    Adeem Ali Anwar, Guanfeng Liu & Xuyun Zhang

  2. Odyssey Analytics, 5757 Woodway Drive, Houston, TX, 77057, USA

    Irfan Younas

Authors
  1. Adeem Ali Anwar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Irfan Younas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guanfeng Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xuyun Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Adeem Ali Anwar .

Editor information

Editors and Affiliations

  1. Northeastern University, Shenyang, China

    Xiaochun Yang

  2. The University of Indonesia, Depok, Indonesia

    Heru Suhartanto

  3. Beijing Institute of Technology, Beijing, China

    Guoren Wang

  4. Northeastern University, Shenyang, China

    Bin Wang

  5. University of Technology Sydney, Sydney, NSW, Australia

    Jing Jiang

  6. Agency for Science, Technology and Research (A*STAR), Singapore, Singapore

    Bing Li

  7. Sun Yat-sen University, Guangzhou, China

    Huaijie Zhu

  8. Anhui University, Hefei, China

    Ningning Cui

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Anwar, A.A., Younas, I., Liu, G., Zhang, X. (2023). A Preference-Based Indicator Selection Hyper-Heuristic for Optimization Problems. In: Yang, X., et al. Advanced Data Mining and Applications. ADMA 2023. Lecture Notes in Computer Science(), vol 14176. Springer, Cham. https://doi.org/10.1007/978-3-031-46661-8_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-46661-8_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-46660-1

  • Online ISBN: 978-3-031-46661-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation