Relevant bibliographies by topics / Simulation de trafic routier / Journal articles
To see the other types of publications on this topic, follow the link: Simulation de trafic routier.

Journal articles on the topic 'Simulation de trafic routier'

Author: Grafiati
Published: 12 October 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Simulation de trafic routier.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Champion, Alexis, Jean-Michel Auberlet, René Mandiau, Stéphane Espié, and Christophe Kolski. "Simulation comportementale du trafic routier en intersection Un mécanisme de résolution de conflit." Recherche - Transports - Sécurité 28, no. 100 (September 30, 2008): 185–94. http://dx.doi.org/10.3166/rts.100.185-194.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Doniec, Arnaud, René Mandiaud, Stéphane Espié, and Sylvain Piechowiak. "Comportements anticipatifs dans les systèmes multi-agents. Application à la simulation de trafic routier." Revue d'intelligence artificielle 21, no. 2 (April 12, 2007): 183–221. http://dx.doi.org/10.3166/ria.21.183-221.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

-MANDIAU, René. "Coordination multi-agent basée sur les jeux : application à la simulation de trafic routier." Revue de l'Electricité et de l'Electronique -, no. 02 (2005): 24. http://dx.doi.org/10.3845/ree.2005.012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Galand, Stéphane, Flavien Balbo, Gauthier Picard, Olivier Boissier, Nicolas Gaud, and Sebastian Rodriguez. "Environnement multidimensionnel pour contextualiser les interactions des agents. Application à la simulation du trafic routier urbain." Revue d'intelligence artificielle 30, no. 1-2 (April 28, 2016): 81–108. http://dx.doi.org/10.3166/ria.30.81-108.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Planchon, Florent, Daniel Delahaye, and Claude Tougard. "Emissions polluantes et trafic routier." Études Normandes 48, no. 1 (1999): 171–78. http://dx.doi.org/10.3406/etnor.1999.2392.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

RICORDEL, S., L. DEDIEU, D. ASTRIE, R. TRAMOY, B. TASSIN, and J. GASPERI. "Macrodéchets et déchets plastiques issus du trafic routier." 6 6, no. 6 (June 20, 2022): 53–70. http://dx.doi.org/10.36904/tsm/202206053.

Full text
Abstract:
Les impacts négatifs des déchets dispersés dans l’environnement sont soulignés depuis des décennies, mais peu de données de terrain sont disponibles dans la littérature scientifique. Les eaux pluviales peuvent contribuer de façon importante à la propagation et à l’accumulation de débris plastiques dans l’environnement. Toutefois, peu de données existent sur les flux et la composition des macrodéchets dans les eaux pluviales, y compris les débris plastiques. Afin de combler ce manque de connaissances, cette étude a pour objectif d’étudier l’occurrence, l’abondance et la composition des macrodéchets issus du trafic routier. Pour y répondre, les macrodéchets, dont les débris plastiques, ont été collectés dans un bassin de rétention des eaux pluviales drainant une portion du périphérique nantais pendant une année. Cette portion correspond à la partie sud du pont de Cheviré qui présente un trafic important (~90 000 véhicules/jour en moyenne). Les macrodéchets sont triés et classés selon la classification Ospar/TG-ML. En un an, 88,5 kg de débris ont été collectés. Au total, les plastiques correspondent à 60 % de la masse de déchets récoltés. Ces déchets plastiques sont surtout des fragments, des mégots et filtres de cigarettes, ainsi que des morceaux de polystyrène. Une identification des sources de rejets a été réalisée en différenciant les déchets jetés volontairement (37,2 %), des déchets perdus accidentellement (62,8 %), parmi les 43 % de déchets pour lesquels cette différenciation était possible. La masse de déchets collectée est fortement corrélée au trafic. Ces résultats démontrent que les routes peuvent avoir une contribution importante dans les fuites de déchets, y compris les plastiques, vers les environnements récepteurs.
APA, Harvard, Vancouver, ISO, and other styles
7

Gillaizeau, Florence, Medhi Danech-Pajouh, and Jean-Claude Pierrelée. "Prévision qualitative du trafic routier par régression logistique." Recherche - Transports - Sécurité 23, no. 93 (December 30, 2006): 295–315. http://dx.doi.org/10.3166/rts.93.295-315.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Nagel, Kai, and Christopher L. Barrett. "Using Microsimulation Feedback For Trip Adaptation For Realistic Traffic In Dallas." International Journal of Modern Physics C 08, no. 03 (June 1997): 505–25. http://dx.doi.org/10.1142/s0129183197000412.

Full text
Abstract:
This paper presents a day-to-day re-routing relaxation approach for traffic simulations. Starting from an initial planset for the routes, the route- based microsimulation is executed. The result of the microsimulation is fed into a re-router, which re-routes a certain percentage of all trips. This approach makes the traffic patterns in the microsimulation much more reasonable. Further, it is shown that the method described in this paper can lead to strong oscillations in the solutions.
APA, Harvard, Vancouver, ISO, and other styles
9

-GROS, Jean-Paul. "Gestion du trafic routier et des terminaux de péage." Revue de l'Electricité et de l'Electronique -, no. 02 (1995): 66. http://dx.doi.org/10.3845/ree.1995.022.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Susueno, Hendra Bayu, Imam Tri Wibowo, Siti Ummi Masruroh, Dewi Khairani, and I’im Umamil Khoiri. "Analisis Routing Protocol Is-Is Dengan MPLS Traffic Engineering Menggunakan GNS3." Jurnal Ilmiah FIFO 13, no. 1 (December 20, 2021): 32. http://dx.doi.org/10.22441/fifo.2021.v13i1.004.

Full text
Abstract:
In the digital era is , the internet becomes a necessity . the increasing number of internet usage by various parties encourages ISPs to improve their service quality . To overcome the problem the IETF has introduced a service Multiprotcol . MPLS-TE allows for schemes TE where the tip router of the label switched path (LSP) can calculate the many routes efficiently through the network to the router tip of the tail of the LSP. TE consists of three steps principal that is the size , model, and control . MPLS-TE allows for schemes TE where the tip router of the label switched path (LSP) can calculate the many routes efficiently through the network to the router tip of the tail of the LSP. ISIS is one of the routing protocol that was created for the OSI mode, using the method of link state as a method of collecting the route , ISIS also will perform the collection of information and the status of all the links that exist in the network . Analysis of the IS-IS routing protocol with the Multiprotocol label switch Traffic Engineering based on the parameters of quality of service (QoS), namely throughput and packet loss where the simulation uses the GNS3 network emulator. The test results prove that the values of throughput and packet loss are not much different.
APA, Harvard, Vancouver, ISO, and other styles
11

KHELIFI, Asma, Jean-Patrick LEBACQUE, and Habib HAJ-SALEM. "Modélisation stochastique macroscopique d'ordre supérieur du trafic sur les réseaux routiers : implications managériales." Revue Française de Gestion Industrielle 37, no. 2 (September 21, 2023): 71–86. http://dx.doi.org/10.53102/2023.37.02.1156.

