Table of Contents. Introduction... PART 1. GRAPH THEORY AND NETWORK MODELING... 1

Transcription

1 Table of Contents Preface... Introduction... xiii xv PART 1. GRAPH THEORY AND NETWORK MODELING... 1 Chapter 1. The Space-time Variability of Road Base Accessibility: Application to London... 3 Manuel APPERT and Laurent CHAPELON 1.1. Bases and principles of modeling Modeling of the regional road network Congestion or suboptimal accessibility Integration of road congestion into accessibility calculations Time slots Evaluation of demand by occupancy rate Evaluation of demand by flows Calculation of driving times Accessibility in the Thames estuary Overall accessibility during the evening rush hour (5-6 pm) Performance of the road network between 1 and 2 pm and 5 and 6 pm Network performance between 1 and 2 pm Network performance between 5 and 6 pm Evolution of network performances related to the Lower Thames Crossing (LTC) project Bibliography... 28

2 vi Graphs and Networks Chapter 2. Journey Simulation of a Movement on a Double Scale Fabrice DECOUPIGNY 2.1. Visitors and natural environments: multiscale movement Leisure and consumption of natural environments Double movement on two distinct scales Movement by car Pedestrian movement The FRED model Problems Structure of the FRED model Part played by the network structure Effects of the network on pedestrian diffusion Determination of the potential path graph: a model of cellular automata Two constraints of diffusion Verification of the model in a theoretical area Bibliography Chapter 3. Determination of Optimal Paths in a Time-delay Graph Hervé BAPTISTE 3.1. Introduction Floyd s algorithm for arcs with permanent functionality Floyd s algorithm for arcs with permanent and temporary functionality Principle Description Conclusion: other developments of Floyd s timetable algorithm Determination of the complete movement chain Overview of all the means of mass transport Combination of means with permanent and temporary functionality The evaluation of a timetable offer under the constraint of departure or arrival times Application of Floyd s algorithm to graph properties Bibliography Chapter 4. Modeling the Evolution of a Transport System and its Impacts on a French Urban System Hervé BAPTISTE 4.1. Introduction Methodology: RES and RES-DYNAM models Modeling of the interactions: procedure and hypotheses... 68

3 Table of Contents vii The area of reference Initial parameters Analysis and interpretation of the results Demographic impacts Alternating migrations revealing demographic trends Evolution of the transport network configuration Conclusion Bibliography PART 2. GRAPH THEORY AND NETWORK REPRESENTATION Chapter 5. Dynamic Simulation of Urban Reorganization of the City of Tours Philippe MATHIS 5.1. Simulations data The model and its adaptations D.LOCA.T model Opening of the model and its modifications Extension of the theoretical base of the model Application to Tours Specific difficulties during simulations First results of simulation Conclusion Bibliography Chapter 6. From Social Networks to the Sociograph for the Analysis of the Actors Games Sébastien LARRIBE 6.1. The legacy of graphs Analysis of social networks The sociograph and sociographies System of information representation Bibliography Chapter 7. RESCOM: Towards Multiagent Modeling of Urban Communication Spaces Ossama KHADDOUR 7.1. Introduction Quantity of information contained in phatic spaces Prospective modeling in RESCOM Phatic attraction surfaces Game of choice

4 viii Graphs and Networks 7.4. Huff s approach Inference Conclusion Bibliography Chapter 8. Traffic Lanes and Emissions of Pollutants Christophe DECOUPIGNY 8.1. Graphs and pollutants emission by trucks Calculation of emissions Calculation of the minimum paths Analysis of subsets Results Section of the A French graph Subset Bibliography PART 3. TOWARDS MULTILEVEL GRAPH THEORY Chapter 9. Graph Theory and Representation of Distances: Chronomaps and Other Representations Alain L HOSTIS 9.1. Introduction A distance on the graph A distance on the map Spring maps Chronomaps: space-time relief maps Conclusion Bibliography Chapter 10. Evaluation of Covisibility of Planning and Housing Projects Kamal SERRHINI Introduction The representation of space and of the network: multiresolution topography The VLP system Acquiring geographical data: DMG and DMS The Conceptual Data Model (CDM) starting point of a graph Principle of multiresolution topography (relations 1 and 2 of the VLP)

