{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T14:01:33Z","timestamp":1774965693292,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,8]],"date-time":"2022-07-08T00:00:00Z","timestamp":1657238400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,8]]},"DOI":"10.1145\/3512290.3528835","type":"proceedings-article","created":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T13:52:32Z","timestamp":1658152352000},"page":"4-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["PLAN"],"prefix":"10.1145","author":[{"given":"Anoushka","family":"Alavilli","sequence":"first","affiliation":[{"name":"Tufts University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mai","family":"Vu","sequence":"additional","affiliation":[{"name":"Tufts University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1611675114"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2017.8206203"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tra.2017.06.011"},{"key":"e_1_3_2_1_4_1","volume-title":"Boyd and Lieven Vandenberghe","author":"Stephen","year":"2011","unstructured":"Stephen P. Boyd and Lieven Vandenberghe . 2011 . Convex Optimization. Cambridge University Press , Cambridge, England. 193, 550, 619 pages. Stephen P. Boyd and Lieven Vandenberghe. 2011. Convex Optimization. Cambridge University Press, Cambridge, England. 193, 550, 619 pages."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12654-3_2"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJBIDM.2010.030296"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41893-020-00678-z"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trpro.2020.03.105"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10211-002-0062-5"},{"key":"e_1_3_2_1_11_1","volume-title":"Kochenderfer and Time A. Wheeler","author":"Mykel","year":"2019","unstructured":"Mykel J. Kochenderfer and Time A. Wheeler . 2019 . Algorithms for Optimization. MIT Press , Cambridge, Massachusetts. 354 pages. Mykel J. Kochenderfer and Time A. Wheeler. 2019. Algorithms for Optimization. MIT Press, Cambridge, Massachusetts. 354 pages."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2021.1042"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/NCM.2008.24"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2019.2893173"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422.322418"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2018.2880007"},{"key":"e_1_3_2_1_17_1","unstructured":"NYC OpenData. 2021. 2020 Yellow Taxi Trip Data. https:\/\/data.cityofnewyork.us\/Transportation\/2020-Yellow-Taxi-Trip-Data\/kxp8-n2sj  NYC OpenData. 2021. 2020 Yellow Taxi Trip Data. https:\/\/data.cityofnewyork.us\/Transportation\/2020-Yellow-Taxi-Trip-Data\/kxp8-n2sj"},{"key":"e_1_3_2_1_18_1","article-title":"Driver shortage increases prices for ride-hailing services","author":"Paul Jesse","year":"2021","unstructured":"Jesse Paul . 2021 . Driver shortage increases prices for ride-hailing services . AP News. Retrieved January 12, 2022 from apnews.com\/article\/health-coronavirus-pandemic-39526365faa33c5bb71272d2e11397fe Jesse Paul. 2021. Driver shortage increases prices for ride-hailing services. AP News. Retrieved January 12, 2022 from apnews.com\/article\/health-coronavirus-pandemic-39526365faa33c5bb71272d2e11397fe","journal-title":"AP News. Retrieved"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2021.103287"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-416743-8.00015-4"}],"event":{"name":"GECCO '22: Genetic and Evolutionary Computation Conference","location":"Boston Massachusetts","acronym":"GECCO '22","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3512290.3528835","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3512290.3528835","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:57Z","timestamp":1750183797000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3512290.3528835"}},"subtitle":["a leafcutter ant colony optimization algorithm for ride-hailing services"],"short-title":[],"issued":{"date-parts":[[2022,7,8]]},"references-count":19,"alternative-id":["10.1145\/3512290.3528835","10.1145\/3512290"],"URL":"https:\/\/doi.org\/10.1145\/3512290.3528835","relation":{},"subject":[],"published":{"date-parts":[[2022,7,8]]},"assertion":[{"value":"2022-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}