東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Harnessing Big Data for the Sharing ...

Shou, Zhenyu.

FindBook

Google Book

Amazon

博客來

Harnessing Big Data for the Sharing Economy in Smart Cities.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Harnessing Big Data for the Sharing Economy in Smart Cities./
作者:	Shou, Zhenyu.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2021,
面頁冊數:	191 p.
附註:	Source: Dissertations Abstracts International, Volume: 82-08, Section: B.
Contained By:	Dissertations Abstracts International82-08B.
標題:	Transportation. -
電子資源:	https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28264909
ISBN:	9798569910038

Harnessing Big Data for the Sharing Economy in Smart Cities.
Shou, Zhenyu.

Harnessing Big Data for the Sharing Economy in Smart Cities. - Ann Arbor : ProQuest Dissertations & Theses, 2021 - 191 p.

Source: Dissertations Abstracts International, Volume: 82-08, Section: B.

Thesis (Ph.D.)--Columbia University, 2021.

This item must not be sold to any third party vendors.

Motivated by the imbalance between demand (i.e., passenger requests) and supply (i.e., available vehicles) in the ride-hailing market and severe traffic congestion faced by modern cities, this dissertation aims to improve the efficiency of the sharing economy by building an agent-based methodological framework for optimal decision-making of distributed agents (e.g., autonomous shared vehicles), including passenger-seeking and route choice. Furthermore, noticing that city planners can impact the behavior of agents via some operational measures such as congestion pricing and signal control, this dissertation investigates the overall bilevel problem that involves the decision-making process of both distributed agents (i.e., the lower level) and central city planners (i.e., the upper level).First of all, for the task of passenger-seeking, this dissertation proposes a model-based Markov decision process (MDP) approach to incorporate distinct features of e-hailing drivers. The modified MDP approach is found to outperform the baseline (i.e., the local hotspot strategy) in terms of both the rate of return and the utilization rate. Although the modified MDP approach is set up in the single-agent setting, we extend its applicability to multi-agent scenarios by a dynamic adjustment strategy of the order matching probability which is able to partially capture the competition among agents. Furthermore, noticing that the reward function is commonly assumed as some prior knowledge, this dissertation unveils the underlying reward function of the overall e-hailing driver population (i.e., 44,000 Didi drivers in Beijing) through an inverse reinforcement learning method, which paves the way for future research on discovering the underlying reward mechanism in a complex and dynamic ride-hailing market.To better incorporate the competition among agents, this dissertation develops a model-free mean-field multi-agent actor-critic algorithm for multi-driver passenger-seeking. A bilevel optimization model is then formulated with the upper level as a reward design mechanism and the lower level as a multi-agent system. We use the developed mean field multi-agent actor-critic algorithm to solve for the optimal passenger-seeking policies of distributed agents in the lower level and Bayesian optimization to solve for the optimal control of upper-level city planners. The bilevel optimization model is applied to a real-world large-scale multi-class taxi driver repositioning task with congestion pricing as the upper-level control. It is disclosed that the derived optimal toll charge can efficiently improve the objective of city planners.With agents knowing where to go (i.e., passenger-seeking), this dissertation then applies the bilevel optimization model to the research question of how to get there (i.e., route choice). Different from the task of passenger-seeking where the action space is always fixed-dimensional, the problem of variable action set emerges in the task of route choice. Therefore, a flow-dependent deep Q-learning algorithm is proposed to efficiently derive the optimal policies for multi-commodity multi-class agents. We demonstrate the effect of two countermeasures, namely tolling and signal control, on the behavior of travelers and show that the systematic objective of city planners can be optimized by a proper control.

ISBN: 9798569910038Subjects--Topical Terms:

555912
Transportation.
Subjects--Index Terms:

Bilevel optimization

