{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T18:10:27Z","timestamp":1774894227666,"version":"3.50.1"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2969519","type":"journal-article","created":{"date-parts":[[2020,2,2]],"date-time":"2020-02-02T05:44:21Z","timestamp":1580622261000},"page":"21437-21452","source":"Crossref","is-referenced-by-count":14,"title":["Multi-Objective Predictive Taxi Dispatch via Network Flow Optimization"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0223-5973","authenticated-orcid":false,"given":"Beomjun","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5220-3139","authenticated-orcid":false,"given":"Jeongho","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5569-5426","authenticated-orcid":false,"given":"Subin","family":"Huh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1984-9077","authenticated-orcid":false,"given":"Seungil","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5887-6169","authenticated-orcid":false,"given":"Insoon","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2015.09.007"},{"key":"ref38","author":"contardo","year":"2012","journal-title":"Balancing A Dynamic Public Bike-Sharing System"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2881419"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2017.8264517"},{"key":"ref31","article-title":"Reward constrained policy optimization","author":"tessler","year":"2018","journal-title":"arXiv 1805 11074"},{"key":"ref30","article-title":"Safe exploration in continuous action spaces","author":"dalal","year":"2018","journal-title":"arXiv 1801 08757"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2016.2529580"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8460966"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487272"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2017.2766042"},{"key":"ref28","article-title":"A cooperative multi-agent reinforcement learning framework for resource balancing in complex logistics network","author":"li","year":"2019","journal-title":"arXiv 1903 00714"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219993"},{"key":"ref29","first-page":"22","article-title":"Constrained policy optimization","volume":"70","author":"achiam","year":"2017","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2732947"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2916342"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915581863"},{"key":"ref22","article-title":"Optimizing online matching for ride-sourcing services with multi-agent deep reinforcement learning","author":"ke","year":"2019","journal-title":"arXiv 1902 06228"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC.2012.6338848"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313433"},{"key":"ref23","article-title":"Distributed policy iteration for scalable approximation of cooperative multi-agent policies","author":"phan","year":"2019","journal-title":"arXiv 1901 08761"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485988"},{"key":"ref25","article-title":"Can sophisticated dispatching strategy acquired by reinforcement learning?—A case study in dynamic courier dispatching system","author":"chen","year":"2019","journal-title":"arXiv 1903 02716"},{"key":"ref50","first-page":"1","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2015","journal-title":"Proc Int Conf Learn Represent (ICLR)ICLR"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2013.08.015"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.32.2.90"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357799"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.12.015"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098138"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313579"},{"key":"ref15","first-page":"2024","article-title":"Optimal trip-vehicle dispatch with multi-type requests","author":"huang","year":"2019","journal-title":"Proc 8th Int Conf Auton Agents Multiagent Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330724"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.3141\/1882-23"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2018.2882861"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2015.7172070"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940798"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2857002"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2016.7509386"},{"key":"ref5","first-page":"1","article-title":"Hands on the wheel: Navigating algorithmic management and Uber drivers’ autonomy","author":"mohlmann","year":"2017","journal-title":"Proc Int Conf Ind Inf Syst (ICIIS)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.10.043"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.36.1.21.570"},{"key":"ref49","first-page":"1928","article-title":"Asynchronous methods for deep reinforcement learning","volume":"48","author":"mnih","year":"2016","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.03.006"},{"key":"ref46","author":"vanderbei","year":"2015","journal-title":"Linear Programming"},{"key":"ref45","author":"bertsimas","year":"1997","journal-title":"Introduction to Linear Optimization"},{"key":"ref48","year":"2019","journal-title":"H3"},{"key":"ref47","article-title":"IBM ILOG CPLEX optimization studio","author":"manual","year":"1987"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.21236\/AD0249662"},{"key":"ref41","author":"ford","year":"2015","journal-title":"Flows in Networks"},{"key":"ref44","author":"dantzig","year":"1998","journal-title":"Linear Programming and Extensions"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45511-7"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/08970355.pdf?arnumber=8970355","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:51:12Z","timestamp":1639770672000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8970355\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":50,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2969519","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}