Meta-Sezgisel Yöntemlerle Sabit Zamanlı Sinyalize Kavşaklar için Optimum Devre Süresi Modeli

Akgüngör, Ali Payıdar; Yılmaz, Özge; Korkmaz, Ersin; Doğan, Erdem

doi:10.31202/ecjse.496257

Cited by 5 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Algoritmanın temel adımları aşağıdaki şekilde özetlenebilir [27][28][29][30]:  Başlangıç yiyecek kaynak bölgelerinin üretilmesi  İşçi arıların yiyecek kaynağı olan bölgeye gönderilmesi  Seçilim için olasılık değerlerinin görevli arıların verdiği bilgiye göre bulunması  Gözcü arıların bulunan olasılık verilerine göre yiyecek kaynağı bölgesi seçmeleri  Kaynağı bırakma kriteri: limit ve kâşif arı üretimi…”

Section: Kâşif Arı Aşamasıunclassified

Dağıtık Permütasyon Akış Tipi Çizelgeleme Problemlerinin Yapay Arı Koloni Algoritması İle Çözümü

Küpeli¹,

Sarucan²,

Küpeli³

2020

El-Cezeri Fen Ve Mühendislik Dergisi

View full text Add to dashboard Cite

Bu çalışmada amaç fonksiyonu maksimum tamamlanma süresinin minimizasyonu olan dağıtık permütasyon akış tipi çizelgeleme problemleri ele alınmıştır. Bu problemin klasik akış tipi çizelgeleme probleminden farkı, işlerin birden fazla fabrikaya dağıtılmasıdır. Problemin çözümünde doğadaki arıların besin arama davranışını temel alan yapay arı koloni algoritması kullanılmıştır. Algoritmanın başlangıç çözümleri üretmesinde NEH (Nawaz Enscore Ham) sezgiselinden yararlanılmıştır. Algoritmanın evrelerinde (işçi, gözlemci ve kâşif arı evresi) komşu çözümler için yer değiştirme metodu kullanılmıştır. Bu metotta rastgele seçilen iki işin yerleri değiştirilerek farklı iş sıraları elde edilmiştir. Algoritmanın problem üzerindeki başarısı literatürde iyi bilinin Taillard'ın küçük ve büyük boyutlu test problemleri kullanılarak ölçülmüştür. Algoritma, 14 adet sezgisel ile karşılaştırılmıştır ve en iyi sonuçları sunmuştur.

show abstract

Section: Kâşif Arı Aşamasıunclassified

Dağıtık Permütasyon Akış Tipi Çizelgeleme Problemlerinin Yapay Arı Koloni Algoritması İle Çözümü

Küpeli¹,

Sarucan²,

Küpeli³

2020

El-Cezeri Fen Ve Mühendislik Dergisi

View full text Add to dashboard Cite

show abstract

“…The authors, who sought solutions with different heuristic approaches to solving nonlinear problems, stated the usability and efficiency of the algorithms [18] [19]. Akgüngör et al, on the other hand, aimed to develop heuristic approaches and find the best travel time for scenarios with high traffic density in [20].…”

Section: Introduction *mentioning

confidence: 99%

Optimization of Traffic Network Signal Durations with Heuristic Algorithm and the Effect of Number of Individuals

Karakuzu

Topal

2023

Kocaeli Journal of Science and Engineering

View full text Add to dashboard Cite

In the traffic network that we frequently use in our daily life, the primary demand of people has been to reduce the time they spend in traffic and to travel to the points they want to reach as quickly as possible. Developing countries want to meet this demand with the least cost in order to meet this demand. In this study, it is aimed to manage the traffic network with the best times by optimizing the traffic signal durations in order to minimize the travel time for a road network chosen as a benchmark. For the optimization process, it is aimed to run a population-based heuristic algorithm with different numbers of individuals and to obtain the best travel time. With the help of an open source code traffic simulation program, which was run by modeling the benchmark road network, the obtained traffic data was also visually analyzed and compared. The effects of the heuristic algorithms applied with different numbers of individuals on the travel times according to the starting-destination points were examined before and after the optimization. As a result of the study, it has been observed that travel times and traffic signal times can be reduced with heuristic algorithms. Based on both numerical metrics and visual results, it has been determined that optimized traffic light durations give better results than non-optimized ones.

show abstract

“…It was obtained that in smaller problem scale, SA algorithm method had obtained more suitable objective function whereas in the conditions that problem's size had increased, there was not much difference between the two methods in estimating optimal objective function. Akgüngör et al 16 calibrated the Webster model using DE and artificial bee colony (ABC) algorithms, and also developed models in exponential and quadratic form. While all developed models had statistically better performance than Webster model.…”

Section: Introductionmentioning

confidence: 99%

Optimum cycle length models using atom search optimization and grasshopper optimization algorithms

Korkmaz

Akgüngör

2021

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

A fixed‐time traffic control system is widely used to manage the traffic flow at intersections. Cycle length has an important effect on the performance of the fixed‐time control system and the Webster model is widely used in the literature to determine the cycle length. However, when the traffic flow ratio (Y) approaches 1, the Webster model loses its effectiveness and cannot determine the cycle length when Y is above 1. In the scope of this study, it is aimed to develop models that can predict cycle length for all traffic conditions in which are Y ≤ 1 and Y ≥ 1. Two different heuristic algorithms, atom search optimization (ASO) and grasshopper optimization algorithm (GOA) were used in the development of models and the performances of these algorithms were demonstrated. The efficiency of the developed models has been demonstrated by comparing them with both Webster's model and VISTRO optimization program. Models developed in exponential, power, and quadratic forms have been able to predict cycle lengths with lower delay values by showing better performance than Webster and VISTRO. In addition, statistical results show that the ASO approach is more successful than the GOA approach.

show abstract

Meta-Sezgisel Yöntemlerle Sabit Zamanlı Sinyalize Kavşaklar için Optimum Devre Süresi Modeli

Cited by 5 publications

References 9 publications

Dağıtık Permütasyon Akış Tipi Çizelgeleme Problemlerinin Yapay Arı Koloni Algoritması İle Çözümü

Dağıtık Permütasyon Akış Tipi Çizelgeleme Problemlerinin Yapay Arı Koloni Algoritması İle Çözümü

Optimization of Traffic Network Signal Durations with Heuristic Algorithm and the Effect of Number of Individuals

Optimum cycle length models using atom search optimization and grasshopper optimization algorithms

Contact Info

Product

Resources

About