Full text
Abstract:
Les systèmes de transport jouent un rôle primordial dans le développement de la croissance économique des pays. Cependant, l'apparition des véhicules autonomes et électriques et les restrictions mises en place pour limiter la diffusion et les impacts du Covid-19 dans les transports en commun ont eu un impact important sur l’augmentation des problèmes de transport notamment aux intersections. Le présent papier aide à résoudre ces problèmes. Cet article s'intéresse à la modélisation stochastique des flux du trafic sur les réseaux routiers, grâce à des modèles macroscopiques génériques de second ordre : la famille GSOM. Il a été montré que de tels modèles d'ordre supérieur peuvent être résolus dans un cadre lagrangien dont les coordonnées lagrangiennes se déplacent avec le trafic. La difficulté d'utiliser cette solution de résolution sur un réseau est de traiter les discontinuités eulériennes – fixes – telles que les jonctions. L'objectif de ce travail est double : d'une part, proposer des modèles d’intersection adaptés aux modèles stochastiques macroscopiques de flux de trafic de second ordre, et d'autre part, résoudre le modèle résultant dans le cadre d’un réseau routier. Quelques exemples numériques sont fournis pour montrer l'efficacité de l'approche proposée.
APA, Harvard, Vancouver, ISO, and other styles
12

Drieieva, Hanna, Yelyzaveta Meleshko, Oleksandr Drieiev, and Volodymyr Mikhav. "COMPUTER SIMULATION MODEL OF A COMPUTER NETWORK WITH FRACTAL TRAFFIC FOR TESTING ROUTING ALGORITHMS." Advanced Information Systems 6, no. 4 (December 8, 2022): 11–18. http://dx.doi.org/10.20998/2522-9052.2022.4.02.

Full text
Abstract:
The object of research in this article is simulation modeling of a computer network and the process of traffic routing. The relevance of the research is due to the importance of ensuring the quality of service in computer networks, in particular, by necessity reducing the number of lost IP-packets at high traffic intensity values. Determining the routing of traffic packets is a complex process and is based on various indicators or combinations of indicators. If the routing process takes place in a dynamic mode, then the complexity of the route calculation increases, in this case, one of the tools for research and comparison of different routing algorithms can be a computer simulation model of a computer network. The goal of the work is the development and research of a computer simulation model of a computer network for testing traffic routing algorithms. The tasks: to develop computer simulation model of a computer network to generate the network structure and simulate the traffic distribution process with the ability to test different routing algorithms. Research methods: theory of computer networks, theory of fractal analysis, object-oriented programming, theory of algorithms and data structures, theory of complex networks, theory of Markov processes. Conclusions. The paper investigated the basic principles of traffic routing in computer networks. A simulation model of a computer network for testing traffic routing algorithms has been developed. A method based on the theory of complex networks has been developed to generate the structure of a computer network. Theory of fractal analysis and Markov processes are used for traffic generation. A series of experiments was conducted on a developed model to determine how different fractal dimensions of traffic at high traffic intensity values affect the number of lost packets, and therefore the quality of service. Analyzing the results of the experiment, the following conclusions can be drawn: the least number of lost packets occurs when the process is random or has weak trends. The fewest lost packets were at fractal dimension 1.5, i.e., when the process is completely random, there were also few lost packets at fractal dimensions close to this; persistent and anti-persistent processes (those with memory) cause more packet loss for the same traffic intensity and maximum number of packets sent from one device per unit of time. Moreover, anti-persistent processes cause significantly more losses than persistent ones. Thus, when performing traffic routing and finding optimal paths for sending IP-packets, it can be useful to determine and take into account the fractal dimension of traffic at the entrance of each router and use it when calculating metrics to determine the best routes.
APA, Harvard, Vancouver, ISO, and other styles
13

Alqurashi, Raghda, and Tom Altman. "Hierarchical Agent-Based Modeling for Improved Traffic Routing." Applied Sciences 9, no. 20 (October 16, 2019): 4376. http://dx.doi.org/10.3390/app9204376.

Full text
Abstract:
Agent-based model (ABM) simulation is a bottom–up approach that can describe the phenomena generated from actions and interactions within a multiagent system. An ABM is an improvement over model simulations which only describe the global behavior of a system. Therefore, it is an appropriate technology to analyze emergent phenomena in social sciences and complex adaptive systems such as vehicular traffic and pedestrian crowds. In this paper, a hybrid agent-based modeling framework designed to automate decision-making processes during traffic congestion is proposed. The model provides drivers with real-time alternative routes, computed via a decentralized multi-agent model, that tries to achieve a system-optimal traffic distribution within an entire system, thus reducing the total travel time of all the drivers. The presented work explores a decentralized ABM technique on an autonomous microgrid that is represented through cellular automata (CA). The proposed model was applied to high-density traffic congestion events such as car accidents or lane closures, and its effectiveness was analyzed. The experimental results confirm the efficiency of the proposed model in not only accurately simulating the driver behaviors and improving vehicular traffic flows during congestion but also by suggesting changes to traffic dynamics during the simulations, such as avoiding obstacles and high-density areas and then selecting the best alternative routes. The simulation results validate the ability of the proposed model and the included decision-making sub-models to both predict and improve the behaviors and intended actions of the agents.
APA, Harvard, Vancouver, ISO, and other styles
14

Kavička, Antonin, and Pavel Krýže. "Dynamic Automated Search of Shunting Routes within Mesoscopic Rail-Traffic Simulators." Journal of Advanced Transportation 2021 (April 5, 2021): 1–22. http://dx.doi.org/10.1155/2021/8840516.

Full text
Abstract:
Software tools using computer simulations are frequently used in the research and optimization of railway transport systems. Such simulations serve to examine different railway traffic scenarios (which typically reflect different timetables and railway infrastructure configurations). During the simulation experiments, it is necessary, among other things, to solve tasks related to the determination of track routes along which individual trains or parts of train sets are moved. Many simulation tools require the basic and alternative permissible track routes to be manually specified before starting the simulations, which is a relatively tedious and time-consuming process. Classical graph algorithms cannot be applied to solve the problem of automatic calculation of the routes because they are unable to take into account the length of the object being moved or recognise changes in the direction of its movement. This article presents original innovative algorithms focused on automated dynamic search of track routes (applying an appropriate optimization criterion), which is performed during simulation experiments within simulators working at the mesoscopic level of detail. The algorithms are based on a mathematical model (represented by a specifically designed weighted digraph) that appropriately reflects the actual track infrastructure. The dynamic calculation of each specific track route for a train or a group of railway vehicles considers both the total train set length and the current railway infrastructure occupancy, including blocked parts of the infrastructure due to intervention of the interlocking system. In addition, the places where the train set movement direction is changed can be identified on each route found. Applications of the algorithms and of the mathematical model of the track layout are demonstrated on a model track infrastructure.
APA, Harvard, Vancouver, ISO, and other styles
15

López, Alfonso, Miguel Gutiérrez, Andrés Ortega, Cristina Puente, Alejandro Morales, Diego Gonzalez, and Emma Díaz. "Performance Analysis of a Medium Frequency Offshore Grid for Identification Of Vessels Sailing on High Density Maritime European Routes." Polish Maritime Research 24, no. 4 (December 20, 2017): 18–26. http://dx.doi.org/10.1515/pomr-2017-0131.

