{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:23:16Z","timestamp":1742948596231,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030930455"},{"type":"electronic","value":"9783030930462"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-93046-2_18","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T05:30:01Z","timestamp":1641015001000},"page":"202-212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Neighborhood Search Acceleration Based on Deep Reinforcement Learning for SSCFLP"],"prefix":"10.1007","author":[{"given":"Zonghui","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Zhangjin","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Lu","family":"Zou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Ahuja, R.K., Orlin, J.B., Pallottino, S., Scaparra, M.P., Scutell\u00e0, M.G.: A multi-exchange heuristic for the single-source capacitated facility location problem. Manage. Sci. 50(6), 749\u2013760 (2004)","DOI":"10.1287\/mnsc.1030.0193"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Beasley, J.E.: Lagrangean heuristics for location problems. European J. Oper. Res. 65(3), 383\u2013399 (1993)","DOI":"10.1016\/0377-2217(93)90118-7"},{"key":"18_CR3","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940 (2016)"},{"key":"18_CR4","unstructured":"Chen, X., Tian, Y.: Learning to perform local rewriting for combinatorial optimization. arXiv preprint arXiv:1810.00337 (2018)"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Cho, K., et al.: Learning phrase representations using rnn encoder-decoder for statistical machine translation. arXiv preprint arXiv:1406.1078 (2014)","DOI":"10.3115\/v1\/D14-1179"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Contreras, I.A., D\u00edaz, J.A.: Scatter search for the single source capacitated facility location problem. Ann. Oper. Res. 157(1), 73\u201389 (2008)","DOI":"10.1007\/s10479-007-0193-1"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Cortinhal, M.J., Captivo, M.E.: Upper and lower bounds for the single source capacitated location problem. European J. Oper. Res. 151(2), 333\u2013351 (2003)","DOI":"10.1016\/S0377-2217(02)00829-9"},{"key":"18_CR8","unstructured":"Gao, L., Chen, M., Chen, Q., Luo, G., Zhu, N., Liu, Z.: Learn to design the heuristics for vehicle routing problem. arXiv preprint arXiv:2002.08539 (2020)"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Guo, P., Cheng, W., Wang, Y.: Hybrid evolutionary algorithm with extreme machine learning fitness function evaluation for two-stage capacitated facility location problems. Expert Syst. Appl. 71, 57\u201368 (2017)","DOI":"10.1016\/j.eswa.2016.11.025"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Hindi, K., Pie\u0144kosz, K.: Efficient solution of large scale, single-source, capacitated plant location problems. J. Oper. Res. Soc. 50(3), 268\u2013274 (1999)","DOI":"10.1057\/palgrave.jors.2600698"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Ho, S.C.: An iterated tabu search heuristic for the single source capacitated facility location problem. Appl. Soft Comput. 27, 169\u2013178 (2015)","DOI":"10.1016\/j.asoc.2014.11.004"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Holmberg, K., R\u00f6nnqvist, M., Yuan, D.: An exact algorithm for the capacitated facility location problems with single sourcing. European J. Oper. Res. 113(3), 544\u2013559 (1999)","DOI":"10.1016\/S0377-2217(98)00008-3"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Klincewicz, J.G., Luss, H.: A lagrangian relaxation heuristic for capacitated facility location with single-source constraints. J. Oper. Res. Soc. 37(5), 495\u2013500 (1986)","DOI":"10.1057\/jors.1986.84"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Neebe, A., Rao, M.: An algorithm for the fixed-charge assigning users to sources problem. J. Oper. Res. Soc. 34(11), 1107\u20131113 (1983)","DOI":"10.1057\/jors.1983.242"},{"key":"18_CR15","unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., Klimov, O.: Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 (2017)"},{"key":"18_CR16","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., Bengio, Y.: Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)"},{"key":"18_CR17","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. arXiv preprint arXiv:1506.03134 (2015)"},{"key":"18_CR18","unstructured":"Zaremba, W., Sutskever, I., Vinyals, O.: Recurrent neural network regularization. arXiv preprint arXiv:1409.2329 (2014)"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93046-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,18]],"date-time":"2022-06-18T08:05:37Z","timestamp":1655539537000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93046-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030930455","9783030930462"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93046-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"CAAI International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hangzhou","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cicai2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cicai.caai.cn\/#\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"307","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"105","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}