{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:18:42Z","timestamp":1758845922966,"version":"3.44.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s40747-025-02091-5","type":"journal-article","created":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T08:18:45Z","timestamp":1757578725000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["HRL-MOEA: a hybrid reinforcement learning-enhanced multi-objective recommendation algorithm with dynamic policy orchestration"],"prefix":"10.1007","volume":"11","author":[{"given":"Liang","family":"Chu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3487-5126","authenticated-orcid":false,"given":"Ye","family":"Tian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"key":"2091_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.neucom.2021.11.041","volume":"474","author":"Y Zheng","year":"2022","unstructured":"Zheng Y, Wang DX (2022) A survey of recommender systems with multi-objective optimization. Neurocomputing 474:141\u2013153","journal-title":"Neurocomputing"},{"issue":"2","key":"2091_CR2","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/MCI.2024.3363984","volume":"19","author":"Y Li","year":"2024","unstructured":"Li Y, Liu K, Satapathy R, Wang S, Cambria E (2024) Recent developments in recommender systems: a survey. IEEE Comput Intell Mag 19(2):78\u201395","journal-title":"IEEE Comput Intell Mag"},{"issue":"3","key":"2091_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3547333","volume":"41","author":"Y Wang","year":"2023","unstructured":"Wang Y, Ma W, Zhang M, Liu Y, Ma S (2023) A survey on the fairness of recommender systems. ACM Trans Inf Syst 41(3):1\u201343","journal-title":"ACM Trans Inf Syst"},{"key":"2091_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2023.102233","volume":"117","author":"FE Zaizi","year":"2023","unstructured":"Zaizi FE, Qassimi S, Rakrak S (2023) Multi-objective optimization with recommender systems: a systematic review. Inf Syst 117:102233","journal-title":"Inf Syst"},{"issue":"7","key":"2091_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3543846","volume":"55","author":"M Mehdi Afsar","year":"2022","unstructured":"Mehdi Afsar M, Crump T, Far B (2022) Reinforcement learning based recommender systems: a survey. ACM Comput Surv 55(7):1\u201338","journal-title":"ACM Comput Surv"},{"key":"2091_CR6","doi-asserted-by":"publisher","first-page":"130389","DOI":"10.1109\/ACCESS.2021.3113975","volume":"9","author":"Q Dong","year":"2021","unstructured":"Dong Q, Xie SS, Li WJ (2021) User-item matching for recommendation fairness. IEEE Access 9:130389\u2013130398","journal-title":"IEEE Access"},{"issue":"2","key":"2091_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3631943","volume":"3","author":"TV Rampisela","year":"2024","unstructured":"Rampisela TV, Maistro M, Ruotsalo T, Lioma C (2024) Evaluation measures of individual item fairness for recommender systems: a critical study. ACM Trans Recomm Syst 3(2):1\u201352","journal-title":"ACM Trans Recomm Syst"},{"key":"2091_CR8","doi-asserted-by":"crossref","unstructured":"Wang J, Ma W, Li J, Lu H, Zhang M, Li B, Liu Y, Jiang P, Ma S (2022) Make fairness more fair: Fair item utility estimation and exposure re-distribution. In: Proceedings of the 28th ACM SIGKDD conference on knowledge discovery and data mining, Association for Computing Machinery, Washington DC USA, pp1868\u20131877","DOI":"10.1145\/3534678.3539354"},{"key":"2091_CR9","doi-asserted-by":"publisher","first-page":"2391","DOI":"10.1109\/TKDE.2025.3543285","volume":"37","author":"Y Liu","year":"2025","unstructured":"Liu Y, Zhang Y (2025) Diversity-promoting recommendation with dual-objective optimization and dual consideration. IEEE Trans Knowl Data Eng 37:2391\u20132404","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"8","key":"2091_CR10","doi-asserted-by":"publisher","first-page":"8326","DOI":"10.1109\/TCYB.2021.3049712","volume":"52","author":"Z Wang","year":"2021","unstructured":"Wang Z, Zhen H-L, Deng J, Zhang Q, Li X, Yuan M, Zeng J (2021) Multiobjective optimization-aided decision-making system for large-scale manufacturing planning. IEEE Trans Cybern 52(8):8326\u20138339","journal-title":"IEEE Trans Cybern"},{"issue":"1","key":"2091_CR11","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1109\/TCYB.2021.3126341","volume":"53","author":"Z Wang","year":"2021","unstructured":"Wang Z, Zhang Q, Ong Y-S, Yao S, Liu H, Luo J (2021) Choose appropriate subproblems for collaborative modeling in expensive multiobjective optimization. IEEE Trans Cybern 53(1):483\u2013496","journal-title":"IEEE Trans Cybern"},{"issue":"3","key":"2091_CR12","doi-asserted-by":"publisher","first-page":"1984","DOI":"10.1109\/TCYB.2023.3312476","volume":"54","author":"Z Wang","year":"2023","unstructured":"Wang Z, Yao S, Li G, Zhang Q (2023) Multiobjective combinatorial optimization using a single deep reinforcement learning model. IEEE Trans Cybern 54(3):1984\u20131996","journal-title":"IEEE Trans Cybern"},{"issue":"1","key":"2091_CR13","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/MCI.2014.2369894","volume":"10","author":"Y Zuo","year":"2015","unstructured":"Zuo Y, Gong M, Zeng J, Ma L, Jiao L (2015) Personalized recommendation based on evolutionary multi-objective optimization [research frontier]. IEEE Comput Intell Mag 10(1):52\u201362","journal-title":"IEEE Comput Intell Mag"},{"key":"2091_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.knosys.2016.04.018","volume":"104","author":"S Wang","year":"2016","unstructured":"Wang S, Gong M, Li H, Yang J (2016) Multi-objective optimization for long tail recommendation. Knowl Based Syst 104:145\u2013155","journal-title":"Knowl Based Syst"},{"key":"2091_CR15","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.jpdc.2016.10.014","volume":"103","author":"L Cui","year":"2017","unstructured":"Cui L, Ou P, Fu X, Wen Z, Lu N (2017) A novel multi-objective evolutionary algorithm for recommendation systems. J Parallel Distrib Comput 103:53\u201363","journal-title":"J Parallel Distrib Comput"},{"key":"2091_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112857","volume":"139","author":"A Jain","year":"2020","unstructured":"Jain A, Singh PK, Dhar J (2020) Multi-objective item evaluation for diverse as well as novel item recommendations. Expert Syst Appl 139:112857","journal-title":"Expert Syst Appl"},{"key":"2091_CR17","doi-asserted-by":"crossref","unstructured":"Wang S, Zhou Y, Fan X, Li J, Lei Z, Gong M (2025) Personalized federated contrastive learning for recommendation. IEEE Trans Comput Soc Syst(Early Access):1-13","DOI":"10.1109\/TCSS.2024.3524587"},{"key":"2091_CR18","doi-asserted-by":"crossref","unstructured":"Zhang J-C, Zain AM, Zhou K-Q, Chen X, Zhang R-M (2024) A review of recommender systems based on knowledge graph embedding. Expert Syst Appl 250:123876","DOI":"10.1016\/j.eswa.2024.123876"},{"key":"2091_CR19","doi-asserted-by":"crossref","unstructured":"Herlocker JL, Konstan JA, Borchers A, Riedl J (1999) An algorithmic framework for performing collaborative filtering. In: Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval, Association for Computing Machinery, Berkeley California USA, pp 230\u2013237","DOI":"10.1145\/312624.312682"},{"issue":"3","key":"2091_CR20","doi-asserted-by":"publisher","first-page":"274","DOI":"10.3991\/ijet.v16i03.18851","volume":"16","author":"U Javed","year":"2021","unstructured":"Javed U, Shaukat K, Hameed IA, Iqbal F, Alam TM, Luo S (2021) A review of content-based and context-based recommendation systems. Int J Emerg Technol Learn (iJET) 16(3):274\u2013306","journal-title":"Int J Emerg Technol Learn (iJET)"},{"key":"2091_CR21","doi-asserted-by":"crossref","unstructured":"Sedhain S, Sanner S, Braziunas D, Xie L, Christensen J (2014) Social collaborative filtering for cold-start recommendations. In: Proceedings of the 8th ACM conference on recommender systems, Association for Computing Machinery,Foster City, Silicon Valley California USA, pp 345\u2013348","DOI":"10.1145\/2645710.2645772"},{"issue":"11","key":"2091_CR22","doi-asserted-by":"publisher","first-page":"992","DOI":"10.14778\/3402707.3402736","volume":"4","author":"Y Sun","year":"2011","unstructured":"Sun Y, Han J, Yan X, Yu PS, Wu T (2011) Pathsim: meta path-based top-k similarity search in heterogeneous information networks. Proc VLDB Endow 4(11):992\u20131003","journal-title":"Proc VLDB Endow"},{"issue":"22","key":"2091_CR23","doi-asserted-by":"publisher","first-page":"7004","DOI":"10.3923\/itj.2013.7004.7008","volume":"12","author":"Z Li","year":"2013","unstructured":"Li Z, Tao Q, Piqiang T (2013) Using key users of social networks to solve cold start problem in collaborative recommendation systems. Inf Technol J 12(22):7004","journal-title":"Inf Technol J"},{"issue":"9","key":"2091_CR24","doi-asserted-by":"publisher","first-page":"3753","DOI":"10.1007\/s10115-023-01897-4","volume":"65","author":"SH Oskouei","year":"2023","unstructured":"Oskouei SH, Hashemzadeh M (2023) Foodrecnet: a comprehensively personalized food recommender system using deep neural networks. Knowl Inf Syst 65(9):3753\u20133775","journal-title":"Knowl Inf Syst"},{"issue":"5","key":"2091_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3535101","volume":"55","author":"S Wu","year":"2022","unstructured":"Wu S, Sun F, Zhang W, Xie X, Cui B (2022) Graph neural networks in recommender systems: a survey. ACM Comput Surv 55(5):1\u201337","journal-title":"ACM Comput Surv"},{"issue":"8","key":"2091_CR26","doi-asserted-by":"publisher","first-page":"4463","DOI":"10.1007\/s10115-024-02094-7","volume":"66","author":"V Stergiopoulos","year":"2024","unstructured":"Stergiopoulos V, Vassilakopoulos M, Tousidou E, Corral A (2024) An academic recommender system on large citation data based on clustering, graph modeling and deep learning. Knowl Inf Syst 66(8):4463\u20134496","journal-title":"Knowl Inf Syst"},{"key":"2091_CR27","doi-asserted-by":"crossref","unstructured":"Wang X, He X, Wang M, Feng F, Chua T-S (2019) Neural graph collaborative filtering. In: Proceedings of the 42nd international ACM SIGIR conference on Research and development in Information Retrieval, Association for Computing Machinery, Paris France, pp 165\u2013174","DOI":"10.1145\/3331184.3331267"},{"key":"2091_CR28","doi-asserted-by":"crossref","unstructured":"He X, Deng K, Wang X, Li Y, Zhang Y, Wang M (2020) LightGCN:simplifying and powering graph convolution network for recommendation. In: Proceedings of the 43rd international ACM SIGIR conference on research and development in Information Retrieval, Association for Computing Machinery, Virtual Event China, pp 639\u2013648","DOI":"10.1145\/3397271.3401063"},{"issue":"1","key":"2091_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3586993","volume":"42","author":"Y Wu","year":"2023","unstructured":"Wu Y, Cao J, Xu G (2023) Faster: a dynamic fairness-assurance strategy for session-based recommender systems. ACM Trans Inf Syst 42(1):1\u201326","journal-title":"ACM Trans Inf Syst"},{"key":"2091_CR30","doi-asserted-by":"crossref","unstructured":"Shi Z, Gong D, Yao X, Yang M (2020) New task oriented recommendation method based on Hungarian algorithm in crowdsourcing platform. In: 2020 IEEE World Congress on Services (SERVICES). IEEE, Beijing, China, pp 134\u2013144","DOI":"10.1109\/SERVICES48979.2020.00040"},{"key":"2091_CR31","doi-asserted-by":"crossref","unstructured":"Chen X, Du Y, Xia L, Wang J (2021) Reinforcement recommendation with user multi-aspect preference. In: Proceedings of the web conference 2021, Association for Computing Machinery, Ljubljana Slovenia, pp 425\u2013435","DOI":"10.1145\/3442381.3449846"},{"issue":"6","key":"2091_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2021.102691","volume":"58","author":"X Yu","year":"2021","unstructured":"Yu X, Peng Q, Xu L, Jiang F, Du J, Gong D (2021) A selective ensemble learning based two-sided cross-domain collaborative filtering algorithm. Inf Proc Manag 58(6):102691","journal-title":"Inf Proc Manag"},{"issue":"22","key":"2091_CR33","doi-asserted-by":"publisher","first-page":"25274","DOI":"10.1109\/JSEN.2021.3072429","volume":"21","author":"H Li","year":"2021","unstructured":"Li H, Zhong Z, Shi J, Li H, Zhang Y (2021) Multi-objective optimization-based recommendation for massive online learning resources. IEEE Sens J 21(22):25274\u201325281","journal-title":"IEEE Sens J"},{"key":"2091_CR34","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.tourman.2018.12.013","volume":"72","author":"W Zheng","year":"2019","unstructured":"Zheng W, Liao Z (2019) Using a heuristic approach to design personalized tour routes for heterogeneous tourist groups. Tour Manag 72:313\u2013325","journal-title":"Tour Manag"},{"key":"2091_CR35","doi-asserted-by":"publisher","first-page":"3657","DOI":"10.1109\/ACCESS.2017.2678200","volume":"5","author":"MB Bashir","year":"2017","unstructured":"Bashir MB, Nadeem A (2017) Improved genetic algorithm to reduce mutation testing cost. IEEE Access 5:3657\u20133674","journal-title":"IEEE Access"},{"issue":"4","key":"2091_CR36","doi-asserted-by":"publisher","first-page":"5064","DOI":"10.1109\/TNNLS.2022.3207346","volume":"35","author":"X Wang","year":"2022","unstructured":"Wang X, Wang S, Liang X, Zhao D, Huang J, Xu X, Dai B, Miao Q (2022) Deep reinforcement learning: a survey. IEEE Trans Neural Netw Learn Syst 35(4):5064\u20135078","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"2091_CR37","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/j.future.2024.04.014","volume":"157","author":"Y Gar\u00ed","year":"2024","unstructured":"Gar\u00ed Y, Pacini E, Robino L, Mateos C, Monge DA (2024) Online rl-based cloud autoscaling for scientific workflows. evaluation of q-learning and sarsa. Future Gener Comput Syst 157:573\u2013586","journal-title":"Future Gener Comput Syst"},{"key":"2091_CR38","doi-asserted-by":"crossref","unstructured":"Tian Y, Ji L, Hu Y, Ma H, Wu L, Zhang X (2024) An evolutionary multitasking algorithm for efficient multiobjective recommendations. IEEE Trans Artif Intell 6(3):518\u2013532","DOI":"10.1109\/TAI.2024.3414289"},{"key":"2091_CR39","doi-asserted-by":"crossref","unstructured":"Ge Y, Zhao X, Yu L, Paul S, Hu D, Hsieh C-C, Zhang Y (2022)Toward pareto efficient fairness-utility trade-off in recommendation through reinforcement learning. In: Proceedings of the fifteenth ACM international conference on web search and data mining, Association for Computing Machinery,Virtual Event AZ USA, pp 316\u2013324","DOI":"10.1145\/3488560.3498487"},{"issue":"4","key":"2091_CR40","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"2002","unstructured":"Zitzler E, Thiele L (2002) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans Evol Comput 3(4):257-271","journal-title":"IEEE Trans Evol Comput"},{"key":"2091_CR41","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s00500-008-0394-9","volume":"14","author":"Y-N Wang","year":"2010","unstructured":"Wang Y-N, Wu L-H, Yuan X-F (2010) Multi-objective self-adaptive differential evolution with elitist archive and crowding entropy-based diversity measure. Soft Comput 14:193\u2013209","journal-title":"Soft Comput"}],"container-title":["Complex & Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-02091-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-025-02091-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-02091-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T13:35:01Z","timestamp":1758807301000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-025-02091-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"references-count":41,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["2091"],"URL":"https:\/\/doi.org\/10.1007\/s40747-025-02091-5","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"type":"print","value":"2199-4536"},{"type":"electronic","value":"2198-6053"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"23 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"452"}}