5 Table of Contents ix Need for overlapping of several spatial resolutions (relation 2 of the VLP) Why a square grid? Regular and irregular hierarchical tessellation: fractalization Evaluation of the visual impact of an installation: covisibility Definitions, properties, vocabulary and some results Operating principles of the covisibility algorithm (relations 3 and 4 of the VLP) Why a covisibility algorithm of the centroid-centroid type? Comparisons between the method of covisibility and recent publications Conclusion Bibliography Chapter 11. Dynamics of Von Thünen s Model: Duality and Multiple Levels Philippe MATHIS Hypotheses and ambitions at the origin of this dynamic von Thünen model The current state of research The structure of the program Simulations carried out The first simulation: a strong instability in the isolated state with only one market town The second simulation: reducing instability The third simulation: the competition of two towns The fourth simulation: the competition between five towns of different sizes Conclusion Bibliography Chapter 12. The Representation of Graphs: A Specific Domain of Graph Theory Philippe MATHIS Introduction The freedom of drawing a graph or the absence of representation rules Graphs and fractals Mandelbrot s graphs and fractals Graph and a tree-structured fractal: Mandelbrot s H-fractal The Pythagoras tree An example of multiplane plotting

6 x Graphs and Networks The example of the Sierpinski carpet and its use in Christaller s theory Development of networks and fractals in extension Grid of networks: borderline case between extension and reduction Application examples of fractals to transport networks Nodal graph Planarity and duality The cellular graph The faces of the graph: from network to space Bibliography Chapter 13. Practical Examples Philippe MATHIS Premises of multiscale analysis Cellular percolation Diffusion of agents reacting to the environment Taking relief into account in the difficulty of the trip Practical application of the cellular graph: fine modeling of urban transport and spatial spread of pollutant emissions The algorithmic transformation of a graph into a cellular graph at the level of arcs The algorithmic transformation of a graph into a cellular graph at the level of the nodes Behavior rules of the agents circulating in the network Strict rules Elementary rules Behavioral rules Contributions of an MAS and cellular simulation on the basis of a graph representing the circulation network Expected simulation results Limits of application of laws considered as general Effectiveness of cellular graphs for a truly door-to-door modeling Conclusion Bibliography PART 4. GRAPH THEORY AND MAS Chapter 14. Cellular Graphs, MAS and Congestion Modeling Jean-Baptiste BUGUELLOU and Philippe MATHIS Daily movement modeling: the agent-network relation The modeled space: Indre-et-Loire department

7 Table of Contents xi Diagram of activities: a step toward the development of a schedule Typology of possible agent activities Individual behavior mechanism: the daily scale Satisfaction and learning The choice of an acceptable solution Collective learning and convergence of the model toward a balanced solution Examination of the transport network Local congestion The peaks represent different types of intersections The emergence of congestion fronts on edges Intersection modeling Limited peak capacity: crossings and traffic circles In conclusion on crossings From microscopic actions to macroscopic variables a global validation test The appropriateness of the model with traditional throughputspeed, density-speed and throughput-density curves The distribution of traffic density over time The measure of lost transport time by agents because of congestion Spatial validation Conclusion Bibliography Chapter 15. Disruptions in Public Transport and Role of Information Julien COQUIO and Philippe MATHIS The model and its objectives Public transport Hypotheses to verify The PERTURB model Theoretical fields mobilized Working hypotheses Functionalities The simulation platform Simulations in real space: Île-de-France Disruptions simulated in the Île-de-France public transport Node-node calculations: measure of the deterioration of relational potentials between two network vertices Unipolar calculations: measures of the deterioration of traveling opportunities from a network vertice

8 xii Graphs and Networks Multipolar calculations: global measures of structural impacts Simulations in theoretical transport systems The initial network and line creation Studied disruption Multipolar calculations Simulations integrating capacity constraints Discussion on hypotheses Field of structural vulnerability Field of functional vulnerability Conclusion Bibliography Conclusion List of Authors Index