{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T12:34:29Z","timestamp":1730205269058,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1109\/ceec47804.2019.8974324","type":"proceedings-article","created":{"date-parts":[[2020,1,31]],"date-time":"2020-01-31T05:02:16Z","timestamp":1580446936000},"page":"75-78","source":"Crossref","is-referenced-by-count":0,"title":["Conditional Markov Chain Search for the Generalised Travelling Salesman Problem for Warehouse Order Picking"],"prefix":"10.1109","author":[{"given":"Olegs","family":"Nalivajevs","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Karapetyan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-015-0080-8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.08.011"},{"key":"ref10","first-page":"220","article-title":"Algorithm configuration: Learning policies for the quick termination of poor performers","volume":"11353","author":"karapetyan","year":"2018","journal-title":"Proceedings of LION 2018 ser LNCS"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-009-9111-6"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-94830-0_7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.05.010"},{"key":"ref12","first-page":"107","article-title":"Empirical evaluation of construction heuristics for the multidimensional assignment problem","author":"karapetyan","year":"2009","journal-title":"London Algorithmics 2008 Theory and Practice ser Texts in Algorithmics"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1186\/s40294-017-0048-9"},{"key":"ref7","first-page":"165","author":"silberholz","year":"2007","journal-title":"The Generalized Traveling Salesman Problem A New Genetic Algorithm Approach"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.01.011"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.01.001"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.11601\/ijates.v2i3.61"}],"event":{"name":"2019 11th Computer Science and Electronic Engineering (CEEC)","start":{"date-parts":[[2019,9,18]]},"location":"Colchester, United Kingdom","end":{"date-parts":[[2019,9,20]]}},"container-title":["2019 11th Computer Science and Electronic Engineering (CEEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8966525\/8974308\/08974324.pdf?arnumber=8974324","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T15:13:35Z","timestamp":1658157215000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8974324\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/ceec47804.2019.8974324","relation":{},"subject":[],"published":{"date-parts":[[2019,9]]}}}