Yazar "Tongur, Vahit" seçeneğine göre listele
Listeleniyor 1 - 7 / 7
Sayfa Başına Sonuç
Sıralama seçenekleri
Öğe The Analysis of Migrating Birds Optimization Algorithm with Neighborhood Operator on Traveling Salesman Problem(SPRINGER INTERNATIONAL PUBLISHING AG, 2016) Tongur, Vahit; Ulker, ErkanMigrating birds optimization (MBO) algorithm is a new meta-heuristic algorithm inspired from behaviors of migratory birds during migration. Basic MBO algorithm is designed for quadratic assignment problems (QAP) which are known as discrete problems, and the performance of MBO algorithm for solving QAP is shown successfully. But MBO algorithm could not achieve same performance for some other benchmark problems like traveling salesman problem (TSP) and asymmetric traveling salesman problem (ATSP). In order to deal with these kinds of problems, neighborhood operators of MBO is focused in this paper. The performance of MBO algorithm is evaluated with seven varieties of neighborhood operators on symmetric and asymmetric TSP problems. Experimental results show that the performance of MBO algorithm is improved up to 36% by utilizing different neighborhood operators.Öğe Atmega128 tabanlı PLC tasarımı(Selçuk Üniversitesi Fen Bilimleri Enstitüsü, 2008-08-14) Tongur, Vahit; Kahramanlı, ŞirzatPLC'ler endüstriyel kontrol uygulamalarında yaygın olarak kullanılmaktadır. PLC'ler gerekli işlemlerin yapılmasını sağlayan bir komut kümesine sahiptir. PLC'ler komut kümesi, merdiven diyagramları veya lojik kapı mantığı ile programlanabilirler. Bu tez çalışmasında Atmega128 mikrodenetleyici tabanlı bir PLC tasarımı gerçekleştirilmiştir. Tasarlanan PLC modeli için kontrol devrelerinin simülasyonunu yapabilen, hex kodlar üretebilen bir arayüz yazılımı (EVRENPLC) geliştirilmiştir. Hex kodlarının çalışmasını sağlayan bir yorumlayıcı geliştirilerek mikrodenetleyicinin sabit belleğine yerleştirilmiştir. Yapılan deneysel çalışmalar ile örnek kontrol devrelerinin simülasyonu gerçekleştirilmiş ve deney kartı üzerinde çalışması incelenmiştir.Öğe B-Spline Curve Knot Estimation by Using Niched Pareto Genetic Algorithm (NPGA)(SPRINGER INTERNATIONAL PUBLISHING AG, 2016) Tongur, Vahit; Ulker, ErkanIn this paper, estimated curve Knot points are found for B-Spline Curve by using Niched (Celled) Pareto Genetic Algorithm which is one of the multi objective genetic algorithms. It is necessary to know degree of the curve, control points and knot vector for drawing B-Spline curve. Some knot points are of very few or no effect at all on the drawing of B-Spline curve drawing. Omitting such points will not effect the shape of curve in curve drawing. In this study, it is aimed to find and omit these ineffective curve points from drove of curve. Performance of proposed method are compared with selected studies from literature.Öğe BOUGER REDUCTION IN KONYA BASIN EXAMPLE FOR GRAVITY DATAS AND INTERPOLATION OF GRAVITY ANOMALIES(INT SCIENTIFIC CONFERENCE SGEM, 2011) Tongur, Vahit; Tongur, Evren Cankaya; Turgut, BayramGravity which is the basic potantial, can be used in geodesy, geology and other field of engineering. In order to portray earth surface, geoid is needed which is the shape of globe and tranquil sea surface lands are believed to keep on under them. In order to determine the geoid, gravity should be known. Corrections for the gravity value differences sourced by gravity values, which are measured on earth surface, should be done that these corrections are called as gravity reducing. In this study,37 degrees < phi < 39.5 degrees and 31 degrees < lambda < 34,5 degrees latitude and longitute which takes place in Konya basin, which's elevation is known, using EGM08 model in 2682 point and found gravity value and attitude correction is appliad, results are compared and Bouguer corrections are brought.Öğe A Comparative Analysis of Metaheuristic Approaches for Multidimensional Two-Way Number Partitioning Problem(SPRINGER HEIDELBERG, 2018) Hacıbeyoğlu, Mehmet; Alaykıran, Kemal; Acılar, Ayşe Merve; Tongur, Vahit; Ülker, ErkanIn this study, a novel usage of four metaheuristic approaches Genetic algorithm (GA), Simulated annealing (SA), migrating bird optimization algorithm (MBO) and clonal selection algorithm (CSA) are applied to multidimensional two-way number partitioning problem (MDTWNPP). MDTWNPP is a classical combinatorial NP-hard optimization problem where a set of vectors have more than one coordinate is partitioned into two subsets. The main objective function of MDTWNPP is to minimize the maximum absolute difference between the sums per coordinate of elements. In order to solve this problem, GA is applied with greedy crossover and mutation operators. SA is improved with dual local search mechanism. MBO is specialized as multiple flock migrating birds optimization algorithms. CSA is applied with problem specific hyper mutation process. Furthermore, all instances are solved using an integer linear programming model which was previously presented in the literature. In the experiments, four metaheuristic approaches and integer linear programming model are used to solve 126 datasets with different sizes and coordinates. As a brief result, the GA and SA approaches designed for this problem outperformed all other heuristics and the integer programming model. Both the performance of GA and SA approaches are in a competitive manner where GA and SA yielded the best solution for 56 and 65 out of 125 datasets, respectively.Öğe Migrating Birds Optimization (MBO) Algorithm to Solve 0-1 Multidimensional Knapsack Problem(IEEE, 2017) Tongur, Vahit; Ulker, ErkanThis study presents Migrating Birds Optimization (MBO) which is a novel meta-heuristic algorithm for the solution of 0-1 multidimensional knapsack problem. In the study, the basic migrating birds optimization algorithm is used and change is made to the only neighborhood structure of this algorithm for adapting to the addressed problem. The performance of the algorithm is examined on the test problems that selected from OR-library. The obtained results show that the migrating birds optimization algorithm has achieved successful results in 0-1 multidimensional backpack problems.Öğe Migrating birds optimization (MBO) algorithm to solve knapsack problem(ELSEVIER SCIENCE BV, 2017) Ulker, Erkan; Tongur, VahitThis study presents Migrating Birds Optimization (MBO) which is a novel meta-heuristic algorithm for the solution of knapsack problem. The knapsack problem which is classified as NP-complete problem is a combinatorial optimization problem. Its aim is to achieve maximum benefit without exceeding the capacity of the knapsack with selected item. The Migrating Birds Algorithm is designed for discrete problems. Therefore, the performance of basic the MBO algorithm is tested on the some knapsack problems and obtained results are demonstrated in detail. (C) 2017 The Authors. Published by Elsevier B.V.
