Araştırma Makalesi
BibTex RIS Kaynak Göster

En kısa rota seyahat süreleri kullanılarak tek ve iki yönlü yolların optimum düzenlemelerinin yapılması

Yıl 2018, Cilt: 24 Sayı: 6, 1087 - 1092, 18.12.2018

Öz

Ulaştırma
alanındaki en önemli problemlerden biri bilindiği gibi trafik sıkışıklığıdır.
Trafik sıkışıklığının olumsuz etkilerini en aza indirebilmek için uygulanan
geleneksel yöntemlerden biride tek yön uygulamalarıdır. Kentiçi yol ağlarındaki
iki yönlü yolların bazılarının tek yöne çevrilmesi uygulaması bilindiği gibi
sistem performansını artırmaya yönelik diğer uygulamalardan daha az
maliyetlidir. Bu nedenle tek yön uygulamalarının ağ performansı üzerindeki
olası etkilerinin değerlendirilmesi gerekmektedir. Çalışmada bu amaçla yol
ağlarındaki tek yönlü yolların optimum konfigürasyonun belirlenmesi amacıyla
iki seviyeli sezgisel bir çözüm algoritması geliştirilmiştir. Üst seviyede
talep ağırlıklı en kısa rota seyahat sürelerinin toplamının en küçüklenmesi
amaçlanmıştır. Alt seviyede ise kullanıcı dengesi bağ akımları belirlenmiştir.
Üst seviyede oluşturulan ağ yapısına bağlı olarak belirlenen bağ seyahat
süreleri dikkate alınarak trafik atama problemi VISUM yazılımı ile çözülmüş ve
Başlangıç-Varış (B-V) çiftleri arasındaki en kısa rota seyahat süreleri elde
edilmiştir. Tek yönlü yolların daha cazip hale getirmek amacıyla α parametresi
kullanılmıştır. Bu amaçla ulaşım ağı içinde tek yöne çevrilen bağların uzunluğu
α parametresi ile çarpılarak azaltılmış bir başka deyişle bağ üzerindeki hız
artırılmıştır. Geliştirilen iki seviyeli sezgisel çözüm algoritması Sioux-Falls
ulaşım ağına uygulanmıştır. Bazı bağların tek yön olması durumundaki sonuçlar
ağdaki tüm bağların çift yönlü hizmet vermesi durumuna göre geliştirilen amaç
fonksiyonu değerlendirilerek karşılaştırılmıştır. Ayrıca α parametresine karşı
geliştirilen algoritmanın duyarlılığını test etmek amacıyla duyarlılık analizi
yapılmıştır. Sonuçlar geliştirilen algoritmanın kentiçi ulaşım ağlarında
yapılması planlanan tek yön uygulamalarında kullanılabileceğini göstermektedir.

