Applied Graph‑ Theoretic Approach for Two‑ Way to One‑ Way Road Network Conversion

Total Page:16

File Type:pdf, Size:1020Kb

Applied Graph‑ Theoretic Approach for Two‑ Way to One‑ Way Road Network Conversion This document is downloaded from DR‑NTU (https://dr.ntu.edu.sg) Nanyang Technological University, Singapore. Applied graph‑ theoretic approach for two‑ way to one‑ way road network conversion Tan, Kok Chuen 2005 Tan, K. C. (2005). Applied graph‑ theoretic approach for two‑ way to one‑ way road network conversion. Master’s thesis, Nanyang Technological University, Singapore. https://hdl.handle.net/10356/6468 https://doi.org/10.32657/10356/6468 Nanyang Technological University Downloaded on 10 Oct 2021 00:13:03 SGT _.'._"-,1 .- ATTENTION: The Singapore Copyright Act applies to the use of this document. Nanyang Technological University Library An Applied Graph-Theoretic Approach for Two-way to One-way Road Network Conversion Tan Kok Chuen School ofMechanical & Aerospace Engineering A Master thesis submitted to Nanyang Technological University in fulfillment ofthe requirement for the degree of Master ofEngineering 2005 T \ ATTENTION: The Singapore Copyright Act applies to the use of this document. Nanyang Technological University Library Abstract It is not uncommon in the field of traffic engineering for two-way roads to be converted to one-way roads and vice versa. In these situations the traffic engineer would be faced with the problem of selecting direction for each of the one-way roads. This problem is named the one-way road network problem in this thesis. By modelling the road networks as graphs, an algorithm (called 'conversion algorithm' in this thesis) is developed; this enables the search for a global optimal solution for the given road network (based on a theoretical efficiency criterion) by means of enumeration, or exhaustive listing of solutions. The said conversion algorithm is next coupled with the minimum cut graph model which allows further refinement of the theoretical solution(s) obtained based on actual existing traffic conditions. The conversion algorithm together with the minimum cut graph model thus form a model named 'one-way road network model' for solving the above-mentioned problem. A case study is selected and simulated in order to verify the usefulness ofthe one-way road network model. In the one-way road network model, two-way road networks are modelled by undirected graphs and one-way road networks by digraphs. The problem then becomes one of converting an undirected graph to a digraph. The conversion algorithm is developed for obtaining feasible digraphs; this is done by using the device ofbinary number counting to model the directionality of digraph edges so as to enumerate all possible digraphs. For a road network, only strongly connected graphs are "feasible" hence the concept of strong connectivity is incorporated in the conversion algorithm to weed out the "infeasible" digraphs. This is done by inspecting the indegrees and outdegrees of each of the enumerated digraphs. Those with zero indegree or outdegree are not strongly connected and are removed by the conversion algorithm. To arrive at a more efficient one-way road network, the theoretical aspects of network efficiency including junction-traversal delay are explored. Dijkstra's algorithm is modified from calculating the shortest path to calculating the network shortest total travel time. The modified algorithm is incorporated as part ofthe conversion algorithm and used to compare the digraphs enumerated to give the digraph(s) representing the road network with shortest total travel time. ATTENTION: The Singapore Copyright Act applies to the use of this document. Nanyang Technological University Library With the selected 'theoretically efficient' road networks, actual traffic conditions are then taken into consideration and the various one-way road directions on the network are reversed and tested using a minimum-cut graph model. This allows efficient consideration of not only each direction but combinations of directions from different roads as well. By employing a minimum cut algorithm onto the graph model, the desired directions at critical junctions of the- one-way road system for the case study are decided. This gives an efficient one-way road network layout based on actual traffic conditions for the selected case study. The one-way road network is tested against the original two-way road network by means of computer simulation. Results of the simulation runs showed that the one-way road network performed better than the original two-way road network under given traffic load of the case study. This thus verifies the usefulness of the one-way road network model developed in this thesis. Recommendations for future work include improving the conversion algorithm by graph manipulation techniques. Using heuristic reasoning on the results obtained, patterns such as 'twirls' in the one-way roads can be observed; this suggests that graph manipulation techniques identifying digraphs with such patterns can be developed as shortcuts to obtaining theoretically efficient digraphs. Such techniques allow the huge number of infeasible graphs to be removed without having to enumerate all possible digraphs, saving on time and computational resources. A limitation of the minimum-cut graph model caused by the triangle graphs employed can also be further researched. In addition, complexity aspects ofthe one-way road network problem can also be looked into. In the above study, it is assumed that all roads used are unsignalised, that is road junctions are assumed to have no traffic lights; traffic flow consists of only motorised vehicles excluding motorcycles, bicycles and pedestrians; road network is analysed at a macro level, that is to say concepts and variables at the micro level (like driver behaviour, fuel emission, car-following theory) will not be taken into consideration; a fixed traffic demand is used, that is the amount of traffic used for various simulation runs will remain unchanged. 11 ATTENTION: The Singapore Copyright Act applies to the use of this document. Nanyang Technological University Library Acknowledgements The author would like to extend his sincere gratitude to the following people: Supervisor, A/Prof Lew Sin Chye, for his guidance and contributions throughout this project. A/Prof Wong Yiik Diew, A/Prof Lum Kit Meng and A/Prof Tan Van Weng for advice and help in matters pertaining to traffic assignment, transportation simulation and statistics. Technical and administrative staff from Centre for Advanced Numeric Engineering Simulations, School of Mechanical & Production Engineering and Transportation Laboratory, School ofCivil & Environmental Engineering. Fellow graduate students from Rapid Prototyping Research Laboratory and MAE Graduate Student Club for their support and friendship. Fellow hostelites from Hall of Residence 1, Hall of Residence 2 and Hall of Residence 9 for their care and companionship. Especially to Willi Ching Choon Yong, May Win Naing, Valren Wee Zhi Sheng, Gabriel Lee Yeong Yeow, Lawrence Lim Chee Leong and Andy Chua Loy Ngee for their help in making this journey possible. Last but not least friends, family and loved ones for their love and encouragement. iii ATTENTION: The Singapore Copyright Act applies to the use of this document. Nanyang Technological University Library T able of Contents ~]J~1r~,<:1r.......•..•.•.. D.O.OD •••••••• OO •••••••••••••••••••••••••••••••••••• ~ •••••••••••••••••••• ~.I ~<:KN"OWLEDGEMENTS .....•....• 5 •••••••••••••••••••••••••••••••••••••• 0 •••••••••• 00 ••• 0 ••111 1r~]JLE OF <:ON1rENT~.•...•. II "' II II II IV LIS1r. OF FIGURES•..•.......•.... 0 •• I) II) a •••••••••••••••••••••••••• D ••••••••••••••••••••••••••••••IX LIST OF T~BLES•..................•...•...•.....••....•.•.•.....•.• o ••••••••••••••••••••••••• ~XII I IN1rRODUC1rION•......•••. II '...... 1 1.1 Background............................................................................. 1 1.2 Objectives... 4 1.3 Scope... 4 1.4 Organisation ofthe Thesis. ....... ... ... ... .... ...... .. ............. .............. ... 5 II LITERA1rURE REVIEW. II c> C> II................... 7 2.1 Overview 0......................................... 7 2.2 Background information... ... 7 2.2.1 Combinatorics...... 7 2.2.2 Graph Theory 00. ....................... 8 2.2.2.1 Graph........................................................................... 9 2.2.2.2 Adjacency matrix............................................................. 9 2.2.2.3 Directed graph................................................................. 10 ~ ~ 2.2.2.4 Indegree and outdegree 0•••••••••••••••••••••• 0.. 11 2.2.2.5 Weighted graph............................................................... 12 2.2.2.6 Minimum spanning tree (MS1)... 13 2.2.2.7 Strong Connectivity. ............................. ........................ .. 14 2.2.2.8 Shortest path algorithm...................................................... 14 2.2.2.9 Shortest total path... .. .. 15 2.2.2.10 Minimum cut and Maximum flow... 16 iv ATTENTION: The Singapore Copyright Act applies to the use of this document. Nanyang Technological University Library 2.2.3 Application ofgraph theory. ....... ... .......................................... 18 2.2.3.1 Tree building in traffic assignment...................................... 18 2.2.3.2 Minimum-cut graph model in Module Orientation Problem......... 19 2.2.4 Traffic assignment. 24 2.2.4.1 O-D matrix... 25 2.2.4.2 Cost-flow function............................................................ 26 2.2.4.3 Vehicle arrival distribution... ... 27 2.2.4.4 Measurement-of-effectiveness (MOE)..................................... 27 2.2.4.5 Traffic
Recommended publications
  • Chapter 4 the Provincial and Urban Level: Meeting the Local Needs
    The provincial and urban level: meeting local needs Chapter 4 Chapter 4 The provincial and urban level: meeting the local needs Increasingly, cities and regions in developing countries adopt incentive- based transport strategies in order to raise local revenue and alleviate congestion and environmental problems in urban areas. Nevertheless, there is no blue print as to how to successfully manage transport demand on the local level. It should always be borne in mind that sound transport measures based on Economic Instruments: • are highly city-specific, depend on city size, level of develop- ment, road networks and transport demand characteristics, cultu- ral and educational factors that determine transport behaviour, fle- xibility in transport mode choice, public acceptance, institutional capacities to introduce and enforce measures, local institutional and jurisdictional independence from national transport policy fra- meworks; • are most effective if applied as part of a comprehensive transport strategy as outlined in chapters 1 and 2; On the regional and local level important Economic Instruments which are implemented in many countries include: • Surcharges on national/federal measures (see section 4.1), • Parking fees (see section 4.2), • Urban road and congestion pricing (see section 4.3). These measures will be discussed in more detail below. 87 Chapter 4 The provincial and urban level: meeting local needs Surcharges on national/federal measures Surcharges as a policy instrument The basic idea Local charges to Supplementing a national policy. Local conditions are often distinctly better meet the local different from national conditions. To cater for these differences, in needs. many countries Economic Instruments in transport are set at the natio- nal (federal) level to meet the basic national needs, but local govern- ments/authorities are allowed to levy a local/provincial surcharge on these charges.
    [Show full text]
  • Download Project Reference
    PPI ENGINEERING PTE LTD PPI ENGINEERING SYSTEMS PTE LTD 42 Pioneer Sector 2 Singapore 628393 Tel: 68989095 Fax: 68989785 Website: www.ppi.sg Email: [email protected] Date : Nov-16 JOB REFERENCES ON-GOING PROJECTS Year Projects Description Scopes Main Contractor/Client Consultants Owner 2016 GKE Warehouse at 39 Benoi Road Post-tensioning Works - Beams + Flat Slab HPC Builders Pte Ltd CS Engineers Consulting GKE 2016 Fernvale School Post-tensioning Works - Beams Zheng Keng Engineering & Const. PL Sembcorp AE MOE 2016 OVH at Sentosa Post-tensioning Works - Beams + Slab Woh Hup Construction Pte Ltd KCL Consultants P/L Private 2016 IDS at 279 Jalan Ahmad Ibrahim Post-tensioning Works - Beams + Flat Slab Hua Siah Construction KTP Private 2016 Factory at 10 Changi Sth St 2 Post-tensioning Works - Beams + Flat Slab Lida Construction Tenwit Consultant Private 2016 ER382 - Lornie Road Upgrading Post-tensioning Works - PSPC Beams Coninco TYLin LTA 2016 Ice Cave at Yung Ho Rd Post-tensioning Works - Flat Slab Hua Siah Construction Ronnie & Koh Private 2016 MRF Factory @ 7 Tuas South St 7 Post-tensioning Works - Flat Slab Buildform Milleniums Consultamt Private 2016 Warehouse at Plot 6 Tampines Drive Post-tensioning Works - Flat Slab Lim Wen heng Const. KCL Consultants P/L Private 2016 Shine at Tuas South Ave 7 Post-tensioning Works - Beams + Flat Slab Hock Liang Seng EP Engineers Hock Liang Seng 2016 ER397 - TPE/KPE Upgrading Post-tensioning Works - PSPC Beams Coninco TYLin LTA 2016 ER343 - Portsdown Rd Post-tensioning Works - PSPC Beams Coninco TYLin
    [Show full text]
  • Policy Guidelines for Road Transport Pricing
    ECONOMIC AND SOCIAL COMMISSION FOR ASIA AND THE PACIFIC POLICY GUIDELINES FOR ROAD TRANSPORT PRICING A Practical Step-by-Step Approach UNITED NATIONS Economic and Social Commission for Asia and the Pacific & Deutsche Gesellschaft für Technische Zusammenarbeit (GTZ) GmbH POLICY GUIDELINES FOR ROAD TRANSPORT PRICING A Practical Step-by-Step Approach Edited by: Deutsche Gesellschaft für Technische Zusammenarbeit (GTZ) GmbH, Germany; and the United Nations Economic and Social Commission for Asia and the Pacific (ESCAP) Financed by: Bundesministerium für wirtschaftliche Zusammenarbeit und Entwicklung (BMZ), Germany Authors: Jan A. Schwaab and Sascha Thielmann United Nations New York, 2002 ST/ESCAP/2216 Edited by: Deutsche Gesellschaft für Technische Zusammenarbeit (GTZ) GmbH Manfred Breithaupt; Division 44, Environmental Management, Water, Energy and Transport; Dag-Hammarskjöld-Weg 1-5, 65760 Eschborn, Germany Tel.: +49 (0) 6196 / 79 – 1267, Fax: +49 (0) 6196 / 79 - 7144 WWW: http://www.gtz.de United Nations Economic and Social Commission for Asia and the Pacific (ESCAP) Transport and Tourism Division The United Nations Building, Rajadamnern Nok Avenue, Bangkok 10200, Thailand Tel.: +66-2 / 288-1234, Fax: +66-2 / 288-1000, 288-3050 WWW: http://www.unescap.org/tctd/ Financed by: Bundesministerium für wirtschaftliche Zusammenarbeit und Entwicklung (BMZ) Friedrich-Ebert-Allee 40, 53113 Bonn, Germany Tel.: +49 (0) 228 / 535 – 0, Fax: +49 (0) 228 / 535 - 3500 WWW: http://www.bmz.de Authors: Jan A. Schwaab and Sascha Thielmann The authors wish to express their gratitude for the many constructive and helpful comments provided by Manfred Breithaupt, Karl Fjellstrom, Axel Friedrich, Gerhard Metschies, Martine Micozzi, Dieter Niemann, Anthony Ockwell and Werner Rothengatter.
    [Show full text]
  • LAND TRANSPORT Master Plan 2013
    LAND TRANSPORT master plan 2013 Contents Executive Summary 02 1 Taking Stock 06 1.1 Making Public Transport a Choice Mode of Travel 1.2 Managing Road Usage 1.3 Meeting Diverse Needs 1.4 How Did We Do? 2 Singapore: Today and Tomorrow 13 2.1 Key Areas of Concern 2.2 Immediate Challenges 2.3 Consulting the Public 2.4 How We Are Tackling the Challenges Ahead 2.5 What Will the Public See with LTMP 2013? 3 More Connections 19 3.1 Expanding Our Rail Network 3.2 More Bus Services 3.3 Facilitating More Walking and Cycling 3.4 Sustainable Expansion of the Road Network 4 Better Service 27 4.1 Improving Rail Services 4.2 Improving Bus Services 4.3 Welfare of Transport Workers 4.4 Taxis and Car-Sharing 4.5 Travelling the Smart Way 4.6 What Commuters Can Do 5 Liveable and Inclusive Community 38 5.1 No Barriers: Improving Mobility for Seniors and the Less Mobile 5.2 Reducing Noise Levels 5.3 Safer Roads for All 5.4 Environmental Sustainability 5.5 Reclaiming Our Public Spaces: Car-free and Car-less Zones 6 Reducing Reliance on Private Transport 43 6.1 The Vehicle Growth Rate 6.2 Stabilising Supply of COEs 6.3 Next Generation ERP 6.4 Tackling Congestion Today 6.5 Parking Policy 6.6 Enforcement Against Illegal Parking 6.7 A Mindset Shift 7 Our Vision 50 Annex A - Summary of Initiatives 53 Executive Summary Executive Summary All of us use land transport, from the pavements on which we walk, to the trains, buses and other vehicles that carry us and the roads that these vehicles use.
    [Show full text]
  • Annual Report 2010/2011 Table of Vision: Contents a People-Centred Land Transport System
    It’s all about... Annual Report 2010/2011 Table of Vision: Contents A people-centred land transport system. Mission: 14 Chairman’s Statement To provide an efficient and cost-effective 15 Chief Executive’s Message land transport system for different needs. 16 Board Members 20 Senior Management Strategic thrusts: 24 Organisation Chart • Make public transport a choice mode 26 Connectivity • Optimise road network and enhance 36 Mobility its accessibility 48 Innovation • Excel in service quality • Create value and instill pride in our work 58 Partnership 66 Resilience 71 LTA Subsidiaries 76 Major Contracts Awarded in FY10/11 84 Major Contracts to be Awarded in FY11/12 88 Awards Won in FY10/11 90 Significant Events 92 Financial Review ...you. Our fundamental goal is to improve land travel for you. The new MRT lines that we build, the new expressways that we construct, the old roads that we widen and the new traffic information systems that we create, these are all geared towards getting you to your destination as quickly, as pleasantly and as safely as possible. ...connectivity. We strive to provide a seamless travel experience on the public transport system. We want to ensure you are connected to your goals, your aspirations and your lifestyle. Land Transport Authority Annual Report 2010/2011 03 Land Transport Authority Annual Report 2010/2011 ...mobility. We are constantly improving the road network to provide smooth and pleasant journeys for you and your family. Land Transport Authority Annual Report 2010/2011 05 Land Transport Authority Annual Report 2010/2011 ...innovation. Our priority is to leverage technology and international best practices to make your commute safe, convenient and hassle-free.
    [Show full text]
  • Circular No : URA/PB/2014/21-DCG Fax: 6227 4792 Our Ref : DC/ADMIN/CIRCULAR/PB 14 Date : 7 Oct 2014
    Circular No : URA/PB/2014/21-DCG Fax: 6227 4792 Our Ref : DC/ADMIN/CIRCULAR/PB_14 Date : 7 Oct 2014 CIRCULAR TO PROFESSIONAL INSTITUTES Who should know Owners and tenants of shophouses, eating house operators, real estate agents, architects and engineers Effective date With effect from 7 October 2014 NEW LOCATIONS WHERE ADDITIONAL EATING HOUSES IN SHOPHOUSES WILL NOT BE ALLOWED 1. URA and the Land Transport Authority (LTA) have assessed the existing traffic and parking situations of the areas listed below as part of their periodic reviews. To prevent the existing parking and traffic problems from worsening, we will not be able to approve more eating houses in these areas. This is also to address the traffic and parking concerns from the residents there. 2. The seven new locations where additional eating houses in shophouses will not be allowed are: i) Changi Road - Jalan Eunos / Still Road to Jalan Kembangan / Frankel Avenue ii) Upper Paya Lebar Road - Lorong Ah Soo to Paya Lebar Crescent iii) Bukit Timah Road - Wilby Road to Elm Avenue - Anamalai Avenue to Fourth Avenue iv) Sembawang Road - Mandai Road to Transit Road iv) Kampong Glam v) Kampong Bahru Road / Spottiswoode Park Road vi) Jalan Riang 3. The full list of locations where new eating houses will not be allowed are in Appendix A. This supersedes the previous list in URA’s circular dated 6 Feb 2012. 4. We will renew the Temporary Permission (TP) of existing eating houses that are within the locations in Appendix A if there are no major complaints on dis- amenity arising from the use, and there is no breach of our planning guidelines and conditions.
    [Show full text]