{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T15:19:19Z","timestamp":1730301559673,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1109\/uic-atc.2017.8397406","type":"proceedings-article","created":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T22:34:27Z","timestamp":1530225267000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["A hybrid heuristic for the team orienteering problem"],"prefix":"10.1109","author":[{"given":"Adel","family":"Bouchakhchoukha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tarek","family":"Menouer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nitin","family":"Sukhija","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90138-Y"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1016\/j.asoc.2012.09.022","article-title":"Solving the team orienteering problem using effective multi-start simulated annealing","volume":"13","author":"lin","year":"2013","journal-title":"Applied Soft Computing"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.03.045"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.02.053"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(94)90065-5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(98)00071-9"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.6.791"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00289-4"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.06.011"},{"key":"ref7","first-page":"65","article-title":"Ve-hicle Routing with Time Windows: Optimization and Approximation","author":"desrochers","year":"1988","journal-title":"Elsevier Science Publishers B V (North-Holland)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-006-0009-1"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-008-0094-4"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.12.022"}],"event":{"name":"2017 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computed, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld\/SCALCOM\/UIC\/ATC\/CBDCom\/IOP\/SCI)","start":{"date-parts":[[2017,8,4]]},"location":"San Francisco, CA","end":{"date-parts":[[2017,8,8]]}},"container-title":["2017 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computed, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld\/SCALCOM\/UIC\/ATC\/CBDCom\/IOP\/SCI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8386711\/8397387\/08397406.pdf?arnumber=8397406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T13:11:05Z","timestamp":1643202665000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8397406\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/uic-atc.2017.8397406","relation":{},"subject":[],"published":{"date-parts":[[2017,8]]}}}