The Theoretical Framework of the Optimization of Public Transport Travel
|
|
- Easter Smith
- 6 years ago
- Views:
Transcription
1 The Theoretical Framework of the Optimization of Public Transport Travel Jolanta Koszelew # # Faculty of Computer Science, Bialystok Technical University, Wiejska A, - Bialystok, Poland jolka@ii.pb.bialystok.pl Abstract With the increase of cars on the streets, more and more people in big cities, decide to move from one place to another by public transport, such as tram, metro or bus. Public transport users need detail informations about network connections. Therefore, some urban portals offer to use systems of optimization of public transport travel. However, finding one or several optimal routes, according to user preferences, is a difficult problem. This paper presents an original method for determining optimal paths in public transportation network. Author describes a network model with timedependent and bi-modal links, defines the problem of finding optimal routes with users preferences and proposes algorithm, which can be a solution of this problem.. Introduction Plan journeys become more popular in public transport services. People, which use metro, bus or train, want to know, how to get, as quick as it possible, from specified origin to a destination. They also have various limits for their routes, for example: maximum travel time, maximum number of bus-changes, maximum walking distance (Walk to the nearest us stop is an additional kind of link in our network model), minimum probability of successful realization of the the route). Standard shortest path (or paths) algorithms [] find the shortest path(s) in networks with static and deterministic links, meanwhile algorithms for a scheduled transportation network are time-dependent. Edges in such networks can only be traversed at certain points in time and the weights of these edges change in a day and are associated with them. Moreover, standard algorithms considered graphs with one kind of links. Graph in our model has two kinds of edges: directed links which represent connections between bus-stops and undirected edges correspond to the travel between each pair of neighbors nodes (bus-stops) on foot. Additionally, with each node in graphs that represent transportation network, is concerned detail information about: timetables, coordinates of bus-stops, etc. This information is necessarily to determine weights of links during realization of the algorithm. Those three differences between graphs in standard shortest path(s) problem and public transportation networks cause that complexity of algorithms which solve routing problem in the such original network representation, increase. Special methods have to compiled for a construction of optimal paths in this model. New algorithms are needed to accommodate users preferences. In this paper, the author presents a new version of the certain labeling algorithm [], which is solution of K-shortest paths problem and cover users conditions. Before the presentation of the algorithm in section, the author define in the section the network model and in the section the problem of finding optimal routes with user preferences.. Network Model A public transportation network is represented as a directed graph G = V, E where V is a set of nodes and E is a set of edges. Each node in a graph G corresponds to a certain transport station. We assume, for simplification, that there is only one kind of the public transportation bus, so each node corresponds to a bus-stop. This assumption doesn t narrow applications of the presented methods. Each node (bus-stop) is labeled by natural number from to n, where n is a total number of busstops. The edge ( i, j) E exists when is at leas bus connection between the bus-stop number i as a source point and the bus stop number j as a destination. Each edge has a weight t ij, which is an integer number. A value of t ij is time-dependent and is determined during the realization of the algorithm, on the base of information, which is included in the i and j nodes. The following information is contained in the node number i (bus-stop number i): /07 $
2 - numbers of bus lines, which are stop at i. We denote those numbers by i, i,..., etc. - coordinates of the i: x, y (needed to calculate weights of walk-links). Coordinates determine the position of a bus-stop on the map of city. - timetables of each lines i, i,, etc.. We assume, for simplification, that all lines have only one directed route and timetables for work days and weekends are the same. Each element of timetable consists of two numbers: hours and minutes of the departure. Timetable for line i j is a sequence d ij of departure times for line number i j from bus-stop number i. Each element of the sequence is a pair of integer numbers: (h ij, m ij ) h ij hour of departure, m ij minutes of departure - list of nodes which are connected with node i; the list of neighbor bus-stops. Bus-stop j is a neighbor of bus-stop number i, if exists at least one bus connection between the bus-stop number i as a source point and the busstop number j as a destination. Besides bus connections, graph has additional walk links. We assume, that there exists walk link beetween bus-stops i and j, if a time which is needed to walk from bus-stop i to j is less then fifteen minutes. We can calculate this time by the equation: ( i, j) = ( x x ) + ( x x ) dist walktime i j () i ( i, j) = dist( i, j) scaleofmap walkspeed where walkspeed is the input algorithm parameter an average walking speed in km/h and scaleofmap is a scale of map. A graph representation of such the network is shown in Fig.. It s a very simple example of the transportation network. In real world a number of nodes is equal to 00 for the city with 0 ts. citizens. In the next section we define problem of optimal routes with user preferences. The input data of this problem is a graph defined above and travelers additional conditions.. Problem of finding optimal routes with users preferences Optimal route finding is a shortest path problem. Dijkstra s algorithm [] is of course the most efficient and effective solution of this problem in its classical version. However, Dijkstra s algorithm does not allow for timedependent links. Dreyfus [] developed many methods for graphs with time-dependent links, but his algorithms don t accommodate users preferences. New approach is needed to allow the such conditions. Public transport users preferences may be various. We consider the most practical of them: maximum travel time, maximum number of bus-changes, maximum walking distance, minimum probability of successful realization of the route. j lines coordinates x =0, y =0 :7.:00, 7:0 :7:0, 7: :7:0, 7: :7:0, 7: timetables x =0, y =0 :7.:0, 7: :7:08, 7:0 :7:0, 7:0 x =0, y =0 :7.0, 7: :7:07, 7:9 walk links bus links Figure. Representation of a simple transportation network The last preference needs some explanations. What is the minimum probability of successful route realization? Assume, that there are two optimal routes, which include one bus-change, with the same travel time. Which of them should user choice? He can compare both routes in terms of his chance of a bus change. If the time interval between arrival and departure of buses for the first route is equal to four minutes and is equal to two minutes for the second path, then probability of successful realization of the first one is greater then for the second. User can define probability distribution for successful realization of bus-change, conditioned by the time interval between buses arrival and departure. Minimal set of users preferences consists of the following elements: v start source point of a travel, number of the started bus - stop, v stop destination point of travel, number of the finished bus-stop, t start time of a travel beginning, k the number of optimal paths, which algorithm must generate Additional preferences may be very special. Actually, it is unpractical to take every individual conditions into consideration. In this paper, the following preferences are considered: max changes upper limit of bus-changes count, max walking upper limit of walking distance, max time upper limit of travel time, min prob lower limit of a probability of successful realization. x =0, y =0 :7:08, 7: :7:, 7: :7: 7: x =0, y =0 :7:7, 7:7 :7:, 7: :7:, 7: x =0, y =0 :7:, 7:7 :7:, 7:0 :7:, 7: :7:, 7: /07 $
3 Probability of travel successful realization is original for each passenger, because it s determined on the base of probability distribution on the time for bus-change (). We will sign this distribution by BC_distribution. Algorithm, which is presented in the next section, determines at last k shortest paths for a given public transportation network. Each route has the same source and destination bus-stop and time of the travel beginning. Values of other parameters (additional preferences) may be different for different paths. There are two approaches to defining k-shortest paths problems. In classical version of this task (without additional preferences), we find k paths with the minimal travel time [7]. If the set of input parameters includes additional parameters (additional preferences), we can treat them in two different way. The first possibility lies in that all additional preferences have the same importance [8]. In this case algorithm generates k shortest routes with minimal travel time and each path satisfies all additional preferences, i.e. the number of bus changes is smaller then max changes, total walking distance is smaller then max walking value and probability of successful travel realization is greater then min prob. In the second approach we assume, that preferences may have different importance. In this paper we will consider this second possibility. It is practical to take the lowest weight for max changes value. If the path doesn t include buschanges or this value is small, automatically values of other parameters are good for traveler, i.e. travel time and walking distance are the smallest and probability of successful travel realization is the greatest (is equal to ). Example. Sample input parameters for the transportation network in Fig. Base preferences : v start =, v stop =, t start = 7:00, k =, Additional preferences in order of importance: I. max time = (minutes), II: min prob = 0.7, III: max changes =, IV: max walking = 0 (meters), Above order of importance does it mean that if do not exist k routes, which satisfy all additional conditions, algorithm generates routes, which do not satisfy max walking preference. If do not exist k routes, which satisfy I. II. and III. preference, algorithm determines routes, which do not satisfy max changes condition, etc. 0, for 0 t < 0,7 for t < BC _ distribution() t = () 0,8 for t <,0 for t 8 where t is a time (in minutes) for a bus-change, walkspeed = (km/h) scaleofmap = 000 Table. Optimal routes for k= and the transportation network in Fig.. T, T, T optimal routes, L, L, L bus lines for corresponding routes routes T - L T - L T L buschanges time travel walk (km) probability of successful realization If there are two or more routes, which satisfy the same set of additional conditions, algorithm sorts routes according to the priorities of preferences.. Algorithm for optimal routes in public transportation network problem In order to find optimal paths (for k>=), it is important for the algorithms to choose different routes throughout the network []. It can be realized by labeling nodes and edges or by removal of a node or a edge []. Because it is easier to implement the labeling algorithms than the path deletion algorithms for the transportation network, the algorithm described in this paper is based on the label setting technique []. Moreover, the presented algorithm consists of four main steps. In the first step it generates paths without bus- changes and walk distances. Next, standard breath-first-search method (BFS) [] is applied to construct the shortest paths in a direct graph G. The length of paths which are generated in this step is equal to the number of edges on the path and bus-changes are allowed. Then, the algorithm determines the last kind of paths. They are include possibility of bus-changes and walk distance. This third part of the algorithm is based on the method presented in []. For each generated path all values of the additional users preferences parameters are determined: the number of bus-changes, walk distance, time travel and probability of succesfull realization. Finally, the algorithm divides the set of all generated paths to five subsets. The first subset includes paths, which satisfy all users preferences. Paths in this subset are sorted according to the priorities of preferences. Second subset consists of paths, which satisfy three the most important conditions and is also sorted in order of priority of those conditions. Next subset includes paths, which satisfy two main preferences. The fourth subset consists of paths, which come true only one main condition and the last subset includes other routes. First k /07 $
4 ranked paths from each subset is the result of algorithm. OPTIMAL_ROUTES (G, v start, v stop, t start, k, max changes, max walking,, max time,, min prob ) Step : Establish numbers of bus-lines, which stop on v start and v stop location. Determine values of all parameters (travel time, number of bus changes, walk distance and probability of successful realization) for each direct connection and add to a subset R D (direct routes) Step : Use standard BFS procedure to construct all shortest paths in a direct graph G from origin node v start to the destination node v stop. The length of path is equal to the number of edges on the route. Because each generated path must be different, do not use the same set of intermediate nodes (exclude one node in one path). Determine values of parameters for each route and add to a subset R BFS (routes with the minimal number of busstops). Step : Run below label setting algorithm LSA to get the ranked k-shortest paths from the origin to the destination node. 7:0 7:00 7:0 Step.: Find the closest node to the origin by walking. For the network in the Fig. node is the closest node to node by walking, because the time walking from to is equal to minutes. Step.: Compare the arrival time for bus and walk to the closest nodes. Time travel by bus to node is smaller then time walking from node to node. Label node. Step.: Upgrade the network according to the labeled node. In the Fig., there is a bus link from node to node, so the network is upgraded by adding a bus link from the node to the node. There are also walking links from the node to the node, the node and the node, so the network is upgraded by adding links from node to node, node and node. Since there is already a walking link between node and node, the walking link -- becomes the second walking link from node to. It must be added separately as a second walking link with time 9 (+). 7: :00 7:0 7:0 7:0 8 Figure. Step. of LSA algorithm for network in Fig. 7:0 8 8 Figure. Simple transport network with bus links and departure time (in minutes) for two bus lines (routes: - - and ---) and walk links with travel time. LSA algorithm: 7:0 7:09 7:0 Step.: Find the closest node to the v start by bus. Node j is the closest to i node iff the time taken to travel between nodes is minimal. For the network in the Fig. the closest node to v start = is the node, because the time travel from to at t start =7:00 is equal to minutes. If suppose in Step. time walk from the node to the node would be equal to minutes, then the node would be labeled as the closest to node the and the network would be upgraded using the same rules. Step.: If the labeled node is the destination node, add route to the subset R LSA (subset of routes which are generated as a result of LSA algorithm). Step.: Repeat step. to step. until the k ranked shortest path has been added to the subset R LSA. Step.7: Determine values of all parameters for each the shortest route and add to subset R LSA Step : Determine set R of all generated routes. R = R R R { } D BFS LSA /07 $
5 Step : Divide the set R to five new subsets R, R, R, R, R. Subset R includes all routes from R, which satisfy all additional user preferences, the subset R is consists of paths, which satisfy three the most important conditions. Next subset R includes paths, which satisfy two main preferences, the subset R consists of paths, which come true only one main condition and the last subset R includes other routes. 7:0 7:00 7 7:0 7:0 Figure. Step of the LSA algorithm, assuming that the network in Fig. has the time walk from node the to node the equals to minutes. Step : Sort each subset R i (i=...) according to the set users preferences, which are, correspond to the given subset. Step 7: First k ranked paths from R in the first order, from R in the second order, R and R, R in the last order are the result of this algorithm. The designed algorithm generates a list of ranked shortest paths and those paths are compared with users preferences. The graph, which is an input data structure of the algorithm is generated on the base of timetables (bus links) and coordinates of bus stops (walk links). The complexity of the algorithm for all steps behind the Step is not high, but the execution time of labelsetting algorithm, which is realized in Step is still long. For the graph with about 00 nodes (bus-stops), the algorithm returns, five paths with all user preferences after about three minutes. The next stage of the research will focus on reducing the overlap rate by carefully embedding the constraints into the algorithm investigating different methods to ensure credible execution time. In the next paper will be introduced the concept of stochasticity to the above algorithm based on methods presented in [9]. Stochasticity greatly increases the complexity of the rout finding problem, so greater algorithmic efficiency becomes imperative. Different kinds of heuristics [8] will 7:0 be investigated and implemented one after another until satisfying performance is gained.. Conclusions This paper presents some of the approaches to solving of the shortest paths problem in a time-dependent scheduled transportation network with bi-modal links. The algorithm described in the previous section works on random generated, non-realistic network now. The next step of the research will be implementation of the algorithm in a full functional system, which will help travelers to find the optimal routes. In addition we may provide a graphic user interface []. Our system needs to work with a geographic information about location of bus-stops. The algorithm and system will finally be implemented for Bialystok (about 0 nodes) and Warsaw (about 00 nodes) public transport network. Various kinds of Warsaw public transport will be take into consideration: buses, trams and underground. Acknowledgement This paper was supported by the Rector of Bialystok Technical University (grant no.s/wi//0) References [] R. K. Ahuja, Dynamic shortest path minimizing travel times and costs, citeseer.nj.nec.com/ 8.htm, 00. [] I. Chabini, Discrete dynamic shortest path problem in transportation applications: Complexity and algorithms with optimal run time, Transportation Research Records,, 998, pp [] H.K. Chen, G. Feng G, Heuristics for the dynamic useroptimal route choice problem, European Journal of Operational Research,, 000, pp. -0. [] E. Dijkstra, A note on two problems in connection with graphs, Mumerische Mathematik,, 99, pp. 9-7 [] S. E. Dreyfus, An Appraisal of Some Shortest-path Algorithms, Operations Research, 7, 99, pp. 9-. [] P.J. Elkins, Service management systems for public transport the German approach, Proceedings of the IEE Colloquium on Vehicle Location and Fleet Management Systems, 99, pp [7] J. K. Hartley, A. Bargiela, Decision Support for Planning Multi-Modal Urban Travel, Proceedings of th European Simulation Symposium, Marseille, 00, pp /07 $
6 [8] N. Jing, Y. W. Huang, E.A. Rundensteiner, Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation, IEEE Transaction on Knowledge and Data Engineering, 0(), 998, pp [9] J. Koszelew, Probabilistic Analysis of Operational Security for Network Systems, Information processing and security systems / ed. by Khalid Saeed, Jerzy Pejaś. - Heidelberg : Springer-Verlag, 00, pp..- [0] M. P. Wellman, M. Ford, K. Larson, Path planning under time-dependent uncertainty, Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence, 99, pp. 9. [] Q. WU, J.K. Hartley, Accommodating User Preferences in the Optimization of Public Transport Travel, International Journal of Simulation Systems, Science & Technology: Applied Modeling & Simulation, 00, pp /07 $
Approximation Method to Route Generation in Public Transportation Network
dr Jolanta Koszelew Katedra Informatyki Teoretycznej Wydział Informatyki Politechnika Białostocka Approximation Method to Route Generation in Public Transportation Network Abstract This paper presents
More informationTIME-DEPENDENT STOCHASTIC SHORTEST PATH(S) ALGORITHMS FOR A SCHEDULED TRANSPORTATION NETWORK
TIME-DEPENDENT STOCHASTIC SHORTEST PATH(S) ALGORITHMS FOR A SCHEDULED TRANSPORTATION NETWORK QIUJIN WU, JOANNA HARTLEY, DAVID AL-DABASS School of Computing and Informatics, Nottingham Trent University,
More informationPublic Transportation Routing using Route Graph
Public Transportation Routing using Route Graph Han-wen Chang Yu-chin Tai Jane Yung-jen Hsu Department of Computer Science and Information Engineering National Taiwan University, Taiwan {b92099, b92018,
More informationPBW 654 Applied Statistics - I Urban Operations Research. Unit 3. Network Modelling
PBW 54 Applied Statistics - I Urban Operations Research Unit 3 Network Modelling Background So far, we treated urban space as a continuum, where an entity could travel from any point to any other point
More informationTemporally Adaptive A* Algorithm on Time Dependent Transportation Network
Temporally Adaptive A* Algorithm on Time Dependent Transportation Network Nianbo Zheng, Feng Lu Institute of Geographic Sciences and Natural Resources Research Chinese Academy of Sciences Beijing, 100101,
More informationBest-Path Planning for Public Transportation Systems
Best-Path Planning for Public Transportation Systems Chao-Lin Liu Abstract The author examines methods for a special class of path planning problems in which the routes are constrained. General search
More informationUsing Multi-Level Graphs for Timetable Information. Frank Schulz, Dorothea Wagner, and Christos Zaroliagis
Using Multi-Level Graphs for Timetable Information Frank Schulz, Dorothea Wagner, and Christos Zaroliagis Overview 1 1. Introduction Timetable Information - A Shortest Path Problem 2. Multi-Level Graphs
More informationParallel Hierarchies for Solving Single Source Shortest Path Problem
JOURNAL OF APPLIED COMPUTER SCIENCE Vol. 21 No. 1 (2013), pp. 25-38 Parallel Hierarchies for Solving Single Source Shortest Path Problem Łukasz Chomatek 1 1 Lodz University of Technology Institute of Information
More informationPath-Planning Algorithms for Public Transportation Systems
THE FORTH INTERNATIONAL IEEE CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS, OAKLAND, CALIFORNIA, SA, AGST 1 1 Path-Planning Algorithms for Public Transportation Systems Chao-Lin Liu, Tun-Wen Pai, Chun-Tien
More informationRollout Algorithms for Discrete Optimization: A Survey
Rollout Algorithms for Discrete Optimization: A Survey by Dimitri P. Bertsekas Massachusetts Institute of Technology Cambridge, MA 02139 dimitrib@mit.edu August 2010 Abstract This chapter discusses rollout
More informationAdaptations of the A* Algorithm for the Computation of Fastest Paths in Deterministic Discrete-Time Dynamic Networks
60 IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, VOL. 3, NO. 1, MARCH 2002 Adaptations of the A* Algorithm for the Computation of Fastest Paths in Deterministic Discrete-Time Dynamic Networks
More informationDynamic vehicle routing in road evacuation: route design experimentation
Safety and Security Engineering IV 391 Dynamic vehicle routing in road evacuation: route design experimentation A. Polimeni & A. Vitetta Università degli Studi Mediterranea di Reggio Calabria, DIMET -
More informationi,4,2 i,4,1 i,3,2 i,2,2 i,3,1 i direct connection; weight = 0 connection with a change; weight =
Electronic Notes in Theoretical Computer Science 50 No. 1 (2001) Proc. ATMOS 2001 URL: http://www.elsevier.nl/locate/entcs/volume50.html 11 pages Web-Based Integrated Timetable Information System for Railways
More informationModels and Algorithms for Shortest Paths in a Time Dependent Network
Models and Algorithms for Shortest Paths in a Time Dependent Network Yinzhen Li 1,2, Ruichun He 1 Zhongfu Zhang 1 Yaohuang Guo 2 1 Lanzhou Jiaotong University, Lanzhou 730070, P. R. China 2 Southwest Jiaotong
More informationWhat is Network Analyst?
What is Network Analyst? Extension for analyzing transportation networks Four network solvers Route Closest Facility Service Area Uses Network Datasets Origin-Destination (OD) Cost Matrix Specialized layers
More informationA case study of optimal ambulance location problems
The 7th International Symposium on Operations Research and Its Applications (ISORA 08) Lijiang, China, October 31 Novemver 3, 2008 Copyright 2008 ORSC & APORC, pp. 125 130 A case study of optimal ambulance
More informationStability of Marriage and Vehicular Parking
Stability of Marriage and Vehicular Parking Daniel Ayala, Ouri Wolfson, Bo Xu, Bhaskar DasGupta, and Jie Lin University of Illinois at Chicago Abstract. The proliferation of mobile devices, location-based
More informationCS1 Lecture 31 Apr. 3, 2019
CS Lecture 3 Apr. 3, 209 HW6 due Fri. Q3: think carefully about overlaps draw pictures Think dimension by dimension three D problems if they don t overlap in x, they don t overlap» Express this in terms
More informationA Modular k-nearest Neighbor Classification Method for Massively Parallel Text Categorization
A Modular k-nearest Neighbor Classification Method for Massively Parallel Text Categorization Hai Zhao and Bao-Liang Lu Department of Computer Science and Engineering, Shanghai Jiao Tong University, 1954
More informationBUSNet: Model and Usage of Regular Traffic Patterns in Mobile Ad Hoc Networks for Inter-Vehicular Communications
BUSNet: Model and Usage of Regular Traffic Patterns in Mobile Ad Hoc Networks for Inter-Vehicular Communications Kai-Juan Wong, Bu-Sung Lee, Boon-Chong Seet, Genping Liu, Lijuan Zhu School of Computer
More informationCIE4801 Transportation and spatial modelling (Uncongested) Assignment
CIE4801 Transportation and spatial modelling (Uncongested) Assignment Rob van Nes, Transport & Planning 17/4/13 Delft University of Technology Challenge the future Content What do we want to know? Shortest
More informationMSEC PLANT LAYOUT OPTIMIZATION CONSIDERING THE EFFECT OF MAINTENANCE
Proceedings of Proceedings of the 211 ASME International Manufacturing Science and Engineering Conference MSEC211 June 13-17, 211, Corvallis, Oregon, USA MSEC211-233 PLANT LAYOUT OPTIMIZATION CONSIDERING
More informationEfficient decomposition method for the stochastic optimization of public transport schedules
Efficient decomposition method for the stochastic optimization of public transport schedules Sofia Zaourar-Michel Xerox Research Centre Europe sofia.michel@xrce.xerox.com Abstract We propose a new method
More informationVisualization and modeling of traffic congestion in urban environments
1th AGILE International Conference on Geographic Information Science 27 Page 1 of 1 Visualization and modeling of traffic congestion in urban environments Authors: Ben Alexander Wuest and Darka Mioc, Department
More informationPathfinding. Artificial Intelligence for gaming
Pathfinding Artificial Intelligence for gaming Pathfinding Group AI Execution Management Strategy World Inter face Character AI Decision Making Movement Pathfinding Animation Physics Pathfinding Graphs
More informationA multimodal transport network model for advanced traveler information systems
Available online at www.sciencedirect.com Procedia Computer Science 5 (2011) 912 919 AmbienT Intelligence at the services of info-mobility and Critical Transportation networks (ARTIFACT) A multimodal transport
More informationOptimization of Bus Route using Floyd-Warshal s Algorithm 1 Alhassan Abdul-Barik, 2 Osew Philip, and 3 Stephen Akobre 1,2,3
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) International Journal of Emerging Technologies in Computational
More informationQuiz 2 Solutions. (a) T F Topological sort requires Ω(V lg V ) if the edge weights are unbounded. Explain:
Introduction to Algorithms April 15, 2009 Massachusetts Institute of Technology 6.006 Spring 2009 Professors Sivan Toledo and Alan Edelman Quiz 2 Solutions Problem 1. Quiz 2 Solutions True or False [20
More informationA SOCIAL NETWORK ANALYSIS APPROACH TO ANALYZE ROAD NETWORKS INTRODUCTION
A SOCIAL NETWORK ANALYSIS APPROACH TO ANALYZE ROAD NETWORKS Kyoungjin Park Alper Yilmaz Photogrammetric and Computer Vision Lab Ohio State University park.764@osu.edu yilmaz.15@osu.edu ABSTRACT Depending
More informationThe Increase of the Instability of Networks due to Quasi-Static Link Capacities
The Increase of the Instability of Networks due to Quasi-Static Link Capacities D. Koukopoulos a,,m.mavronicolas b, P. Spirakis c a RACTI, 61 Riga Fereou, 26221 Patras, Greece. b Department of Computer
More informationOnline Dial-A-Ride Problem with Time Windows: an exact algorithm using status vectors
Online Dial-A-Ride Problem with Time Windows: an exact algorithm using status vectors A. Fabri 1 and P. Recht 2 1 Universität Dortmund a.fabri@wiso.uni-dortmund.de 2 Universität Dortmund p.recht@wiso.uni-dortmund.de
More informationCSC 373 Lecture # 3 Instructor: Milad Eftekhar
Huffman encoding: Assume a context is available (a document, a signal, etc.). These contexts are formed by some symbols (words in a document, discrete samples from a signal, etc). Each symbols s i is occurred
More informationIdeally your algorithms for both parts should run in linear time. You will receive partial credit for a polynomial-time algorithm.
HW 7: Extra problems Instructor: Sariel Har-Peled CS/ECE 374: Algorithms & Models of Computation, Fall 2017 Version: 1.0 1 Consider a directed graph G, where each edge is colored either red, white, or
More information1 Euler Circuits. Many of the things we do in daily life involve networks, like the one shown below [Houston Street Map]. Figure 1: Houston City Map
1 Euler Circuits Many of the things we do in daily life involve networks, like the one shown below [Houston Street Map]. Figure 1: Houston City Map Suppose you needed to vist a number of locations in the
More informationProbabilistic Worst-Case Response-Time Analysis for the Controller Area Network
Probabilistic Worst-Case Response-Time Analysis for the Controller Area Network Thomas Nolte, Hans Hansson, and Christer Norström Mälardalen Real-Time Research Centre Department of Computer Engineering
More informationA Novel Trip Planner Using Effective Indexing Structure
A Novel Trip Planner Using Effective Indexing Structure M.K Chandrasekharan 1, S Shiva Shankar 2 P.G. Scholar, Department of CSE, Maharaja Institute of Technology, Coimbatore, India 1. Assistant Professor,
More informationMETRO BUS TRACKING SYSTEM
METRO BUS TRACKING SYSTEM Muthukumaravel M 1, Manoj Kumar M 2, Rohit Surya G R 3 1,2,3UG Scholar, Dept. Of CSE, Panimalar Engineering College, Tamil Nadu, India. 1muthukumaravel.muthuraman@gmail.com, 2
More informationIntermodal trip composition: the MyWay meta-planning approach
Intermodal trip composition: the MyWay meta-planning approach MyWay Final Workshop Barcelona Activa - 18 th February 2016 Michal Jakob Artificial Intelligence Center Czech Technical University in Prague
More informationReal-Time Traffic Information Management using Stream Computing
Real-Time Traffic Information Management using Stream Computing Alain Biem, Eric Bouillet, Hanhua Feng, Anand Ranganathan, Anton Riabov, Olivier Verscheure IBM TJ Watson Research Center, NY, USA {biem,
More informationdemand point given tracks
2 Introduction Establishing stops (or stations) within a transportation network is fundamental for offering public transportation service, since stops are an important part of the PTN. But it is not clear
More information3 The standard grid. N ode(0.0001,0.0004) Longitude
International Conference on Information Science and Computer Applications (ISCA 2013 Research on Map Matching Algorithm Based on Nine-rectangle Grid Li Cai1,a, Bingyu Zhu2,b 1 2 School of Software, Yunnan
More informationChapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved.
Chapter 9 Greedy Technique Copyright 2007 Pearson Addison-Wesley. All rights reserved. Greedy Technique Constructs a solution to an optimization problem piece by piece through a sequence of choices that
More information6.231 DYNAMIC PROGRAMMING LECTURE 15 LECTURE OUTLINE
6.231 DYNAMIC PROGRAMMING LECTURE 15 LECTURE OUTLINE Rollout algorithms Cost improvement property Discrete deterministic problems Sequential consistency and greedy algorithms Sequential improvement ROLLOUT
More informationLecture 19 Shortest Path vs Spanning Tree Max-Flow Problem. October 25, 2009
Shortest Path vs Spanning Tree Max-Flow Problem October 25, 2009 Outline Lecture 19 Undirected Network Illustration of the difference between the shortest path tree and the spanning tree Modeling Dilemma:
More informationShortest Path Algorithm
Shortest Path Algorithm Shivani Sanan* 1, Leena jain 2, Bharti Kappor 3 *1 Assistant Professor, Faculty of Mathematics, Department of Applied Sciences 2 Associate Professor & Head- MCA 3 Assistant Professor,
More informationPTV VISUM 18 NEW FEATURES AT A GLANCE
PTV VISUM 18 NEW FEATURES AT A GLANCE Copyright: 2018 PTV AG, Karlsruhe PTV Visum is a trademark of PTV AG All brand or product names in this documentation are trademarks or registered trademarks of the
More informationM Thulasi 2 Student ( M. Tech-CSE), S V Engineering College for Women, (Affiliated to JNTU Anantapur) Tirupati, A.P, India
Volume 4, Issue 7, July 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Enhanced Driving
More informationDynamic Capacity Routing in Networks with MTSP
Dynamic Capacity Routing in Networks with MTSP Ranjana Ponraj1*, George Amalanathan2 1 Hindustan 2 University, Chennai, Tamil Nadu, India. Periyar Maniammai University, Thanjavur, Tamil Nadu, India. *
More informationCopyright 2007 Pearson Addison-Wesley. All rights reserved. A. Levitin Introduction to the Design & Analysis of Algorithms, 2 nd ed., Ch.
Iterative Improvement Algorithm design technique for solving optimization problems Start with a feasible solution Repeat the following step until no improvement can be found: change the current feasible
More informationHOT asax: A Novel Adaptive Symbolic Representation for Time Series Discords Discovery
HOT asax: A Novel Adaptive Symbolic Representation for Time Series Discords Discovery Ninh D. Pham, Quang Loc Le, Tran Khanh Dang Faculty of Computer Science and Engineering, HCM University of Technology,
More informationIndexing in Search Engines based on Pipelining Architecture using Single Link HAC
Indexing in Search Engines based on Pipelining Architecture using Single Link HAC Anuradha Tyagi S. V. Subharti University Haridwar Bypass Road NH-58, Meerut, India ABSTRACT Search on the web is a daily
More informationWeighted Graph Algorithms Presented by Jason Yuan
Weighted Graph Algorithms Presented by Jason Yuan Slides: Zachary Friggstad Programming Club Meeting Weighted Graphs struct Edge { int u, v ; int w e i g h t ; // can be a double } ; Edge ( int uu = 0,
More informationIntroduction To Graphs and Networks. Fall 2013 Carola Wenk
Introduction To Graphs and Networks Fall 203 Carola Wenk On the Internet, links are essentially weighted by factors such as transit time, or cost. The goal is to find the shortest path from one node to
More informationA Quantum Cryptography Communication Network Based on Software Defined Network
A Quantum Cryptography Communication Network Based on Software Defined Network Hongliang Zhang 1.*, Dongxiao Quan 1.*, Changhua Zhu 1.*, and Zhigang Li 1.* 1 Skate Key Laboratory of Integrated Services
More information10/31/18. About A6, Prelim 2. Spanning Trees, greedy algorithms. Facts about trees. Undirected trees
//8 About A, Prelim Spanning Trees, greedy algorithms Lecture CS Fall 8 Prelim : Thursday, November. Visit exams page of course website and read carefully to find out when you take it (: or 7:) and what
More informationSpanning Trees, greedy algorithms. Lecture 20 CS2110 Fall 2018
1 Spanning Trees, greedy algorithms Lecture 20 CS2110 Fall 2018 1 About A6, Prelim 2 Prelim 2: Thursday, 15 November. Visit exams page of course website and read carefully to find out when you take it
More information8. The Postman Problems
8. The Postman Problems The Chinese postman problem (CPP) A postal carrier must pick up the mail at the post office, deliver the mail along blocks on the route, and finally return to the post office. To
More informationPrecept 4: Traveling Salesman Problem, Hierarchical Clustering. Qian Zhu 2/23/2011
Precept 4: Traveling Salesman Problem, Hierarchical Clustering Qian Zhu 2/23/2011 Agenda Assignment: Traveling salesman problem Hierarchical clustering Example Comparisons with K-means TSP TSP: Given the
More informationAutomatic Drawing for Tokyo Metro Map
Automatic Drawing for Tokyo Metro Map Masahiro Onda 1, Masaki Moriguchi 2, and Keiko Imai 3 1 Graduate School of Science and Engineering, Chuo University monda@imai-lab.ise.chuo-u.ac.jp 2 Meiji Institute
More informationMulti-Objective Path Search Problem Based on an Extended Network Model
Proceedings of the 2014 International Conference on Industrial Engineering and Operations Management Bali, Indonesia, January 7 9, 2014 Multi-Objective Path Search Problem Based on an Extended Network
More informationAn Extended Shortest Path Problem with Switch Cost Between Arcs
An Extended Shortest Path Problem with Switch Cost Between Arcs Xiaolong Ma, Jie Zhou Abstract Computing the shortest path in a graph is an important problem and it is very useful in various applications.
More informationA Study of Different Parallel Implementations of Single Source Shortest Path Algorithms
A Study of Different Parallel Implementations of Single Source Shortest Path s Dhirendra Pratap Singh Department of Computer Science and Engineering Maulana Azad National Institute of Technology, Bhopal
More informationTSP-Chord: An Improved Chord Model with Physical Topology Awareness
2012 International Conference on Information and Computer Networks (ICICN 2012) IPCSIT vol. 27 (2012) (2012) IACSIT Press, Singapore TSP-Chord: An Improved Chord Model with Physical Topology Awareness
More informationBijou Detouring - A Dynamic Node Level Routing Algorithm
Bijou Detouring - A Dynamic Node Level Routing Algorithm G.Reshma K.Swarupa Rani D.Leela Dharani D.Anusha Abstract This paper holds a candle light on the Dijkstra algorithm and Distance Vector routing
More informationA Benders decomposition approach for the robust shortest path problem with interval data
A Benders decomposition approach for the robust shortest path problem with interval data R. Montemanni, L.M. Gambardella Istituto Dalle Molle di Studi sull Intelligenza Artificiale (IDSIA) Galleria 2,
More informationA comparison of two new exact algorithms for the robust shortest path problem
TRISTAN V: The Fifth Triennal Symposium on Transportation Analysis 1 A comparison of two new exact algorithms for the robust shortest path problem Roberto Montemanni Luca Maria Gambardella Alberto Donati
More informationAn Investigation of Dijkstra and Floyd Algorithms in National City Traffic Advisory Procedures
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320 088X IJCSMC, Vol. 3, Issue.
More informationFrom Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
SIAM Journal on Computing to appear From Static to Dynamic Routing: Efficient Transformations of StoreandForward Protocols Christian Scheideler Berthold Vöcking Abstract We investigate how static storeandforward
More informationAlgorithm Design, Anal. & Imp., Homework 4 Solution
Algorithm Design, Anal. & Imp., Homework 4 Solution Note: The solution is for your personal use for this course. You are not allowed to post the solution in public place. There could be mistakes in the
More informationYoung Researchers Seminar 2009
Young Researchers Seminar 2009 Torino, Italy, 3 to 5 June 2009 Routing strategies minimizing travel times within multimodal transport networks Contents Motivations and objectives Network model Travel time
More informationAdaptive GPS Algorithms
Adaptive GPS Algorithms Chad Seibert Division of Science and Mathematics University of Minnesota, Morris Morris, MN 56567 seib0060@morris.umn.edu March 16, 2011 Abstract Global positioning systems (GPS)
More informationPath Planning by Using Generalized Voronoi Diagrams and Dijkstra Algorithm. Lai Hon Lin. Project Proposal. Computational Geometry
Path Planning by Using Generalized Voronoi Diagrams and Dijkstra Algorithm by Lai Hon Lin Project Proposal of Computational Geometry Assessed by: Dr. Deng Jun Hui 1. Abstract: This proposal is a description
More informationWDM Network Provisioning
IO2654 Optical Networking WDM Network Provisioning Paolo Monti Optical Networks Lab (ONLab), Communication Systems Department (COS) http://web.it.kth.se/~pmonti/ Some of the material is taken from the
More informationCreating bus timetables with maximal synchronization
Transportation Research Part A 35 2001) 913±928 www.elsevier.com/locate/tra Creating bus timetables with maximal synchronization A. Ceder a, *, B. Golany b, O. Tal b a Faculty of Civil Engineering, Technion-Israel
More informationRobust time-varying shortest path with arbitrary waiting time at vertices
Croatian Operational Research Review 525 CRORR 8(2017), 525 56 Robust time-varying shortest path with arbitrary waiting time at vertices Gholamhassan Shirdel 1, and Hassan Rezapour 1 1 Department of Mathematics,
More informationA Parallel Evolutionary Algorithm for Discovery of Decision Rules
A Parallel Evolutionary Algorithm for Discovery of Decision Rules Wojciech Kwedlo Faculty of Computer Science Technical University of Bia lystok Wiejska 45a, 15-351 Bia lystok, Poland wkwedlo@ii.pb.bialystok.pl
More informationT2CBS: Mining Taxi Trajectories for Customized Bus Systems
T2CBS: Mining Taxi Trajectories for Customized Bus Systems Yan Lyu, Chi-Yin Chow, Victor C. S. Lee, Yanhua Li and Jia Zeng Department of Computer Science, City University of Hong Kong, Hong Kong Department
More informationRouting. Information Networks p.1/35
Routing Routing is done by the network layer protocol to guide packets through the communication subnet to their destinations The time when routing decisions are made depends on whether we are using virtual
More informationCS490 Quiz 1. This is the written part of Quiz 1. The quiz is closed book; in particular, no notes, calculators and cell phones are allowed.
CS490 Quiz 1 NAME: STUDENT NO: SIGNATURE: This is the written part of Quiz 1. The quiz is closed book; in particular, no notes, calculators and cell phones are allowed. Not all questions are of the same
More informationSmart Card Data in Public Transport
Department of Technology & Operations Management Smart Card Data in Public Transport Paul Bouman Also based on work of: Evelien van der Hurk, Timo Polman, Leo Kroon, Peter Vervest and Gábor Maróti Complexity
More informationColumn Generation Method for an Agent Scheduling Problem
Column Generation Method for an Agent Scheduling Problem Balázs Dezső Alpár Jüttner Péter Kovács Dept. of Algorithms and Their Applications, and Dept. of Operations Research Eötvös Loránd University, Budapest,
More informationAN IMPROVED TAIPEI BUS ESTIMATION-TIME-OF-ARRIVAL (ETA) MODEL BASED ON INTEGRATED ANALYSIS ON HISTORICAL AND REAL-TIME BUS POSITION
AN IMPROVED TAIPEI BUS ESTIMATION-TIME-OF-ARRIVAL (ETA) MODEL BASED ON INTEGRATED ANALYSIS ON HISTORICAL AND REAL-TIME BUS POSITION Xue-Min Lu 1,3, Sendo Wang 2 1 Master Student, 2 Associate Professor
More informationThe Encoding Complexity of Network Coding
The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network
More informationHierarchical routing in traffic networks
Hierarchical routing in traffic networks Bogdan Tatomir ab Henrik Dibowski c Leon Rothkrantz ab a Delft University of Tehnology, Mekelweg 4, 2628 CD Delft b DECIS Lab, Delftechpark 24, 2628 XH Delft, The
More informationREVISED MAXSMINT ROUTING TECHNIQUE FOR OPTIMIZATION. (Received on: ; Accepted on: )
! " ###$%$ REVISED MAXSMINT ROUTING TECHNIQUE FOR OPTIMIZATION * Brindha G.R 1 and Anand.S 2 1 Assistant Professor, ICT Dept, School of Computing, SASTRA University, Thanjavur, Tamil Nadu, India 2 B.Tech-Final
More informationSpanning Trees 4/19/17. Prelim 2, assignments. Undirected trees
/9/7 Prelim, assignments Prelim is Tuesday. See the course webpage for details. Scope: up to but not including today s lecture. See the review guide for details. Deadline for submitting conflicts has passed.
More informationSpanning Trees. Lecture 22 CS2110 Spring 2017
1 Spanning Trees Lecture 22 CS2110 Spring 2017 1 Prelim 2, assignments Prelim 2 is Tuesday. See the course webpage for details. Scope: up to but not including today s lecture. See the review guide for
More information1 Shortest Paths. 1.1 Breadth First Search (BFS) CS 124 Section #3 Shortest Paths and MSTs 2/13/2018
CS 4 Section # Shortest Paths and MSTs //08 Shortest Paths There are types of shortest paths problems: Single source single destination Single source to all destinations All pairs shortest path In today
More informationGeneralization of Dijkstra s Algorithm for Extraction of Shortest Paths in Directed Multigraphs
Journal of Computer Science, 9 (3): 377-382, 2013 ISSN 1549-3636 2013 S.S. Biswas et al., This open access article is distributed under a Creative Commons Attribution (CC-BY) 3.0 license doi:10.3844/jcssp.2013.377.382
More informationMWGen: A Mini World Generator
2012 2012 IEEE 13th 13th International Conference on Mobile Mobile Data Data Management MWGen: A Mini World Generator Jianqiu Xu Database Systems for New Applications, Mathematics and Computer Science
More informationUNIT 5 GRAPH. Application of Graph Structure in real world:- Graph Terminologies:
UNIT 5 CSE 103 - Unit V- Graph GRAPH Graph is another important non-linear data structure. In tree Structure, there is a hierarchical relationship between, parent and children that is one-to-many relationship.
More informationLearning the Three Factors of a Non-overlapping Multi-camera Network Topology
Learning the Three Factors of a Non-overlapping Multi-camera Network Topology Xiaotang Chen, Kaiqi Huang, and Tieniu Tan National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy
More informationIE 102 Spring Routing Through Networks - 1
IE 102 Spring 2017 Routing Through Networks - 1 The Bridges of Koenigsberg: Euler 1735 Graph Theory began in 1735 Leonard Eüler Visited Koenigsberg People wondered whether it is possible to take a walk,
More informationGraph Traversal Algorithms
Graph Traversal Algorithms Classes that implement the algorithms Posn, CartPt, Place The classes Posn, CartPt, nad Place are those you have designed in the earlier assignments. The Place class has a name
More informationSearching for Similar Trajectories on Road Networks using Spatio-Temporal Similarity
Searching for Similar Trajectories on Road Networks using Spatio-Temporal Similarity Jung-Rae Hwang 1, Hye-Young Kang 2, and Ki-Joune Li 2 1 Department of Geographic Information Systems, Pusan National
More informationDescription of The Algorithm
Description of The Algorithm Dijkstra s algorithm works by solving the sub-problem k, which computes the shortest path from the source to vertices among the k closest vertices to the source. For the dijkstra
More informationApplication of GIS best path algorithm in Harbin Roads. Sui Min, *Wang Wei-fang
Application of GIS best path algorithm in Harbin Roads Sui Min, *Wang Wei-fang College of Forestry, Northeast Forestry University, Harbin, Heilongjiang 150040, China *Corresponding author. E-mail: weifangwang@126.com
More informationConflict-free Real-time AGV Routing
Conflict-free Real-time AGV Routing Rolf H. Möhring, Ekkehard Köhler, Ewgenij Gawrilow, and Björn Stenzel Technische Universität Berlin, Institut für Mathematik, MA 6-1, Straße des 17. Juni 136, 1623 Berlin,
More informationCS 161 Lecture 11 BFS, Dijkstra s algorithm Jessica Su (some parts copied from CLRS) 1 Review
1 Review 1 Something I did not emphasize enough last time is that during the execution of depth-firstsearch, we construct depth-first-search trees. One graph may have multiple depth-firstsearch trees,
More informationThe Shortest Path Problem
The Shortest Path Problem 1 Shortest-Path Algorithms Find the shortest path from point A to point B Shortest in time, distance, cost, Numerous applications Map navigation Flight itineraries Circuit wiring
More information