{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:43:59Z","timestamp":1758271439466,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1109\/iisa.2015.7388106","type":"proceedings-article","created":{"date-parts":[[2016,3,25]],"date-time":"2016-03-25T20:45:24Z","timestamp":1458938724000},"page":"1-6","source":"Crossref","is-referenced-by-count":12,"title":["Initialization methods for the TSP with Time Windows using Variable Neighborhood Search"],"prefix":"10.1109","author":[{"given":"Christos","family":"Papalitsas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Giannakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Theodore","family":"Andronikos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios","family":"Theotokis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Sifaleras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02022044"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1080\/15458830.1996.11770707","article-title":"Solving the travelling salesman problem with time windows using tabu search","volume":"28","author":"carlton","year":"1996","journal-title":"IEEE Transactions"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1287\/opre.46.3.330"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1287\/opre.40.6.1086"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.34.1.113.12284"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1050.0145"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.11.015"},{"year":"0","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.4249\/scholarpedia.11472"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-008-9098-4"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2012.10.001"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2012.10.012"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2014.11.001"},{"year":"0","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.2.367"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230230706"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.14.4.403.2827"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.32.1.12"},{"journal-title":"The Traveling Salesman Problem","year":"1985","author":"lawler","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2010.04.002"},{"key":"ref1","article-title":"Der Handlungsreisende wie er sein soll und was er zu tun hat, um Auftrge zu erhalten und eines glcklichen Erfolgs in seinen Geschften gewi zu sein von einem alten Commis-Voyageur","volume":"1","author":"voigt","year":"1981","journal-title":"The traveling salesman how he must be and what he should do in order to get commissions and be sure of the happy success in his business by an old commis-voyageur)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/937503.937505"},{"article-title":"Genetic Algorithms in Search, Optimization and Machine Learning (1st ed.)","year":"1989","author":"goldberg","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/b101874"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12001"},{"key":"ref25","article-title":"A variable neighborhood algorithm - A new metaheuristic for combinatorial optimization","author":"mladenovic","year":"1995","journal-title":"Abstracts of papers presented at Optimization Days"}],"event":{"name":"2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA)","start":{"date-parts":[[2015,7,6]]},"location":"Corfu, Greece","end":{"date-parts":[[2015,7,8]]}},"container-title":["2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7376844\/7387951\/07388106.pdf?arnumber=7388106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T00:22:04Z","timestamp":1567729324000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7388106\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/iisa.2015.7388106","relation":{},"subject":[],"published":{"date-parts":[[2015,7]]}}}