{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:29:34Z","timestamp":1750220974706,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T00:00:00Z","timestamp":1562976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,13]]},"DOI":"10.1145\/3319619.3321947","type":"proceedings-article","created":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T12:10:59Z","timestamp":1562760659000},"page":"318-319","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Can route planning be smarter with transfer optimization?"],"prefix":"10.1145","author":[{"given":"Ray","family":"Lim","sequence":"first","affiliation":[{"name":"Nanyang Technological University, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yew-Soon","family":"Ong","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanh Thi Hong","family":"Phan","sequence":"additional","affiliation":[{"name":"Teko Vietnam, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhishek","family":"Gupta","sequence":"additional","affiliation":[{"name":"SIMTech, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Allan Nengsheng","family":"Zhang","sequence":"additional","affiliation":[{"name":"SIMTech, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2017.2769104"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2864345"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/645826.669423"},{"volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"Goldberg David E.","key":"e_1_3_2_1_4_1"},{"volume-title":"TSPLIB---A traveling salesman problem library. ORSA journal on computing, 3, 4","year":"1991","author":"Reinelt Gerhard","key":"e_1_3_2_1_5_1"}],"event":{"name":"GECCO '19: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Prague Czech Republic","acronym":"GECCO '19"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319619.3321947","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319619.3321947","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:35Z","timestamp":1750204475000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319619.3321947"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,13]]},"references-count":5,"alternative-id":["10.1145\/3319619.3321947","10.1145\/3319619"],"URL":"https:\/\/doi.org\/10.1145\/3319619.3321947","relation":{},"subject":[],"published":{"date-parts":[[2019,7,13]]},"assertion":[{"value":"2019-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}