Full text
Abstract:
Abstract The paper analyses the performance of an Automatic Vessel Identification System on Medium Frequency (AVISOMEF), which works with the Grid Method (GM) on high density maritime European routes using real data and uniformly distributed data. Compared to other systems, AVISOMEF is a novelty, as it is not a satellite system, nor is it limited by a given coverage distance, in contrast to the Automatic Identification System (AIS), though in exceptional circumstances it leans towards it. To perform the analysis, special simulation software was developed. Moreover, a number of maritime routes along with their traffic density data were selected for the study. For each route, two simulations were performed, the first of which based on the uniform traffic distribution along the route, while the second one made use of real AIS data positioning of vessels sailing on the selected routes. The obtained results for both simulations made the basis for formulating conclusions regarding the capacity of selected routes to support AVISOMEF.
APA, Harvard, Vancouver, ISO, and other styles
16

Danchuk, Viktor, Olena Bakulich, and Vitaliy Svatko. "Building optimal routes for cargo delivery taking into account the dynamics of traffic flows." MATEC Web of Conferences 259 (2019): 01001. http://dx.doi.org/10.1051/matecconf/201925901001.

Full text
Abstract:
A method for optimizing the route based on a modified ant algorithm is proposed, taking into account the unsteady dynamics of traffic flows in the urban road network. Within the framework of the method, simulation of the building of optimal routes was carried out using the example of Kyiv. It is shown the possibility of using the method for solving problems of effective control over the process of routing freight traffic in conditions of actual dynamics of traffic flows (synchronized traffic, wide moving jam, congestion, emergency situations, etc.)
APA, Harvard, Vancouver, ISO, and other styles
17

Ramadhani, Afifah Dwi, Alon Jala Tirta Segara, and Aditya Wijayanto. "Optimasi Protokol LEACH Menggunakan PSO Pada Mobile Ad-Hoc Network." JURNAL MEDIA INFORMATIKA BUDIDARMA 6, no. 1 (January 25, 2022): 513. http://dx.doi.org/10.30865/mib.v6i1.3455.

Full text
Abstract:
Mobile ad-hoc network is a wireless network with variable topology and communication routes. In a MANET network, nodes have the role of finding and handling routes to each node in the network. There are several challenges such as bandwidth, power, and direction of movement of nodes. A routing protocol is needed to determine the route and ensure that the packets sent successfully arrive at their destination to solve this problem,. In large-scale networks, the routing structure requires redundant route information, resulting in frequent overhead. We investigated the use of the LEACH protocol as a hierarchical protocol to solve the network overhead. The proposed research also adds a PSO algorithm to optimize the performance of the LEACH protocol. The research method uses simulation methods and evaluation of routing models using Network Simulator. Evaluation is prioritized on the use of traffic TCP and UDP. The results show that TCP traffic has better delay, packet loss, and PDR values compared to UDP traffic when using the LEACH protocol. When the PSO algorithm is added, the delay value in TCP traffic decreases by 47%, the packet loss value decreases by 78%, and the PDR value also increases by 0.1%.
APA, Harvard, Vancouver, ISO, and other styles
18

Belov, A. S., A. N. Reformat, E. L. Trakhinin, and N. I. Birkun. "Scientific and Methodological Approach to Assessing Timeliness Operational Management of Vehicle Routing in an Urban Agglomeration." Proceedings of the Southwest State University 27, no. 4 (March 1, 2024): 132–45. http://dx.doi.org/10.21869/2223-1560-2023-27-4-132-145.

Full text
Abstract:
Purpose of reseach. The purpose of this article is to develop a scientific and methodological approach to assessing the timeliness of decision-making in the operational management of car traffic routing in an urban agglomeration. Timeliness is manifested in reducing the time to prepare a decision to change the route of a car delivering goods in conditions of a possible (predicted) increase in traffic congestion at intersections and streets crossing the established route in an urban agglomeration. Methods. The presented approach is based on the basic principles of management theory in organizational systems, the theory of rational consumer behavior, mathematical statistics, and simulation modeling.Results. A variant of the generalized scheme of the operational control cycle for the routing of a car in an urban agglomeration has been developed. A sequence of estimation of decision-making time for operational control of vehicle traffic routing is proposed, and the individual stages of the evaluation sequence implement the main functions of the developed version of the operational control cycle. Experimental dependences of the time of analysis of route parameters during operational management on the quantity and quality of the routes under consideration in the AnyLogic 8.4.0 simulation environment are obtained.Conclusion. The article considers an approach to assessing the timeliness of decision-making in the operational management of the route of a car delivering goods in an urban agglomeration. To minimize the time for making an operational decision, it is proposed to predict the intensity of traffic congestion and assess the quality of the route. The approach allows, based on forecasting the state of the road situation at the intersection points of the route and streets with a high probability of traffic congestion, as well as, taking into account the number and quality of routes, to increase the timeliness of making a decision to change the route of a car delivering goods to an urban agglomeration.
APA, Harvard, Vancouver, ISO, and other styles
19

Syahputra, Ramdhani, Rahmadi Kurnia, and Rian Ferdian. "Analysis of FHRP Design and Implementation in RIPv2 and OSPF Routing Protocols." Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) 4, no. 1 (February 8, 2020): 102–8. http://dx.doi.org/10.29207/resti.v4i1.1490.

Full text
Abstract:
The high reliability of data access has become a problem faced by many companies, institutions, and universities. For this reason, a protocol required that can protect the network from a communication breakdown. One method used to maintain communication is by implementing a protocol redundancy system. One or more routers will act as the primary router for load balancing, and some routers are in standby mode if one main router is down. First hop redundancy protocols (FHRP) is a protocol that implements redundancy and load balancing systems. This protocol can transfer access data traffic if one of the routers on the network is down. FHRP divided into virtual router redundancy protocol (VRRP) and gateway load balancing Protocol (GLBP). This research analyzes the design and implementation to provide information about the quality of VRRP and GLBP services on the main router and the backup router, by using an application graphical network simulator (GNS) simulation 3. In the GNS3 application, a LAN network topology is designed with eight router devices in the form of a ring topology using RIPv2 and OSPF routing protocols, then implemented in protocols VRRP and GLBP. The analysis results show that GLBP can back up the network faster than VRRP when the primary router is down. If implemented into a LAN network with RIPv2 and OSPF routing protocols, VRRP has better service quality than GLBP.
APA, Harvard, Vancouver, ISO, and other styles
20

Pol, Sonia Mahendra, Aniket Rayte, Bhushan T. Patil, and Ketaki N. Joshi. "Analysis and Optimization of Transportation Logistics for Supply Chain Management of Perishable Goods using Monte Carlo Simulation." E3S Web of Conferences 559 (2024): 04004. http://dx.doi.org/10.1051/e3sconf/202455904004.

Full text
Abstract:
In the realm of intelligent transportation, the global logistics and supply chain industry grapples with the challenges of the transportation of perishable goods. This paper advocates for the optimization of perishable goods transportation through the application of Monte Carlo Simulation, a sophisticated tool to analyse traffic patterns and refine route selection. Targeting decision-makers, the study aims to unravel the intricate relationship between traffic dynamics, route choices, and product perishability. Historical traffic data, perishability rates, and route information are the basis for simulating the impact of traffic hours on goods perishing. The model actively seeks routes that minimise perished goods, employing Monte Carlo simulation to quantitatively assess the risks and benefits of various strategies. By presenting a data-driven framework, the research enhances supply chain efficiency, curbs losses of perished goods, and encourages the adoption of sustainable and intelligent transportation methods within the industry.
APA, Harvard, Vancouver, ISO, and other styles
21