Kaynakça

  • Lee CK, Yang KI. “Network design of one-way streets with simulated annealing”. Papers in Regional Science, 73(2), 119-134, 1994.
  • Drezner Z, Weselowsky GO. “Selecting an optimum configuration of one-way and two-way routes”. Transportation Science, 31, 386-394, 1997.
  • Drezner Z, Salhi S. “Selecting an optimum configuration of one-way and two-way routes using tabu search”. Kyoto University Research Information Repository, 1068, 203-215, 1998.
  • Drezner Z, Salhi S. “Using hybrid metaheuristics for the one-way and two-way network design problem”. Naval Research Logistics, 49(5), 449-463, 2002.
  • Ozan C, Baskan O. “Implementation of one-way streets using shortest path distances on urban road networks”. 12th Transportation Congress, Adana, Turkey, 24-26 May 2017. (in Turkish).
  • Drezner Z, Weselowsky GO. “Network design: Selection and design of links and facility location”. Transportation Research Part- A, 37, 241-256, 2003.
  • Zargari SA, Taromi R. “Selecting an optimum configuration of urban one-way and two-way streets using genetic algorithms”. International Journal of Civil Engineering, 4(3), 244-259, 2006.
  • Miandoabchi E, Farahani RZ. “Bi-objective bimodal urban road network design using hybrid metaheuristics”. Central European Journal of Operations Research, 20, 583-621, 2012.
  • Salcedo-Sanz S, Manjarres D, Pastor-Sanchez A, Del Ser J, Portilla-Figureas JA, Gil-Lopez S. “One-way urban traffic reconfiguration using a multi-objective harmony search approach”. Expert System with Applications, 40(9), 3341-3350, 2013.
  • Poorzahedy H, Shirazi DM. “A simulated annealing approach to solve the network design of one-way streets: case of shiraz network”. Computational Methods in Civil Engineering, 4(1), 83-101, 2013.
  • Salcedo-Sanz S, Cuadra L, Alexandre-Cortizo E, Jimenez-Fernandez S, Portilla-Figueras A. “Soft-Computing: An innovative technological solution for urban traffic-related problems in modern cities”. Technological Forecasting & Social Change, 89, 236-244, 2014.
  • Afandizadeh S, Jahangiri A, Kalantari N. “Determination of the optimal network configuration for emergency evacuation by simulated annealing algorithm”. Proceeding of the 2nd WSEAS International Conference on Natural Hazards, Baltimore, USA, 65-71, 2009.
  • Afandizadeh S, Jahangiri A, Kalantari N. “Identifying the optimal configuration of one-way and two-way streets for contraflow operation during an emergency evacuation”. Natural Hazards, 69, 1315-1334, 2013.
  • Farahani RZ, Miandoabchi E, Szeto WY, Rashidi, H. “A review of urban transportation network design problems”. European Journal of Operational Research, 229(2), 281-302, 2013.
  • Fisk C. “Optimal signal controls on congested networks”. 9th International Symposium on Transportation and Traffic Theory, Delft, Netherlands, 11-13 July, 1984.
  • Baskan O. “Determining optimal link capacity expansions in road networks using cuckoo search algorithm with levy flights”. Journal of Applied Mathematics, 2013, 1-11, 2013.
  • Baskan O. “Harmony search algorithm for continuous network design problem with link capacity expansions”. KSCE Journal of Civil Engineering, 18(1), 273-283, 2014.
  • Wardrop JG. “Some theoretical aspects of road traffic research”. Proceedings of the Institution of Civil Engineers Part II, 1, 325-378, 1952.
  • PTV Planung Transport Verkehr AG. “VISUM 14-User Manual”. Karlsruhe, Germany, 2014.
  • Liu H, Cai Z, Wang Y. “Hybridizing particle swarm optimization with differential evolution for constrained numerical and engineering optimization”. Applied Soft Computing, 10(2), 629-640, 2010.
  • Baskan O. “Solving combined road network design problem using differential evolution algorithm”. 10th Transportation Congress, Izmir, Turkey, 24-26 September 2013. (in Turkish).
  • Baskan O, Ceylan H. “Modified differential evolution algorithm for the continuous network design problem”. 16th Meeting of Euro Working Group on Transportation, Porto, Portugal, 4-6 September 2013.
  • Baskan O. “An evaluation of heuristic methods for determining optimal link capacity expansions on road networks”. International Journal of Transportation, 2(1), 77-94, 2014.
  • Baskan O, Ceylan H. “Differential evolution based solution approaches for solving transportation network design problems”. Pamukkale University Journal of Engineering Sciences, 20(9), 324-331, 2014.
  • Baskan O, Ozan C. “Combined solution of capacity expansion and signal setting problems for signalized road networks”. 18th Meeting of Euro Working Group on Transportation, TU Delft, The Netherlands, 14-16 July 2015.
  • Storn R, Price K. “Differential Evolution: A Simple and Efficient Adaptive Scheme for Global Optimization over Continuous Spaces”. International Computer Science Institute, Berkeley, USA, Technical Report, TR-95-012, 1995.

Determining optimum configuration of one-way and two-way streets using shortest path travel costs based on results of traffic assignment

Yıl 2018, Cilt: 24 Sayı: 6, 1087 - 1092, 18.12.2018

Öz

