{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T13:09:39Z","timestamp":1751288979637,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"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":[[2023,7,1]]},"DOI":"10.1109\/cec53210.2023.10254179","type":"proceedings-article","created":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T14:04:21Z","timestamp":1695650661000},"page":"1-8","source":"Crossref","is-referenced-by-count":2,"title":["An Improved Genetic Algorithm With Euclidean Geometry and Hybrid Heuristic Crossover for Traveling Salesman Problem"],"prefix":"10.1109","author":[{"given":"Bryan","family":"Zhu","sequence":"first","affiliation":[{"name":"Bellevue High School,Washington,Bellevue,USA"}]},{"given":"Wei-Fang","family":"Xie","sequence":"additional","affiliation":[{"name":"Industrial & Aerospace,Concordia University,Department of Mechanical,Montreal,Canada"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.01.068"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996022"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00254"},{"key":"ref10","article-title":"A comparative study of crossover operators for genetic algorithms to solve traveling salesman problem","author":"hameed","year":"2018","journal-title":"International Journal of Research -GRANTHAALAYAH"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.01.039"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.1998.724995"},{"key":"ref8","article-title":"New variations of order crossover for traveling salesman problem","author":"deep","year":"2011","journal-title":"International Journal of Combinatorial Optimization Problems and Informatics"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IMCCC.2012.223"},{"key":"ref9","article-title":"A comparative study of adaptive crossover operators for genetic algorithms to resolve the traveling salesman problem","volume":"31","author":"otman","year":"2011","journal-title":"International Journal of Computer Applications"},{"journal-title":"Introduction to Algorithms","year":"2009","author":"cormen","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/6642009"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0957-4158(97)00033-0"},{"journal-title":"Urban Operations Research","year":"2007","author":"larson","key":"ref5"}],"event":{"name":"2023 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2023,7,1]]},"location":"Chicago, IL, USA","end":{"date-parts":[[2023,7,5]]}},"container-title":["2023 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10253662\/10253666\/10254179.pdf?arnumber=10254179","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T13:49:58Z","timestamp":1697464198000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10254179\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,1]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/cec53210.2023.10254179","relation":{},"subject":[],"published":{"date-parts":[[2023,7,1]]}}}