{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:18Z","timestamp":1750306338938,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,20]],"date-time":"2016-07-20T00:00:00Z","timestamp":1468972800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Goverment of Russian Federation","award":["074-U01"],"award-info":[{"award-number":["074-U01"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,20]]},"DOI":"10.1145\/2908961.2931666","type":"proceedings-article","created":{"date-parts":[[2016,7,29]],"date-time":"2016-07-29T19:04:16Z","timestamp":1469819056000},"page":"1027-1030","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Small-Moves Based Mutation For Pick-Up And Delivery Problem"],"prefix":"10.1145","author":[{"given":"Viacheslav","family":"Shalamov","sequence":"first","affiliation":[{"name":"ITMO University, St. Petersburg, Russian Fed."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrey","family":"Filchenkov","sequence":"additional","affiliation":[{"name":"ITMO University, St. Petersburg, Russian Fed."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniil","family":"Chivilikhin","sequence":"additional","affiliation":[{"name":"ITMO University, St. Petersburg, Russian Fed."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1060.0202"},{"key":"e_1_3_2_1_2_1","volume-title":"Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints. European journal of operational research, 223:60--75","author":"Cheang B.","year":"2012","unstructured":"B. Cheang , X. Gao , A. Lim , H. Qin , and W. Zhu . Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints. European journal of operational research, 223:60--75 , 2012 . B. Cheang, X. Gao, A. Lim, H. Qin, and W. Zhu. Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints. European journal of operational research, 223:60--75, 2012."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463372.2463440"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.v55:1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/978-0-387-77778-8_15","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges","author":"Cordeau J.","year":"2008","unstructured":"J. Cordeau , G. Laporte , and S. Ropke . The Vehicle Routing Problem: Latest Advances and New Challenges , chapter Recent Models and Algorithms for One-to-One Pickup and Delivery Problems, pages 327 -- 357 . Springer US , 2008 . J. Cordeau, G. Laporte, and S. Ropke. The Vehicle Routing Problem: Latest Advances and New Challenges, chapter Recent Models and Algorithms for One-to-One Pickup and Delivery Problems, pages 327--357. Springer US, 2008."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00462870"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11750-010-0144-x"},{"key":"e_1_3_2_1_8_1","volume-title":"The traveling salesman problem: A case study in local optimization. Local search in combinatorial optimization, 1:215--310","author":"Johnson D.","year":"1997","unstructured":"D. Johnson and L. McGeoch . The traveling salesman problem: A case study in local optimization. Local search in combinatorial optimization, 1:215--310 , 1997 . D. Johnson and L. McGeoch. The traveling salesman problem: A case study in local optimization. Local search in combinatorial optimization, 1:215--310, 1997."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.05.012"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-014-0386-3"},{"key":"e_1_3_2_1_11_1","volume-title":"Stochastic optimization","author":"Schneider J.","year":"2007","unstructured":"J. Schneider and S. Kirkpatrick . Stochastic optimization . Springer Science & Business Media , 2007 . J. Schneider and S. Kirkpatrick. Stochastic optimization. Springer Science & Business Media, 2007."}],"event":{"name":"GECCO '16: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Denver Colorado USA","acronym":"GECCO '16"},"container-title":["Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2908961.2931666","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2908961.2931666","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:55:02Z","timestamp":1750222502000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2908961.2931666"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,20]]},"references-count":11,"alternative-id":["10.1145\/2908961.2931666","10.1145\/2908961"],"URL":"https:\/\/doi.org\/10.1145\/2908961.2931666","relation":{},"subject":[],"published":{"date-parts":[[2016,7,20]]},"assertion":[{"value":"2016-07-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}