User Guide
Why can I only view 3 results?
You can also view all results when you are connected from the network of member institutions only. For non-member institutions, we are opening a 1-month free trial version if institution officials apply.
So many results that aren't mine?
References in many bibliographies are sometimes referred to as "Surname, I", so the citations of academics whose Surname and initials are the same may occasionally interfere. This problem is often the case with citation indexes all over the world.
How can I see only citations to my article?
After searching the name of your article, you can see the references to the article you selected as soon as you click on the details section.
 Views 13
 Downloands 3
A Comparison of Metaheuristics for the Allocation of Elevators to Calls in Buildings
2017
Journal:  
Politeknik Dergisi
Author:  
Abstract:

Bu çalışma binalarda düşey taşımacılıkta kullanılan asansörler için çağrıların kabinlere dağıtılması problemi üzerinedir.  Geniş bir spektrumda farklı sezgisel optimizasyon algoritmaları problem üzerinde performans yönünden karşılaştırılmış ve başarılıları belirlenmiştir. Test edilen algoritmalar Çıkarımsal Evrim (Differential Evolution, DE), Rastgele Yeniden Başlatmalı Benzetimli Tavlama (Simulated Annealing with Random Starts, SAR), Yapay Arı Kolonisi (Artificial Bee Colony, ABC), Yarasa Algoritması (Bat Algoritması, BA), Bakteri Otlama Optimizasyon Algoritması (Bacterial Foraging Optimization Algorithm, BF), Parçacık Sürü Optimizasyonu (Particle Swarm Optimization, PSO),  Genetic Algoritma (Genetic Algorithm, GA) ve Tabu Araştırmasıdır (Tabu Search, TS). Her algoritma simülasyon ile 10 ila 24 katlı binalar ve 2 ila 6 kabin ile test edilmiştir. Sonuçlar ABC ve TS algoritmalarının daha iyi bir ortalama yolculuk zamanı verdiğini göstermiştir. Ayrıca Benzetimli Tavlama algoritmasının yeni bir versiyonu olan Rastgele Yeniden Başlatmalı Benzetimli Tavlama (SAR) algoritması geliştirilmiştir. SAR deney sonuçlarında en iyi 3. algoritma olarak çıkmaktadır.

Keywords:

null
2017
Journal:  
Politeknik Dergisi
Author:  
0
2017
Journal:  
Politeknik Dergisi
Author:  
Abstract:

This paper deals with the car-call allocation problem in vertical transportation in buildings. We have made a wide comparison of different metaheuristic optimization algorithms to identify those with a better performance dealing with the problem. The tested approaches are Differential Evolution (DE), Simulated Annealing with Random Starts (SAR), Artificial Bee Colony (ABC), Bat Algorithm (BA), Bacterial Foraging Optimization Algorithm (BF), Particle Swarm Optimization (PSO), Genetic Algorithm (GA), and Tabu Search (TS). Each algorithm was tested in high-rise building simulations of 10 to 24 floors, with car configurations of 2 to 6 cars. Results proved that the ABC and TS algorithms generally result in better average journey times compared to other methods. It has to be noted that we introduced a new version of the Simulated Annealing, Simulated Annealing with Restarts (SAR), which ranked as the third best algorithm.

Citation Owners
Information: There is no ciation to this publication.
Similar Articles












Politeknik Dergisi

Field :   Mühendislik

Journal Type :   Uluslararası

Metrics
Article : 1.729
Cite : 5.008
Politeknik Dergisi