LI, KUN, XIAOFENG GONG, SHUGUANG GUAN, and C. H. LAI. "ANALYSIS OF TRAFFIC FLOW ON COMPLEX NETWORKS." International Journal of Modern Physics B 25, no. 10 (April 20, 2011): 1419–28. http://dx.doi.org/10.1142/s0217979211100655.

Full text
Abstract:
We propose a new routing strategy for controlling packet routing on complex networks. The delivery capability of each node is adopted as a piece of local information to be integrated with the load traffic dynamics to weight the next route. The efficiency of transport on complex network is measured by the network capacity, which is enhanced by distributing the traffic load over the whole network while nodes with high handling ability bear relative heavier traffic burden. By avoiding the packets through hubs and selecting next routes optimally, most travel times become shorter. The simulation results show that the new strategy is not only effective for scale-free networks but also for mixed networks in realistic networks.
APA, Harvard, Vancouver, ISO, and other styles
22

Madhu Mohan Swaminathan, S., N. K. Sakthivel, and S. Subasree. "FA-LAR: an efficient flow aware based load adaptive routing scheme for optical communication networks." International Journal of Engineering & Technology 7, no. 2.27 (September 5, 2018): 306. http://dx.doi.org/10.14419/ijet.v7i2.27.12637.

Full text
Abstract:
Routing Protocols have been proposed to enable the network to identify and suggest various routes to number of demanded flows. In the Flow-Aware Network Models, the routes are identified and selected with the help of Flow Tables or Flow Identifiers that proposed by Flow Aggregation Mechanism. That is, users can define a Flow Aggregation Model to suggest routes depend on their defined-demanded flows and this model effectively handles many flows, which helps core routers to profit aggregate routing. This is an efficient and effective approach to identify a best route to achieve required performance. It is noted from the literature survey that the Flow-Aware Multi-Topology Adaptive Routing (FAMTAR) was proposed for achieving higher Network performance through multipath solutions. This FAMTAR Model was implemented and studied thoroughly. From the experimental results, it was noticed that this model unable to i. detect and manage bulk flow, ii. Control Traffic Loss and iii. Maintain Deviation of Links Load against Traffic Load. To address the above mentioned issues, this research work is proposed an efficient Flow-Aware based Load Adaptive Routing (FA-LAR). This model is developed and implemented in ns3 and the simulation results are analysed carefully. From the experimental results, it is noticed that the prosed Model, FA-LAR is performing well as compared with the existing FAMTAR in terms of Queueing Delay, Throughput, Power Consumption (Energy Dissipation), and Load Deviation. It is also noticed that the proposed model unable to achieve higher Throughput for Low Load.
APA, Harvard, Vancouver, ISO, and other styles
23

Yang, Licai, Yunfeng Shi, Shenxue Hao, and Lei Wu. "Route Choice Model Based on Game Theory for Commuters." PROMET - Traffic&Transportation 28, no. 3 (June 6, 2016): 195–203. http://dx.doi.org/10.7307/ptt.v28i3.1727.

Full text
Abstract:
The traffic behaviours of commuters may cause traffic congestion during peak hours. Advanced Traffic Information System can provide dynamic information to travellers. Due to the lack of timeliness and comprehensiveness, the provided information cannot satisfy the travellers’ needs. Since the assumptions of traditional route choice model based on Expected Utility Theory conflict with the actual situation, a route choice model based on Game Theory is proposed to provide reliable route choice to commuters in actual situation in this paper. The proposed model treats the alternative routes as game players and utilizes the precision of predicted information and familiarity of traffic condition to build a game. The optimal route can be generated considering Nash Equilibrium by solving the route choice game. Simulations and experimental analysis show that the proposed model can describe the commuters’ routine route choice decisionexactly and the provided route is reliable.
APA, Harvard, Vancouver, ISO, and other styles
24

MA, LIANG, and MIESO K. DENKO. "ENHANCED ROUTING METRIC FOR LOAD-BALANCING IN WIRELESS MESH NETWORKS." Journal of Interconnection Networks 08, no. 04 (December 2007): 407–26. http://dx.doi.org/10.1142/s0219265907002107.

Full text
Abstract:
Wireless mesh networks (WMNs) have been drawing significant attention in recent years due to their flexibility in providing extensive wireless backbone. WMNs typically consist of mesh routers and mesh clients with each node operating not only as a host but also as a router. Due to the traffic patterns in WMNs, load-balancing becomes an important issue and may degrade the performance of the entire network. This paper proposes a routing metric known as Weighted Cumulative Expected Transmission Time with Load-Balancing (WCETT-LB) for wireless mesh networks. WCETTT-LB enhances the basic Weighted Cumulative Expected Transmission Time (WCETT) by incorporating load-balancing into the routing metric. Unlike existing schemes, WCETT-LB implements load-balancing at mesh routers. WCETT-LB provides a congestion-aware routing and traffic splitting mechanism to achieve global load-balancing in the network. By conducting an extensive simulation experiments, the result shows that WCETT-LB outperforms the existing routing metrics in load-balancing in terms of achieving high packet delivery ratio, low average end-to-end delay and low average congestion level in wireless mesh networks. The qualitative and quantitative analysis also show the significance of the proposed scheme.
APA, Harvard, Vancouver, ISO, and other styles
25

Kumar, Sunil, Siddharth Khimsara, Kashyap Kambhatla, Kalyani Girivanesh, John D. Matyjas, and Michael Medley. "Robust On-Demand Multipath Routing with Dynamic Path Upgrade for Delay-Sensitive Data over Ad Hoc Networks." Journal of Computer Networks and Communications 2013 (2013): 1–13. http://dx.doi.org/10.1155/2013/791097.

Full text
Abstract:
Node mobility in mobile ad hoc networks (MANETs) causes frequent route breakages and intermittent link stability. In this paper, we introduce a robust routing scheme, known as ad hoc on-demand multipath distance vector with dynamic path update (AOMDV-DPU), for delay-sensitive data transmission over MANET. The proposed scheme improves the AOMDV scheme by incorporating the following features: (i) a routing metric based on the combination of minimum hops and received signal strength indicator (RSSI) for discovery of reliable routes; (ii) alocal path updatemechanism which strengthens the route, reduces the route breakage frequency, and increases the route longevity; (iii) akeep alivemechanism for secondary route maintenance which enables smooth switching between routes and reduces the route discovery frequency; (iv) apacket salvagingscheme to improve packet delivery in the event of a route breakage; and (v) low HELLO packet overhead. The simulations are carried out in ns-2 for varying node speeds, number of sources, and traffic load conditions. Our AOMDV-DPU scheme achieves significantly higher throughput, lower delay, routing overhead, and route discovery frequency and latency compared to AOMDV. For H.264 compressed video traffic, AOMDV-DPU scheme achieves 3 dB or higher PSNR gain over AOMDV at both low and high node speeds.
APA, Harvard, Vancouver, ISO, and other styles
26

Dacko, Marion. "Franchir les montagnes du Massif central à l’époque romaine. Sources antiques et données archéologiques." Aquitania : une revue inter-régionale d'archéologie 37, no. 1 (2021): 103–15. http://dx.doi.org/10.3406/aquit.2021.1640.

