Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (187)
- Computer Sciences (185)
- Engineering (88)
- Operations Research, Systems Engineering and Industrial Engineering (81)
- Artificial Intelligence and Robotics (61)
-
- Databases and Information Systems (46)
- Numerical Analysis and Scientific Computing (39)
- Theory and Algorithms (26)
- Software Engineering (12)
- Asian Studies (11)
- International and Area Studies (11)
- OS and Networks (9)
- Business (8)
- Information Security (7)
- Computer Engineering (6)
- Operations and Supply Chain Management (3)
- Applied Mathematics (2)
- Law (2)
- Numerical Analysis and Computation (2)
- Technology and Innovation (2)
- Transportation Law (2)
- Urban Studies and Planning (2)
- Computer and Systems Architecture (1)
- Data Science (1)
- Data Storage Systems (1)
- Digital Communications and Networking (1)
- Disability Studies (1)
- Keyword
-
- Optimization (10)
- Transportation (9)
- Reinforcement learning (8)
- Vehicle routing problem (8)
- Vehicle routing (7)
-
- Singapore (6)
- Public transportation (5)
- Ride-sourcing (5)
- Routing (5)
- Road traffic (4)
- Scheduling (4)
- Artificial intelligence (3)
- Decision making (3)
- Decoding (3)
- Genetic algorithm (3)
- Labor supply (3)
- Mixed integer programming (3)
- Reliability (3)
- Road network (3)
- Road networks (3)
- Taxicabs (3)
- Taxis (3)
- Traffic control (3)
- Transportation network (3)
- Adaptive large neighborhood search (2)
- Adaptive sampling (2)
- Algorithm (2)
- Analytical models (2)
- Anomaly detection (2)
- Arriving on time (2)
Articles 31 - 60 of 203
Full-Text Articles in Transportation
Spatial Data Management For Green Mobility, Christophe Claramunt, Christine Bassem, Demetrios Zeinalipour-Yazti, Baihua Zheng, Goce Trajcevski, Kristian Torp
Spatial Data Management For Green Mobility, Christophe Claramunt, Christine Bassem, Demetrios Zeinalipour-Yazti, Baihua Zheng, Goce Trajcevski, Kristian Torp
Research Collection School Of Computing and Information Systems
While many countries are developing appropriate actions towards a greener future and moving towards adopting sustainable mobility activities, the real-time management and planning of innovative transportation facilities and services in urban environments still require the development of advanced mobile data management infrastructures. Novel green mobility solutions, such as electric, hybrid, solar and hydrogen vehicles, as well as public and gig-based transportation resources are very likely to reduce the carbon footprint. However, their successful implementation still needs efficient spatio-temporal data management resources and applications to provide a clear picture and demonstrate their effectiveness. This paper discusses the major data management challenges, …
Quantifying Taxi Drivers' Behaviors With Behavioral Game Theory, Mengyu Ji, Yuhong Xu, Shih-Fen Cheng
Quantifying Taxi Drivers' Behaviors With Behavioral Game Theory, Mengyu Ji, Yuhong Xu, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
With their flexibility and convenience, taxis play a vital role in urban transportation systems. Understanding how human drivers make decisions in a context of uncertainty and competition is crucial for taxi fleets that depend on drivers to provide their services. As part of this paper, we propose modeling taxi drivers’ behaviors based on behavioral game theory. Based on real-world data, we demonstrate that the behavioral game theory model we select is superior to state-of-the-art baselines. These results provide a solid foundation for improving taxi fleet efficiency in the future.
Understanding Multi-Homing And Switching By Platform Drivers, Xiaotong Guo, Andreas Haupt, Hai Wang, Rida Qadri, Jinhua Zhao
Understanding Multi-Homing And Switching By Platform Drivers, Xiaotong Guo, Andreas Haupt, Hai Wang, Rida Qadri, Jinhua Zhao
Research Collection School Of Computing and Information Systems
Freelance drivers in the shared mobility market frequently switch or work for multiple platforms, affecting driver labor supply. Due to the importance of driver labor supply for the shared mobility market, understanding drivers’ switching and multi-homing behavior is vital to managing service quality on – and effective regulation of – mobility platforms. However, a lack of individual-level data on driver behavior has thus far impeded a deeper understanding. This paper taxonomizes and estimates perceived switching and multi-homing frictions on mobility platforms. Based on a structural model of driver labor supply, we estimate switching and multi-homing costs in a platform duopoly …
An Adaptive Large Neighborhood Search For Heterogeneous Vehicle Routing Problem With Time Windows, Minh Pham Kien Nguyen, Aldy Gunawan, Vincent F. Yu, Mustafa Misir
An Adaptive Large Neighborhood Search For Heterogeneous Vehicle Routing Problem With Time Windows, Minh Pham Kien Nguyen, Aldy Gunawan, Vincent F. Yu, Mustafa Misir
Research Collection School Of Computing and Information Systems
The heterogeneous vehicle routing problem with time windows (HVRPTW) employs various vehicles with different capacities to serve upcoming pickup and delivery orders. We introduce a HVRPTW variant for reflecting the practical needs of crowd-shipping by considering the mass-rapid-transit stations, as the additional terminal points. A mixed integer linear programming model is formulated. An Adaptive Large Neighborhood Search based meta-heuristic is also developed by utilizing a basic probabilistic selection strategy, i.e. roulette wheel, and Simulated Annealing. The proposed approach is empirically evaluated on a new set of benchmark instances. The computational results revealed that ALNS shows its clear advantage on the …
Vehicle Routing Problem With Parcel Locker And Public Transportation: Goods Delivery Using Mass-Rapid-Transit System, Pham K.M. Nguyen, Vincent F. Yu, Aldy Gunawan
Vehicle Routing Problem With Parcel Locker And Public Transportation: Goods Delivery Using Mass-Rapid-Transit System, Pham K.M. Nguyen, Vincent F. Yu, Aldy Gunawan
Research Collection School Of Computing and Information Systems
The logistics industry is experiencing significant transformations with the emergence of modern technologies, well-established civil infrastructure, and mixed transportation methods. These changes are driven by the increase in mobility, sustainability, and eco-friendliness of logistics processes. As a result, recent works have focused on incorporating mixed fleets and omnichannel systems to the original vehicle routing problem which boosts the delivery system's efficiency, effectiveness, reliability, and customer satisfaction while reducing operational costs simultaneously. We augment the existing studies by proposing a new mathematical model that combines common mass rapid transit systems and delivery fleets to solve the traditional vehicle routing problem with …
A Lightweight Privacy-Preserving Path Selection Scheme In Vanets, Guojun Wang, Huijie Yang
A Lightweight Privacy-Preserving Path Selection Scheme In Vanets, Guojun Wang, Huijie Yang
Research Collection School Of Computing and Information Systems
With the rapid development of edge computing, artificial intelligence and other technologies, intelligent transportation services in the vehicular ad hoc networks (VANETs) such as in-vehicle navigation and distress alert are increasingly being widely used in life. Currently, road navigation is an essential service in the vehicle network. However, when a user employs the road navigation service, his private data maybe exposed to roadside nodes. Meanwhile, when the trusted authorization sends the navigation route data to the user, the user can obtain all the road data. Especially, other unrequested data might be related to the military. Therefore, how to achieve secure …
Imitation Improvement Learning For Large-Scale Capacitated Vehicle Routing Problems, The Viet Bui, Tien Mai
Imitation Improvement Learning For Large-Scale Capacitated Vehicle Routing Problems, The Viet Bui, Tien Mai
Research Collection School Of Computing and Information Systems
Recent works using deep reinforcement learning (RL) to solve routing problems such as the capacitated vehicle routing problem (CVRP) have focused on improvement learning-based methods, which involve improving a given solution until it becomes near-optimal. Although adequate solutions can be achieved for small problem instances, their efficiency degrades for large-scale ones. In this work, we propose a newimprovement learning-based framework based on imitation learning where classical heuristics serve as experts to encourage the policy model to mimic and produce similar or better solutions. Moreover, to improve scalability, we propose Clockwise Clustering, a novel augmented framework for decomposing large-scale CVRP into …
Testing Automated Driving Systems By Breaking Many Laws Efficiently, Xiaodong Zhang, Wei Zhao, Yang Sun, Jun Sun, Yulong Shen, Xuewen Dong, Zijiang Yang
Testing Automated Driving Systems By Breaking Many Laws Efficiently, Xiaodong Zhang, Wei Zhao, Yang Sun, Jun Sun, Yulong Shen, Xuewen Dong, Zijiang Yang
Research Collection School Of Computing and Information Systems
An automated driving system (ADS), as the brain of an autonomous vehicle (AV), should be tested thoroughly ahead of deployment. ADS must satisfy a complex set of rules to ensure road safety, e.g., the existing traffic laws and possibly future laws that are dedicated to AVs. To comprehensively test an ADS, we would like to systematically discover diverse scenarios in which certain traffic law is violated. The challenge is that (1) there are many traffic laws (e.g., 13 testable articles in Chinese traffic laws and 16 testable articles in Singapore traffic laws, with 81 and 43 violation situations respectively); and …
Estimation Of Recursive Route Choice Models With Incomplete Trip Observations, Tien Mai, The Viet Bui, Quoc Phong Nguyen, Tho V. Le
Estimation Of Recursive Route Choice Models With Incomplete Trip Observations, Tien Mai, The Viet Bui, Quoc Phong Nguyen, Tho V. Le
Research Collection School Of Computing and Information Systems
This work concerns the estimation of recursive route choice models in the situation that the trip observations are incomplete, i.e., there are unconnected links (or nodes) in the observations. A direct approach to handle this issue could be intractable because enumerating all paths between unconnected links (or nodes) in a real network is typically not possible. We exploit an expectation–maximization (EM) method that allows dealing with the missing-data issue by alternatively performing two steps of sampling the missing segments in the observations and solving maximum likelihood estimation problems. Moreover, observing that the EM method could be expensive, we propose a …
A Data-Driven Approach For Scheduling Bus Services Subject To Demand Constraints, Brahmanage Janaka Chathuranga Thilakarathna, Thivya Kandappu, Baihua Zheng
A Data-Driven Approach For Scheduling Bus Services Subject To Demand Constraints, Brahmanage Janaka Chathuranga Thilakarathna, Thivya Kandappu, Baihua Zheng
Research Collection School Of Computing and Information Systems
Passenger satisfaction is extremely important for the success of a public transportation system. Many studies have shown that passenger satisfaction strongly depends on the time they have to wait at the bus stop (waiting time) to get on a bus. To be specific, user satisfaction drops faster as the waiting time increases. Therefore, service providers want to provide a bus to the waiting passengers within a threshold to keep them satisfied. It is a two-pronged problem: (a) to satisfy more passengers the transport planner may increase the frequency of the buses, and (b) in turn, the increased frequency may impact …
Optimization Of Station-Skip In A Cyclic Express Subway Service, Jingfeng Yang, Hai Wang, Jiangang Jin
Optimization Of Station-Skip In A Cyclic Express Subway Service, Jingfeng Yang, Hai Wang, Jiangang Jin
Research Collection School Of Computing and Information Systems
With rapid population growth and increasing demand for urban mobility, metropolitan areas such as Singapore, Tokyo, and Shanghai are increasingly dependent on public transport systems. Various strategies are proposed to improve the service quality and capacity of bus and subway systems. Express trains—i.e., trains that skip certain stations—are commonly used because they can travel at higher speeds, potentially reduce travel time, and serve more passengers. In this paper, we study cyclic express subway service (CESS), in which express trains provide routine transport service with cyclic (periodic) station-skip patterns that can be used in daily service. We propose an exact Mixed …
Editorial: Innovative Shared Transportation, Marco Nie, Hai Wang, Wai Yuen Szeto
Editorial: Innovative Shared Transportation, Marco Nie, Hai Wang, Wai Yuen Szeto
Research Collection School Of Computing and Information Systems
Recent technological developments—mobile computing, autonomous driving, alternative fuel vehicles, and blockchain, to name a few—have enabled numerous innovations in mobility, transportation, and logistics services. They offer unprecedented opportunities to transform conventional transportation systems, for both personal travel and freight logistics, with novel solutions. Of these solutions, those built on the emerging concept of shared economy, such as Uber, Didi, and Cargostream, have received much attention recently. The rapidly expanding scope of shared transportation services now includes ride-sourcing, ridesharing, car sharing, hitch service, flexible paratransit, shared freight delivery, shared logistics, bike sharing, shared last-mile service, parking space sharing, and so on.
Introduction To The Special Issue On Innovation In Transportation-Enabled Urban Services, Part 1, Niels Agatz, Soo-Haeng Cho, Hai Wang, Saif Benjaafar
Introduction To The Special Issue On Innovation In Transportation-Enabled Urban Services, Part 1, Niels Agatz, Soo-Haeng Cho, Hai Wang, Saif Benjaafar
Research Collection School Of Computing and Information Systems
Rapid developments in city infrastructure and technol-ogies are creating numerous opportunities and inspiring innovative and emerging urban services. Among these innovations, complex systems of urban transportation and logistics have embraced advances and have been reshaped significantly. They enable innovative new urban services, which are now booming and changing everyday life for urban residents.This special issue of Service Science explores perspectives on innovation in transportation-enabled urban services. We hope that the special issue will enhance the understanding of the planning, operation, and management of such services. Contributions are expected to demonstrate rigorous model development, economic/ econometric analysis, and decision-making tools based …
Neighborhood Retail Amenities And Taxi Trip Behavior: A Natural Experiment In Singapore, Kwan Ok Lee, Shih-Fen Cheng
Neighborhood Retail Amenities And Taxi Trip Behavior: A Natural Experiment In Singapore, Kwan Ok Lee, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
While a small change in land use planning in existing neighborhoods may significantly reduce private vehicle trips, we do not have a great understanding of the magnitude of the project- and shock-based causal change in travel behaviors, especially for the retail purpose. We analyze the impact of newly developed malls on the retail trip behavior of nearby residents for shopping, dining or services. Using the difference-in-differences approach and big data from a major taxi company in Singapore, we find that households residing within 800 m from a new mall are significantly less likely to take taxis to other retail destinations …
A Diversity-Enhanced Memetic Algorithm For Solving Electric Vehicle Routing Problems With Time Windows And Mixed Backhauls, Jianhua Xiao, Jingguo Du, Zhiguang Cao, Xingyi Zhang, Yunyun Niu
A Diversity-Enhanced Memetic Algorithm For Solving Electric Vehicle Routing Problems With Time Windows And Mixed Backhauls, Jianhua Xiao, Jingguo Du, Zhiguang Cao, Xingyi Zhang, Yunyun Niu
Research Collection School Of Computing and Information Systems
The electric vehicle routing problem (EVRP) has been studied increasingly because of environmental concerns. However, existing studies on the EVRP mainly focus on time windows and sole linehaul customers, which might not be practical as backhaul customers are also ubiquitous in reality. In this study, we investigate an EVRP with time windows and mixed backhauls (EVRPTWMB), where both linehaul and backhaul customers exist and can be served in any order. To address this challenging problem, we propose a diversity-enhanced memetic algorithm (DEMA) that integrates three types of novel operators, including genetic operators based on adaptive selection mechanism, a selection operator …
Coordinating Multi-Party Vehicle Routing With Location Congestion Via Iterative Best Response, Waldy Joe, Hoong Chuin Lau
Coordinating Multi-Party Vehicle Routing With Location Congestion Via Iterative Best Response, Waldy Joe, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
This work is motivated by a real-world problem of coordinating B2B pickup-delivery operations to shopping malls involving multiple non-collaborative logistics service providers (LSPs) in a congested city where space is scarce. This problem can be categorized as a vehicle routing problem with pickup and delivery, time windows and location congestion with multiple LSPs (or ML-VRPLC in short), and we propose a scalable, decentralized, coordinated planning approach via iterative best response. We formulate the problem as a strategic game where each LSP is a self-interested agent but is willing to participate in a coordinated planning as long as there are sufficient …
Lawbreaker: An Approach For Specifying Traffic Laws And Fuzzing Autonomous Vehicles, Yang Sun, Christopher M. Poskitt, Jun Sun, Yuqi Chen, Zijiang Yang
Lawbreaker: An Approach For Specifying Traffic Laws And Fuzzing Autonomous Vehicles, Yang Sun, Christopher M. Poskitt, Jun Sun, Yuqi Chen, Zijiang Yang
Research Collection School Of Computing and Information Systems
Autonomous driving systems (ADSs) must be tested thoroughly before they can be deployed in autonomous vehicles. High-fidelity simulators allow them to be tested against diverse scenarios, including those that are difficult to recreate in real-world testing grounds. While previous approaches have shown that test cases can be generated automatically, they tend to focus on weak oracles (e.g. reaching the destination without collisions) without assessing whether the journey itself was undertaken safely and satisfied the law. In this work, we propose LawBreaker, an automated framework for testing ADSs against real-world traffic laws, which is designed to be compatible with different scenario …
Towards An Optimal Bus Frequency Scheduling: When The Waiting Time Matters, Songsong Mo, Zhifeng Bao, Baihua Zheng, Zhiyong Peng
Towards An Optimal Bus Frequency Scheduling: When The Waiting Time Matters, Songsong Mo, Zhifeng Bao, Baihua Zheng, Zhiyong Peng
Research Collection School Of Computing and Information Systems
Reorganizing bus frequencies to cater for actual travel demands can significantly save the cost of the public transport system. This paper studies the bus frequency optimization problem considering the user satisfaction. Specifically, for the first time to our best knowledge, we study how to schedule the buses such that the total number of passengers who could receive their bus services within the waiting time threshold can be maximized. We propose two variants of the problem, FAST and FASTCO, to cater for different application needs and prove that both are NP-hard. To solve FAST effectively and efficiently, we first present an …
Learning To Solve Multiple-Tsp With Time Window And Rejections Via Deep Reinforcement Learning, Rongkai Zhang, Cong Zhang, Zhiguang Cao, Wen Song, Puay Siew Tan, Jie Zhang, Bihan Wen, Justin Dauwels
Learning To Solve Multiple-Tsp With Time Window And Rejections Via Deep Reinforcement Learning, Rongkai Zhang, Cong Zhang, Zhiguang Cao, Wen Song, Puay Siew Tan, Jie Zhang, Bihan Wen, Justin Dauwels
Research Collection School Of Computing and Information Systems
We propose a manager-worker framework (the implementation of our model is publically available at: https://github.com/zcaicaros/manager-worker-mtsptwr) based on deep reinforcement learning to tackle a hard yet nontrivial variant of Travelling Salesman Problem (TSP), i.e. multiple-vehicle TSP with time window and rejections (mTSPTWR), where customers who cannot be served before the deadline are subject to rejections. Particularly, in the proposed framework, a manager agent learns to divide mTSPTWR into sub-routing tasks by assigning customers to each vehicle via a Graph Isomorphism Network (GIN) based policy network. A worker agent learns to solve sub-routing tasks by minimizing the cost in terms of both …
Fed-Ltd: Towards Cross-Platform Ride Hailing Via Federated Learning To Dispatch, Yansheng Wang, Yongxin Tong, Zimu Zhou, Ziyao Ren, Yi Xu, Guobin Wu, Weifeng Lv
Fed-Ltd: Towards Cross-Platform Ride Hailing Via Federated Learning To Dispatch, Yansheng Wang, Yongxin Tong, Zimu Zhou, Ziyao Ren, Yi Xu, Guobin Wu, Weifeng Lv
Research Collection School Of Computing and Information Systems
Learning based order dispatching has witnessed tremendous success in ride hailing. However, the success halts within individual ride hailing platforms because sharing raw order dispatching data across platforms may leak user privacy and business secrets. Such data isolation not only impairs user experience but also decreases the potential revenues of the platforms. In this paper, we advocate federated order dispatching for cross-platform ride hailing, where multiple platforms collaboratively make dispatching decisions without sharing their local data. Realizing this concept calls for new federated learning strategies that tackle the unique challenges on effectiveness, privacy and efficiency in the context of order …
Order Constraints In Optimal Transport, Fabian Lim, Laura Wynter, Shiau Hong Lim
Order Constraints In Optimal Transport, Fabian Lim, Laura Wynter, Shiau Hong Lim
Research Collection School Of Computing and Information Systems
Optimal transport is a framework for comparing measures whereby a cost is incurred for transporting one measure to another. Recent works have aimed to improve optimal transport plans through the introduction of various forms of structure. We introduce novel order constraints into the optimal transport formulation to allow for the incorporation of structure. We define an efficient method for obtaining explainable solutions to the new formulation that scales far better than standard approaches. The theoretical properties of the method are provided. We demonstrate experimentally that order constraints improve explainability using the e-SNLI (Stanford Natural Language Inference) dataset that includes human-annotated …
Multi-Agent Reinforcement Learning For Traffic Signal Control Through Universal Communication Method, Qize Jiang, Minhao Qin, Shengmin Shi, Weiwei Sun Sun, Baihua Zheng
Multi-Agent Reinforcement Learning For Traffic Signal Control Through Universal Communication Method, Qize Jiang, Minhao Qin, Shengmin Shi, Weiwei Sun Sun, Baihua Zheng
Research Collection School Of Computing and Information Systems
How to coordinate the communication among intersections effectively in real complex traffic scenarios with multi-intersection is challenging. Existing approaches only enable the communication in a heuristic manner without considering the content/importance of information to be shared. In this paper, we propose a universal communication form UniComm between intersections. UniComm embeds massive observations collected at one agent into crucial predictions of their impact on its neighbors, which improves the communication efficiency and is universal across existing methods. We also propose a concise network UniLight to make full use of communications enabled by UniComm. Experimental results on real datasets demonstrate that UniComm …
Time Dependent Orienteering Problem With Time Windows And Service Time Dependent Profits, M. Khodadadian, A. Divsalar, C. Verbeeck, Aldy Gunawan, P. Vansteenwegen
Time Dependent Orienteering Problem With Time Windows And Service Time Dependent Profits, M. Khodadadian, A. Divsalar, C. Verbeeck, Aldy Gunawan, P. Vansteenwegen
Research Collection School Of Computing and Information Systems
This paper addresses the time dependent orienteering problem with time windows and service time dependent profits (TDOPTW-STP). In the TDOPTW-STP, each vertex is assigned a minimum and a maximum service time and the profit collected at each vertex increases linearly with the service time. The goal is to maximize the total collected profit by determining a subset of vertices to be visited and assigning appropriate service time to each vertex, considering a given time budget and time windows. Moreover, travel times are dependent of the departure times. To solve this problem, a mixed integer linear model is formulated and a …
Transportation-Enabled Urban Services: A Brief Discussion, Hai Wang
Transportation-Enabled Urban Services: A Brief Discussion, Hai Wang
Research Collection School Of Computing and Information Systems
Nearly 55% of the world's population lives in urban areas or cities, and is expected to rise above 70% over the coming decades. Rapid urbanization brings steadily more residents and a growing freelancing workforce into cities. The developments of city infrastructure and technologies—for instance, mobile location tracking and computing, autonomous and connected vehicles, wearable devices, robotics and robots, smart appliances, biometric authentication, various internet-of-things devices, and smart monitoring systems—are creating numerous opportunities and inspiring innovative and emerging urban services. Among these innovations, complex systems of urban transportation and logistics have embraced advances in technologies and, consequently, been significantly reshaped (Agatz …
Hierarchical Value Decomposition For Effective On-Demand Ride Pooling, Hao Jiang, Pradeep Varakantham
Hierarchical Value Decomposition For Effective On-Demand Ride Pooling, Hao Jiang, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
On-demand ride-pooling (e.g., UberPool, GrabShare) services focus on serving multiple different customer requests using each vehicle, i.e., an empty or partially filled vehicle can be assigned requests from different passengers with different origins and destinations. On the other hand, in Taxi on Demand (ToD) services (e.g., UberX), one vehicle is assigned to only one request at a time. On-demand ride pooling is not only beneficial to customers (lower cost), drivers (higher revenue per trip) and aggregation companies (higher revenue), but is also of crucial importance to the environment as it reduces the number of vehicles required on the roads. Since …
Neighborhood Cooperative Multiagent Reinforcement Learning For Adaptive Traffic Signal Control In Epidemic Regions, Chengwei Zhang, Yu Tian, Zhibin Zhang, Wanli Xue, Xiaofei Xie, Tianpei Yang, Xin Ge, Rong Chen
Neighborhood Cooperative Multiagent Reinforcement Learning For Adaptive Traffic Signal Control In Epidemic Regions, Chengwei Zhang, Yu Tian, Zhibin Zhang, Wanli Xue, Xiaofei Xie, Tianpei Yang, Xin Ge, Rong Chen
Research Collection School Of Computing and Information Systems
Nowadays, multiagent reinforcement learning (MARL) have shared significant advances in the adaptive traffic signal control (ATSC) problems. For most of the researches, agents are all isomorphic, which disregards the situation in which isomerous intersections cooperative together in a real ATSC scenario, especially in epidemic regions where different intersections have quite different levels of importance. To this end, this paper models the ATSC problem as a networked Markov game (NMG), in which agents take into account information, including traffic conditions of it and its connected neighbors. A cooperative MARL framework named neighborhood cooperative hysteretic DQN (NC-HDQN) is proposed. Specifically, for each …
Undiscounted Recursive Path Choice Models: Convergence Properties And Algorithms, Tien Mai, Emma Frejinger
Undiscounted Recursive Path Choice Models: Convergence Properties And Algorithms, Tien Mai, Emma Frejinger
Research Collection School Of Computing and Information Systems
Traffic flow predictions are central to a wealth of problems in transportation. Path choice models can be used for this purpose, and in state-of-the-art models—so-called recursive path choice (RPC) models—the choice of a path is formulated as a sequential arc choice process using undiscounted Markov decision process (MDP) with an absorbing state. The MDP has a utility maximization objective with unknown parameters that are estimated based on data. The estimation and prediction using RPC models require repeatedly solving value functions that are solutions to the Bellman equation. Although there are several examples of successful applications of RPC models in the …
Competition And Third-Party Platform-Integration In Ride-Sourcing Markets, Yaqian Zhou, Hai Yang, Jintao Ke, Hai Wang, Xinwei Li
Competition And Third-Party Platform-Integration In Ride-Sourcing Markets, Yaqian Zhou, Hai Yang, Jintao Ke, Hai Wang, Xinwei Li
Research Collection School Of Computing and Information Systems
Recently, some third-party integrators attempt to integrate the ride services offered by multiple independent ride-sourcing platforms. Accordingly, passengers can request ride through the integrators and receive ride service from any one of the ride-sourcing platforms. This novel business model, termed as third-party platform-integration in this work, has potentials to alleviate market fragmentation cost resulting from demand splitting among multiple platforms. Although most existing studies focus on operation strategies for one single monopolist platform, much less is known about the competition and platform-integration and their implications on operation strategy and system efficiency. In this work, we propose mathematical models to describe …
A Survey On Modern Deep Neural Network For Traffic Prediction: Trends, Methods And Challenges, David Alexander Tedjopumomo, Zhifeng Bao, Baihua Zheng, Farhana Murtaza Choudhury, Kai Qin
A Survey On Modern Deep Neural Network For Traffic Prediction: Trends, Methods And Challenges, David Alexander Tedjopumomo, Zhifeng Bao, Baihua Zheng, Farhana Murtaza Choudhury, Kai Qin
Research Collection School Of Computing and Information Systems
In this modern era, traffic congestion has become a major source of negative economic and environmental impact for urban areas worldwide. One of the most efficient ways to mitigate traffic congestion is through future traffic prediction. The field of traffic prediction has evolved greatly ever since its inception in the late 70s. Earlier studies mainly use classical statistical models such as ARIMA and its variants. Then, researchers started to focus on machine learning models due to their power and flexibility. As theoretical and technological advances emerge, we enter the era of deep neural network, which gained popularity due to its …
Heterogeneous Attentions For Solving Pickup And Delivery Problem Via Deep Reinforcement Learning, Jingwen Li, Liang Xin, Zhiguang Cao, Andrew Lim, Wen Song, Jie Zhang
Heterogeneous Attentions For Solving Pickup And Delivery Problem Via Deep Reinforcement Learning, Jingwen Li, Liang Xin, Zhiguang Cao, Andrew Lim, Wen Song, Jie Zhang
Research Collection School Of Computing and Information Systems
Recently, there is an emerging trend to apply deep reinforcement learning to solve the vehicle routing problem (VRP), where a learnt policy governs the selection of next node for visiting. However, existing methods could not handle well the pairing and precedence relationships in the pickup and delivery problem (PDP), which is a representative variant of VRP. To address this challenging issue, we leverage a novel neural network integrated with a heterogeneous attention mechanism to empower the policy in deep reinforcement learning to automatically select the nodes. In particular, the heterogeneous attention mechanism specifically prescribes attentions for each role of the …