Muzaffer Kapanoglu - Academia.edu (original) (raw)

Papers by Muzaffer Kapanoglu

Uluslararası Muhendislik Arastirma ve Gelistirme Dergisi, 2021

Öz Hasta ergonomisi, sistem performansının ve hasta konforunun birlikte optimize edilmesini gerek... more Öz Hasta ergonomisi, sistem performansının ve hasta konforunun birlikte optimize edilmesini gerektirir. Sağlık kuruluşlarında sunulan tüm hizmetlerin hasta odaklı tasarımı, hizmet kalitesinin ve hasta memnuniyetinin artırılması bakımından oldukça önemlidir. Bu çalışmada diyaliz merkezlerinde tedavi gören hastaların merkeze geliş gidişleri için sunulan servis araçlarına ait rotaların optimizasyonu problemi üzerinde durulmuştur. Rotaların iyileştirilmesi ile hastaların servis içerisinde geçirilen yolculuk sürelerinin mümkün olduğunca azaltılması ve dengelenmesi hedeflenmektedir. Servis araçlarının rotasyonunun etkin biçimde gerçekleştirilmesi ile hasta konforu arttırılacaktır. Servis araçlarının rotalanması problemi, başlangıç ve bitiş noktaları aynı birden fazla servis aracının tüm hastaları konumlarından alıp merkeze getirilmesi faaliyetlerini içerdiğinden Çoklu Gezgin Satıcı Problemi olarak ele alınmıştır. Problem kapsamında, servis araçlarına ait en uzun mesafenin ve toplam mesafenin en küçüklenmesini gözeten bir çözüm yöntemi geliştirilmiştir. Yöntem kümeleme ve rotalama olmak üzere iki ana adımdan meydana gelmektedir. Birinci adımda konumlar kortalamalar yöntemi ile kümelenmekte ikinci adımda ise En Yakın Komşu Sezgiseli ve 2-opt algoritmalarının ardışık kullanımı ile rotalanmaktadır. Varılan sonuçlar probleme ait matematiksel model sonuçları ile karşılaştırılmış, bir servis aracının kat ettiği en uzun mesafe, tüm araçların katettiği mesafeler toplamı ve çözüm süresi performans kriterleri olarak belirlenmiştir. Yöntem ilk en iyi çözüme yaklaşmış diğer kriterlerde ise daha iyi sonuçlar vermiştir.

European Journal of Science and Technology, 2021

These can be the sum of distances traveled by all salesman or the maximum distance traveled by an... more These can be the sum of distances traveled by all salesman or the maximum distance traveled by any salesman. Significant imbalances occur in workloads between salesmen based on total distance, which is undesirable. When the distance traveled by the salesman who travels the maximum distance is desired to be reduced, the imbalance disappears, but the total distance (cost) increases to maintain the balance. The problem has an exponentially increasing solution space and is in the NP-hard class. The current mathematical models proposed for solving the problem at its optimum have very limited use in daily life. This brings to the fore the solution methods specific to the problem dealt with in practice. In this context, the problem of business management that runs people pick up and collect service with three vehicles has been studied. The triple traveling salesman problem is a subset of the MTSP where the number of salesmen is three. In this study, a three-phase solution approach, which considers both minimization objectives and which provides effective solutions in a short time, has been proposed. Clustering first divides the pickup points into three groups according to their proximity with the k-means method. For the clusters obtained, the routes are initially created with the Nearest Neighbor Heuristic (NN) and then improved with the 2-opt algorithm. The approach proposed in this study was applied to test problems used for the multiple traveling salesman problem and randomly generated problems, and the results were presented by comparing them with the results of the mathematical model. The maximum distance that any salesman will travel, total distance, and algorithm solution time are determined as performance criteria. As a result, the proposed sequential approach converged to the best solutions by 70-80% in the first criterion, outperforming other criteria. At the point where the deviations between salesmen and the total distance are minimized by parallel tradeoff, the solutions obtained are of high level and the running time of the approach is polynomial time.