Full text
Abstract:
À l’époque romaine, le Massif central est décrit par les sources textuelles comme un secteur délicat en termes de circulation routière. Dans cette région où les zones montagneuses couvrent les quatre cinquièmes de la superficie du territoire, la chaîne des Puys, la Haute-Combraille et le massif du Devès sont aujourd’hui encore considérés comme des points de passage difficiles. Traversés par des axes antiques de moyen et long parcours, ces trois espaces offrent de fortes contraintes climatiques (couverture neigeuse, vents vigoureux, cycles de gel et dégel) et topographiques (pentes, dénivellations) qui devaient considérablement peser sur la viabilité, notamment hivernale. Cette contribution propose de s’intéresser à la qualité des infrastructures de transport et à la gestion du trafic routier dans ces zones de relief.
APA, Harvard, Vancouver, ISO, and other styles
27

Li, Xiao Hua, Ren Long Zhang, Yu Jie Wang, Li Yang, Juan Nie, and Quan Yue Yang. "GNS-Based Simulation and Analysis of OSPFv2 Neighbor Authentication." Advanced Materials Research 989-994 (July 2014): 4603–7. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.4603.

Full text
Abstract:
Routing information release is a kind of promise from the router for network reachability. Illegal routing information may have disastrous effects on the normal work of the network. Open Shortest Path First (OSPF) protocol provides authentication methods to protect the authenticity and integrity of the routing traffic. This paper describes two authentication types of OSPFv2, analyzes the realization mechanism and packet header format of each authentication respectively. Based on GNS3, a typical network topology was designed, and with the aid of it functional verification and security analysis are carried out. The simulation can provide a reference for building an OSPF network. Experimental results show that the configuration of OSPFv2 routing authentication can effectively prevent the router from receiving unauthorized or malicious routing updates, thereby improving network safety.
APA, Harvard, Vancouver, ISO, and other styles
28

Wang, Yu, Shingo Mabu, Shinji Eto, and Kotaro Hirasawa. "Global Optimal Routing Algorithm for Traffic Systems with Multiple ODs." Journal of Advanced Computational Intelligence and Intelligent Informatics 13, no. 6 (November 20, 2009): 704–12. http://dx.doi.org/10.20965/jaciii.2009.p0704.

Full text
Abstract:
Global optimal routing for multiple Origin-Destinations (ODs) in traffic systems becomes extremely complicated when considering the traffic volumes on the road sections. This paper proposes a Combinational Algorithm which is combined by Conventional Method, U Algorithm, SU Algorithm, SRU Algorithm, SAU Algorithm and SRAU Algorithm to solve this problem. Among the above 6 algorithms, SRAU Algorithm contributes to the Combinational Algorithm the most, where firstly, all original ODs are sorted by their traffic volumes, and then the order is randomized to generate some routing candidates. For each candidate, before finding the optimal route of the current OD, the traveling times on the optimal routes calculated by ODs with high priority are adjusted and then Q Value-based dynamic programming is utilized to find the optimal route. Next, an updating process is needed to update the traveling time on the route using the current OD. Finally the best solution can be selected out of all solutions. Sufficient simulations show that the proposed routing algorithm is efficient enough to obtain the near optimal solution even in very large scale traffic systems. Also the consideration of the traffic volumes on the road sections enables our proposal to apply to real traffic systems.
APA, Harvard, Vancouver, ISO, and other styles
29

Chen, Hongmei, and Yuanhang Zhang. "Dynamic Path Optimization in Sharing Mode to Relieve Urban Traffic Congestion." Discrete Dynamics in Nature and Society 2021 (May 24, 2021): 1–16. http://dx.doi.org/10.1155/2021/8874957.

Full text
Abstract:
In recent years, a new mode of transportation, referred to as “shared commuter buses,” has been introduced, which can considerably reduce the dependence of office workers on private cars and relieve urban traffic congestion, but is not widely used owing to efficiency issues. Improving the efficiency of shared commuter buses was set as a goal, and in this study, several research objects were selected to optimize the driving routes of shared commuter buses. The problem of stop location is combined with dynamic route optimization; the “shortest walking distance” model is established to select the most appropriate location for stops. The vehicle routing problem model and “key point updating strategy” are employed to plan routes with real-time traffic information. Finally, we conduct an empirical study to validate our conclusions. The results show that both the model and algorithm are reliable and effective; thus, travel efficiency can be effectively improved and traffic jams can be alleviated.
APA, Harvard, Vancouver, ISO, and other styles
30

Li, Xiao Hua, Xian Gang Zhao, Ren Long Zhang, Shu Yan Xu, and Li Yang. "Simulation and Analysis of OSPFv2 Neighbor Authentication Based on GNS." Advanced Engineering Forum 6-7 (September 2012): 876–81. http://dx.doi.org/10.4028/www.scientific.net/aef.6-7.876.

Full text
Abstract:
Routing information release is a kind of promise from the router for network reachability. Illegal routing information may have disastrous effects on the normal work of the network. Open Shortest Path First (OSPF) protocol provides authentication methods to protect the authenticity and integrity of the routing traffic. This paper describes two authentication types of OSPFv2, analyzes the realization mechanism and packet header format of each authentication respectively. Based on GNS3, a typical network topology was designed, and with the aid of it we carried out functional verification and security analysis. The simulation can provide a reference for building an OSPF network. Experimental results show that the configuration of OSPFv2 routing authentication can effectively prevent the router from receiving unauthorized or malicious routing updates, thereby improving network safety.
APA, Harvard, Vancouver, ISO, and other styles
31

Leblond, Mathieu, Christian Dussault, and Jean-Pierre Ouellet. "Réponses comportementales du caribou forestier à l’élargissement d’un axe routier majeur." Projets entourant la route 175 136, no. 2 (May 11, 2012): 22–28. http://dx.doi.org/10.7202/1009102ar.

Full text
Abstract:
Nous avons évalué les réactions du caribou forestier (Rangifer tarandus caribou) face à une route majeure avant, pendant et après son élargissement. Nous avons suivi 53 individus par télémétrie GPS de 2004 à 2010, et avons étudié leurs déplacements et leur distribution par rapport à la route 175, en réfection depuis 2006. Nous avons comparé le taux des traversées réelles de la route par les caribous à des traversées de routes aléatoires, et avons mesuré le taux de déplacement des caribous au moment d’une traversée. Nous avons aussi évalué la sélection des ressources dans le domaine vital des individus, ainsi que dans des zones de 1 250, 2 500 et 5 000 m de chaque côté de la route. Seulement 12 caribous traversèrent la route, pour un total de 93 traversées en 7 ans. Moins de localisations de caribous furent observées près de la route pendant et après les travaux de réfection, qu’avant les travaux. Le taux de déplacement des caribous fut plus élevé à proximité de la route, particulièrement lorsque la densité du trafic était élevée. Nous concluons que la connectivité entre les 2 côtés de la route doit être maintenue afin de maximiser les chances de viabilité de cette population au statut précaire.
APA, Harvard, Vancouver, ISO, and other styles
32

BOUHRAOUA, ABDELHAFID, and MUHAMMAD E. S. ELRABAA. "IMPROVED MODIFIED FAT-TREE TOPOLOGY NETWORK-ON-CHIP." Journal of Circuits, Systems and Computers 20, no. 04 (June 2011): 757–80. http://dx.doi.org/10.1142/s0218126611007591.

