{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:18:13Z","timestamp":1760710693829,"version":"3.28.0"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"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":[[2021,6,28]]},"DOI":"10.1109\/cec45853.2021.9504975","type":"proceedings-article","created":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T21:57:06Z","timestamp":1628546226000},"page":"1365-1371","source":"Crossref","is-referenced-by-count":4,"title":["Fast Heuristics for Traveling Salesman Problems with Multiple Flying Sidekicks"],"prefix":"10.1109","author":[{"given":"Gustavo","family":"Delazeri","sequence":"first","affiliation":[]},{"given":"Marcus","family":"Ritt","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2015.03.005"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2020.102762"},{"key":"ref10","article-title":"Constraint integer programming","author":"achterberg","year":"2007","journal-title":"Ph D Dissertation"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2019.11.003"},{"journal-title":"Reinforcement Learning An Introduction","year":"2018","author":"sutton","key":"ref8"},{"key":"ref7","article-title":"An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems","author":"helsgaun","year":"2017","journal-title":"Roskilde University Tech Rep"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.3390\/drones3030066"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF02278710"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.cor.2014.06.008","article-title":"A survey on two-echelon routing problems","volume":"55","author":"speranza","year":"2015","journal-title":"Comp Oper Res"}],"event":{"name":"2021 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2021,6,28]]},"location":"Krak\u00f3w, Poland","end":{"date-parts":[[2021,7,1]]}},"container-title":["2021 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9504682\/9504683\/09504975.pdf?arnumber=9504975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:44:33Z","timestamp":1652197473000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9504975\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,28]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/cec45853.2021.9504975","relation":{},"subject":[],"published":{"date-parts":[[2021,6,28]]}}}