Traffic
congestion is one of the major problems in transportation field. To reduce
unfavorable impact of that problem, one of the conventional applications is to
find optimal or near-optimal configuration of one-way streets on road networks.
When some of two-way streets in the network are converted to one-way, which may
be cheaper than other possible improvements, the performance of the road system
may increase. Thus, this arrangement should be evaluated in order to determine
its possible effects. For this purpose, a bilevel heuristic solution algorithm
is proposed to find optimal configuration of one-way streets on road networks
in this study. The upper level deals with finding optimal configuration of
one-way streets by minimizing the total flow (demand) weighted shortest path
travel costs (distance) while user equilibrium link flows are determined in the
lower level. Shortest path travel costs between OD pairs are obtained after
executing traffic assignment module of VISUM software by considering link travel
times according to created network configuration in the upper level. To make
more attractive one-way streets, we have used the parameter of α which is
multiplied with the length of one-way streets to increase its speed. The
bilevel heuristic solution algorithm is combined with VISUM and applied to
Sioux-Falls city network. The results of near-optimal arrangement of one-way
streets are compared with those of base case in terms of objective function
considered. Additionally, sensitivity analysis was performed to investigate how
the algorithm reacts to the variation of the parameter of α. Results showed
that developed algorithm may be considered for finding optimal configuration of
one–way streets on urban road networks.

Kaynakça

  • Lee CK, Yang KI. “Network design of one-way streets with simulated annealing”. Papers in Regional Science, 73(2), 119-134, 1994.
  • Drezner Z, Weselowsky GO. “Selecting an optimum configuration of one-way and two-way routes”. Transportation Science, 31, 386-394, 1997.
  • Drezner Z, Salhi S. “Selecting an optimum configuration of one-way and two-way routes using tabu search”. Kyoto University Research Information Repository, 1068, 203-215, 1998.
  • Drezner Z, Salhi S. “Using hybrid metaheuristics for the one-way and two-way network design problem”. Naval Research Logistics, 49(5), 449-463, 2002.
  • Ozan C, Baskan O. “Implementation of one-way streets using shortest path distances on urban road networks”. 12th Transportation Congress, Adana, Turkey, 24-26 May 2017. (in Turkish).
  • Drezner Z, Weselowsky GO. “Network design: Selection and design of links and facility location”. Transportation Research Part- A, 37, 241-256, 2003.
  • Zargari SA, Taromi R. “Selecting an optimum configuration of urban one-way and two-way streets using genetic algorithms”. International Journal of Civil Engineering, 4(3), 244-259, 2006.
  • Miandoabchi E, Farahani RZ. “Bi-objective bimodal urban road network design using hybrid metaheuristics”. Central European Journal of Operations Research, 20, 583-621, 2012.
  • Salcedo-Sanz S, Manjarres D, Pastor-Sanchez A, Del Ser J, Portilla-Figureas JA, Gil-Lopez S. “One-way urban traffic reconfiguration using a multi-objective harmony search approach”. Expert System with Applications, 40(9), 3341-3350, 2013.
  • Poorzahedy H, Shirazi DM. “A simulated annealing approach to solve the network design of one-way streets: case of shiraz network”. Computational Methods in Civil Engineering, 4(1), 83-101, 2013.
  • Salcedo-Sanz S, Cuadra L, Alexandre-Cortizo E, Jimenez-Fernandez S, Portilla-Figueras A. “Soft-Computing: An innovative technological solution for urban traffic-related problems in modern cities”. Technological Forecasting & Social Change, 89, 236-244, 2014.
  • Afandizadeh S, Jahangiri A, Kalantari N. “Determination of the optimal network configuration for emergency evacuation by simulated annealing algorithm”. Proceeding of the 2nd WSEAS International Conference on Natural Hazards, Baltimore, USA, 65-71, 2009.
  • Afandizadeh S, Jahangiri A, Kalantari N. “Identifying the optimal configuration of one-way and two-way streets for contraflow operation during an emergency evacuation”. Natural Hazards, 69, 1315-1334, 2013.
  • Farahani RZ, Miandoabchi E, Szeto WY, Rashidi, H. “A review of urban transportation network design problems”. European Journal of Operational Research, 229(2), 281-302, 2013.
  • Fisk C. “Optimal signal controls on congested networks”. 9th International Symposium on Transportation and Traffic Theory, Delft, Netherlands, 11-13 July, 1984.
  • Baskan O. “Determining optimal link capacity expansions in road networks using cuckoo search algorithm with levy flights”. Journal of Applied Mathematics, 2013, 1-11, 2013.
  • Baskan O. “Harmony search algorithm for continuous network design problem with link capacity expansions”. KSCE Journal of Civil Engineering, 18(1), 273-283, 2014.
  • Wardrop JG. “Some theoretical aspects of road traffic research”. Proceedings of the Institution of Civil Engineers Part II, 1, 325-378, 1952.
  • PTV Planung Transport Verkehr AG. “VISUM 14-User Manual”. Karlsruhe, Germany, 2014.
  • Liu H, Cai Z, Wang Y. “Hybridizing particle swarm optimization with differential evolution for constrained numerical and engineering optimization”. Applied Soft Computing, 10(2), 629-640, 2010.
  • Baskan O. “Solving combined road network design problem using differential evolution algorithm”. 10th Transportation Congress, Izmir, Turkey, 24-26 September 2013. (in Turkish).
  • Baskan O, Ceylan H. “Modified differential evolution algorithm for the continuous network design problem”. 16th Meeting of Euro Working Group on Transportation, Porto, Portugal, 4-6 September 2013.
  • Baskan O. “An evaluation of heuristic methods for determining optimal link capacity expansions on road networks”. International Journal of Transportation, 2(1), 77-94, 2014.
  • Baskan O, Ceylan H. “Differential evolution based solution approaches for solving transportation network design problems”. Pamukkale University Journal of Engineering Sciences, 20(9), 324-331, 2014.
  • Baskan O, Ozan C. “Combined solution of capacity expansion and signal setting problems for signalized road networks”. 18th Meeting of Euro Working Group on Transportation, TU Delft, The Netherlands, 14-16 July 2015.
  • Storn R, Price K. “Differential Evolution: A Simple and Efficient Adaptive Scheme for Global Optimization over Continuous Spaces”. International Computer Science Institute, Berkeley, USA, Technical Report, TR-95-012, 1995.
