Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Adaptive large neighborhood search (1)
- Airport slot scheduling (1)
- Bus bridging design (1)
- Compromise Solution (1)
- Cooperative delivery (1)
-
- Energy consumption (1)
- Gaussian distribution (1)
- Generalized actor critic (1)
- Multi-objective Optimization (1)
- Navigation (1)
- Online Algorithms (1)
- Optimization (1)
- Path-size logit choice (1)
- Pick-up point selection (1)
- Real-time systems (1)
- Reinforcement Learning (1)
- Reliability (1)
- Ride-sourcing (1)
- Routing (1)
- Sample efficiency (1)
- Steep roads (1)
- Stochastic on-time arrival (SOTA) (1)
- Strategic (1)
- Taxi travel behavior (1)
- Transportation (1)
- Trucks and drones (1)
- Urban rail transit disruption (1)
- Variable neighborhood search (1)
- Variance reduction (1)
- Visual analysis (1)
Articles 1 - 7 of 7
Full-Text Articles in Engineering
Path-Choice-Constrained Bus Bridging Design Under Urban Rail Transit Disruptions, Yiyang Zhu, Jian Gang Jin, Hai Wang
Path-Choice-Constrained Bus Bridging Design Under Urban Rail Transit Disruptions, Yiyang Zhu, Jian Gang Jin, Hai Wang
Research Collection School Of Computing and Information Systems
Although urban rail transit systems play a crucial role in urban mobility, they frequently suffer from unexpected disruptions due to power loss, severe weather, equipment failure, and other factors that cause significant disruptions in passenger travel and, in turn, socioeconomic losses. To alleviate the inconvenience of affected passengers, bus bridging services are often provided when rail service has been suspended. Prior research has yielded various methodologies for effective bus bridging services; however, they are mainly based on the strong assumption that passengers must follow predetermined bus bridging routes. Less attention is paid to passengers’ path choice behaviors, which could affect …
Reinforcement Learning For Strategic Airport Slot Scheduling: Analysis Of State Observations And Reward Designs, Anh Nguyen-Duy, Duc-Thinh Pham, Jian-Yi Lye, Nguyen Binh Duong Ta
Reinforcement Learning For Strategic Airport Slot Scheduling: Analysis Of State Observations And Reward Designs, Anh Nguyen-Duy, Duc-Thinh Pham, Jian-Yi Lye, Nguyen Binh Duong Ta
Research Collection School Of Computing and Information Systems
Due to the NP-hard nature, the strategic airport slot scheduling problem is calling for exploring sub-optimal approaches, such as heuristics and learning-based approaches. Moreover, the continuous increase in air traffic demand requires approaches that can work well in new scenarios. While heuristics rely on a fixed set of rules, which limits the ability to explore new solutions, Reinforcement Learning offers a versatile framework to automate the search and generalize to unseen scenarios. Finding a suitable state observation and reward structure design is essential in using Reinforcement Learning. In this paper, we investigate the impact of providing the Reinforcement Learning agent …
Editorial: Emerging On-Demand Passenger And Logistics Systems: Modelling, Optimization, And Data Analytics, Jintao Ke, Hai Wang, Neda Masoud, Maximilian Schiffer, Goncalo H. A. Correia
Editorial: Emerging On-Demand Passenger And Logistics Systems: Modelling, Optimization, And Data Analytics, Jintao Ke, Hai Wang, Neda Masoud, Maximilian Schiffer, Goncalo H. A. Correia
Research Collection School Of Computing and Information Systems
The proliferation of smart personal devices and mobile internet access has fueled numerous advancements in on-demand transportation services. These services are facilitated by online digital platforms and range from providing rides to delivering products. Their influence is transforming transportation systems and leaving a mark on changing individual mobility, activity patterns, and consumption behaviors. For instance, on-demand transportation companies such as Uber, Lyft, Grab, and DiDi have become increasingly vital for meeting urban transportation needs by connecting available drivers with passengers in real time. The recent surge in door-to-door food delivery (e.g., Uber Eats, DoorDash, Meituan); grocery delivery (e.g., Amazon Fresh, …
T-Pickseer: Visual Analysis Of Taxi Pick-Up Point Selection Behavior, Shuxian Gu, Yemo Dai, Zezheng Feng, Yong Wang, Haipeng Zeng
T-Pickseer: Visual Analysis Of Taxi Pick-Up Point Selection Behavior, Shuxian Gu, Yemo Dai, Zezheng Feng, Yong Wang, Haipeng Zeng
Research Collection School Of Computing and Information Systems
Taxi drivers often take much time to navigate the streets to look for passengers, which leads to high vacancy rates and wasted resources. Empty taxi cruising remains a big concern for taxi companies. Analyzing the pick-up point selection behavior can solve this problem effectively, providing suggestions for taxi management and dispatch. Many studies have been devoted to analyzing and recommending hotspot regions of pick-up points, which can make it easier for drivers to pick-up passengers. However, the selection of pick-up points is complex and affected by multiple factors, such as convenience and traffic management. Most existing approaches cannot produce satisfactory …
Multiobjective Stochastic Optimization: A Case Of Real-Time Matching In Ride-Sourcing Markets, Guodong Lyu, Wang Chi Cheung, Chung-Piaw Teo, Hai Wang
Multiobjective Stochastic Optimization: A Case Of Real-Time Matching In Ride-Sourcing Markets, Guodong Lyu, Wang Chi Cheung, Chung-Piaw Teo, Hai Wang
Research Collection School Of Computing and Information Systems
Problem Definition: The job of any marketplace is to facilitate the matching of supply with demand in real-time. Success is often measured using various metrics. The challenge is to design matching algorithms to balance the trade-offs among multiple objectives in a stochastic environment, to arrive at a “compromise” solution, which minimizes say the ℓp-norm-based distance function (for some 1 ≤p ≤∞) between the attained performance metrics and the target performances.Methodology/Results: We observe that the sample-average-approximation formulation of this multi-objective stochastic optimization problem can be solved by an online algorithm that uses only gradient information from “historical” (i.e., past) sample information, …
Cooperative Trucks And Drones For Rural Last-Mile Delivery With Steep Roads, Jiuhong Xiao, Ying Li, Zhiguang Cao, Jianhua Xiao
Cooperative Trucks And Drones For Rural Last-Mile Delivery With Steep Roads, Jiuhong Xiao, Ying Li, Zhiguang Cao, Jianhua Xiao
Research Collection School Of Computing and Information Systems
The cooperative delivery of trucks and drones promises considerable advantages in delivery efficiency and environmental friendliness over pure fossil fuel fleets. As the prosperity of rural B2C e-commerce grows, this study intends to explore the prospect of this cooperation mode for rural last-mile delivery by developing a green vehicle routing problem with drones that considers the presence of steep roads (GVRPD-SR). Realistic energy consumption calculations for trucks and drones that both consider the impacts of general factors and steep roads are incorporated into the GVRPD-SR model, and the objective is to minimize the total energy consumption. To solve the proposed …
Segac: Sample Efficient Generalized Actor Critic For The Stochastic On-Time Arrival Problem, Honglian Guo, Zhi He, Wenda Sheng, Zhiguang Cao, Yingjie Zhou, Weinan Gao
Segac: Sample Efficient Generalized Actor Critic For The Stochastic On-Time Arrival Problem, Honglian Guo, Zhi He, Wenda Sheng, Zhiguang Cao, Yingjie Zhou, Weinan Gao
Research Collection School Of Computing and Information Systems
This paper studies the problem in transportation networks and introduces a novel reinforcement learning-based algorithm, namely. Different from almost all canonical sota solutions, which are usually computationally expensive and lack generalizability to unforeseen destination nodes, segac offers the following appealing characteristics. segac updates the ego vehicle’s navigation policy in a sample efficient manner, reduces the variance of both value network and policy network during training, and is automatically adaptive to new destinations. Furthermore, the pre-trained segac policy network enables its real-time decision-making ability within seconds, outperforming state-of-the-art sota algorithms in simulations across various transportation networks. We also successfully deploy segac …