Abstract
In this paper, we introduce a new model of urban traffic networks by using timed event graphs (TEG). Based on dioid algebra, the behavior of the system is described by (Max, +)-linear equations. This will allow to approach the traffic control problems which rise issues of cycle times and of synchronization. As a result, we show how we can solve a non-null initial marking problem inherent in dioid modeling. Besides, the proposed model provides us with interesting performance evaluations, such as realtime counts of vehicles and bounds of sojourn time in each part of the studied street. An example is worked out to validate the model
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
