Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Reinforcement learning (3)
- Vehicle routing problem (3)
- Costs (2)
- Access pattern (1)
- Adaptive large neighborhood searches (1)
-
- Airport ground handling (1)
- Attention model (1)
- Automated Driving System (1)
- Baidu Apollo (1)
- Best response planning (1)
- Bus Schedule Optimization (1)
- Bus Stop (1)
- COST (1)
- Capacitated vehicle routing problem (1)
- Clockwise clustering (1)
- Cloud computing (1)
- Congestion (1)
- Data Driven Approach (1)
- Data Models (1)
- Data infrastructure (1)
- Decomposition-composition (1)
- Demand Constraints (1)
- Dual-server model (1)
- Dynamic Bus Scheduling (1)
- Electric vehicles (1)
- Encryption (1)
- Expectation-maximization (1)
- Generative Flow Network (1)
- Genetic Algorithms (1)
- Geometric range query (1)
Articles 1 - 14 of 14
Full-Text Articles in Physical Sciences and Mathematics
Neural Airport Ground Handling, Yaoxin Wu, Jianan Zhou, Yunwen Xia, Xianli Zhang, Zhiguang Cao, Jie Zhang
Neural Airport Ground Handling, Yaoxin Wu, Jianan Zhou, Yunwen Xia, Xianli Zhang, Zhiguang Cao, Jie Zhang
Research Collection School Of Computing and Information Systems
Airport ground handling (AGH) offers necessary operations to flights during their turnarounds and is of great importance to the efficiency of airport management and the economics of aviation. Such a problem involves the interplay among the operations that leads to NP-hard problems with complex constraints. Hence, existing methods for AGH are usually designed with massive domain knowledge but still fail to yield high-quality solutions efficiently. In this paper, we aim to enhance the solution quality and computation efficiency for solving AGH. Particularly, we first model AGH as a multiple-fleet vehicle routing problem (VRP) with miscellaneous constraints including precedence, time windows, …
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, …
Privacy-Preserving Arbitrary Geometric Range Query In Mobile Internet Of Vehicles, Yinbin Miao, Lin Song, Xinghua Li, Hongwei Li, Kim-Kwang Raymond Choo, Robert H. Deng
Privacy-Preserving Arbitrary Geometric Range Query In Mobile Internet Of Vehicles, Yinbin Miao, Lin Song, Xinghua Li, Hongwei Li, Kim-Kwang Raymond Choo, Robert H. Deng
Research Collection School Of Computing and Information Systems
The mobile Internet of Vehicles (IoVs) has great potential for intelligent transportation, and creates spatial data query demands to realize the value of data. Outsourcing spatial data to a cloud server eliminates the need for local computation and storage, but it leads to data security and privacy threats caused by untrusted third-parties. Existing privacy-preserving spatial range query solutions based on Homomorphic Encryption (HE) have been developed to increase security. However, in the single server model, the private key is held by the query user, which incurs high computation and communication burdens on query users due to multiple rounds of interactions. …
Decentralized Multimedia Data Sharing In Iov: A Learning-Based Equilibrium Of Supply And Demand, Jiani Fan, Minrui Xu, Jiale Guo, Lwin Khin Shar, Jiawen Kang, Dusit Niyato, Kwok-Yan Lam
Decentralized Multimedia Data Sharing In Iov: A Learning-Based Equilibrium Of Supply And Demand, Jiani Fan, Minrui Xu, Jiale Guo, Lwin Khin Shar, Jiawen Kang, Dusit Niyato, Kwok-Yan Lam
Research Collection School Of Computing and Information Systems
The Internet of Vehicles (IoV) has great potential to transform transportation systems by enhancing road safety, reducing traffic congestion, and improving user experience through onboard infotainment applications. Decentralized data sharing can improve security, privacy, reliability, and facilitate infotainment data sharing in IoVs. However, decentralized data sharing may not achieve the expected efficiency if there are IoV users who only want to consume the shared data but are not willing to contribute their own data to the community, resulting in incomplete information observed by other vehicles and infrastructure, which can introduce additional transmission latency. Therefore, in this paper, by modeling the …
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.
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 …
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 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 …
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 …
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 …
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 …
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 …
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 …