Harnessing Big Data for the Sharing Economy in Smart Cities.
LDR:04768nmm a2200481 4500 001 2281976
005 20210927083509.5
008 220723s2021 ||||||||||||||||| ||eng d
020 $a 9798569910038
035 $a (MiAaPQ)AAI28264909
035 $a AAI28264909
040 $a MiAaPQ $c MiAaPQ
100 1 $a Shou, Zhenyu. $3 3560691
245 1 0 $a Harnessing Big Data for the Sharing Economy in Smart Cities.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2021
300 $a 191 p.
500 $a Source: Dissertations Abstracts International, Volume: 82-08, Section: B.
500 $a Advisor: Di, Xuan.
502 $a Thesis (Ph.D.)--Columbia University, 2021.
506 $a This item must not be sold to any third party vendors.
520 $a Motivated by the imbalance between demand (i.e., passenger requests) and supply (i.e., available vehicles) in the ride-hailing market and severe traffic congestion faced by modern cities, this dissertation aims to improve the efficiency of the sharing economy by building an agent-based methodological framework for optimal decision-making of distributed agents (e.g., autonomous shared vehicles), including passenger-seeking and route choice. Furthermore, noticing that city planners can impact the behavior of agents via some operational measures such as congestion pricing and signal control, this dissertation investigates the overall bilevel problem that involves the decision-making process of both distributed agents (i.e., the lower level) and central city planners (i.e., the upper level).First of all, for the task of passenger-seeking, this dissertation proposes a model-based Markov decision process (MDP) approach to incorporate distinct features of e-hailing drivers. The modified MDP approach is found to outperform the baseline (i.e., the local hotspot strategy) in terms of both the rate of return and the utilization rate. Although the modified MDP approach is set up in the single-agent setting, we extend its applicability to multi-agent scenarios by a dynamic adjustment strategy of the order matching probability which is able to partially capture the competition among agents. Furthermore, noticing that the reward function is commonly assumed as some prior knowledge, this dissertation unveils the underlying reward function of the overall e-hailing driver population (i.e., 44,000 Didi drivers in Beijing) through an inverse reinforcement learning method, which paves the way for future research on discovering the underlying reward mechanism in a complex and dynamic ride-hailing market.To better incorporate the competition among agents, this dissertation develops a model-free mean-field multi-agent actor-critic algorithm for multi-driver passenger-seeking. A bilevel optimization model is then formulated with the upper level as a reward design mechanism and the lower level as a multi-agent system. We use the developed mean field multi-agent actor-critic algorithm to solve for the optimal passenger-seeking policies of distributed agents in the lower level and Bayesian optimization to solve for the optimal control of upper-level city planners. The bilevel optimization model is applied to a real-world large-scale multi-class taxi driver repositioning task with congestion pricing as the upper-level control. It is disclosed that the derived optimal toll charge can efficiently improve the objective of city planners.With agents knowing where to go (i.e., passenger-seeking), this dissertation then applies the bilevel optimization model to the research question of how to get there (i.e., route choice). Different from the task of passenger-seeking where the action space is always fixed-dimensional, the problem of variable action set emerges in the task of route choice. Therefore, a flow-dependent deep Q-learning algorithm is proposed to efficiently derive the optimal policies for multi-commodity multi-class agents. We demonstrate the effect of two countermeasures, namely tolling and signal control, on the behavior of travelers and show that the systematic objective of city planners can be optimized by a proper control.
590 $a School code: 0054.
650 4 $a Transportation. $3 555912
650 4 $a Area planning & development. $3 3172430
650 4 $a Artificial intelligence. $3 516317
650 4 $a Civil engineering. $3 860360
650 4 $a Automotive engineering. $3 2181195
650 4 $a Information technology. $3 532993
650 4 $a Public policy. $3 532803
653 $a Bilevel optimization
653 $a Markov decision process
653 $a Multi-agent reinforcement learning
653 $a Passenger-seeking
653 $a Route choice
653 $a Smart cities
653 $a Modernization
653 $a City planners
653 $a E-hailing driver population
690 $a 0709
690 $a 0341
690 $a 0540
690 $a 0543
690 $a 0489
690 $a 0630
690 $a 0454
690 $a 0800
710 2 $a Columbia University. $b Civil Engineering and Engineering Mechanics. $3 2093087
773 0 $t Dissertations Abstracts International $g 82-08B.
790 $a 0054
791 $a Ph.D.
792 $a 2021
793 $a English
856 4 0 $u https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28264909