DEVELOPMENT OF A METHODOLOGY FOR BUS ROUTE NETWORK PLAN FOR THE WESTERN PROVINCE
|
|
- Beverley Sherman
- 5 years ago
- Views:
Transcription
1 DEVELOPMENT OF A METHODOLOGY FOR BUS ROUTE NETWORK PLAN FOR THE WESTERN PROVINCE R.M.N.T. Sirisoma, J.M.S.J. Bandara and Amal Kumarage Department of Civil Engineering, University of Moratuwa ABSTRACT Effective design of transit routes and service frequencies can reduce the overall cost of providing transit services, which generally consists of user costs and operator costs. Both these parties will prefer to minimize their own costs. The route design problem is very complicated due to its multi-objective nature, the non-linearity and non-convexity of the objective function that represents the cost function. Therefore, a number of computer algorithms are to be used to develop a methodology for designing the route network for the Western Province. Initially only the demand and travel distance will be taken into account and at a later stage, this network can be modified to minimize the number of transfers made within the system. The main objective of this research is to find an acceptable network that minimizes total cost including invehicle and transfer cost of bus passengers. A separate algorithm is to be used to generate the route network so that all nodes in a network have to be served at least by one route. In this algorithm, while constructing the route, it will consider the O-D pair with the maximum demand in the network demand matrix. It will then assign that demand along the minimum path route between those two nodes assuming all the passengers would select the travel path with the shortest distance. Then the program checks for the second highest demand pair and assigns that demand along the shortest path between those two nodes. Likewise all the demand values can be assigned to the network along respective minimum paths. After generating the routes based on the passenger demand along the minimum path rule, the user of the program has the choice to modify the network using set of algorithms for route breaking, route merging, changing the crossover points etc. in order to minimize the transfer trips in the entire system. This would be an iterative process until the user is satisfied with the designed route network. A methodology for route design for any transit system is presented in this paper. INTRODUCTION Effective design of transit routes and service frequencies can decrease the overall cost of providing transit services, which generally consists of passenger costs and operator costs. Both the operator and the user will prefer to minimize their own costs. The user costs includes the entire in-vehicle time and transfer time. The route design problem is complicated due to its multi-objective nature and the non-linearity and non-convexity of the objective function (Ofyar at al ). Non-availability of passenger demand data is another constraint. Therefore, the calculated demand O-D matrix can be used to identify the passenger demand distribution over the study area. Other than that the road inventory details such as nodes, links, neighbouring nodes, link length and bus terminal points should be available. In this research, only the routes, which operate in main corridors between Divisional Secretariat Divisions, will be considered. There are several types of routes such as ring routes, feeder routes, line haul routes etc. Nevertheless, not all these route types can be analysed together. One reason is smaller routes would not be available
2 at the planning stage. Other reason is demand for feeder and other local routes will depend on the arrangement of main route network. From the passengers point of view they would always like to have their trips with in a minimum travel time and a minimum cost. But operators would prefer the maximum profit with a higher demand level. Therefore, the final solution should be justifiable for both parties and the main objective of this study is to find a solution that minimises the in-vehicle travel time and the transfer time of the passengers of the whole network (Markwah at al 7). Here, it is assumed that the passengers prefer to use the minimum travel time path to their destinations. In order to minimize the total cost of passengers travelling from their origin to destination, the following objective function can be used. Minimize Travel time cost, which is given by C D t ij IVTT Where C t Cost per unit time per passenger D ij between node i and j IVTT ij In vehicle travel time between i and j Optimum Route Network ij Beginning with any node the first stage involves choosing the shortest possible link to another node. The second stage involves identifying the unconnected node that is closest to either of these connected nodes and then adding the corresponding link to the network. This process would be repeated until all the nodes have been connected. The resulting network is called as the optimal route network. Assumptions The following assumptions have been used in the algorithm to determine the optimum route network.. The demand pattern (i.e. O-D table) is static and remains constant for all periods of study.. A passenger will choose the route to their destination based on the shortest travel time.. Every bus in the system travels with constant speed on all parts or links along the route.. Travel demand is symmetric in the system (i.e. the O-D matrix is square and symmetric).. Routes can have partial overlaps.. All buses have the same capacity. 7. All buses are in good condition and operate for all 0 days per month.
3 Route Generation The first step of this process is to generate routes in the existing route network. According to the demand, routes should be introduced for every link in the system. A separate algorithm should be used to generate the route network with the constraint that all nodes have to be served by at least one bus route. For the construction of the route network, the maximum demand O-D pair from the demand matrix is considered first. Then it will assign that passenger demand along the minimum path route assuming all the passengers travel along the minimum path. Then it will check for the second highest demand pair and assign that demand along the minimum path between those two nodes. Likewise all the demand values can be assigned to the network along minimum paths. All the demands between nodes along this route should be added to that route so that it can be added some overlapping routes to the assigned route. Route Merging When several routes terminate at one node and if there are several possible ways to join two routes and, the route merging can be carried out. Two separate routes having the same terminal can be added together so that it will serve a direct route for the passengers minimizing their transfers. The first route can be selected randomly and the second route should be selected so that it saves the highest number of transfers from that common node (Figure ). When adding the routes the decision can be taken on the basis of demand density (demand per unit distance), because merging may be not cost effective for a lower passenger demand 0 R/ R R R 0 R/ Figure : Route Merging Route Breaking This route breaking can be done for routes exhibiting a significant variation in demand over their length. On each route the demand difference between each link can be recorded. The route which has the highest difference can be split into different routes (refer the figure below). The link with the least flow will become a route by itself.
4 Because of its low flow, it can operate with higher headways with a lesser number of buses. If the link with the least demand happens to fall at the end of the original route, only two routes would be generated. (Figure ) Difference Figure : Route Breaking New routes [,, ], [, ] and [, ] Alternately, it can be spilt into two different routes if the transfer demand is very high. Then the operator will be able to cover his operating cost from the available demand. Route Sprouting (Overlapping Routes) In this algorithm, the decisions can be made to introduce overlapping routes to the system. If the demand on certain links are relatively high compared to the other links one bus route may not be enough to serve the demand. Therefore overlapping route can be introduced in those links with a smaller fleet size. Here the procedure is opposite of the route breaking. It should be identified the highest difference in the link flows along a route and it can be called as the critical demand link. The critical link can become a separate route and this demand can be served by overlapping routes. (Figure ) Critical Difference Figure : Route Sprouting New Routes [,,,,] and [,]
5 Identify the Route Crossover Points Crossover can be explained by the following example.(figure ) 7 R R R R R R R R Figure : Route crossover points If route R intersects two other routes R and R the intersection point can be selected to break that route into two routes. For this figure, the possible crossovers are as follows. Name Route R Route R Route R Original [,,,,] [,,7] [,,] Crossover [,,] [7,,,,] [,,] Crossover [,,7] [,,,,] [,,] Crossover [,,,,,] [,,7] [,] Crossover [,,,,,] [,,7] [,] The purpose of doing this is recombining two routes to minimize the number of transfers and reduce underutilization of the buses along certain locations. For every intersection between two routes, there are four possible routes that might come up in the existing solution (Figure ).
6 7 7 Figure : Possible routes at an intersection The selection of new route will depend on the savings of transfer demand, which is sum of the all O-D flows along that route completely. For example selection would consists of O-D flows [7,], [7,] and [7,]. Analysis of Sample Route Network Using above algorithms and demand O-D matrix, a route network can be designed. Let us consider a sample O-D matrix as in the table, which shows the average demand per hour and the existing road network with the distances between each node (Figure ). Thereafter, this demand should be assigned to the route network. If we consider the minimum path as the design criteria it will not give any picture on the origin of the trip, the transfer nodes and number of transfers per trip etc. Therefore, when we design the network it is necessary to consider the demand, origin destination and transfer points. Therefore, the passenger assignment and the route generation should be done in parallel to each other. At the same time, the transfers at each node and the path of the trip should be tabulated. Node 7 Total Total 77 0 Table : Sample O-D Matrix
7 According to the O-D matrix given in Table, the highest demand is from node 7 to node. Therefore assign that total demand in route (R). The second highest demand is from node to node. That should be assigned in the minimum path i.e. --. The passengers from - and - should be assigned to the same route (R). Similarly, the whole demand should be assigned and if there are no direct route transfer nodes are tabulated as in the Table. The Figure 7 shows the assigned demands is shown in circles and route number is also given. Origin Node Destination Node Node Route Before R R7 R R Route After Node Route Before R R R R R R R R R R R R R R R R7 7 R R 7 R R 7 R R R R R R R R 7 R R R R R R R R R R R R R R7 R R 7 R R 7 R R 7 R R R R R R7 R R 7 R R R R R R R R R R 7 R R R R R7 R R R R7 R R R Total s 0 Table : Number of transfers Route After
8 7 * The link distances are shown in the cages Figure : Existing Road Network with the Link Distances R R7 R R R R7 R R R R 7 R R R 0 R R 0 R R R R R R Figure 7: Assigned s in each Route
9 To minimize the number of transfer trips the above network can be used. Now we can use the algorithms of route merging, route sprouting, route breaking etc. to change the route terminals. All the possibilities of merging routes can be checked and decision of adding routes, breaking routes or introducing overlapping routes can be taken with the help of route density. If the demand is less, a short distance route may be profitable with a small fleet that operates in a lower headway. To check for route sprouting the demand variation along the route is plotted. If there is a critical demand or higher demand variation, an overlapping route is introduced and the transfer saving is checked. For example consider the demand variation from node to node (Figure ) Critical Difference Figure : Variation between Node and Node Considering the demand variation an overlapping route can be introduced from node to node so that it will save 7 number of transfer trips in the system. Similarly, all the route can be checked for route sprouting. For this system, it does not need to change the crossover points since most of the transfers take place from either node or node and transfer trips can be saved in route merging. The final route network and the demand densities are given in the figure and table
10 R 7 R 0 R R7 R R R R R R R R R R R 0 R R R R7 R R R R R Figure : Final Route Network Rote Link Distance Density R 7-0 R R -- R R --- R -- 7 R7 - R - R 7- R - R -7- R - 0 R - 0 R -- R7 - Table : Density in Each Route
11 CONCLUSION The algorithm developed in this paper, can be used to design a bus route network for the Western Province. In the first stage, it can develop a bus route network considering the demand values in the O-D matrix. Then the user of the algorithm has the authority to change the network using the sub-algorithms of route merging, breaking, sprouting etc. The main objective function used in this process is to minimize the number of passenger transfers made within the defined network. In addition, the user can attempt to optimise the operator costs, since each route and each node will improve the service to the passengers but will increase the operators cost. Therefore, there should be a compromise between these two states. The proposed program can be used for other geographic areas if the relevant network and demand data and socio economic data is available for that particular area. At the same time, the user of the program should be knowledgeable on the existing route network and the road details, since the final solution needs to be based on human judgement as well as artificial intelligence. REFERENCES. Ana I. Ramirez and Priyanka N. Senevirathna, Transit Routine Design Applications Using Geographic Information System, Transportation Research Record 7. Bandara J.M.S.J., Weerasinghe S.C., Gurofsky D. and Chan P., Grade Separated Pedestrian Circulation Systems, Transportation Research Record, page to. Kumarage et al, Department of National Planning, Ministry of Finance and Planning, Colombo, Sri Lanka, Assessing Public Investment in the Transport Sector, September 00. Louis Berger International Inc, East Orange, New Jersey, USA, Sri Lanka Transport Sector Planning Study Final Report Buses, Volume, Resources Development Consultants Ltd., Colombo, Sri Lanka. Mahmood Omar Imam, Optimal Design of Public Bus Service with Equilibrium, Journal of Transportation Engineering, September-October,. Marwah B.R., Farokh S. Umrigar and Patnaik S.B., Optimal Design of Bus Routes and Friquencies for Ahmedabad, Transportarion Research Record,7 7. Ofyar Z. Tamin, Public Transport Estimation by Calibrating a Trip Distribution- Mode Choice (TDMC) Model From Passenger Counts: A Case Study in Bandung, Indonesia, Journal of Advanced Transportation, vol,. Srinivas S Pulagurtha and Shashi S Nambisan, Estimating Time Dependant O-D Trip Tables During Peak Periods, Journal of Advanced Transportation, Year 000, Vol., No.. Wijesundara W.W.M.R.K., Development and Testing of a Set of Mathematical Models for Travel Estimation, Report to Partially Fulfillment of the Requirement of the Degree of Master of Engineering, Department of Civil Engineering, University of Moratuwa Sri Lanka, June 00. Wong S.C and Tang C.O., Estimation of Time Dependent Origin Destination Matrices for Transit Networks, Transplan Res-B, Year, Vol., No.,
Trip Assignment models in TransCAD. Murtaza Haider Tel: , ext. 2480
Trip Assignment models in TransCAD Murtaza Haider murtaza.haider@ryerson.ca Tel: 416.979.5000, ext. 2480 Trip Assignment Procedures Goal: understand how to use TransCAD to: Generate inputs for trip assignment
More informationNetwork Flow Models. Chapter Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall
Network Flow Models Chapter 7 7-1 Chapter Topics The Shortest Route Problem The Minimal Spanning Tree Problem The Maximal Flow Problem 7-2 Network Components A network is an arrangement of paths (branches)
More informationIntroduction to Management Science (8th Edition, Bernard W. Taylor III) Chapter 12 Network Flow Models. Chapter 12 - Network Flow Models 1
Introduction to Management Science (8th Edition, Bernard W. Taylor III) Chapter 12 Network Flow Models Chapter 12 - Network Flow Models 1 Chapter Topics The Shortest Route Problem The Minimal Spanning
More informationSTOCHASTIC USER EQUILIBRIUM TRAFFIC ASSIGNMENT WITH MULTIPLE USER CLASSES AND ELASTIC DEMAND
STOCHASTIC USER EQUILIBRIUM TRAFFIC ASSIGNMENT WITH MULTIPLE USER CLASSES AND ELASTIC DEMAND Andrea Rosa and Mike Maher School of the Built Environment, Napier University, U e-mail: a.rosa@napier.ac.uk
More informationGuidelines for Traffic Counting. May 2013
Guidelines for Traffic Counting May 2013 Guidelines for Traffic Counting Matthew Rodwell Hastings District Council Abbreviations ADT AADT HCV HPMV NZTA RAMM RCA TMS VKT Average Daily Traffic Annual Average
More informationFigure 1: Summary Status of Actions Recommended in June 2016 Committee Report. Status of Actions Recommended # of Actions Recommended
Chapter 3 Section 3.05 Metrolinx Regional Transportation Planning Standing Committee on Public Accounts Follow-Up on Section 4.08, 2014 Annual Report In November 2015, the Standing Committee on Public
More informationVerification Plan: Mitchell Hammock Road. Adaptive Traffic Signal Control System. Prepared by: City of Oviedo. Draft 1: June 2015
Verification Plan: Mitchell Hammock Road Adaptive Traffic Signal Control System Red Bug Lake Road from Slavia Road to SR 426 Mitchell Hammock Road from SR 426 to Lockwood Boulevard Lockwood Boulevard from
More informationOR 217,I-5 Experience Portland, OR
OR 217,I-5 Experience Portland, OR By: Abby Caringula Parsons Brinckerhoff July 8th, 2011 Presentation Outline Background VISUM Network Adjustment Model Origin-Destination(O-D) Demand Development ANM Export
More informationBasic Concepts And Future Directions Of Road Network Reliability Analysis
Journal of Advanced Transportarion, Vol. 33, No. 2, pp. 12.5-134 Basic Concepts And Future Directions Of Road Network Reliability Analysis Yasunori Iida Background The stability of road networks has become
More informationMulti-Modal Inter-Regional Travel Demand Estimation
90 th TRB Annual Meeting, Jan 25 th, 2011, Washington, DC Multi-Modal Inter-Regional Travel Demand Estimation A Review of National-Level Passenger Travel Analysis Methodologies and Their Implications on
More informationWorkshop on Traffic Assignment with Equilibrium Methods
Workshop on Traffic Assignment with Equilibrium Methods Presented by: David Boyce and Michael Florian Northwestern University and University of Montreal Sponsored by: Subcommittee on Network Equilibrium
More informationSpatial Analysis (Vector) II
Spatial Analysis (Vector) II GEOG 300, Lecture 9 Dr. Anthony Jjumba 1 A Spatial Network is a set of geographic locations interconnected in a system by a number of routes is a system of linear features
More informationCh.07 Shortest Route, Minimal Spanning Tree, and Maximal Flow Models. Management Science / Prof. Bonghyun Ahn
Ch.07 Shortest Route, Minimal Spanning Tree, and Maximal Flow Models Management Science / Prof. Bonghyun Ahn Chapter Topics Network Components The Shortest Route Problem The Minimal Spanning Tree Problem
More informationLecture 8 Network Flow Models
Lecture 8 Andrew Nunekpeku / Charles Jackson Fall 2011 Outline 1 1 Assignment 4 When we ask for the solution of an LP, we typically mean tell me the values of the decision variables or what is the plan?
More informationVeirs Mill Road Metrobus Improvements Request to Conduct Public Hearing
Customer Services, Operations, and Safety Committee Board Information Item III-B September 24, 2009 Veirs Mill Road Metrobus Improvements Request to Conduct Public Hearing Washington Metropolitan Area
More informationDESIGNING ALGORITHMS FOR SEARCHING FOR OPTIMAL/TWIN POINTS OF SALE IN EXPANSION STRATEGIES FOR GEOMARKETING TOOLS
X MODELLING WEEK DESIGNING ALGORITHMS FOR SEARCHING FOR OPTIMAL/TWIN POINTS OF SALE IN EXPANSION STRATEGIES FOR GEOMARKETING TOOLS FACULTY OF MATHEMATICS PARTICIPANTS: AMANDA CABANILLAS (UCM) MIRIAM FERNÁNDEZ
More informationProposed FY 06 Project Development Program and FY 05 Project Development Program Update
Washington Metropolitan Area Transit Authority Proposed FY 06 Project Development Program and FY 05 Project Development Program Update Presented to the Board of Directors: P D E C Planning & Development
More informationCouncil of State Governments. Takoma Langley Transit Center Purple Line Project Briefing. October 28, 2013
Council of State Governments Takoma Langley Transit Center Purple Line Project Briefing October 28, 2013 Takoma Langley Transit Center Purpose and Need Provide a safe, attractive and efficient facility
More informationMETRO SHORT RANGE TRANSIT PLAN FY Executive Summary May 2009 DIVERSIFIED TRANSPORTATION SOLUTIONS
METRO SHORT RANGE TRANSIT PLAN FY 2010 2014 2014 Executive Summary May 2009 DIVERSIFIED TRANSPORTATION SOLUTIONS OVERVIEW Purpose of Metro SRTP Develop multi year strategic plan to improve transit quality,
More informationHEURISTICS FOR THE NETWORK DESIGN PROBLEM
HEURISTICS FOR THE NETWORK DESIGN PROBLEM G. E. Cantarella Dept. of Civil Engineering University of Salerno E-mail: g.cantarella@unisa.it G. Pavone, A. Vitetta Dept. of Computer Science, Mathematics, Electronics
More informationCentrality Measures to Identify Traffic Congestion on Road Networks: A Case Study of Sri Lanka
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 13, Issue 2 Ver. I (Mar. - Apr. 2017), PP 13-19 www.iosrjournals.org Centrality Measures to Identify Traffic Congestion
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 informationMetrobus 30s Line Enhancements
Customer Service, Operations and Safety Committee Action Item III-C February 14, 2008 Metrobus 30s Line Enhancements Washington Metropolitan Area Transportation Authority Board Action/Information Summary
More informationConical Travel Time Functions for the GTA Road Network. Gabriel Alvarado
Conical Travel Time Functions for the GTA Road Network by Gabriel Alvarado A project submitted in conformity with the requirements for the degree of Master of Engineering Graduate Department of Civil Engineering
More informationSYDE Winter 2011 Introduction to Pattern Recognition. Clustering
SYDE 372 - Winter 2011 Introduction to Pattern Recognition Clustering Alexander Wong Department of Systems Design Engineering University of Waterloo Outline 1 2 3 4 5 All the approaches we have learned
More informationAutomatically Balancing Intersection Volumes in A Highway Network
Automatically Balancing Intersection Volumes in A Highway Network Jin Ren and Aziz Rahman HDR Engineering, Inc. 500 108 th Avenue NE, Suite 1200 Bellevue, WA 98004-5549 Jin.ren@hdrinc.com and 425-468-1548
More informationUniversity of Florida CISE department Gator Engineering. Clustering Part 2
Clustering Part 2 Dr. Sanjay Ranka Professor Computer and Information Science and Engineering University of Florida, Gainesville Partitional Clustering Original Points A Partitional Clustering Hierarchical
More informationOptimized DTN-Routing for Urban Public Transport Systems
Optimized DTN-Routing for Urban Public Transport Systems Tobias Pögel Institute of Operating Systems and Computer Networks Technische Universität Braunschweig, Germany poegel@ibr.cs.tu-bs.de Abstract Communication
More informationCHAPTER 3 MAP DIGITIZING
CHAPTER 3 MAP DIGITIZING 3.1 Introduction This chapter deals with the route map digitizing process. The type of data collected, the plotting of the trajectory, digitizing the map into regular intervals
More informationCELLULAR M2M DEVICE CONNECTIONS AND REVENUE: WORLDWIDE TRENDS AND FORECASTS
analysysmason.com RESEARCH FORECAST REPORT CELLULAR M2M DEVICE CONNECTIONS AND REVENUE: WORLDWIDE TRENDS AND FORECASTS 2015 2025 MICHELE MACKENZIE Analysys Mason Limited 2016 About this report This report
More informationIntroducing convergent feedback in the Melbourne Integrated Transport Model
Introducing convergent feedback in the Melbourne Integrated Transport Model Mansel Rogerson, Frank Carnovale VicRoads, Kew, Victoria, Australia 1 Introduction The importance of achieving convergence in
More informationKhushboo Arora, Samiksha Agarwal, Rohit Tanwar
International Journal of Scientific & Engineering Research, Volume 7, Issue 1, January-2016 1014 Solving TSP using Genetic Algorithm and Nearest Neighbour Algorithm and their Comparison Khushboo Arora,
More informationESTIMATING PARAMETERS FOR MODIFIED GREENSHIELD S MODEL AT FREEWAY SECTIONS FROM FIELD OBSERVATIONS
0 ESTIMATING PARAMETERS FOR MODIFIED GREENSHIELD S MODEL AT FREEWAY SECTIONS FROM FIELD OBSERVATIONS Omor Sharif University of South Carolina Department of Civil and Environmental Engineering 00 Main Street
More informationOptimal Detector Locations for OD Matrix Estimation
Optimal Detector Locations for OD Matrix Estimation Ying Liu 1, Xiaorong Lai, Gang-len Chang 3 Abstract This paper has investigated critical issues associated with Optimal Detector Locations for OD matrix
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 informationUNIT 2 LINEAR PROGRAMMING PROBLEMS
UNIT 2 LINEAR PROGRAMMING PROBLEMS Structure 2.1 Introduction Objectives 2.2 Linear Programming Problem (LPP) 2.3 Mathematical Formulation of LPP 2.4 Graphical Solution of Linear Programming Problems 2.5
More informationAnalytical strategies in deciding bus route alignments
University of South Florida Scholar Commons Graduate Theses and Dissertations Graduate School 2003 Analytical strategies in deciding bus route alignments Sandeep Seshan Iyer University of South Florida
More informationA transit network design model for urban areas
A transit network design model for urban areas M. Petrelli Dip. di Scienze dell Ingegneria Civile, Università di Roma Tre, Italy Abstract Transit network design is discussed in an extensive amount of literature,
More informationUsing graph theoretic measures to predict the performance of associative memory models
Using graph theoretic measures to predict the performance of associative memory models Lee Calcraft, Rod Adams, Weiliang Chen and Neil Davey School of Computer Science, University of Hertfordshire College
More informationNovember 28, 2012 ALTERNATIVES ANALYSIS PUBLIC MEETING
November 28, 2012 ALTERNATIVES ANALYSIS PUBLIC MEETING Project Background Description of the Project Alternatives Analysis Process Project Progress Activity Stations Comments Adjourn 2 VIA spent 2 years
More informationThe Practical Side of Cell Phones as Traffic Probes
The Practical Side of Cell Phones as Traffic Probes The information contained in this document is considered proprietary, and may not be reproduced or redistributed without the consent of Delcan Inc. Cell
More informationCentral Corridor. - Central Corridor. Management Committee, Light Rail Transit. Rail-Volution - Weaving Transit into Existing Communities
- Central Corridor Rail-Volution - Weaving Transit into Existing Communities Management Committee, October 31, 2009 June Improving 11, 2008 mobility Easing congestion Strengthening our communities Twin
More information1. Sorting (assuming sorting into ascending order) a) BUBBLE SORT
DECISION 1 Revision Notes 1. Sorting (assuming sorting into ascending order) a) BUBBLE SORT Make sure you show comparisons clearly and label each pass First Pass 8 4 3 6 1 4 8 3 6 1 4 3 8 6 1 4 3 6 8 1
More informationPublic Outreach Overview Tuesday, September 27. COTA William J. Lhota Building 33 N. High St. Columbus, OH 43215
Public Outreach Overview Tuesday, September 27 COTA William J. Lhota Building 33 N. High St. Columbus, OH 43215 Project Overview Goals and Overview Create a community vision for the future of public transportation
More informationNMC Sample Problems: Grade 8
NM Sample Problems: Grade 8. right triangle has lengths of and 8 in sides. What is the length of hypotenuse (the longest side)? (b) 0 5. n isosceles triangle has the base length of 6 and each side of length.
More informationConveyor Performance based on Motor DC 12 Volt Eg-530ad-2f using K-Means Clustering
IOP Conference Series: Materials Science and Engineering PAPER OPEN ACCESS Conveyor Performance based on Motor DC 12 Volt Eg-530ad-2f using K-Means Clustering To cite this article: Zaenal Arifin et al
More informationOptimisation of a Bus Network Configuration and Frequency Considering the Common Lines Problem
Journal of Transportation Technologies, 2012, 2, 220-229 http://dx.doi.org/10.4236/jtts.2012.23024 Published Online July 2012 (http://www.scirp.org/journal/jtts) Optimisation of a Bus Network Configuration
More informationGrade 4 CCSS Pacing Guide: Math Expressions
Grade 4 CCSS Pacing Guide: Math Expressions Green : Areas of intensive focus, where students need fluent understanding and application of the core concepts (Approximately 70%) Blue : Rethinking and linking;
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 informationCreating transportation system intelligence using PeMS. Pravin Varaiya PeMS Development Group
Creating transportation system intelligence using PeMS Pravin Varaiya PeMS Development Group Summary Conclusion System overview Routine reports: Congestion monitoring, LOS Finding bottlenecks Max flow
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 informationCase Study: Finding Shortest Path Itineraries for Security Runs in Robotics
Case Study: Finding Shortest Path Itineraries for Security Runs in Robotics Security Run Problem I In Autonomous Mobile Robotics (AMR), robots are confronted regularly with the problem of finding the best
More informationIntroduction to Dynamic Traffic Assignment
Introduction to Dynamic Traffic Assignment CE 392D January 22, 2018 WHAT IS EQUILIBRIUM? Transportation systems involve interactions among multiple agents. The basic facts are: Although travel choices
More informationTransit Network Sensitivity Analysis
Transit Network Sensitivity Analysis Transit Network Sensitivity Analysis Young-Jae Lee, Morgan State University Abstract Transit network conditions change everyday. While those changes should be considered
More informationSimulating Growth of Transportation Networks
The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 348 355 Simulating Growth of Transportation
More information2) Ciliwung riverside, extension from Kota (low- and middle-rise buildings) 4) Tomang Slipi (S. Parman) roadside (middle- and high-rise buildings)
3.3 TARGET TDM AREA The Study on Integrated Transportation Master Plan for JABODETABEK (Phase II) (1) Major Business and Commercial Activity Centers Traffic restraint measures for TDM shall be designed
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 informationClustering CS 550: Machine Learning
Clustering CS 550: Machine Learning This slide set mainly uses the slides given in the following links: http://www-users.cs.umn.edu/~kumar/dmbook/ch8.pdf http://www-users.cs.umn.edu/~kumar/dmbook/dmslides/chap8_basic_cluster_analysis.pdf
More informationM50 Demand Management Study
Study Briefing paper to the Strategic Policy Committees (Transport) of : Dun Laoghaire Rathdown County Council, Dublin City Council Fingal County Council South Dublin Co Council 5 th June 2013 December
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 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 informationCORSIM User's Guide. Version 6.0
CORSIM User's Guide Version 6.0 Prepared by: ITT Industries, Inc., Systems Division ATMS R&D and Systems Engineering Program Team P O Box 15012 Colorado Springs, CO 80935-5012 Prepared for: FHWA Office
More informationThe districting problem: applications and solving methods
The districting problem: applications and solving methods Viviane Gascon Département des sciences de la gestion Université du Québec à Trois-Rivi Rivières 1 Introduction The districting problem consists
More informationAn Android Smartphone Application for Collecting, Sharing and Predicting the Niagara Frontier Border Crossings Waiting Time
An Android Smartphone Application for Collecting, Sharing and Predicting the Niagara Frontier Border Crossings Waiting Time Lei Lin 1, Qian Wang 1, Adel W. Sadek 1, Yan Li 2 1 Civil, Structural and Environmental
More informationSeminar on African Electrical Interconnection. Module 1. The feasibility of Regional Electricity Cooperation and Integration
Seminar on African Electrical Interconnection Module 1 The feasibility of Regional Electricity Cooperation and Integration Module 1 - RECI Feasibility Focuses on: Winning conditions for cooperation and
More informationNETWORK OPTIMIZATION MODELS
NETWORK OPTIMIZATION MODELS Network models Transportation, electrical and communication networks pervade our daily lives. Network representation are widely used in: Production, distribution, project planning,
More informationGraph-based Analysis of City-wide Traffic Dynamics using Time-evolving Graphs of Trajectory Data
Australasian Transport Research Forum 2016 Proceedings 16 18 November 2016, Melbourne, Australia Publication website: http://www.atrf.info Graph-based Analysis of City-wide Traffic Dynamics using Time-evolving
More informationThe birth of public bus transportation system
Link Travel Time Prediction using Origin Destination Matrix and Neural Network Model AYOBAMI EPHRAIM ADEWALE University of Tartu adewale@ut.ee May 28, 2018 Abstract Origin Destination matrix have been
More informationKuwait Railroad & Rapid Transit Systems. Eng. Khaled A. Al-Awadhi General Manager Kuwait Metro Rapid Transport Co.
Kuwait Railroad & Rapid Transit Systems Eng. Khaled A. Al-Awadhi General Manager Kuwait Metro Rapid Transport Co. October2011 Contents Introduction Background Kuwait Rapid Transport System Kuwait Rail
More informationApplications. Foreground / background segmentation Finding skin-colored regions. Finding the moving objects. Intelligent scissors
Segmentation I Goal Separate image into coherent regions Berkeley segmentation database: http://www.eecs.berkeley.edu/research/projects/cs/vision/grouping/segbench/ Slide by L. Lazebnik Applications Intelligent
More informationSolution of m 3 or 3 n Rectangular Interval Games using Graphical Method
Australian Journal of Basic and Applied Sciences, 5(): 1-10, 2011 ISSN 1991-8178 Solution of m or n Rectangular Interval Games using Graphical Method Pradeep, M. and Renukadevi, S. Research Scholar in
More informationRobin Bailey Head of Decision Systems Group June 2005 Belgrade. Outline
Analysys STEM case studies Migrating separate voice and data services to an NGN platform Measuring the economic potential of ADSL Adding data revenues in transition from GSM to UMTS Robin Bailey Head of
More informationFurther Mathematics 2016 Module 2: NETWORKS AND DECISION MATHEMATICS Chapter 9 Undirected Graphs and Networks
Further Mathematics 2016 Module 2: NETWORKS AND DECISION MATHEMATICS Chapter 9 Undirected Graphs and Networks Key knowledge the conventions, terminology, properties and types of graphs; edge, face, loop,
More informationAhadjitse, Yaovi(1) Mohamed Shawky(2) (1)Université du Québec en Outaouais, Gatineau, Canada (2) Universitéde Technologiede Compiégne, France
IlhamBenyahia(1) Ahadjitse, Yaovi(1) Mohamed Shawky(2) (1)Université du Québec en Outaouais, Gatineau, Canada (2) Universitéde Technologiede Compiégne, France ACGM-2012 1 Outline 1. Introduction 2. Existing
More informationTransit Development Plan - Draft October 2015
Transit Development Plan - Draft October 2015 Agenda What is a TDP? Market Analysis and Existing Conditions Community Outreach 10-Year Transit Development Plan Next Steps TDP conducted in conjunction with
More informationUnsupervised Learning : Clustering
Unsupervised Learning : Clustering Things to be Addressed Traditional Learning Models. Cluster Analysis K-means Clustering Algorithm Drawbacks of traditional clustering algorithms. Clustering as a complex
More informationCopyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Chapter 17. PATH ANALYSIS AND NETWORK APPLICATIONS 17.1 Path Analysis 17.1.1 Source Raster 17.1.2 Cost Raster Box 17.1 Cost Raster for a Site Analysis of Pipelines 17.1.3 Cost Distance Measures 17.1.4
More informationStability analysis of Activity-Based models
Stability analysis of Activity-Based models Case study of the Tel Aviv Transportation Model Shlomo Bekhor Technion, Israel Institute of Technology Leonid Kheifits Independent Consultant, Israel Michael
More informationGain familiarity with factors and multiples. Use place value understanding and properties of operations to perform multi-digit arithmetic.
Prairie-Hills Elementary School District 144 4 th Grade ~ MATH Curriculum Map Quarter 1 Month: August, September, October Domain(s): Operations and Algebraic Thinking Number Base Ten (NBT) Cluster(s):
More informationAPPENDIX E TRANSPORTATION
APPENDIX E TRANSPORTATION 2011 PATRON SURVEYS VISSIM MODEL CALIBRATION AND VALIDATION Environmental and Planning Consultants 440 Park Avenue South 7th Floor New York, NY 10016 tel: 212 696-0670 fax:
More informationOPERATIONS RESEARCH. Transportation and Assignment Problems
OPERATIONS RESEARCH Chapter 2 Transportation and Assignment Problems Prof Bibhas C Giri Professor of Mathematics Jadavpur University West Bengal, India E-mail : bcgirijumath@gmailcom MODULE-3: Assignment
More informationANNUAL NATIONAL ASSESSMENT 2015 ASSESSMENT GUIDELINES MATHEMATICS GRADE 7
ANNUAL NATIONAL ASSESSMENT 2015 ASSESSMENT GUIDELINES MATHEMATICS GRADE 7 INTRODUCTION The 2015 cycle of Annual National Assessment (ANA 2015) will be administered in all public and designated 1 independent
More informationTRANSPORT PLANNING AND
Tutorial TRANSPORT PLANNING AND MODELING Using TFTP (Teacher Friendly Transportation Program) WHAT IS MODEL? Ortusar and Willumsen, 1994, A simplified representation of a part of the real world the system
More informationInteractive Math Glossary Terms and Definitions
Terms and Definitions Absolute Value the magnitude of a number, or the distance from 0 on a real number line Addend any number or quantity being added addend + addend = sum Additive Property of Area the
More informationImproved K-Means Algorithm for Capacitated Clustering Problem
Improved K-Means Algorithm for Capacitated Clustering Problem S. GEETHA 1 G. POONTHALIR 2 P. T. VANATHI 3 PSG College of Technology Tamil Nadu India 1 geet_shan@yahoo.com 2 thalirkathir@rediffmail.com
More informationDynamically Configured λ-opt Heuristics for Bus Scheduling
Dynamically Configured λ-opt Heuristics for Bus Scheduling Prapa Rattadilok and Raymond S K Kwan School of Computing, University of Leeds, UK {prapa, rsk}@comp.leeds.ac.uk Bus scheduling is a complex combinatorial
More informationDetection spacing of DSRC-based data collection system for real-time highway travel time estimation
American Journal of Civil Engineering 2013; 1(1): 41-48 Published online June 30, 2013 (http://www.sciencepublishinggroup.com/j/ajce) doi: 10.11648/j.ajce.20130101.16 Detection spacing of DSRC-based data
More informationIt s Only a Matter of Time Using GTFS in the NY Best Practice Model
It s Only a Matter of Time Using GTFS in the NY Best Practice Model presented to 2016 Transport-Tech Summit presented by Cambridge Systematics, Inc. Nikhil Puri November 15, 2016 1 Outline Background and
More informationCrystal Springs Upland School Transportation Demand Management Plan. March 2016
Crystal Springs Upland School Transportation Demand Management Plan March 06 CONTENTS Introduction... Transportation Demand Management (TDM) Program.... Background/Survey of Existing Student Commuting
More informationA New Framework for Development of Time Varying OD Matrices Based on Cellular Phone Data
A New Framework for Development of Time Varying OD Matrices Based on Cellular Phone Data Corresponding Author: Jingtao Ma, Mygistics Inc. 9755 SW Barnes Rd Suite 550 Portland, OR 97225 Phone +01-503-575-2191,
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 informationTransit Development Plan/Transportation Demand. Chuck Steigerwald Director of Strategic Planning. Management Plan
Transit Development Plan/Transportation Demand Chuck Steigerwald Director of Strategic Planning Management Plan OmniRide Strategic Plan Phase III TDP/TDMP Recommended service changes Ten-year plan Final
More informationUsing GPS Based Origin-Destination Data to Improve Traffic Studies. Michael R. Wahlstedt, PE, PTOE OTEC October 11, 2017
Using GPS Based Origin-Destination Data to Improve Traffic Studies Michael R. Wahlstedt, PE, PTOE OTEC October 11, 2017 Overview Benefits of using O-D data for traffic analysis, particularly for operational
More informationAnnouncements. Data Sources a list of data files and their sources, an example of what I am looking for:
Data Announcements Data Sources a list of data files and their sources, an example of what I am looking for: Source Map of Bangor MEGIS NG911 road file for Bangor MEGIS Tax maps for Bangor City Hall, may
More informationGenetic algorithms and VRP: the behaviour of a crossover operator
Baltic J. Modern Computing, Vol. 1 (2013), No. 3-4, 161-185 Genetic algorithms and VRP: the behaviour of a crossover operator Gintaras VAIRA and Olga KURASOVA Vilnius University, Institute of Mathematics
More informationAn Improved Method of Vehicle Driving Cycle Construction: A Case Study of Beijing
International Forum on Energy, Environment and Sustainable Development (IFEESD 206) An Improved Method of Vehicle Driving Cycle Construction: A Case Study of Beijing Zhenpo Wang,a, Yang Li,b, Hao Luo,
More informationFault-Tolerant Routing Algorithm in Meshes with Solid Faults
Fault-Tolerant Routing Algorithm in Meshes with Solid Faults Jong-Hoon Youn Bella Bose Seungjin Park Dept. of Computer Science Dept. of Computer Science Dept. of Computer Science Oregon State University
More informationPTV VISSIM - BASE. Introduction to microscopic traffic simulation with PTV Vissim. PRICE: ####,- DHS plus VAT SHORT DESCRIPTION TARGET GROUP
PTV VISSIM BASIC PTV VISSIM - BASE Introduction to microscopic traffic simulation with PTV Vissim You will learn modeling of transport network and demand microscopically. In addition to private traffic
More informationDOWNLOAD OR READ : THE WAY INTERSECTION PROBLEM FOR M CYCLE SYSTEMS PDF EBOOK EPUB MOBI
DOWNLOAD OR READ : THE WAY INTERSECTION PROBLEM FOR M CYCLE SYSTEMS PDF EBOOK EPUB MOBI Page 1 Page 2 the way intersection problem for m cycle systems the way intersection problem pdf the way intersection
More informationGRAPH-BASED MODELING AND DIJKSTRA ALGORITHM FOR SEARCHING VEHICLE ROUTES ON HIGHWAYS
International Journal of Mechanical Engineering and Technology (IJMET) Volume 9, Issue 8, August 2018, pp. 1273 1280, Article ID: IJMET_09_08_137 Available online at http://www.iaeme.com/ijmet/issues.asp?jtype=ijmet&vtype=9&itype=8
More information