… University Journal of …, 2010

... İlkay ORHANa,*, Muzaffer KAPANOĞLUb ve T. Hikmet KARAKOÇa ... tam olarak durarak yolcu, yük v... more ... İlkay ORHANa,*, Muzaffer KAPANOĞLUb ve T. Hikmet KARAKOÇa ... tam olarak durarak yolcu, yük veya diğer muhteviyatı indirme ve/veya bindirme amacıyla kendisine tahsis edilen park yerine gelme anına kadar geçen toplam süreyi ifade etmektedir (http-4, 2009; Çetin vd, 2008 ...

Bu kaynak, Moodle'in 1.7-1.9 versiyonarina yoneliktir. Yeni versiyonu icin yazar veya bolumle... more Bu kaynak, Moodle'in 1.7-1.9 versiyonarina yoneliktir. Yeni versiyonu icin yazar veya bolumle gorusunuz.

Journal of Aeronautics and Space Technologies, 2012

This study deals with the problem of air transportation in Turkish Air Force. The Turkish Air For... more This study deals with the problem of air transportation in Turkish Air Force. The Turkish Air Force has different cargo aircraft to be used in air transportation operations, located in different airbases. The cargo aircraft are loaded cargo, equipment, personnel, repaired items etc. from one of airbases and transport them to the demanding airbases. In this military flight network, each airbase is a demand and support point for different kinds of items. Pickup and delivery demands are known deterministically. There are several operational constraints. The objective of the problem is to find a feasible set of routes for the cargo aircraft so that all requests are serviced, and such that the overall cost is minimized. Problem in hand is modeled and solved as multi-commodity, multi depot and heterogeneous vehicle pickup and delivery problem.

2009 IEEE International Conference on Control Applications, 2009

Abstract Minimizing the coverage task time is important for many sensor-based coverage applicati... more Abstract Minimizing the coverage task time is important for many sensor-based coverage applications. The completion time of a sensor-based coverage task is determined by the maximum time traveled by a robot in a mobile robot group. So the environment needs to be ...

Evaluation and Program Planning, 2005

The main purpose of this study is to solve a real-world, multicriteria, high-tech selection probl... more The main purpose of this study is to solve a real-world, multicriteria, high-tech selection problem by using analytic network process (ANP). The proposed ANP model consists of a control hierarchy, and a network of connections among the clusters of alternatives, actors and criteria. The strategic criteria were included into the model to rate benefits (B), opportunities (O), costs (C), and risks (R). Then, final synthesis of alternatives was obtained by using rated BOCR. Three actor groups at each step of ANP were cooperated to gain their contributions into the decision as well as to promote the implementation. The results and their interpretations are presented. The management has currently implemented the new high-tech transaction processing system proposed by this study as the best alternative.

cs.bham.ac.uk

A dispatching policy can be defined as a set of condition-action (CA) rules in which changing job... more A dispatching policy can be defined as a set of condition-action (CA) rules in which changing job-shop circumstances (such as number of waiting jobs in queues, machine queue lengths in minutes or hours, overall system utilization, machine utilizations, material ...

Journal of Statistical Computation and Simulation, 2007

In this study, we examine the genetic algorithms (GAs) for parameter estimation of nonlinear regr... more In this study, we examine the genetic algorithms (GAs) for parameter estimation of nonlinear regression models over a large set of test problems with three difficulty levels. A GA is developed based on a full-factorial experimental design. The proposed GA performs well for the test problems even for relatively larger intervals of the parameters. We analyze the effect of the preset difficulty levels of the test problems on the performance and the convergence properties of the developed GA. On the basis of the convergence analysis, we point out that the regression parameters that have stronger effect on the sum of squared errors converge much faster to their optimal values.

This paper introduces a multi -population genetic algorithm (M-PPGA) using a new genetic represen... more This paper introduces a multi -population genetic algorithm (M-PPGA) using a new genetic representation, the kth-nearest neighbor representation, for Euclidean Traveling Salesman Problems. The proposed M-PPGA runs M g reedy genetic algorithms on M separate populations, each with two new operators, intersection repairing and cheapest insert. The M-PPGA finds optimal or near optimal solutions by using a novel communication operator

The steelmaking process consists of two phases: primary steelmaking and finishing lines. The sche... more The steelmaking process consists of two phases: primary steelmaking and finishing lines. The scheduling of the continuous galvanizing lines (CGL) is regarded as the most difficult process among the finishing lines due to its multi-objective and highly-constrained nature. In this paper, we present a multi-population parallel genetic algorithm (MPGA) with a new genetic representation called k th nearest neighbor representation, and with a new communication operator for performing better communication between subpopulations in the scheduling of CGL. The developed MPGA consists of two phases. Phase one generates schedules from a primary work in process (WIP) inventory filtered according to the production campaign, campaign tonnage, priorities of planning department, and the due date information of each steel coil. If the final schedule includes the violations of some constraints, phase two repairs these violations by using a secondary WIP inventory of steel coils. The developed scheduli...

Journal of Intelligent Manufacturing, 2012

Sensor-based multi-robot coverage path planning problem is one of the challenging problems in man... more Sensor-based multi-robot coverage path planning problem is one of the challenging problems in managing flexible, computer-integrated, intelligent manufacturing systems. A novel pattern-based genetic algorithm is proposed for this problem. The area subject to coverage is modeled with disks representing the range of sensing devices. Then the problem is defined as finding a sequence of the disks for each robot to minimize the coverage completion time determined by the maximum time traveled by a robot in a mobile robot group. So the environment needs to be partitioned among robots considering their travel times. Robot turns cause the robot to slow down, turn and accelerate inevitably. Therefore, the actual travel time of a mobile robot is calculated based on the traveled distance and the number of turns. The algorithm is designed to handle routing and partitioning concurrently. Experiments are conducted using P3-DX mobile robots in the laboratory and simulation environment to validate the results.

Journal of the Faculty of Engineering and Architecture of Gazi University

Thesis (Ph. D.)--University of South Florida, 1997. Includes bibliographical references (leaves 1... more Thesis (Ph. D.)--University of South Florida, 1997. Includes bibliographical references (leaves 187-193).

Türk Sivil Havacılık sektörü, 2002-2008 yılları arasında gelişen ekonomi ve havacılık alanındaki ... more Türk Sivil Havacılık sektörü, 2002-2008 yılları arasında gelişen ekonomi ve havacılık alanındaki bazı kısıtlamaların kaldırılmasıyla % 53 oranında büyümüştür. Havayolu sektöründe başarılı uluslararası firmalar planlama ve çizelgeleme problemlerini çözmede gelişmiş bilgisayar-destekli çözüm yöntemleri kullanmaktadır. Bu yöntemler işletmelere ciddi rekabet üstünlüğü sağlamaktadır. Havayolu sektöründe dört temel operasyonel planlama ve çizelgeleme problemi bulunmaktadır: uçuş çizelgeleme, uçak çizelgeleme, ekip çizelgeleme ve düzensiz olayların yönetimi. Tüm havayolu işletmelerinin karşı karşıya kaldığı söz konusu operasyonel planlama ve çizelgeleme problemleri bu çalışmada ayrıntılı olarak incelenmiştir. İncelemeler, işletmelerin söz konusu yöntemleri kullanarak maliyetlerinde önemli kazanımlar sağladığını ortaya koymaktadır. Bununla birlikte, büyük ölçekli problemlerin çözümü için gereken süre karar vericilerin arzu ettikleri karar kalitesini tatmin etmeyebilmektedir. Böylesi durumlarda gelişmiş teknolojilerle bütünleştirilmiş modern karar yöntemlerinin kullanılması da işletmelere ciddi maliyet üstünlüğü fırsatı sunmaktadır.