Toplam 26 adet kaynakça vardır.

Ayrıntılar

Birincil Dil İngilizce
Konular Mühendislik
Bölüm Makale
Yazarlar

Özgür Başkan 0000-0001-5016-8328

Cenk Ozan 0000-0003-0690-6033

Yayımlanma Tarihi 18 Aralık 2018
Yayımlandığı Sayı Yıl 2018 Cilt: 24 Sayı: 6

Kaynak Göster

APA Başkan, Ö., & Ozan, C. (2018). Determining optimum configuration of one-way and two-way streets using shortest path travel costs based on results of traffic assignment. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi, 24(6), 1087-1092.
AMA Başkan Ö, Ozan C. Determining optimum configuration of one-way and two-way streets using shortest path travel costs based on results of traffic assignment. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi. Aralık 2018;24(6):1087-1092.
Chicago Başkan, Özgür, ve Cenk Ozan. “Determining Optimum Configuration of One-Way and Two-Way Streets Using Shortest Path Travel Costs Based on Results of Traffic Assignment”. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi 24, sy. 6 (Aralık 2018): 1087-92.
EndNote Başkan Ö, Ozan C (01 Aralık 2018) Determining optimum configuration of one-way and two-way streets using shortest path travel costs based on results of traffic assignment. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi 24 6 1087–1092.
IEEE Ö. Başkan ve C. Ozan, “Determining optimum configuration of one-way and two-way streets using shortest path travel costs based on results of traffic assignment”, Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi, c. 24, sy. 6, ss. 1087–1092, 2018.
ISNAD Başkan, Özgür - Ozan, Cenk. “Determining Optimum Configuration of One-Way and Two-Way Streets Using Shortest Path Travel Costs Based on Results of Traffic Assignment”. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi 24/6 (Aralık 2018), 1087-1092.
JAMA Başkan Ö, Ozan C. Determining optimum configuration of one-way and two-way streets using shortest path travel costs based on results of traffic assignment. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi. 2018;24:1087–1092.
MLA Başkan, Özgür ve Cenk Ozan. “Determining Optimum Configuration of One-Way and Two-Way Streets Using Shortest Path Travel Costs Based on Results of Traffic Assignment”. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi, c. 24, sy. 6, 2018, ss. 1087-92.
Vancouver Başkan Ö, Ozan C. Determining optimum configuration of one-way and two-way streets using shortest path travel costs based on results of traffic assignment. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi. 2018;24(6):1087-92.





Creative Commons Lisansı
Bu dergi Creative Commons Al 4.0 Uluslararası Lisansı ile lisanslanmıştır.