Replacement of signalized traffic network design with Hamiltonian roads: delay? Nevermind
Soft Computing, cilt.27, sa.12, ss.8245-8254, 2023 (SCI-Expanded, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 27 Sayı: 12
- Basım Tarihi: 2023
- Doi Numarası: 10.1007/s00500-022-07735-z
- Dergi Adı: Soft Computing
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, Applied Science & Technology Source, Compendex, Computer & Applied Sciences, INSPEC, zbMATH
- Sayfa Sayıları: ss.8245-8254
- Anahtar Kelimeler: Traffic delay, Traffic network, Hamiltonian cycle, Graph theory, ALGORITHM, TRANSPORTATION, MODEL
- Süleyman Demirel Üniversitesi Adresli: Evet
Özet
Signal optimisation is essential in traffic engineering. The traffic light control timings should be set as optimum. However, it is challenging because the traffic network is a non-polynomial problem. In this study, the problem is evaluated from a unique perspective. The primary idea is to remove the crossings of the intersections. A Hamiltonian cycle algorithm has been used to design the network. So, vehicles are only able to join or split. Thus, no control mechanism is needed that delays or interrupts the flow. The suggested algorithm and intersection design were tested on Allsop and Charlesworth’s widely used sample network. Findings were compared with the literature in the form of delay calculated using the Highway Capacity Manual 2010 formula. The suggested network’s delay is calculated to be 98.17% and 95.45% less than the original network and recently published study-based delay, respectively. As a result, Hamiltonian roads seem sustainable in time and fuel consumption and could be used for future designs.