Geri Dön

Runtime analysis of evolutionary algorithms with complex fitness evaluation mechanisms

Başlık çevirisi mevcut değil.

PDF İndir

  1. Tez No: 717823
  2. Yazar: DOGAN CORUS
  3. Danışmanlar: Belirtilmemiş.
  4. Tez Türü: Doktora
  5. Konular: Bilgisayar Mühendisliği Bilimleri-Bilgisayar ve Kontrol, Computer Engineering and Computer Science and Control
  6. Anahtar Kelimeler: Belirtilmemiş.
  7. Yıl: 2017
  8. Dil: İngilizce
  9. Üniversite: The Unıversıty Of Nottıngham
  10. Enstitü: Yurtdışı Enstitü
  11. Ana Bilim Dalı: Belirtilmemiş.
  12. Bilim Dalı: Belirtilmemiş.
  13. Sayfa Sayısı: Belirtilmemiş.

Özet

Özet yok.

Özet (Çeviri)

Evolutionary algorithms (EAs) are bio-inspired general purpose optimisation methods which are applicable to a wide range of problems. The performance of an EA can vary considerably according to the problem it tackles. Runtime analyses of EAs rigorously prove bounds on the expected computational resources required by the EA to solve a given problem. A crucial component of an EA is the way it evaluates the quality (i.e. fitness) of candidate solutions. Different fitness evaluation methods may drastically change the efficiency of a given EA. In this thesis, the effects of different fitness evaluation methods on the performance of evolutionary algorithms are investigated. A major contribution of this thesis is the first runtime analyses of EAs on bi-level optimisation problems. The performances of different EAs on The Generalised Minimum Spanning Tree Problem and The Generalised Travelling Salesperson Problem are analysed to illustrate how bi-level problem structures can be exploited to delegate part of the optimisation effort to problem-specific deterministic algorithms. Different bi-level representations are considered and it is proved that one of them leads to fixed-parameter evolutionary algorithms for both problems with respect to the number of clusters. Secondly, a new mathematical tool called the level-based theorem is presented. The theorem is a high level analytical tool which provides upper bounds on the runtime of a wide range of non-elitist population-based algorithms with independent sampling and using sophisticated high arity variation operators such as crossover. The independence of this new tool from the objective function allows runtime analyses of EAs which use complicated fitness evaluation methods. As an application of the level-based theorem, we conduct, for the first time, runtime analyses of non-elitist genetic algorithms on pseudo-Boolean test functions and also 1 on three classical combinatorial optimisation problems. The last major contribution of this thesis is the illustration of how the level-based theorem can be used to design genetic algorithms with guaranteed runtime bounds. The well-known graph problems Single Source Shortest Path and All-Pairs Shortest Path are used as test beds. The used fitness evaluation method is tailored to incorporate the optimisation approach of a well known problem-specific algorithm and it is rigorously proved that the presented EA optimises both problems efficiently. The thesis is concluded with a discussion of the wider implications of the presented work and future work directions are explored.

Benzer Tezler

  1. Tez No

    948819

    Aeroelastic optimization with genetic algorithm

    Genetik algoritma ile aeroelastik optimizasyon

    AHMET GÜVER

    Yüksek Lisans

    İngilizce

    İngilizce

    2025

    Uçak Mühendisliğiİstanbul Teknik Üniversitesi

    Uçak ve Uzay Mühendisliği Ana Bilim Dalı

    DOÇ. DR. SEHER EKEN

  2. Tez No

    982086

    Optimizasyon tabanlı bir su kaynakları sistemi modelleme aracının geliştirilmesi ve çok amaçlı sektörel tahsise uygulanması

    Development of an optimization-based modeling tool for water resources systems and application to multi-objective sectoral allocation

    SALİM YAYKIRAN

    Doktora

    Türkçe

    Türkçe

    2025

    Çevre Mühendisliğiİstanbul Teknik Üniversitesi

    Çevre Mühendisliği Ana Bilim Dalı

    DOÇ. DR. ALPASLAN EKDAL

  3. Tez No

    822220

    Perinatal dönemdeki psikiyatrik hastalık belirtilerinin yapay zeka tabanlı büyük veri işleme platformu ile belirlenmesi

    Detection of psychiatric disease symptoms in the perinatal period with an ai-based big data processing platform

    NUR BANU OĞUR

    Doktora

    Türkçe

    Türkçe

    2023

    Bilgisayar Mühendisliği Bilimleri-Bilgisayar ve KontrolSakarya Üniversitesi

    Bilgisayar Mühendisliği Ana Bilim Dalı

    PROF. DR. CELAL ÇEKEN

  4. Tez No

    871760

    GR6J hidrolojik modelindeki artık yağış ayrıştırma sabitinin model kalibrasyonuna etkisi

    Effect of residual rainfall separation constant on model calibration in the GR6J hydrological model

    HALİL İBRAHİM DEMİR

    Yüksek Lisans

    Türkçe

    Türkçe

    2024

    İnşaat Mühendisliğiİstanbul Teknik Üniversitesi

    İnşaat Mühendisliği Ana Bilim Dalı

    DOÇ. DR. MEHMET CÜNEYD DEMİREL

  5. Tez No

    66398

    İmalat sistemlerinin tasarlanması ve öncelik kurallarının belirlenmesinde yapay sinir ağlarının kullanılması

    <the use of neural networks in determination of the manufacturing systems design and dispatching rules

    TARIK ÇAKAR

    Doktora

    Türkçe

    Türkçe

    1997

    İşletmeİstanbul Teknik Üniversitesi

    İşletme Mühendisliği Ana Bilim Dalı

    PROF. DR. AYHAN TORAMAN

Geri Dön