Intelligent hyper-heuristics: A tool for solving generic optimisation problems
Başlık çevirisi mevcut değil.
- Tez No: 402371
- Danışmanlar: PROF. DR. PATRICK DE CAUSMAECKER
- Tez Türü: Doktora
- Konular: Bilgisayar Mühendisliği Bilimleri-Bilgisayar ve Kontrol, Bilim ve Teknoloji, Computer Engineering and Computer Science and Control, Science and Technology
- Anahtar Kelimeler: Belirtilmemiş.
- Yıl: 2012
- Dil: İngilizce
- Üniversite: Katholieke Universiteit Leuven (Catholic University of Leuven)
- Enstitü: Yurtdışı Enstitü
- Ana Bilim Dalı: Belirtilmemiş.
- Bilim Dalı: Belirtilmemiş.
- Sayfa Sayısı: 282
Özet
Özet yok.
Özet (Çeviri)
Designing a dedicated search and optimisation algorithm is a time-consuming process requiring an in-depth analysis of the problem. The resulting algorithm is expected to be effective for solving a given set of target problem instances. However, since the algorithm is dedicated, it is hard to adapt and to apply to other problems. Meta-heuristics were brought in to cope with this drawback. Nevertheless, in most of the meta-heuristic studies, the employed meta-heuristics have been implemented as rather problem-dependent methodologies. Hyperheuristics furnish problem-independent management opportunities differently from such search and optimisation algorithms. The present dissertation focuses on the generality of hyper-heuristics. It thereby aims at designing intelligent hyper-heuristics so that generality is facilitated. While most works on hyper-heuristics make use of the term generality in describing the potential for solving various problems, the performance changes across different domains have only rarely been reported. Additionally, there are other generality related elements such as the performance variations over distinct heuristic sets, that are usually ignored. This means that there is no study fully discussing generality questions while providing a hyper-heuristic design capable of addressing them. To this end, the factors affecting the hyper-heuristics' generality are determined and several novel hyper-heuristic components are developed based on these factors. Then, the hyper-heuristics using the new components are tested across various problem domains on different heuristic sets, while also varying the experimental limits. First, each developed hyper-heuristic is applied to only one problem domain. The performance of these hyper-heuristics is compared with other algorithms encountered in the literature. The information gathered during these experiments is used later on to design a highly adaptive, intelligent selection hyper-heuristic. The ultimate result of the present PhD research is called the Generic Intelligent Hyper-heuristic (GIHH). It is equipped with multiple online adaptive hyperheuristic procedures and decision mechanisms for simultaneously coordinating them. GIHH is expected to evolve for different search environments without human intervention. A simplified version of GIHH is tested via a series of experiments on three problems from practice to measure its generality level. A comprehensive performance analysis is conducted using a group of selection hyper-heuristics only involving heuristic selection and move acceptance mechanisms from the literature. The analysis provides strong conclusions about when a hyper-heuristic with certain characteristics has advantages or disadvantages. Finally, GIHH is tested on other challenging combinatorial optimisation problems under different empirical conditions. The computational results indicate that GIHH is effective in solving the target instances from distinct problem domains. Additionally, GIHH won the first international cross domain heuristic search challenge 2011 against 19 high-level algorithms developed by the other academic competitors. The winning hyper-heuristic was then used to investigate the performance and contribution of low-level heuristics while simultaneously solving three problems with routing and rostering characteristics. This completely new application of a hyper-heuristic offers promising perspectives for supporting dedicated heuristic development.
Benzer Tezler
- Yelken balığı eniyileme yaklaşımı ile güçlendirilmiş karar ağacı algoritması kullanarak kalp rahatsızlıklarının teşhisi
Using sailfish optimizer with enhanced decision tree algorithm to diagnose heart disease
MURAT ONUR YILDIRIM
Yüksek Lisans
Türkçe
2021
Endüstri ve Endüstri MühendisliğiSüleyman Demirel ÜniversitesiEndüstri Mühendisliği Ana Bilim Dalı
DOÇ. DR. ERDAL AYDEMİR
- Bilişsel radyo ağlarında üst sezgiseller ile kanal atama probleminin çözülmesi
Solving channel assignment problem with hyper-heuristics in cognitive radio networks
EMRULLAH GAZİOĞLU
Yüksek Lisans
Türkçe
2015
Bilgisayar Mühendisliği Bilimleri-Bilgisayar ve Kontrolİstanbul Teknik ÜniversitesiBilgisayar Mühendisliği Ana Bilim Dalı
DOÇ. DR. AYŞE ŞİMA UYAR
- Askeri lojistik dağıtımında araç rotalama problemi için hipersezgisel algoritma geliştirilmesi
Development of a hyper-heuristic algorithm for vehicle routing problem in military logistics distribution
SÜLEYMAN KESİK
Yüksek Lisans
Türkçe
2023
Bilgisayar Mühendisliği Bilimleri-Bilgisayar ve KontrolIsparta Uygulamalı Bilimler ÜniversitesiBilgisayar Mühendisliği Ana Bilim Dalı
DR. ÖĞR. ÜYESİ CEVRİYE ALTINTAŞ
- Hyper-heuristics for online path planning of unmanned aerial vehicles
İnsansiz hava araçlarinin çevrimiçi güzergah planlamasi için üst sezgisel yöntemler
ENGİN AKAR
Yüksek Lisans
İngilizce
2013
Bilgisayar Mühendisliği Bilimleri-Bilgisayar ve KontrolMarmara ÜniversitesiBilgisayar Mühendisliği Ana Bilim Dalı
PROF. DR. HALUK RAHMİ TOPCUOĞLU
- Automated curriculum design for reinforcement learning with graph theory and evaluation heuristics
Çizge kuramı ve değerlendirme bazlı sezgisel yöntemler ile pekiştirmeli öğrenme için otomatik müfredat tasarımı
ANIL ÖZTÜRK
Yüksek Lisans
İngilizce
2021
Bilgisayar Mühendisliği Bilimleri-Bilgisayar ve Kontrolİstanbul Teknik ÜniversitesiBilgisayar Mühendisliği Ana Bilim Dalı
DOÇ. DR. NAZIM KEMAL ÜRE