{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:19:22Z","timestamp":1742912362440,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":50,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819787425"},{"type":"electronic","value":"9789819787432"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-8743-2_9","type":"book-chapter","created":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T15:57:22Z","timestamp":1730303842000},"page":"114-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Deep Reinforcement Learning Based on\u00a0Greed for\u00a0the\u00a0Critical Cross-Section Identification Problem"],"prefix":"10.1007","author":[{"given":"Huaiyuan","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donghua","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hekai","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinglei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongzhi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,31]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Zhou, X., Zhang, Z.: Opinion maximization in social networks via leader selection[C]. In: Proceedings of the ACM Web Conference, pp. 133\u2013142 (2023)","DOI":"10.1145\/3543507.3583243"},{"issue":"11","key":"9_CR2","first-page":"64","volume":"35","author":"H Zhou","year":"2022","unstructured":"Zhou, H., Sun, F.: Topology path search method of active distribution network based on undirected graph[J]. Guangdong Electric Power 35(11), 64\u201371 (2022)","journal-title":"Guangdong Electric Power"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Eliasof, M., Haber, E., Treister, E.: Feature transportation improves graph neural networks. In: Proceedings of the AAAI Conference on Artificial Intelligence , vol. 38 no. 11, pp. 11874\u201311882 (2024)","DOI":"10.1609\/aaai.v38i11.29073"},{"key":"9_CR4","unstructured":"Grinsztajn, N., Furelos-Blanco, D., Surana, S., et al.: Winner takes it all: training performant RL populations for combinatorial optimization[J]. Adv. Neural Inform. Process. Syst. 36 (2024)"},{"key":"9_CR5","first-page":"69","volume-title":"Der Handlungsreisende, wie er sein soll und was er zu thun hat, um Auftr\u00e4ge zu erhalten und eines gl\u00fccklichen Erfolgs in seinen Gesch\u00e4ften gewiss zu sein[J]","author":"BF Voigt","year":"1831","unstructured":"Voigt, B.F.: Der Handlungsreisende, wie er sein soll und was er zu thun hat, um Auftr\u00e4ge zu erhalten und eines gl\u00fccklichen Erfolgs in seinen Gesch\u00e4ften gewiss zu sein[J], pp. 69\u201372. Ilmenau, Commis-Voageur (1831)"},{"key":"9_CR6","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability[M]. San Francisco: freeman (1979)"},{"key":"9_CR7","unstructured":"Miller, R.E., Muller, D.E.: A problem of maximum consistent subsets[R]. IBM Research Report RC-240, JT Watson Research Center, Yorktown Heights, NY, (1960)"},{"key":"9_CR8","unstructured":"Wang, T., Li, Y., Gu, X., et al.: Identification of the key transmission sections considering optimization of geographical partition boundary for power grids [J]. Trans. China Electrotech. Society 29(04), 220\u2013228+245 (2014)"},{"issue":"5","key":"9_CR9","doi-asserted-by":"publisher","first-page":"3349","DOI":"10.1109\/TPWRS.2015.2493141","volume":"31","author":"X Zhang","year":"2015","unstructured":"Zhang, X., Grijalva, S.: Decentralized total transfer capability evaluation using domain decomposition methods[J]. IEEE Trans. Power Syst. 31(5), 3349\u20133357 (2015)","journal-title":"IEEE Trans. Power Syst."},{"issue":"3","key":"9_CR10","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1109\/TPWRS.2006.876690","volume":"21","author":"L Min","year":"2006","unstructured":"Min, L., Abur, A.: Total transfer capability computation for multi-area power systems. IEEE Trans. Power Syst. 21(3), 1141\u20131147 (2006)","journal-title":"IEEE Trans. Power Syst."},{"issue":"6","key":"9_CR11","first-page":"100","volume":"38","author":"Y Yan","year":"2017","unstructured":"Yan, Y., Zhou, Q., He, H., et al.: Subarea division and transmission sections search method based on complex network theory. Electric Power Construct. 38(6), 100\u2013107 (2017)","journal-title":"Electric Power Construct."},{"key":"9_CR12","unstructured":"Papadimitriou, C., Steiglitz, K.: Combinatorial optimization: algorithms and complexity[M]. Courier Corporation (1998)"},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"E Lawler","year":"1966","unstructured":"Lawler, E., Wood, D.: Branch-and-bound methods: a survey. Oper. Res. 14(4), 699\u2013719 (1966)","journal-title":"Oper. Res."},{"key":"9_CR14","volume-title":"Dynamic Programming and Optimal Control","author":"DP Bertsekas","year":"1995","unstructured":"Bertsekas, D.P.: Dynamic Programming and Optimal Control. Athena Scientific, Belmont, MA (1995)"},{"key":"9_CR15","doi-asserted-by":"publisher","DOI":"10.1201\/EBK0824740993","volume-title":"Dynamic Programming: Foundations and Principles (Second edition)","author":"M Sniedovich","year":"2010","unstructured":"Sniedovich, M.: Dynamic Programming: Foundations and Principles (Second edition). CRC Press, Boca Raton, FL (2010)"},{"key":"9_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"D Williamson","year":"2011","unstructured":"Williamson, D., Shmoys, D.: The Design of Approximation Algorithms. Cambridge University Press, Cambridge (2011)"},{"key":"9_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation Algorithms","author":"V Vazirani","year":"2003","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, Berlin, Heidelberg (2003)"},{"issue":"2","key":"9_CR18","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/261342.571216","volume":"28","author":"D Hochba","year":"1997","unstructured":"Hochba, D.: Approximation algorithms for NP-hard problems. ACM SIGACT News 28(2), 40\u201352 (1997)","journal-title":"ACM SIGACT News"},{"key":"9_CR19","unstructured":"Chen, X., Tian, Y.: Learning to perform local rewriting for combinatorial optimization. In: Proceedings of the 33rd Conference on Neural Information Processing Systems. Vancouver, Canada: Curran Associates, Inc., pp. 6278\u20136289 (2019)"},{"key":"9_CR20","unstructured":"Yolcu, E., Poczos, B.: Learning local search heuristics for Boolean satisfiability. In: Proceedings of the 33rd Conference on Neural Information Processing Systems. Vancouver, Canada: Curran Associates, Inc., pp. 7992\u20138003 (2019)"},{"key":"9_CR21","unstructured":"Gao, L., Chen, M., Chen, Q., et al.: Learn to design the heuristics for vehicle routing problem. arXiv preprint arXiv: 2002.08539 (2020)"},{"key":"9_CR22","unstructured":"Lu, H., Zhang, X., Yang, S.: A learning-based iterative method for solving vehicle routing problems. In: Proceedings of the 8th International Conference on Learning Representations. Addis Ababa, Ethiopia, (2020)"},{"key":"9_CR23","first-page":"6659","volume":"33","author":"N Karalias","year":"2020","unstructured":"Karalias, N., Loukas, A.: Erdos goes neural: an unsupervised learning framework for combinatorial optimization on graphs. Adv. Neural. Inf. Process. Syst. 33, 6659\u20136672 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Barrett, T., Clements, W., Foerster, J., et al.: Exploratory combinatorial optimization with reinforcement learning. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34 no. 04, pp. 3243\u20133250 (2020)","DOI":"10.1609\/aaai.v34i04.5723"},{"key":"9_CR25","first-page":"31444","volume":"35","author":"H Wang","year":"2022","unstructured":"Wang, H., Wu, N., Yang, H., et al.: Unsupervised learning for combinatorial optimization with principled objective relaxation. Adv. Neural. Inf. Process. Syst. 35, 31444\u201331458 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Aarts, E., Aarts, E., Lenstra, J.: Local search in combinatorial optimization[M]. Princeton University Press (2003)","DOI":"10.1515\/9780691187563"},{"key":"9_CR27","first-page":"15","volume-title":"Genetic Algorithms[M]","author":"S Sivanandam","year":"2008","unstructured":"Sivanandam, S., Deepa, S.: Genetic Algorithms[M], pp. 15\u201337. Berlin, Heidelberg, Introduction to genetic algorithms. Springer (2008)"},{"issue":"4","key":"9_CR28","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo, M., Birattari, M., Stutzle, T.: Ant colony optimization. IEEE Comput. Intell. Mag. 1(4), 28\u201339 (2006)","journal-title":"IEEE Comput. Intell. Mag."},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Wu, C., Shankari, K., Kamar, E., et al.: Optimizing the diamond lane: a more tractable carpool problem and algorithms. In: 2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC). IEEE, pp. 1389\u20131396 (2016)","DOI":"10.1109\/ITSC.2016.7795739"},{"issue":"6","key":"9_CR30","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"G Croes","year":"1958","unstructured":"Croes, G.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791\u2013812 (1958)","journal-title":"Oper. Res."},{"issue":"1","key":"9_CR31","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9_CR32","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"issue":"10","key":"9_CR33","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin, S.: Computer solutions of the traveling salesman problem. Bell Labs Tech. J. 44(10), 2245\u20132269 (1965)","journal-title":"Bell Labs Tech. J."},{"key":"9_CR34","unstructured":"Helsgaun, K.: An Extension Of The Lin-kernighan-helsgaun Tsp Solver for Constrained Traveling Salesman nd Vehicle Routing Problems, pp. 24\u201350. Roskilde University, Roskilde (2017)"},{"key":"9_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105643","volume":"140","author":"T Vidal","year":"2022","unstructured":"Vidal, T.: Hybrid genetic search for the CVRP: Open-source implementation and SWAP* neighborhood. Comput. Oper. Res. 140, 105643 (2022)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9_CR36","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal, T., Crainic, T., Gendreau, M., et al.: A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60(3), 611\u2013624 (2012)","journal-title":"Oper. Res."},{"issue":"2","key":"9_CR37","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1111\/itor.12807","volume":"29","author":"M Bourel","year":"2022","unstructured":"Bourel, M., Canale, E., Robledo, F., et al.: Complexity and heuristics for the weighted max cut-clique problem. Int. Trans. Oper. Res. 29(2), 908\u2013928 (2022)","journal-title":"Int. Trans. Oper. Res."},{"issue":"3","key":"9_CR38","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s11590-017-1128-7","volume":"12","author":"B Nogueira","year":"2018","unstructured":"Nogueira, B., Pinheiro, R., Subramanian, A.: A hybrid iterated local search heuristic for the maximum weight independent set problem. Optimiz. Lett. 12(3), 567\u2013583 (2018)","journal-title":"Optimiz. Lett."},{"key":"9_CR39","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: vertexer networks. Adv. Neural Inform. Process. Systems, vol. 28 (2015)"},{"key":"9_CR40","unstructured":"Li, Z., Chen, Q., Koltun, V.: Combinatorial optimization with graph convolutional networks and guided tree search. Adv. Neural Inform. Process. Syst. vol. 31 (2018)"},{"key":"9_CR41","unstructured":"Selsam, D., Lamm, M., B\u00fcnz, B., et al.L Learning a SAT solver from single-bit supervision[C]. In: 7th International Conference on Learning Representations(ICLR 2019) (2019)"},{"key":"9_CR42","unstructured":"Bello, I., Pham, H., Le, Q., et al.: Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940 (2016)"},{"key":"9_CR43","unstructured":"Khalil, E., Dai, H., Zhang, Y., et al.: Learning combinatorial optimization algorithms over graphs[J]. In: Advances in Neural Information Processing Systems, vol. 30 (2017)"},{"key":"9_CR44","doi-asserted-by":"publisher","unstructured":"Deudon, M., Cournut, P., Lacoste, A., et al.: Learning heuristics for the tsp by policy gradient. In: International conference on the integration of constraint programming, artificial intelligence, and operations research. Springer, Cham, pp. 170\u2013181 (2018). https:\/\/doi.org\/10.1007\/978-3-319-93031-2_12","DOI":"10.1007\/978-3-319-93031-2_12"},{"key":"9_CR45","unstructured":"Kool, W., Van Hoof, H., Welling, M.: Attention, Learn to Solve Routing Problems!. In: 7th International Conference on Learning Representations (ICLR 2019) (2019)"},{"issue":"3","key":"9_CR46","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"J Hopfield","year":"1985","unstructured":"Hopfield, J., Tank, D.: Neural computation of decisions in optimization problemsD. Biol. Cybern. 52(3), 141\u2013152 (1985)","journal-title":"Biol. Cybern."},{"issue":"1","key":"9_CR47","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/ijoc.11.1.15","volume":"11","author":"K Smith","year":"1999","unstructured":"Smith, K.: Neural networks for combinatorial optimization: a review of more than a decade of research. INFORMS J. Comput. 11(1), 15\u201334 (1999)","journal-title":"INFORMS J. Comput."},{"key":"9_CR48","unstructured":"Amizadeh, S., Matusevych, S., Weimer, M.: Learning to solve circuit-SAT: an unsupervised differentiable approach. In: International Conference on Learning Representations (2018)"},{"key":"9_CR49","first-page":"245","volume-title":"The Maximum Weight Connected Subgraph Problem","author":"E \u00c1lvarez-Miranda","year":"2013","unstructured":"\u00c1lvarez-Miranda, E., Ljubi\u0107, I., Mutzel, P.: The Maximum Weight Connected Subgraph Problem, pp. 245\u2013270. Festschrift for Martin Gr\u00f6tschel, Facets of combinatorial optimization (2013)"},{"issue":"11","key":"9_CR50","first-page":"19","volume":"34","author":"Q Wei","year":"2021","unstructured":"Wei, Q., Tang, W., Jiang, C., et al.: Online equivalent modeling of active distribution network based on improved reinforcement learning algorithm. Guangdong Electric Power 34(11), 19\u201326 (2021)","journal-title":"Guangdong Electric Power"}],"container-title":["Communications in Computer and Information Science","Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-8743-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T16:06:36Z","timestamp":1730304396000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-8743-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819787425","9789819787432"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-8743-2_9","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"31 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICPCSEE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of Pioneering Computer Scientists, Engineers and Educators","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macao","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":"27 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icpcsee2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2024.icpcsee.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}