Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (194)
- Old Dominion University (21)
- University of Nevada, Las Vegas (16)
- San Jose State University (15)
- World Maritime University (7)
-
- Edith Cowan University (3)
- University of Texas at El Paso (3)
- Walden University (3)
- New Jersey Institute of Technology (2)
- Portland State University (2)
- University of Nebraska at Omaha (2)
- Ateneo de Manila University (1)
- Brigham Young University (1)
- California State University, San Bernardino (1)
- Claremont Colleges (1)
- Purdue University (1)
- University of Arkansas, Fayetteville (1)
- University of Central Florida (1)
- University of Denver (1)
- University of Kentucky (1)
- University of Michigan Law School (1)
- University of San Diego (1)
- Keyword
-
- Transportation (17)
- Artificial intelligence (11)
- Machine learning (11)
- Optimization (9)
- Reinforcement learning (9)
-
- Singapore (9)
- Vehicle routing problem (9)
- Vehicle routing (7)
- Deep learning (6)
- Big data (5)
- Decision making (5)
- Logistics (5)
- Public transportation (5)
- Routing (5)
- Traffic congestion (5)
- Innovation (4)
- Neural networks (4)
- Ride-sourcing (4)
- Road traffic (4)
- Scheduling (4)
- Security (4)
- Traffic flow (4)
- Automated guided vehicle systems (3)
- Computer simulation (3)
- Crowdsourcing (3)
- Cybersecurity (3)
- Data mining (3)
- Decoding (3)
- Electric vehicles (3)
- Genetic algorithm (3)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (185)
- Mineta Transportation Institute (15)
- Electrical & Computer Engineering Faculty Research (9)
- World Maritime University Dissertations (6)
- College of Engineering: Graduate Celebration Programs (5)
-
- Computer Science Theses & Dissertations (4)
- Electrical & Computer Engineering Theses & Dissertations (4)
- Research Collection College of Integrative Studies (4)
- Civil & Environmental Engineering Theses & Dissertations (3)
- Computational Modeling & Simulation Engineering Theses & Dissertations (3)
- Open Access Theses & Dissertations (3)
- Walden Dissertations and Doctoral Studies (3)
- Asian Management Insights (2)
- Computer Science Faculty Publications (2)
- Dissertations (2)
- Engineering Technology Faculty Publications (2)
- UNLV Theses, Dissertations, Professional Papers, and Capstones (2)
- Australian Digital Forensics Conference (1)
- Australian Information Security Management Conference (1)
- Civil & Environmental Engineering Faculty Publications (1)
- Community & Environmental Health Faculty Publications (1)
- Department of Information Systems & Computer Science Faculty Publications (1)
- Digital Initiatives Symposium (1)
- Dissertations and Theses Collection (1)
- Electronic Theses and Dissertations (1)
- Electronic Theses, Projects, and Dissertations (1)
- Geography and the Environment: Faculty Scholarship (1)
- Graduate Theses and Dissertations (1)
- Interdisciplinary Informatics Faculty Proceedings & Presentations (1)
- Journal of Law and Mobility (1)
- Publication Type
Articles 211 - 240 of 279
Full-Text Articles in Transportation
Do We Choose What We Desire? – Persuading Citizens To Make Consistent And Sustainable Mobility Decisions, Christopher Lisson, Margeret A. Hall
Do We Choose What We Desire? – Persuading Citizens To Make Consistent And Sustainable Mobility Decisions, Christopher Lisson, Margeret A. Hall
Interdisciplinary Informatics Faculty Proceedings & Presentations
A dilemma in urban mobility with tremendous effects on citizens’ wellbeing is the unconscious antipode between their short- and long-term goals. People do not anticipate all consequences of their modal choices and thus make decisions that might be incoherent with their desires, e.g. taking their own car due to convenience but causing a congested city. Omnipresent Information Systems on smartphones provide the necessary information and coordination capabilities to support people for sustainable and individually coherent mobility decisions on a mass scale. Building upon extant work in travel behavior and social psychology, a framework is proposed to coordinate research efforts in …
How Can We Have A Better Public Transportation System? –An Exploratory Agent Based Model, Boyu Liu
How Can We Have A Better Public Transportation System? –An Exploratory Agent Based Model, Boyu Liu
Pomona Senior Theses
Public transportation plays an integral part in a city's development, but transportation professionals disagree about whether it is feasible to increase the capacity of public transportation systems at a reasonable cost; and if it is, how. This study develops an agent based model that aims to answer this question and provide a framework to compare the effects of improvements in different aspects of the public transportation service. The results of this study show that it is possible to increase ridership enough to compensate for the increased operational cost, but only in certain circumstances. Interesting phenomenon that might have showed up …
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 …
From Sensors To Sense Making: Leveraging Open-Access Scientific Data To Assess Arctic Maritime Risks, Mark A. Stoddard, Melanie Fournier Ph.D, Laurent Etienne Ph.D, Leah Beveridge Ph.D
From Sensors To Sense Making: Leveraging Open-Access Scientific Data To Assess Arctic Maritime Risks, Mark A. Stoddard, Melanie Fournier Ph.D, Laurent Etienne Ph.D, Leah Beveridge Ph.D
ShipArc 2015 Conference
No abstract provided.
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 …
Major Challenges And Solutions For Utilizing Big Data In The Maritime Industry, Sadaharu Koga
Major Challenges And Solutions For Utilizing Big Data In The Maritime Industry, Sadaharu Koga
World Maritime University Dissertations
The dissertation is a study of big data for the use in the maritime industry. Today’s society is information-intensive. The term “big data” is becoming more common. In fact, some maritime companies and institutions have already been trying to utilize big data for enhancing maritime safety and environmental protection. In order to promote this trend, the dissertation tries to identify common and important challenges for the whole maritime industry in terms of the utilization of big data and propose corresponding solutions. First, by reviewing the definitions of big data, three major features are identified. Big data takes electronic form, is …
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 …
Systems For Delivering Electric Vehicle Data Analytics, Vamshi Krishna Bolly
Systems For Delivering Electric Vehicle Data Analytics, Vamshi Krishna Bolly
Open Access Theses
n the recent times, advances in scientific research related to electric vehicles led to generation of large amounts of data. This data is majorly logger data collected from various sensors in the vehicle. It is predominantly unstructured and non-relational in nature, also called Big Data. Analysis of such data needs a high performance information technology infrastructure that provides superior computational efficiency and storage capacity. It should be scalable to accommodate the growing data and ensure its security over a network. This research proposes an architecture built over Hadoop to effectively support distributed data management over a network for real-time data …
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 …
Smart Data Collection Using Mobile Devices To Improve Transportation Systems, Tharindu Dasun Abeygunawardana
Smart Data Collection Using Mobile Devices To Improve Transportation Systems, Tharindu Dasun Abeygunawardana
UNLV Theses, Dissertations, Professional Papers, and Capstones
Travel time is a matter that affects most of us, especially those that live in highly congested cities. Ideally, we want to reduce travel time as much as possible, thereby freeing up more of our time and enabling a higher quality of life. Data collection of transportation metrics helps us get a clearer picture of the transportation system, and helps us make smarter choices when it comes to improving the existing system. The rapid emergence of interconnected mobile devices carried along by travelers opens up many possibilities for gathering data as they travel, and also to serve them relevant data …
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 …
Scalable Randomized Patrolling For Securing Rapid Transit Networks, Pradeep Varakantham, Hoong Chuin Lau, Zhi Yuan
Scalable Randomized Patrolling For Securing Rapid Transit Networks, Pradeep Varakantham, Hoong Chuin Lau, Zhi Yuan
Research Collection School Of Computing and Information Systems
Mass Rapid Transit using rail is a popular mode of transport employed by millions of people in many urban cities across the world. Typically, these networks are massive, used by many and thus, can be a soft target for criminals. In this paper, we consider the problem of scheduling randomised patrols for improving security of such rail networks. Similar to existing work in randomised patrols for protecting critical infrastructure, we also employ Stackelberg Games to represent the problem. In solving the Stackelberg games for massive rail networks, we make two key contributions. Firstly, we provide an approach called RaPtoR for …
Best Upgrade Plans For Large Road Networks, Yimin Lin, Kyriakos Mouratidis
Best Upgrade Plans For Large Road Networks, Yimin Lin, Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
In this paper, we consider a new problem in the context of road network databases, named Resource Constrained Best Upgrade Plan computation (BUP, for short). Consider a transportation network (weighted graph) G where a subset of the edges are upgradable, i.e., for each such edge there is a cost, which if spent, the weight of the edge can be reduced to a specific new value. Given a source and a destination in G, and a budget (resource constraint) B, the BUP problem is to identify which upgradable edges should be upgraded so that the shortest path distance between source and …
Delayflow Centrality For Identifying Critical Nodes In Transportation Networks, Yew-Yih Cheng, Roy Ka Wei Lee, Ee-Peng Lim, Feida Zhu
Delayflow Centrality For Identifying Critical Nodes In Transportation Networks, Yew-Yih Cheng, Roy Ka Wei Lee, Ee-Peng Lim, Feida Zhu
Research Collection School Of Computing and Information Systems
In an urban city, its transportation network supports efficient flow of people between different parts of the city. Failures in the network can cause major disruptions to commuter and business activities which can result in both significant economic and time losses. In this paper, we investigate the use of centrality measures to determine critical nodes in a transportation network so as to improve the design of the network as well as to devise plans for coping with network failures. Most centrality measures in social network analysis research unfortunately consider only topological structure of the network and are oblivious of transportation …
Development Of A Comprehensive Database System For A Highway Safety Engineering And Management, Naveen Veeramisti, Justin Baker, Indira Khanal, Kenny Moupita, Alexander Paz
Development Of A Comprehensive Database System For A Highway Safety Engineering And Management, Naveen Veeramisti, Justin Baker, Indira Khanal, Kenny Moupita, Alexander Paz
College of Engineering: Graduate Celebration Programs
In simple words, the objective of this study is to develop a comprehensive database system to provide a data for highway safety engineering and management.
Calibration Of Traffic Flow Models, Victor Molano
Calibration Of Traffic Flow Models, Victor Molano
College of Engineering: Graduate Celebration Programs
This study proposes a methodology to calibrate microscopic traffic flow simulation models. A Simultaneous Perturbation Stochastic Approximation (SPSA) algorithm searches for the set of model parameters that minimizes the difference between actual and simulated values