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 151 - 180 of 203
Full-Text Articles in Transportation
Achieving Economic And Environmental Sustainabilities In Urban Consolidation Center With Bicriteria Auction, Stephanus Daniel Handoko, Hoong Chuin Lau, Shih-Fen Cheng
Achieving Economic And Environmental Sustainabilities In Urban Consolidation Center With Bicriteria Auction, Stephanus Daniel Handoko, Hoong Chuin Lau, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
Consolidation lies at the heart of the last-mile logistics problem. Urban consolidation centers (UCCs) have been set up to facilitate such consolidation all over the world. To the best of our knowledge, most-if not all-of the UCCs operate on volume-based fixed-rate charges. To achieve environmental sustainability while ensuring economic sustainability in urban logistics, we propose, in this paper, a bicriteria auction mechanism for the automated assignment of last-mile delivery orders to transport resources. We formulate and solve the winner determination problem of the auction as a biobjective programming model. We then present a systematic way to generate the Pareto frontier …
Improving Carbon Efficiency Through Container Size Optimization And Shipment Consolidation, Nang Laik Ma, Kar Way Tan, Edwin Lik Ming Chong
Improving Carbon Efficiency Through Container Size Optimization And Shipment Consolidation, Nang Laik Ma, Kar Way Tan, Edwin Lik Ming Chong
Research Collection School Of Computing and Information Systems
Purpose: Many manufacturing companies that ship goods through full container loads found themselves under-utilizing the containers and resulting in higher carbon footprint per volume shipment. One of the reasons is the choice of non-ideal container sizes for their shipments. Consolidation fills up the containers more efficiently that reduces the overall carbon footprint. The objective of this paper is to support decisions on selection of appropriate combination of container sizes and shipment consolidation for a manufacturing company. We develop two-steps model which first takes the volumes to be shipped as an input and provide the combination of container sizes required; then …
Singapore In Motion: Insights On Public Transport Service Level Through Farecard And Mobile Data Analytics, Hasan Poonawala, Vinay Kolar, Sebastien Blandin, Laura Wynter, Sambit Sahu
Singapore In Motion: Insights On Public Transport Service Level Through Farecard And Mobile Data Analytics, Hasan Poonawala, Vinay Kolar, Sebastien Blandin, Laura Wynter, Sambit Sahu
Research Collection School Of Computing and Information Systems
Given the changing dynamics of mobility patterns and rapid growth of cities, transport agencies seek to respond more rapidly to needs of the public with the goal of offering an effective and competitive public transport system. A more data-centric approach for transport planning is part of the evolution of this process. In particular, the vast penetration of mobile phones provides an opportunity to monitor and derive insights on transport usage. Real time and historical analyses of such data can give a detailed understanding of mobility patterns of people and also suggest improvements to current transit systems. On its own, however, …
Robust Repositioning To Counter Unpredictable Demand In Bike Sharing Systems, Supriyo Ghosh, Michael Trick, Pradeep Varakantham
Robust Repositioning To Counter Unpredictable Demand In Bike Sharing Systems, Supriyo Ghosh, Michael Trick, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
Bike Sharing Systems (BSSs) experience a significant loss in customer demand due to starvation (empty base stations precluding bike pickup) or congestion (full base stations precluding bike return). Therefore, BSSs operators reposition bikes between stations with the help of carrier vehicles. Due to unpredictable and dynamically changing nature of the demand, myopic reasoning typically provides a below par performance. We propose an online and robust repositioning approach to minimise the loss in customer demand while considering the possible uncertainty in future demand. Specifically, we develop a scenario generation approach based on an iterative two player game to compute a strategy …
Approximating The Performance Of A "Last Mile" Transportation System, Hai Wang, Amedeo Odoni
Approximating The Performance Of A "Last Mile" Transportation System, Hai Wang, Amedeo Odoni
Research Collection School Of Computing and Information Systems
The Last Mile Problem (LMP) refers to the provision of travel service from the nearest public transportation node to a home or office. We study the supply side of this problem in a stochastic setting, with batch demands resulting from the arrival of groups of passengers who request last-mile service at urban rail stations or bus stops. Closedform approximations are derived for the performance of Last Mile Transportations Systems as a function of the fundamental design parameters of such systems. An initial set of results is obtained for the case in which a fleet of vehicles of unit capacity provides …
Patrol Scheduling In An Urban Rail Network, Hoong Chuin Lau, Zhi Yuan, Aldy Gunawan
Patrol Scheduling In An Urban Rail Network, Hoong Chuin Lau, Zhi Yuan, Aldy Gunawan
Research Collection School Of Computing and Information Systems
This paper presents the problem of scheduling security teams to patrol a mass rapid transit rail network of a large urban city. The main objective of patrol scheduling is to deploy security teams to stations of the network at varying time periods subject to rostering as well as security-related constraints. We present several mathematical programming models for different variants of this problem. To generate randomized schedules on a regular basis, we propose injecting randomness by varying the start time and break time for each team as well as varying the visit frequency and visit time for each station according to …
Detection Of Bird Nests In Overhead Catenary System Images For High-Speed Rail, Xiao Wu, Ping Yuan, Qiang Peng, Chong-Wah Ngo, Jun-Yan He
Detection Of Bird Nests In Overhead Catenary System Images For High-Speed Rail, Xiao Wu, Ping Yuan, Qiang Peng, Chong-Wah Ngo, Jun-Yan He
Research Collection School Of Computing and Information Systems
The high-speed rail system provides a fast, reliable and comfortable means to transport large number of travelers over long distances. The existence of bird nests in overhead catenary system (OCS) can hazard to the safety of the high-speed rails, which will potentially result in long time delays and expensive damages. A vision-based intelligent inspection system capable of automatic detection of bird nests built on overhead catenary would avoid the damages and increase the reliability and punctuality, and therefore is attractive for a high-speed railway system. However, OCS images exhibit great variations with lighting changes, illumination conditions and complex backgrounds, which …
Online Spatio-Temporal Matching In Stochastic And Dynamic Domains, Meghna Lowalekar, Pradeep Varakantham, Patrick Jaillet
Online Spatio-Temporal Matching In Stochastic And Dynamic Domains, Meghna Lowalekar, Pradeep Varakantham, Patrick Jaillet
Research Collection School Of Computing and Information Systems
Spatio-temporal matching of services to customers online is a problem that arises on a large scale in many domains associated with shared transportation (ex: taxis, ride sharing, super shuttles, etc.) and delivery services (ex: food, equipment, clothing, home fuel, etc.). A key characteristic of these problems is that matching of services to customers in one round has a direct impact on the matching of services to customers in the next round. For instance, in the case of taxis, in the second round taxis can only pick up customers closer to the drop off point of the customer from the first …
Ict-Travel: Mobile Public Transport Companion For The Visually Impaired, Linting Cui, Kenny Ngo, Benjamin Kok Siew Gan
Ict-Travel: Mobile Public Transport Companion For The Visually Impaired, Linting Cui, Kenny Ngo, Benjamin Kok Siew Gan
Research Collection School Of Computing and Information Systems
The smartphone application widespread adoption has brought about many conveniences to the general population. Unfortunately, like most technology adoption, the focus lacks behind for people with disabilities. Yet, the potential for IT to personalize the mobile application for these groups is high. In our capstone project at Singapore Management University, we developed an iOS application for the visually impaired to use the public transport in Singapore. Beyond meeting the initial requirements, we tested with the visually impaired in order to empathize and cater to their specific needs. This software engineering project is a lesson in iterative software development with changing …
Efficient Collective Spatial Keyword Query Processing On Road Networks, Yunjun Gao, Jingwen Zhao, Baihua Zheng, Gang Chen
Efficient Collective Spatial Keyword Query Processing On Road Networks, Yunjun Gao, Jingwen Zhao, Baihua Zheng, Gang Chen
Research Collection School Of Computing and Information Systems
The collective spatial keyword query (CSKQ), an important variant of spatial keyword queries, aims to find a set of the objects that collectively cover users' queried keywords, and those objects are close to the query location and have small inter-object distances. Existing works only focus on the CSKQ problem in the Euclidean space, although we observe that, in many real-life applications, the closeness of two spatial objects is measured by their road network distance. Thus, existing methods cannot solve the problem of network-based CSKQ efficiently. In this paper, we study the problem of collective spatial keyword query processing on road …
Where Are The Passengers? A Grid-Based Gaussian Mixture Model For Taxi Bookings, Meng-Fen Chiang, Tuan Anh Hoang, Ee-Peng Lim
Where Are The Passengers? A Grid-Based Gaussian Mixture Model For Taxi Bookings, Meng-Fen Chiang, Tuan Anh Hoang, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
Taxi bookings are events where requests for taxis are made by passengers either over voice calls or mobile apps. As the demand for taxis changes with space and time, it is important to model both the space and temporal dimensions in dynamic booking data. Several applications can benefit from a good taxi booking model. These include the prediction of number of bookings at certain location and time of the day, and the detection of anomalous booking events. In this paper, we propose a Grid-based Gaussian Mixture Model (GGMM) with spatio-temporal dimensions that groups booking data into a number of spatio-temporal …
Designing Bus Transit Services For Routine Crowd Situations At Large Event Venues, Jianli Du, Shih-Fen Cheng, Hoong Chuin Lau
Designing Bus Transit Services For Routine Crowd Situations At Large Event Venues, Jianli Du, Shih-Fen Cheng, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
We are concerned with the routine crowd management problem after a major event at a known venue. Without properly design complementary transport services, such sudden crowd build-ups will overwhelm the existing infrastructure. In this paper, we introduce a novel flow-rate based model to model the dynamic movement of passengers over the transportation flow network. Based on this basic model, an integer linear programming model is proposed to solve the bus transit problem permanently. We validate our model against a real scenario in Singapore, where a newly constructed mega-stadium hosts various large events regularly. The results show that the proposed approach …
A Rolling Horizon Auction Mechanism And Virtual Pricing Of Shipping Capacity For Urban Consolidation Centers, Chen Wang, Hoong Chuin Lau, Yun Fong Lim
A Rolling Horizon Auction Mechanism And Virtual Pricing Of Shipping Capacity For Urban Consolidation Centers, Chen Wang, Hoong Chuin Lau, Yun Fong Lim
Research Collection School Of Computing and Information Systems
A number of cities around the world have adopted urban consolidation centers (UCCs) to address challenges of last-mile deliveries. At the UCC, goods are consolidated based on their destinations prior to their deliveries into city centers. Typically, a UCC owns a fleet of ecofriendly vehicles to carry out such deliveries. Shippers/carriers that make use of the UCC’s service hence no longer need to be restricted by timewindow and vehicle-type regulations. As a result, they retain the ability to deploy large trucks for the economies of scale from the source to the UCC which is located outside the city center. Furthermore, …
Cooperation In Delay-Tolerant Networks With Wireless Energy Transfer: Performance Analysis And Optimization, Dusit Niyato, Ping Wang, Hwee-Pink Tan, Walid Saad, Dong In Kim
Cooperation In Delay-Tolerant Networks With Wireless Energy Transfer: Performance Analysis And Optimization, Dusit Niyato, Ping Wang, Hwee-Pink Tan, Walid Saad, Dong In Kim
Research Collection School Of Computing and Information Systems
We consider a delay-tolerant network (DTN) whose mobile nodes are assigned to collect packets from data sources and deliver them to a sink (i.e., a gateway). Each mobile node operates by using energy transferred wirelessly from the gateway. For such a network, two main issues are studied. First, when a mobile node is at the data source, this node must decide on whether to accept the packet received from the data source or not. In contrast, whenever a mobile node is at the gateway, it has to decide on whether to transmit the packets collected from the data sources or …
On Mining Lifestyles From User Trip Data, Meng-Fen Chiang, Ee-Peng Lim
On Mining Lifestyles From User Trip Data, Meng-Fen Chiang, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
Large cities today are facing major challenges in planning and policy formulation to keep their growth sustainable. In this paper, we aim to gain useful insights about people living in a city by developing novel models to mine user lifestyles represented by the users' activity centers. Two models, namely ACMM and ACHMM, have been developed to learn the activity centers of each user using a large dataset of bus and subway train trips performed by passengers in Singapore. We show that ACHMM and ACMM yield similar accuracies in location prediction task. We also propose methods to automatically predict "home", "work" …
Fast Optimal Aggregate Point Search For A Merged Set On Road Networks, Weiwei Sun, Chong Chen, Baihua Zheng, Chunan Chen, Liang Zhu, Weimo Liu, Yan Huang
Fast Optimal Aggregate Point Search For A Merged Set On Road Networks, Weiwei Sun, Chong Chen, Baihua Zheng, Chunan Chen, Liang Zhu, Weimo Liu, Yan Huang
Research Collection School Of Computing and Information Systems
Aggregate nearest neighbor query, which returns an optimal target point that minimizes the aggregate distance for a given query point set, is one of the most important operations in spatial databases and their application domains. This paper addresses the problem of finding the aggregate nearest neighbor for a merged set that consists of the given query point set and multiple points needed to be selected from a candidate set, which we name as merged aggregate nearest neighbor(MANN) query. This paper proposes two algorithms to process MANN query on road networks when aggregate function is max. Then, we extend the algorithms …
Efficient Reverse Top-K Boolean Spatial Keyword Queries On Road Networks, Yunjun Gao, Xu Qin, Baihua Zheng, Gang Chen
Efficient Reverse Top-K Boolean Spatial Keyword Queries On Road Networks, Yunjun Gao, Xu Qin, Baihua Zheng, Gang Chen
Research Collection School Of Computing and Information Systems
Reverse k nearest neighbor (RkNN) queries have a broad application base such as decision support, profile-based marketing, and resource allocation. Previous work on RkNN search does not take textual information into consideration or limits to the Euclidean space. In the real world, however, most spatial objects are associated with textual information and lie on road networks. In this paper, we introduce a new type of queries, namely, reverse top-k Boolean spatial keyword (RkBSK) retrieval, which assumes objects are on the road network and considers both spatial and textual information. Given a data set P on a road network and a …
Solving Multi-Vehicle Profitable Tour Problem Via Knowledge Adoption In Evolutionary Bi-Level Programming, Stephanus Daniel Handoko, Abhishek Gupta, Chen Kim Heng, Hoong Chuin Lau, Yew Soon Ong, Puay Siew Tan
Solving Multi-Vehicle Profitable Tour Problem Via Knowledge Adoption In Evolutionary Bi-Level Programming, Stephanus Daniel Handoko, Abhishek Gupta, Chen Kim Heng, Hoong Chuin Lau, Yew Soon Ong, Puay Siew Tan
Research Collection School Of Computing and Information Systems
Profitable tour problem (PTP) belongs to the class of vehicle routing problem (VRP) with profits seeking to maximize the difference between the total collected profit and the total cost incurred. Traditionally, PTP involves single vehicle. In this paper, we consider PTP with multiple vehicles. Unlike the classical VRP that seeks to serve all customers, PTP involves the strategic-level customer selection so as to maximize the total collected profit and the operational-level route optimization to minimize the total cost incurred. Therefore, PTP is essentially the knapsack problem at the strategic level with VRP at the operational level. That means the evolutionary …
Improving Public Transit Accessibility For Blind Riders By Crowdsourcing Bus Stop Landmark Locations With Google Street View: An Extended Analysis, Kotaro Hara, Shiri Azenkot, Megan Campbell, Cynthia L. Bennett, Vicki Le, Sean Pannella, Robert Moore, Kelly Minckler, Rochelle H. Ng, Jon E. Froehlich
Improving Public Transit Accessibility For Blind Riders By Crowdsourcing Bus Stop Landmark Locations With Google Street View: An Extended Analysis, Kotaro Hara, Shiri Azenkot, Megan Campbell, Cynthia L. Bennett, Vicki Le, Sean Pannella, Robert Moore, Kelly Minckler, Rochelle H. Ng, Jon E. Froehlich
Research Collection School Of Computing and Information Systems
Low-vision and blind bus riders often rely on known physical landmarks to help locate and verify bus stoplocations (e.g., by searching for an expected shelter, bench, or newspaper bin). However, there are currentlyfew, if any, methods to determine this information a priori via computational tools or services. In thisarticle, we introduce and evaluate a new scalable method for collecting bus stop location and landmarkdescriptions by combining online crowdsourcing and Google Street View (GSV). We conduct and report onthree studies: (i) a formative interview study of 18 people with visual impairments to inform the designof our crowdsourcing tool, (ii) a comparative …
Stability Of Transportation Networks Under Adaptive Routing Policies, Sebastien Boyer, Sebastien Blandin, Laura Wynter
Stability Of Transportation Networks Under Adaptive Routing Policies, Sebastien Boyer, Sebastien Blandin, Laura Wynter
Research Collection School Of Computing and Information Systems
Growing concerns regarding urban congestion, and the recent explosion of mobile devices able to provide real-time information to traffic users have motivated increasing reliance on real-time route guidance for the online management of traffic networks. However, while the theory of traffic equilibria is very well-known, much fewer results exist on the stability of such equilibria, especially in the context of adaptive routing policy. In this work, we consider the problem of characterizing the stability properties of traffic equilibria in the context of online adaptive route choice induced by GPS-based decision making. We first extend the recent framework of “Markovian Traffic …
The Evolution Of Research On Multimedia Travel Guide Search And Recommender Systems, Junge Shen, Zhiyong Cheng, Jialie Shen, Tao Mei, Xinbo Gao
The Evolution Of Research On Multimedia Travel Guide Search And Recommender Systems, Junge Shen, Zhiyong Cheng, Jialie Shen, Tao Mei, Xinbo Gao
Research Collection School Of Computing and Information Systems
The importance of multimedia travel guide search and recommender systems has led to a substantial amount of research spanning different computer science and information system disciplines in recent years. The five core research streams we identify here incorporate a few multimedia computing and information retrieval problems that relate to the alternative perspectives of algorithm design for optimizing search/recommendation quality and different methodological paradigms to assess system performance at large scale. They include (1) query analysis, (2) diversification based on different criteria, (3) ranking and reranking, (4) personalization and (5) evaluation. Based on a comprehensive discussion and analysis of these streams, …
Historical Traffic-Tolerant Paths In Road Networks, Pui Hang Li, Man Lung Yiu, Kyriakos Mouratidis
Historical Traffic-Tolerant Paths In Road Networks, Pui Hang Li, Man Lung Yiu, Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
Historical traffic information is valuable for transportation analysis and planning, as well as for route search services. In view of these applications, we propose the k traffic-tolerant paths problem (TTP) on road networks, which takes a source-destination pair and historical traffic information as input, and returns k paths that minimize the aggregate (historical) travel time. Unlike the shortest path problem, the TTP problem has a combinatorial search space that renders the optimal solution expensive to compute. We propose an exact algorithm and a heuristic algorithm for this problem. Experiments on real traffic data demonstrate the effectiveness of TTP paths and …
Time-Series Data Mining In Transportation: A Case Study On Singapore Public Train Commuter Travel Patterns, Roy Ka Wei Lee, Tin Seong Kam
Time-Series Data Mining In Transportation: A Case Study On Singapore Public Train Commuter Travel Patterns, Roy Ka Wei Lee, Tin Seong Kam
Research Collection School Of Computing and Information Systems
The adoption of smart cards technologies and automated data collection systems (ADCS) in transportation domain had provided public transport planners opportunities to amass a huge and continuously increasing amount of time-series data about the behaviors and travel patterns of commuters. However the explosive growth of temporal related databases has far outpaced the transport planners’ ability to interpret these data using conventional statistical techniques, creating an urgent need for new techniques to support the analyst in transforming the data into actionable information and knowledge. This research study thus explores and discusses the potential use of time-series data mining, a relatively new …
Press: A Novel Framework Of Trajectory Compression In Road Networks, Renchu Song, Weiwei Sun, Baihua Zheng, Yu Zheng
Press: A Novel Framework Of Trajectory Compression In Road Networks, Renchu Song, Weiwei Sun, Baihua Zheng, Yu Zheng
Research Collection School Of Computing and Information Systems
Location data becomes more and more important. In this paper, we focus on the trajectory data, and propose a new framework, namely PRESS (Paralleled Road-Network-Based Trajectory Compression), to effectively compress trajectory data under road network constraints. Different from existing work, PRESS proposes a novel representation for trajectories to separate the spatial representation of a trajectory from the temporal representation, and proposes a Hybrid Spatial Compression (HSC) algorithm and error Bounded Temporal Compression (BTC) algorithm to compress the spatial and temporal information of trajectories respectively. PRESS also supports common spatial-temporal queries without fully decompressing the data. Through an extensive experimental study …
A Fast Decomposition Approach For Traffic Control, Xiaocheng Tang, Sébastien Blandin, Laura Wynter
A Fast Decomposition Approach For Traffic Control, Xiaocheng Tang, Sébastien Blandin, Laura Wynter
Research Collection School Of Computing and Information Systems
Real-time road traffic control has been the subject of active research efforts for more than fifty years. In recent years, however, the convergence of ubiquitous sensing with seamless communication technologies has motivated the development of more computationally efficient control methods, able to operate in real-time in a live environment. In this work, we present a fast decomposition method for network optimization problems, with application to real-time traffic control. Our approach is based on a nonlinear programming formulation of the network control problem and consists of an alternating directions method using forward numerical simulation in place of one of the optimization …
An Air Index For Spatial Query Processing In Road Networks, Weiwei Sun, Chunan Chen, Baihua Zheng, Chong Chen, Peng Liu
An Air Index For Spatial Query Processing In Road Networks, Weiwei Sun, Chunan Chen, Baihua Zheng, Chong Chen, Peng Liu
Research Collection School Of Computing and Information Systems
Spatial queries such as range query and kNN query in road networks have received a growing number of attention in real life. Considering the large population of the users and the high overhead of network distance computation, it is extremely important to guarantee the efficiency and scalability of query processing. Motivated by the scalable and secure properties of wireless broadcast model, this paper presents an air index called Network Partition Index (NPI) to support efficient spatial query processing in road networks via wireless broadcast. The main idea is to partition the road network into a number of regions and then …
Mechanisms For Arranging Ride Sharing And Fare Splitting For Last-Mile Travel Demands, Shih-Fen Cheng, Duc Thien Nguyen, Hoong Chuin Lau
Mechanisms For Arranging Ride Sharing And Fare Splitting For Last-Mile Travel Demands, Shih-Fen Cheng, Duc Thien Nguyen, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
A great challenge of city planners is to provide efficient and effective connection service to travelers using public transportation system. This is commonly known as the last-mile problem and is critical in promoting the utilization of public transportation system. In this paper, we address the last-mile problem by considering a dynamic and demand-responsive mechanism for arranging ride sharing on a non-dedicated commercial fleet (such as taxis or passenger vans). Our approach has the benefits of being dynamic, flexible, and with low setup cost. A critical issue in such ride-sharing service is how riders should be grouped and serviced, and how …
Time-Series Data Mining In Transportation: A Case Study On Singapore Public Train Commuter Travel Patterns, Tin Seong Kam, Roy Ka Wei Lee
Time-Series Data Mining In Transportation: A Case Study On Singapore Public Train Commuter Travel Patterns, Tin Seong Kam, Roy Ka Wei Lee
Research Collection School Of Computing and Information Systems
The adoption of smart cards technologies and automated data collection systems (ADCS) in transportation domain had provided public transport planners opportunities to amass a huge and continuously increasing amount of time-series data about the behaviors and travel patterns of commuters. However the explosive growth of temporal related databases has far outpaced the transport planners’ ability to interpret these data using conventional statistical techniques, creating an urgent need for new techniques to support the analyst in transforming the data into actionable information and knowledge. This research study thus explores and discusses the potential use of time-series data mining, a relatively new …
Challenges And Opportunities In Taxi Fleet Anomaly Detection, Rijurekha Sen, Rajesh Krishna Balan
Challenges And Opportunities In Taxi Fleet Anomaly Detection, Rijurekha Sen, Rajesh Krishna Balan
Research Collection School Of Computing and Information Systems
To enhance fleet operation and management, logistics companies instrument their vehicles with GPS receivers and network connectivity to servers. Mobility traces from such large fleets provide significant information on commuter travel patterns, traffic congestion and road anomalies, and hence several researchers have mined such datasets to gain useful urban insights. These logistics companies, however, incur significant cost in deploying and maintaining their vast network of instrumented vehicles. Thus research problems, that are not only of interest to urban planners, but to the logistics companies themselves are important to attract and engage these companies for collaborative data analysis. In this paper, …
Merged Aggregate Nearest Neighbor Query Processing In Road Networks, Weiwei Sun, Chong Chen, Baihua Zheng, Chunan Chen, Liang Zhu
Merged Aggregate Nearest Neighbor Query Processing In Road Networks, Weiwei Sun, Chong Chen, Baihua Zheng, Chunan Chen, Liang Zhu
Research Collection School Of Computing and Information Systems
Aggregate nearest neighbor query, which returns a common interesting point that minimizes the aggregate distance for a given query point set, is one of the most important operations in spatial databases and their application domains. This paper addresses the problem of finding the aggregate nearest neighbor for a merged set that consists of the given query point set and multiple points needed to be selected from a candidate set, which we name as merged aggregate nearest neighbor(MANN) query. This paper proposes an effective algorithm to process MANN query in road networks based on our pruning strategies. Extensive experiments are conducted …