{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T16:48:53Z","timestamp":1782492533758,"version":"3.54.5"},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Neural Networks"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.neunet.2026.109269","type":"journal-article","created":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T06:48:43Z","timestamp":1781851723000},"page":"109269","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["LLM-Driven Regime-Adaptive strategy synthesis for Polymorphic Network routing"],"prefix":"10.1016","volume":"204","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-0389-445X","authenticated-orcid":false,"given":"Shuhan","family":"Guo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-1058-7625","authenticated-orcid":false,"given":"Yudong","family":"Bai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2887-8395","authenticated-orcid":false,"given":"Wei","family":"Huangfu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8736-1161","authenticated-orcid":false,"given":"Quan","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8944-8618","authenticated-orcid":false,"given":"Quanming","family":"Yao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.neunet.2026.109269_bib0001","series-title":"Proceedings of the ACM SIGCOMM 2008 conference on data communication","article-title":"A scalable, commodity data center network architecture","author":"Al-Fares","year":"2008"},{"key":"10.1016\/j.neunet.2026.109269_bib0002","unstructured":"Al-Fares, M., & Others (2025). Model retraining upon concept drift detection in network traffic big data. Mathematics."},{"key":"10.1016\/j.neunet.2026.109269_bib0003","series-title":"Proceedings of the ACM SIGCOMM 2024 conference","article-title":"Transferable neural WAN TE for changing topologies","author":"AlQiam","year":"2024"},{"key":"10.1016\/j.neunet.2026.109269_bib0004","series-title":"Introduction to Algorithms","author":"Cormen","year":"2009"},{"key":"10.1016\/j.neunet.2026.109269_bib0005","series-title":"Proceedings of the 1999 congress on evolutionary computation-CEC99","article-title":"Ant colony optimization: A new meta-heuristic","author":"Dorigo","year":"1999"},{"key":"10.1016\/j.neunet.2026.109269_bib0006","series-title":"Tabu search principles","author":"Glover","year":"1997"},{"key":"10.1016\/j.neunet.2026.109269_bib0007","series-title":"Findings of the association for computational linguistics: ACL 2025","article-title":"Nested-refinement metamorphosis: Reflective evolution for efficient optimization of networking problems","author":"Guo","year":"2025"},{"key":"10.1016\/j.neunet.2026.109269_bib0008","series-title":"Proceedings of the ACM coNEXT-2025 workshop on the polymorphic network","article-title":"NeRM-Net: Reflective evolution of routing strategies for dynamic communication networks","author":"Guo","year":"2025"},{"key":"10.1016\/j.neunet.2026.109269_bib0009","series-title":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","article-title":"Achieving high utilization with software-driven WAN","author":"Hong","year":"2013"},{"key":"10.1016\/j.neunet.2026.109269_bib0010","doi-asserted-by":"crossref","DOI":"10.1109\/TNSE.2020.3006249","article-title":"Polymorphic smart network: An open, flexible and universal architecture for future heterogeneous networks","author":"Hu","year":"2020","journal-title":"IEEE Transactions on Network Science and Engineering"},{"key":"10.1016\/j.neunet.2026.109269_bib0011","series-title":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","article-title":"B4: Experience with a globally-deployed software defined WAN","author":"Jain","year":"2013"},{"key":"10.1016\/j.neunet.2026.109269_bib0012","series-title":"Proceedings of IEEE INFOCOM 2001","article-title":"Multi-constrained optimal path selection","author":"Korkmaz","year":"2001"},{"key":"10.1016\/j.neunet.2026.109269_bib0013","series-title":"Proceedings of the ACM coNEXT 2025 conference","article-title":"Shooting large-scale traffic engineering by combining deep learning and optimization approach","author":"Liu","year":"2025"},{"key":"10.1016\/j.neunet.2026.109269_bib0014","unstructured":"Liu, F., Tong, X., Yuan, M., Lin, X., Luo, F., Wang, Z., Lu, Z., & Zhang, Q. (2024). Evolution of heuristics: Towards efficient automatic algorithm design using large language model. In Forty-first international conference on machine learning (ICML)."},{"key":"10.1016\/j.neunet.2026.109269_bib0015","article-title":"An efficient stochastic gradient descent algorithm to maximize the coverage of cellular networks","author":"Liu","year":"2019","journal-title":"IEEE Transactions on Wireless Communications"},{"key":"10.1016\/j.neunet.2026.109269_bib0016","unstructured":"Lu, J., Liu, A., Dong, F., Gu, F., Gama, J., & Zhang, G. (2018). A survey on concept drift adaptation. ACM Computing Surveys (CSUR)."},{"key":"10.1016\/j.neunet.2026.109269_bib0017","series-title":"International conference on machine learning (ICML)","first-page":"1928","article-title":"Asynchronous methods for deep reinforcement learning","author":"Mnih","year":"2016"},{"key":"10.1016\/j.neunet.2026.109269_bib0018","doi-asserted-by":"crossref","DOI":"10.1109\/TGCN.2025.3548140","article-title":"Graph pointer network assisted deep reinforcement learning for virtualized network embedding","author":"Pei","year":"2025","journal-title":"IEEE Transactions on Green Communications and Networking"},{"key":"10.1016\/j.neunet.2026.109269_bib0019","doi-asserted-by":"crossref","DOI":"10.1109\/90.842145","article-title":"A distributed algorithm for delay-constrained unicast routing","author":"Reeves","year":"2000","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.1016\/j.neunet.2026.109269_bib0020","doi-asserted-by":"crossref","DOI":"10.1038\/s41586-023-06924-6","article-title":"Mathematical discoveries from program search with large language models","author":"Romera-Paredes","year":"2024","journal-title":"Nature"},{"key":"10.1016\/j.neunet.2026.109269_bib0021","article-title":"The emergence of edge computing","author":"Satyanarayanan","year":"2017","journal-title":"Computer"},{"key":"10.1016\/j.neunet.2026.109269_bib0022","unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., & Klimov, O. (2017). Proximal policy optimization algorithms. arXiv preprint arXiv: 1707.06347."},{"key":"10.1016\/j.neunet.2026.109269_bib0023","unstructured":"Wang, N. (2020). GEANT\/Abilene network topology data and traffic traces."},{"key":"10.1016\/j.neunet.2026.109269_bib0024","article-title":"Netchecker: Enabling real-time and error-locatable runtime verification for programmable networks","author":"Yao","year":"2025","journal-title":"Journal of King Saud University: Computer and Information Sciences"},{"key":"10.1016\/j.neunet.2026.109269_bib0025","series-title":"Proceedings of the 38th international conference on neural information processing systems (neurIPS)","article-title":"Reevo: Large language models as hyper-heuristics with reflective evolution","author":"Ye","year":"2024"}],"container-title":["Neural Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S089360802600729X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S089360802600729X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T16:14:29Z","timestamp":1782490469000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S089360802600729X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":25,"alternative-id":["S089360802600729X"],"URL":"https:\/\/doi.org\/10.1016\/j.neunet.2026.109269","relation":{},"ISSN":["0893-6080"],"issn-type":[{"value":"0893-6080","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"LLM-Driven Regime-Adaptive strategy synthesis for Polymorphic Network routing","name":"articletitle","label":"Article Title"},{"value":"Neural Networks","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.neunet.2026.109269","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"109269"}}