Full text
Abstract:
C-based cycle-accurate simulations are used to evaluate the performance of a Network-on-Chip (NoC) based on an improved version of the modified Fat Tree topology. The modification simplifies routing further and guarantee orderly reception of packets without any loss of performance. Several traffic models have been used in these simulations; Bursty and non-bursty traffic with uniformly-distributed destination addresses and non-uniformly-distributed destination addresses. A simple new traffic model has been developed for generating non-uniformly-distributed destination addresses. This model is general enough to be used in developing new NoC architectures and captures universally accepted place-and-route methodologies. Simulation results are used to illustrate how the hardware resources of a modified Fat Tree NoC can be minimized without affecting the network performance. The performance of a NoC with regular Mesh topology was also evaluated for comparison with the modified Fat Tree topology.
APA, Harvard, Vancouver, ISO, and other styles
33

Bouhri, Neïla, Florence Boillot, and Pierre Vinant. "Régulation multimodale du trafic routier et des transports en commun de surface. Une classification des méthodes." Recherche - Transports - Sécurité 28, no. 98 (March 30, 2008): 53–72. http://dx.doi.org/10.3166/rts.98.53-72.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Bonhomme, Alexandre, Philippe Mathieu, and Sébastien Picault. "Simuler le trafic routier à partir de données réelles. Vers un outil d’aide à la décision." Revue d'intelligence artificielle 30, no. 3 (June 28, 2016): 329–52. http://dx.doi.org/10.3166/ria.30.329-352.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Zhou, Xiaofeng, Lu Liu, Zhangming Zhu, and Duan Zhou. "A Routing Aggregation for Load Balancing Network-on-Chip." Journal of Circuits, Systems and Computers 24, no. 09 (August 27, 2015): 1550137. http://dx.doi.org/10.1142/s0218126615501376.

Full text
Abstract:
A routing aggregation (RA) is proposed for load balancing network-on-chip (NoC). The computing nodes with dense traffic and long distance in network are gathered into the same routing node to form a super router. A load balancing routing algorithm for super router is presented to improve the overall performance of NoC. A simulation platform using System C is presented to confirm the feasibility of the proposed design in 2D mesh. The simulation results show that the proposed RA design can reduce the average packet latency and the standard deviation of host link utilization 8% and 33%, respectively compared with the reported routing methods. The area cost and power consumption compared with the reported schemes are 22% and 12% less, respectively.
APA, Harvard, Vancouver, ISO, and other styles
36

Saravanan, K., and R. Asokan. "An New Efficient Cluster Based Detection Mechanisms for Distributed Denial of Services (DDoS) Attacks." International Journal of Mathematics and Computers in Simulation 15 (November 27, 2021): 147–52. http://dx.doi.org/10.46300/9102.2021.15.27.

Full text
Abstract:
Cluster aggregation of statistical anomaly detection is a mechanism for defending against denial of service attack (dos) and distributed denial-of-service (DDoS) attacks. DDoS attacks are treated as a congestioncontrol problem; because most of the congestion is occurred in the malicious hosts not follow the normal endto- end congestion control. Upstream routers are also notified to drop such packets in order that the router’s resources are used to route legitimate traffic hence term cluster aggregation. If the victim suspects that the cluster aggregations are solved by most of the clients, it increases the complexity of the cluster aggregation. This aggregation solving technique allows the traversal of the attack traffic throughout the intermediate routers before reaching the destination. In this proposal, the aggregation solving mechanism is cluster aggregation to the core routers rather than having at the victim. The router based cluster aggregation mechanism checks the host system whether it is legitimate or not by providing a aggregation to be solved by the suspected host.
APA, Harvard, Vancouver, ISO, and other styles
37

Wang, Jianqiang, and Shiwei Li. "Modeling and simulation of network traffic flow evolution based on incomplete information feedback strategies in the ATIS environment." International Journal of Modeling, Simulation, and Scientific Computing 08, no. 03 (September 2017): 1750031. http://dx.doi.org/10.1142/s1793962317500313.

Full text
Abstract:
Considering both the high complexity of urban traffic flow systems and the bounded rationality of travelers, providing traffic information to all travelers is an effective method to induce each individual to make a more rational route-choice decision. Within Advanced Traveler Information System (ATIS) working environment, temporal and spatial evolution processes of traffic flow in urban road networks are closely related to strategies of providing traffic information and contents of information. In view of the day-to-day route-choice situations, this study constructs original updating models of the cognitive travel time of travelers under four conditions, including not providing any route travel time, only providing the most rapid route travel time, only providing the most congested route travel time, and providing all the routes travel times. The disaggregate route-choice approach is adopted for simulation to reveal the relationship between the evolution process of network traffic flow and the strategy of providing traffic information. The simulation shows that providing traffic information to all travelers cannot improve the operational efficiency of road networks. It is noteworthy that an inappropriate information feedback strategy would lead to intense variation in various routes traffic flow. Compared with incomplete information feedback strategies, it is inefficient and superfluous to provide complete traffic information to all travelers.
APA, Harvard, Vancouver, ISO, and other styles
38

V, Danchuk, Svatko V, and Rudoman N. "DYNAMIC ROUTING OF CARGO DELIVERY PROCESSES IN CITIES BASE ON SYNERGETIC APPROACH." National Transport University Bulletin 1, no. 51 (2022): 159–71. http://dx.doi.org/10.33744/2308-6645-2022-1-51-159-171.

Full text
Abstract:
The paper proposes synergetic approach for simulation the processes of optimization of routes for the delivery of goods taking into account the non-stationary dynamics of traffic flows on sections of the urban road network. Within the framework of synergetic Lorentz model, the analytical dependences of the change in the speed of the traffic flow on the characteristic time of the change in the dynamics of the traffic flow and the density of the traffic flow in the network sections are determined. Further, based on the obtained dependence of the traffic flow speed on its density by using a modified self-organization algorithm of the ant colony, the route on the network is optimized. Here the urban road network is represented as a bidirectional weighted graph. The main element of the modification is that it implements the possibility of asynchronous movement of the each ant colony agent at a certain speed. In addition, it is also possible to fix the results of optimization of a partially traveled path for calculating a further route when the edge weight (length) of the graph changes during the movement. This allows you to management the route optimization process, taking into account the dynamic state of the network, which depends on the speed of movement of vehicles on certain sections of the 171 network. These changes in speed can be caused by an increase in the congestion of network sections, the occurrence of traffic jams, emergency situations, etc. To test the proposed method, simulation of route optimization processes was carried out within the framework of the traveling salesman problem, taking into account the real dynamics of traffic flows on the example of the road network of Kyiv city. Here, when conducting research on some selected sections of the network, the average density of traffic flows at certain points in time during the day was experimentally determined. Based on the simulation results, a number of effects were identified. These effects are associated with the rebuilding of optimal routes when the average speeds of vehicles on the model sections of the network decrease to certain boundary values corresponding to certain modes of traffic flow. The paper discusses the possibility of using the proposed method in intelligent transportation systems. In particular, this method can be used to solve dynamic vehicle routing problems using information about traffic prediction. KEYWORDS: TRAFFIC FLOW, URBAN ROAD NETWORK, SYNERGETIC LORENTZ MODEL, SYNERGETIC APPROACH, ANT ALGORITHM
APA, Harvard, Vancouver, ISO, and other styles
39

