{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T19:40:12Z","timestamp":1743622812237,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":15,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819642069","type":"print"},{"value":"9789819642076","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-4207-6_29","type":"book-chapter","created":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T19:00:16Z","timestamp":1743620416000},"page":"313-326","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Q-Learning Driven Artificial Bee Colony Algorithm for\u00a0Multi-objective Multiplex Industrial Chain Networks Design with\u00a0Multiple Supply Cycles"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-9262-4306","authenticated-orcid":false,"given":"Zhenyu","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-3253-4733","authenticated-orcid":false,"given":"Xianzhou","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-1536-9774","authenticated-orcid":false,"given":"Zhengyi","family":"An","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7349-5249","authenticated-orcid":false,"given":"Yichuan","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7929-0682","authenticated-orcid":false,"given":"Kai","family":"Di","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7137-2416","authenticated-orcid":false,"given":"Xianghui","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,1]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","unstructured":"Di, K., Chen, F., Jiang, Y., Li, P., Liu, T., Jiang, Y.: Adaptive task migration in multiplex networked industrial chains. IEEE Trans. Emerg. Top. Comput. 1\u201315 (2024). https:\/\/doi.org\/10.1109\/TETC.2024.3364703.","DOI":"10.1109\/TETC.2024.3364703."},{"issue":"5","key":"29_CR2","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1109\/TMC.2020.2971599","volume":"20","author":"D Yu","year":"2021","unstructured":"Yu, D., et al.: Implementing the abstract MAC layer in dynamic networks. IEEE Trans. Mob. Comput. 20(5), 1832\u20131845 (2021). https:\/\/doi.org\/10.1109\/TMC.2020.2971599","journal-title":"IEEE Trans. Mob. Comput."},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.ins.2018.07.064","volume":"466","author":"Z Zhongying","year":"2018","unstructured":"Zhongying, Z., Wenqiang, L., Yuhua, Q., et al.: Identifying advisor-advisee relationships from co-author networks via a novel deep model. Inf. Sci. 466, 258\u2013269 (2018). https:\/\/doi.org\/10.1016\/j.ins.2018.07.064","journal-title":"Inf. Sci."},{"issue":"1","key":"29_CR4","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.ejor.2017.04.009","volume":"263","author":"K Govindan","year":"2017","unstructured":"Govindan, K., Fattahi, M., Keyvanshokooh, E.: Supply chain network design under uncertainty: a comprehensive review and future research directions. Eur. J. Oper. Res. 263(1), 108\u2013141 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2017.04.009","journal-title":"Eur. J. Oper. Res."},{"key":"29_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2020.125457","volume":"286","author":"AM Walker","year":"2021","unstructured":"Walker, A.M., Vermeulen, W.J.V., Simboli, A., Raggi, A.: Sustainability assessment in circular inter-firm networks: an integrated framework of industrial ecology and circular supply chain management approaches. J. Clean. Prod. 286, 125457 (2021). https:\/\/doi.org\/10.1016\/j.jclepro.2020.125457","journal-title":"J. Clean. Prod."},{"issue":"3","key":"29_CR6","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1016\/j.ejor.2023.02.033","volume":"312","author":"H Jahani","year":"2024","unstructured":"Jahani, H., Abbasi, B., Sheu, J.B., Klibi, W.: Supply chain network design with financial considerations: a comprehensive review. Eur. J. Oper. Res. 312(3), 799\u2013839 (2024). https:\/\/doi.org\/10.1016\/j.ejor.2023.02.033","journal-title":"Eur. J. Oper. Res."},{"key":"29_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110774","volume":"147","author":"A Mohammed","year":"2023","unstructured":"Mohammed, A., Al-shaibani, M.S., Duffuaa, S.O.: A meta-heuristic-based algorithm for designing multi-objective multi-echelon supply chain network. Appl. Soft Comput. 147, 110774 (2023). https:\/\/doi.org\/10.1016\/j.asoc.2023.110774","journal-title":"Appl. Soft Comput."},{"key":"29_CR8","doi-asserted-by":"publisher","unstructured":"Kazancoglu, Y., Yuksel, D., Sezer, M.D., Mangla, S.K., Hua, L.: A green dual-channel closed-loop supply chain network design model. J. Clean. Prod. 332(May 2021), 130062 (2022). https:\/\/doi.org\/10.1016\/j.jclepro.2021.130062","DOI":"10.1016\/j.jclepro.2021.130062"},{"key":"29_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.07.025","volume":"140","author":"AM Mohammed","year":"2020","unstructured":"Mohammed, A.M., Duffuaa, S.O.: A tabu search based algorithm for the optimal design of multi-objective multi-product supply chain networks. Expert Syst. Appl. 140, 112808 (2020). https:\/\/doi.org\/10.1016\/j.eswa.2019.07.025","journal-title":"Expert Syst. Appl."},{"key":"29_CR10","doi-asserted-by":"publisher","unstructured":"Hu, H., Guo, S., Zhen, L., Wang, S., Bian, Y.: A multi-product and multi-period supply chain network design problem with price-sensitive demand and incremental quantity discount. Exp. Syst. Appl. 238(PE), 122005 (2024). https:\/\/doi.org\/10.1016\/j.eswa.2023.122005","DOI":"10.1016\/j.eswa.2023.122005"},{"key":"29_CR11","doi-asserted-by":"publisher","unstructured":"Mohammed, A., Govindan, K., Zubairu, N., Pratabaraj, J., Abideen, A.Z.: Multi-tier supply chain network design: a key towards sustainability and resilience. Comput. Ind. Eng., 182(June) (2023). https:\/\/doi.org\/10.1016\/j.cie.2023.109396","DOI":"10.1016\/j.cie.2023.109396"},{"key":"29_CR12","doi-asserted-by":"publisher","unstructured":"Li, K., Tian, L., Zheng, X., et al.: Plausible heterogeneous graph k-anonymization for social networks. Tsinghua Sci. Technol. 27(6), 912\u2013924 (2022). https:\/\/doi.org\/10.26599\/TST.2021.9010083","DOI":"10.26599\/TST.2021.9010083"},{"key":"29_CR13","doi-asserted-by":"publisher","unstructured":"Yu, W., Liao, Y., Yang, Y.: Exact and approximation algorithms for the multi-depot capacitated arc routing problems. Tsinghua Sci. Technol. 28(5), 916\u2013928 (2023). https:\/\/doi.org\/10.26599\/TST.2022.9010052","DOI":"10.26599\/TST.2022.9010052"},{"key":"29_CR14","doi-asserted-by":"publisher","unstructured":"Huang, P., Guo, L., Zhong, Y.: Efficient algorithms for maximizing group influence in social networks. Tsinghua Sci. Technol. 27(5), 832\u2013842 (2022). https:\/\/doi.org\/10.26599\/TST.2021.9010062","DOI":"10.26599\/TST.2021.9010062"},{"issue":"2","key":"29_CR15","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002). https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing, Applications and Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-4207-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T19:00:17Z","timestamp":1743620417000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-4207-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819642069","9789819642076"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-4207-6_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PDCAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel and Distributed Computing: Applications and Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pdcat2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/hpcc.siat.ac.cn\/meeting\/pdcat2024\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}