Pamosoaji, A. K., P. K. Dewa, and J. V. Krisnanta. "Proposed Modified Clarke-Wright Saving Algorithm for Capacitated Vehicle Routing Problem." International Journal of Industrial Engineering and Engineering Management 1, no. 1 (June 30, 2019): 9. http://dx.doi.org/10.24002/ijieem.v1i1.2292.

Full text
Abstract:
A multi-objective distribution routing algorithm by using modified Clarke and Wright Saving algorithm is presented. The problem to solve is to deliver loads to a number of outlets based load requirement. The objective function to minimize is the distance saving and traveling time of the resulted route started from depot to the outlets and return to the original depot. Problem to solve is generating a distribution route in a week considering traffic condition for each day. The original Clarke and Wright saving algorithm is modified such that the resulted routes (from a depot to some outlets) accommodates some constraints such as the maximum allowable traveling time, maximum number of delivery shifts, and maximum number of vehicles. The algorithm is applied to a distributor company with nine outlets, two vehicles, and two delivery shifts. In addition, the traffic condition on the outlet-to-outlet and the depot-to-outlet routes is considered. The simulation of the proposed algorithm shows that the algorithm can generate routes that comply with shift’s maximum delivery time and the vehicles’ capacities.
APA, Harvard, Vancouver, ISO, and other styles
40

Zhang, Fan, and Gangqiang Yang. "A Stable Backup Routing Protocol for Wireless Ad Hoc Networks." Sensors 20, no. 23 (November 25, 2020): 6743. http://dx.doi.org/10.3390/s20236743.

Full text
Abstract:
High-speed mobility and heavy-load traffic in mobile Ad hoc networks (MANET) may result in frequent topology changes and packet loss. To guarantee packet delivery, a novel stable backup routing (SBR) scheme is put forward in this paper, which consists of the establishment of backup routes and route maintenance. In SBR, backup routes are set up by overhearing MAC signals, and the bit error rate is considered in path selection for improving stability. To repair broken links effectively and reasonably, qualified backup routes are classified into three categories with different priorities, based on which the relevant nodes decide how to reconstruct the forwarding path. Extensive simulations demonstrate that our proposed method outperforms other comparable backup routing mechanisms in terms of packet delivery ratio, average delay and control overhead.
APA, Harvard, Vancouver, ISO, and other styles
41

Agafonov, Anton, and Aleksandr Borodinov. "A Route Reservation Approach for an Autonomous Vehicles Routing Problem." MATEC Web of Conferences 220 (2018): 02004. http://dx.doi.org/10.1051/matecconf/201822002004.

Full text
Abstract:
Autonomous vehicle development is one of many trends that will affect future transport demands and planning needs. Autonomous vehicles management in the context of an intelligent transportation system could significantly reduce the traffic congestion level and decrease the overall travel time in a network. In this work, we investigate a route reservation architecture to manage road traffic within an urban area. The routing architecture decomposes road segments into time and spatial slots and for every vehicle, it makes the reservation of the appropriate slots on the road segments in the selected route. This approach allows to predict the traffic in the network and to find the shortest path more precisely. We propose to use a rerouting procedure to improve the quality of the routing approach. Experimental study of the routing architecture is conducted using microscopic traffic simulation in SUMO package.
APA, Harvard, Vancouver, ISO, and other styles
42

Mecheva, Teodora, Radoslav Furnadzhiev, and Nikolay Kakanakov. "Modeling Driver Behavior in Road Traffic Simulation." Sensors 22, no. 24 (December 14, 2022): 9801. http://dx.doi.org/10.3390/s22249801.

Full text
Abstract:
Driver behavior models are an important part of road traffic simulation modeling. They encompass characteristics such as mood, fatigue, and response to distracting conditions. The relationships between external factors and the way drivers perform tasks can also be represented in models. This article proposes a methodology for establishing parameters of driver behavior models. The methodology is based on road traffic data and determines the car-following model and routing algorithm and their parameters that best describe driving habits. Sequential and parallel implementation of the methodology through the urban mobility simulator SUMO and Python are proposed. Four car-following models and three routing algorithms and their parameters are investigated. The results of the performed simulations prove the applicability of the methodology. Based on more than 7000 simulations performed, it is concluded that in future experiments of the traffic in Plovdiv it is appropriate to use a Contraction Hierarchies routing algorithm with the default routing step and the Krauss car-following model with the default configuration parameters.
APA, Harvard, Vancouver, ISO, and other styles
43

Ruiz-Rosero, Juan, Gustavo Ramirez-Gonzalez, and Rahul Khanna. "Masivo: Parallel Simulation Model Based on OpenCL for Massive Public Transportation Systems’ Routes." Electronics 8, no. 12 (December 8, 2019): 1501. http://dx.doi.org/10.3390/electronics8121501.

Full text
Abstract:
There is a large number of tools for the simulation of traffic and routes in public transport systems. These use different simulation models (macroscopic, microscopic, and mesoscopic). Unfortunately, these simulation tools are limited when simulating a complete public transport system, which includes all its buses and routes (up to 270 for the London Underground). The processing times for these type of simulations increase in an unmanageable way since all the relevant variables that are required to simulate consistently and reliably the system behavior must be included. In this paper, we present a new simulation model for public transport routes’ simulation called Masivo. It runs the public transport stops’ operations in OpenCL work items concurrently, using a multi-core high performance platform. The performance results of Masivo show a speed-up factor of 10.2 compared with the simulator model running with one compute unit and a speed-up factor of 278 times faster than the validation simulator. The real-time factor achieved was 3050 times faster than the 10 h simulated duration, for a public transport system of 300 stops, 2400 buses, and 456,997 passengers.
APA, Harvard, Vancouver, ISO, and other styles
44

Danjou, A., A. Lafontaine, B. Jacquemin, K. De Hoogh, J. Clavel, and S. Goujon. "2-4 - Exposition au trafic routier à la naissance et risque de leucémie chez l'enfant, France métropolitaine." Journal of Epidemiology and Population Health 72 (July 2024): 202566. http://dx.doi.org/10.1016/j.jeph.2024.202566.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Schweizer, Joerg, Fabian Schuhmann, and Cristian Poliziani. "hybridPy: The Simulation Suite for Mesoscopic and Microscopic Traffic Simulations." SUMO Conference Proceedings 5 (July 17, 2024): 39–55. http://dx.doi.org/10.52825/scp.v5i.1030.

Full text
Abstract:
Mesoscopic, agent-based simulations efficiently model and assess entire regions’ daily activities and travel patterns, exemplified by smaller countries like Switzerland. The queue-based simulation represents a compromise between computational speed on the one hand and the necessity of detailed modeling infrastructure on the other hand. Thus, mesoscopic simulations enable an efficient and reasonably detailed analysis of the complex interplay between supply and demand in mobility research. Conversely, microsimulations excel at reproducing individual speed profiles and behavior by modeling the interactions between traffic participants, including pedestrians, bicycles, and scooters. Although allowing for more detailed system analysis, the downside is the high computational burden, which often prevents large-scale microscopic simulations from running in optimization or calibration loops. hybridPY, an extension of SUMOPy, aims to close the gap and benefit from both environments. The simulation suite allows the running of mesoscopic as well as microscopic traffic simulations based on the core idea: running a microscopic simulation in a smaller dedicated area, using the routes or mobility plans generated from a larger mesoscopic model. The main features of this software are: (i) import, editing and visualization of MATSim and BEAM CORE networks; (ii) conversion of MATSim plans to SUMO routes or plans within the SUMO area; (iii) configuring and running of MATSim simulations. The capability of hybridPY is demonstrated by two applications: the simulation of Schwabing, Germany, based on the MITO MATSim model, and the San Francisco municipality, USA, based on the mesoscopic BEAM CORE model of the entire San Francisco Bay area. Both scenarios demonstrate that the hybrid approach results in significant computational gains with respect to a pure microscopic approach.
APA, Harvard, Vancouver, ISO, and other styles
46

Esser, J., and M. Schreckenberg. "Microscopic Simulation of Urban Traffic Based on Cellular Automata." International Journal of Modern Physics C 08, no. 05 (October 1997): 1025–36. http://dx.doi.org/10.1142/s0129183197000904.

Full text
Abstract:
Saturated capacities in traffic systems evoke increasing interest in simulations of complex networks serving as laboratory environment for developing management strategies. Especially for urban areas questions concerning overall traffic control have to be considered with regard to their impacts on the whole network. Modeling traffic flow dynamics using cellular automata allows us to run large network traffic simulations with only comparatively low computational efforts. We present a traffic simulation tool for urban road networks which is based on the Nagel–Schreckenberg Model. Arbitrary kinds of roads and crossings are modeled as combinations of only a few basic elements. Furthermore parking capacities are considered as well as circulations of public transports. The vehicles are driven corresponding to route plans or at random depending on the available data. The application of this network simulation covers investigations on the field of traffic planning as well as online simulations based on real-time traffic data as basis for dynamic traffic management systems.
APA, Harvard, Vancouver, ISO, and other styles
47

Нургалиев and E. Nurgaliev. "SIMULATION OF OPERATIONAL ROUTING BUSES." Alternative energy sources in the transport-technological complex: problems and prospects of rational use of 2, no. 2 (December 17, 2015): 807–12. http://dx.doi.org/10.12737/19568.

Full text
Abstract:
Of all the methods available and the most appropriate modeling tools that meet their stated objectives for the study of traffic flows is a simulation. This article describes two methods for rapid routing traffic minibuses. For the method based on the analysis of the complete set of traffic situa-tions, developed a simulation model of municipal passenger transport. As a result of simulation ob-tained by the implementation of a process that allows after treatment to determine the value of sta-tistical criteria for defining the transport proce
APA, Harvard, Vancouver, ISO, and other styles
48

Santos, Osvaldo, Fernando Ribeiro, José Metrôlho, and Rogério Dionísio. "Using Smart Traffic Lights to Reduce CO2 Emissions and Improve Traffic Flow at Intersections: Simulation of an Intersection in a Small Portuguese City." Applied System Innovation 7, no. 1 (December 25, 2023): 3. http://dx.doi.org/10.3390/asi7010003.

Full text
Abstract:
Reducing CO2 emissions is currently a key policy in most developed countries. In this article, we evaluate whether smart traffic lights can have a relevant role in reducing CO2 emissions in small cities, considering their specific traffic profiles. The research method is a quantitative modelling approach tested by computational simulation. We propose a novel microscopic traffic simulation framework, designed to simulate realistic vehicle kinematics and driver behaviour, and accurately estimate CO2 emissions. We also propose and evaluate a routing algorithm for smart traffic lights, specially designed to optimize CO2 emissions at intersections. The simulations reveal that deploying smart traffic lights at a single intersection can reduce CO2 emissions by 32% to 40% in the vicinity of the intersection, depending on the traffic density. The simulations show other advantages for drivers: an increase in average speed of 60% to 101% and a reduction in waiting time of 53% to 95%. These findings can be useful for city-level decision makers who wish to adopt smart technologies to improve traffic flows and reduce CO2 emissions. This work also demonstrates that the simulator can play an important role as a tool to study the impact of smart traffic lights and foster the improvement in smart routing algorithms to reduce CO2 emissions.
APA, Harvard, Vancouver, ISO, and other styles
49

LI, DAWEI, JIE WU, DAJIN WANG, and JIAYIN WANG. "Software-Defined Networking Switches for Fast Single-Link Failure Recovery." Journal of Interconnection Networks 18, no. 04 (December 2018): 1850014. http://dx.doi.org/10.1142/s0219265918500147.

Full text
Abstract:
In this paper, we consider IP fast recovery from single-link failures in a given network topology. The basic idea is to replace some existing routers with a designated switch. When a link fails, the affected router will send all the affected traffic to the designated switch (through pre-configured IP tunnels), which will deliver the affected traffic to its destination without using the failed link. The goal of the approach is to achieve faster failure recovery than traditional routing protocols that employ reactive computing upon link failures. Software-Defined Networking (SDN) switches can serve as the designated switches because they can flexibly redirect affected traffic to other routes, instead of only to the shortest paths in the network. However, SDN switches are very expensive. Our objective is to minimize the number of SDN switches needed and to guarantee that the network can still recover from any single-link failure. For networks with uniform link costs, we show that using normal non-SDN switches with IP tunneling capability as designated switches can guarantee recovery from any single-link failure. For networks with general link costs, we find that not all single-link failures can be recovered by using non-SDN switches as designated switches; by using SDN switches only when necessary, we can reduce the total number of SDN switches needed compared to an existing work. We conduct extensive simulations to verify our proposed approaches.
APA, Harvard, Vancouver, ISO, and other styles
50

Dussault, Christian, Catherine Laurian, and Jean-Pierre Ouellet. "Réactions comportementales de l’orignal à la présence d’un réseau routier dans un milieu forestier." Les routes et la grande faune 136, no. 2 (May 11, 2012): 48–53. http://dx.doi.org/10.7202/1009106ar.

Full text
Abstract:
Les accidents routiers impliquant l’orignal engendrent des dégâts matériels coûteux et peuvent causer des pertes de vies humaines. Nous avons étudié le comportement de l’orignal près des routes afin de développer des mesures d’atténuation pour réduire le nombre d’accidents routiers avec cette espèce. Nous avons muni plusieurs orignaux de colliers GPS entre 2003 et 2006 dans le nord de la réserve faunique des Laurentides, où se trouvent deux routes principales asphaltées et un réseau de chemins forestiers. Les axes routiers, même les chemins forestiers où le trafic était faible, furent généralement évités par les orignaux. Nos résultats suggèrent que la fréquentation par l’orignal des abords de routes pavées s’explique par la présence de sodium dans les mares d’eau stagnante. Cependant, la fréquentation des routes par l’orignal n’a pas augmenté en période d’abondance d’insectes piqueurs. Les abords des routes asphaltées ont généralement été visités au printemps et en été, périodes durant lesquelles les besoins en sodium de l’orignal sont les plus élevés. La présence de mares salines en bordure des routes augmente le risque de collision avec un orignal. L’élimination de ces mares pourrait donc améliorer sensiblement la sécurité routière, mais l’efficacité de cette approche à long terme n’est pas connue.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Simulation de trafic routier' for other source types:
Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography