Search results for: using an Anisotropic Analytical Algorithm (AAA)

Authors: Abhishek Bhardwaj, Manish Kumar Bajpai

Abstract:

An image with its content and schema of colors presents an effective mode of information sharing and processing. By changing its color schema different visions and prospect are discovered by the users. This phenomenon of color transfer is being used by Social media and other channel of entertainment. Reinhard et al’s algorithm was the first one to solve this problem of color transfer. In this paper, we make this algorithm efficient by introducing domain parallelism among different processors. We also comment on the factors that affect the speedup of this problem. In the end by analyzing the experimental data we claim to propose a novel and efficient parallel Reinhard’s algorithm.

Keywords: Reinhard et al’s algorithm, color transferring, parallelism, speedup

Procedia PDF Downloads 585

Authors: Abdullah Eqal Al Mazrooei

Abstract:

Kalman filter is a famous algorithm that utilizes to estimate the state in the linear systems. It has numerous applications in technology and science. Since of the most of applications in real life can be described by nonlinear systems. So, Kalman filter does not work with the nonlinear systems because it is suitable to linear systems only. In this work, a nonlinear filtering algorithm is presented which is suitable to use with the special kinds of nonlinear systems. This filter generalizes the Kalman filter. This means that this filter also can be used for the linear systems. Our algorithm depends on a special linearization of the second degree. We introduced the nonlinear algorithm with a bilinear state-space model. A simulation example is presented to illustrate the efficiency of the algorithm.

Keywords: Kalman filter, filtering algorithm, nonlinear systems, state-space model

Procedia PDF Downloads 351

Authors: Siavash Salamatpoor, Hossein Motaghedi, Jr., Mehrdad Nategh

Abstract:

In this study, undrained triaxial tests under anisotropic consolidation were conducted on the reconstituted samples of Ramsar sand, which underlies a densely populated, seismic region of the southern coast of Caspian Sea in Mazandaran province, Iran. Ramsar costal city is regularly visited by many tourists. Accordingly, many tall building and heavy structures are going to be constructed over this coastal area. This region is overlaid by poorly graded clean sand and because of high water level, is susceptible to liquefaction. The specimens were consolidated anisotropically to simulate initial shear stress which is mobilized due to surface constructions. Different states of soil behavior were obtained by applying different levels of initial relative density, shear stress, and effective stress. It is shown that Ramsar clean sand can experience the whole possible states of liquefiable soils i.e. fully liquefaction, limited liquefaction, and dilation behaviors. It would be shown that by increasing the shear parameter in high confine pressure, the liquefaction susceptibility has increased while for low confine pressure it would be vice versa.

Keywords: anisotropic, triaxial test, shear parameter, static liquefaction

Procedia PDF Downloads 383

Authors: Li Ni, Pen ManMan, Li KenLi

Abstract:

Clustering is an intensive research for some years because of its multifaceted applications, such as biology, information retrieval, medicine, business and so on. The expectation maximization (EM) is a kind of algorithm framework in clustering methods, one of the ten algorithms of machine learning. Traditionally, optimization of objective function has been the standard approach in EM. Hence, research has investigated the utility of evolutionary computing and related techniques in the regard. Chemical Reaction Optimization (CRO) is a recently established method. So the property embedded in CRO is used to solve optimization problems. This paper presents an algorithm framework (EM-CRO) with modified CRO operators based on EM cluster problems. The hybrid algorithm is mainly to solve the problem of initial value sensitivity of the objective function optimization clustering algorithm. Our experiments mainly take the EM classic algorithm:k-means and fuzzy k-means as an example, through the CRO algorithm to optimize its initial value, get K-means-CRO and FKM-CRO algorithm. The experimental results of them show that there is improved efficiency for solving objective function optimization clustering problems.

Keywords: chemical reaction optimization, expection maimization, initia, objective function clustering

Procedia PDF Downloads 685

Authors: M. F. F. Ab Rashid, A. N. Mohd Rose, N. M. Z. Nik Mohamed, W. S. Wan Harun, S. A. Che Ghani

Abstract:

Traveling salesman problem with precedence constraint (TSPPC) is one of the most complex problems in combinatorial optimization. The existing algorithms to solve TSPPC cost large computational time to find the optimal solution. The purpose of this paper is to present an efficient genetic algorithm that guarantees optimal solution with less number of generations and iterations time. Unlike the existing algorithm that generates priority factor as chromosome, the proposed algorithm directly generates sequence of solution as chromosome. As a result, the proposed algorithm is capable of generating optimal solution with smaller number of generations and iteration time compare to existing algorithm.

Keywords: traveling salesman problem, sequencing, genetic algorithm, precedence constraint

Procedia PDF Downloads 537

Authors: T. Sahbani, M. Bouteraa, R. Wamkeue

Abstract:

Wind Turbine are considered to be one of the more efficient system of energy production nowadays, a reason that leads the main industrial companies in wind turbine construction and researchers in over the world to look for better performance and one of the ways for that is the use of the synchronous permanent magnet generator. In this context, this work is about developing an analytical model that could simulate different situation in which the synchronous generator may go through, and of course this model match perfectly with the numerical and experimental model.

Keywords: MATLAB, synchronous permanent magnet generator, wind turbine, analytical model

Procedia PDF Downloads 524

Authors: Elsayeda M. Elgaml, Dina M. Ibrahim, Elsayed A. Sallam

Abstract:

Association rule mining is one of the most important fields of data mining and knowledge discovery. In this paper, we propose an efficient multiple support frequent pattern growth algorithm which we called “MSFP-growth” that enhancing the FP-growth algorithm by making infrequent child node pruning step with multiple minimum support using maximum constrains. The algorithm is implemented, and it is compared with other common algorithms: Apriori-multiple minimum supports using maximum constraints and FP-growth. The experimental results show that the rule mining from the proposed algorithm are interesting and our algorithm achieved better performance than other algorithms without scarifying the accuracy.

Keywords: association rules, FP-growth, multiple minimum supports, Weka tool

Procedia PDF Downloads 452

Authors: Li Dan, Zhao Junsuo, Zhang Wenjun

Abstract:

Aiming at the shortcomings of the Quantum Genetic Algorithm such as the multimodal function optimization problems easily falling into the local optimum, and vulnerable to premature convergence due to no closely relationship between individuals, the paper presents an Improved Many Worlds Quantum Genetic Algorithm (IMWQGA). The paper using the concept of Many Worlds; using the derivative way of parallel worlds’ parallel evolution; putting forward the thought which updating the population according to the main body; adopting the transition methods such as parallel transition, backtracking, travel forth. In addition, the algorithm in the paper also proposes the quantum training operator and the combinatorial optimization operator as new operators of quantum genetic algorithm.

Keywords: quantum genetic algorithm, many worlds, quantum training operator, combinatorial optimization operator

Procedia PDF Downloads 713

Authors: Nhat-To Huynh, Chen-Fu Chien

Abstract:

Textile batch dyeing scheduling problem is complicated which includes batch formation, batch assignment on machines, batch sequencing with sequence-dependent setup time. Most manufacturers schedule their orders manually that are time consuming and inefficient. More power methods are needed to improve the solution. Motivated by the real needs, this study aims to propose approaches in which genetic algorithm is developed with multi-subpopulation and hybridised with estimation of distribution algorithm to solve the constructed problem for minimising the makespan. A heuristic algorithm is designed and embedded into the proposed algorithms to improve the ability to get out of the local optima. In addition, an empirical study is conducted in a textile company in Taiwan to validate the proposed approaches. The results have showed that proposed approaches are more efficient than simulated annealing algorithm.

Keywords: estimation of distribution algorithm, genetic algorithm, multi-subpopulation, scheduling, textile dyeing

Procedia PDF Downloads 275

Authors: S. Aizikovich, L. Krenev, Y. Tokovyy, Y. C. Wang

Abstract:

An approximate analytical-numerical solution to the axisymmetric problem on thermo-mechanical indentation of a flat cylindrical punch into an arbitrarily non-homogeneous elastic half-space is constructed by making use of the bilateral asymptotic method. The key point of this method lies in evaluation of the ker¬nels in the obtained integral equations by making use of a numerical technique. Once the structure of the kernel is defined, it then is approximated by an analytical expression of special kind so that the solution of the integral equation can be achieved analytically. This fact allows for construction of the solution in an analytical form, which is convenient for analysis of the mechanical effects concerned with arbitrarily presumed non-homogeneity of the material.

Keywords: contact problem, circular punch, arbitrarily-nonhomogeneous halfspace

Procedia PDF Downloads 497

Authors: Keunhong Chae, Seokho Yoon

Abstract:

We propose a code acquisition scheme called improved multiple-shift (IMS) for optical code division multiple access systems, where the optical orthogonal code is used instead of the pseudo noise code. Although the IMS algorithm has a similar process to that of the conventional MS algorithm, it has a better code acquisition performance than the conventional MS algorithm. We analyze the code acquisition performance of the IMS algorithm and compare the code acquisition performances of the MS and the IMS algorithms in single-user and multi-user environments.

Keywords: code acquisition, optical CDMA, optical orthogonal code, serial algorithm

Procedia PDF Downloads 507

Authors: Andrey V. Osipov, Sergey A. Kukushkin, Andrey V. Luk’yanov

Abstract:

A method is developed for the solid-phase synthesis of epitaxial layers when the substrate itself is involved into a topochemical reaction and the reaction product grows in the interior of substrate layer. It opens up new possibilities for the relaxation of the elastic energy due to the attraction of point defects formed during the topochemical reaction in anisotropic media. The presented method of silicon carbide (SiC) formation employs a topochemical reaction between the single-crystalline silicon (Si) substrate and gaseous carbon monoxide (CO). The corresponding theory of interaction of point dilatation centers in anisotropic crystals is developed. It is eliminated that the most advantageous location of the point defects is the direction (111) in crystals with cubic symmetry. The single-crystal SiC films with the thickness up to 200 nm have been grown on Si (111) substrates owing to the topochemical reaction with CO. Grown high-quality single-crystal SiC films do not contain misfit dislocations despite the huge lattice mismatch value of ~20%. Also the possibility of growing of thick wide-gap semiconductor films on these templates SiC/Si(111) and, accordingly, its integration into Si electronics, is demonstrated. Finally, the ab initio theory of SiC formation due to the topochemical reaction has been developed.

Keywords: epitaxy, silicon carbide, topochemical reaction, wide-bandgap semiconductors

Procedia PDF Downloads 435

Authors: Abdulrahman Abdulrahman

Abstract:

The specific energy equation has many applications in practical channels, such as exponential channels. In this paper, the governing equation of alternate depth ratio for exponential channels, in general, was investigated towards obtaining analytical solution for the alternate depth ratio in three exponential channel shapes, viz., rectangular, triangular, and parabolic channels. The alternate depth ratio for rectangular channels is quadratic; hence it is very simple to solve. While for parabolic and triangular channels, the alternate depth ratio is cubic and quartic equations, respectively, analytical solution for these equations may be achieved easily for a given Froud number. Different examples are solved to prove the efficiency of the proposed solution. Such analytical solution can be easily used in natural rivers and most of practical channels.

Keywords: alternate depth, analytical solution, specific energy, parabolic channel, rectangular channel, triangular channel, open channel flow

Procedia PDF Downloads 164

Authors: Tai Nguyen, Minh Bui, Huong Ninh, Tu Nguyen, Hai Tran

Abstract:

GraphCut algorithm has been widely utilized to solve various types of computer vision problems. Its expensive computational cost encouraged many researchers to improve the speed of the algorithm. Recent works proposed schemes that work on parallel computing platforms such as CUDA. However, the problem of low convergence speed prevents the usage of GraphCut for real time applications. In this paper, we propose global suppression heuristic to boost the conver-gence process of the algorithm. A parallel implementation of GraphCut algorithm on CUDA designed for the image stitching problem is introduced. Our method achieves up to 3× time boost on the graph of size 80 × 480 compared to the best sequential GraphCut algorithm while achieving satisfactory stitched images, suitable for panorama applications. Our source code will be soon available for further research.

Keywords: CUDA, graph cut, image stitching, texture synthesis, maxflow/mincut algorithm

Procedia PDF Downloads 99

Authors: A. Kavandi, K. Goshtasbi, M. R. Hadei, H. Nejati

Abstract:

In geothermal energy production, the method of liquid nitrogen (LN₂) fracturing in hot, dry rock is one of the most effective methods to increase the permeability of the reservoir. The geothermal reservoirs mainly consist of hard rocks such as granites and metamorphic rocks like gneiss with high temperatures. Gneiss, as a metamorphic rock, experiences a high level of inherent anisotropy. This type of anisotropy is considered as the nature of rocks, which affects the mechanical behavior of rocks. The aim of this study is to investigate the effects of heating-liquid nitrogen (LN₂) cooling treatment and rock anisotropy on the fracture toughness of gneiss. For this aim, a series of semi-circular bend (SCB) tests were carried out on specimens of gneiss with different anisotropy plane angles (0°, 30°, 60°, and 90°). In this study, gneiss specimens were exposed to heating–cooling treatment through gradual heating to 100°C followed by LN₂ cooling. Results indicate that the fracture toughness of treated samples is lower than that of untreated samples, and with increasing the anisotropy plane angle, the fracture toughness increases. The scanning electron microscope (SEM) technique is also implemented to evaluate the fracture process zone (FPZ) ahead of the crack tip.

Keywords: heating-cooling, anisotropic rock, fracture toughness, liquid nitrogen

Procedia PDF Downloads 40

Authors: Jun Su Park, Byung Kwan Oh, Jin Woo Hwang, Yousok Kim, Hyo Seon Park

Abstract:

For the structural safety, the maximum stress calculated from the stress distribution of a structure is widely used. The stress distribution can be estimated by deformed shape of the structure obtained from measurement. Although the estimation of stress is strongly affected by the location and number of sensing points, most studies have conducted the stress estimation without reasonable basis on sensing plan such as the location and number of sensors. In this paper, an optimal sensing technique for estimating the stress distribution is proposed. This technique proposes the optimal location and number of sensing points for a 2-D frame structure while minimizing the error of stress distribution between analytical model and estimation by cubic smoothing splines using genetic algorithm. To verify the proposed method, the optimal sensor measurement technique is applied to simulation tests on 2-D steel frame structure. The simulation tests are performed under various loading scenarios. Through those tests, the optimal sensing plan for the structure is suggested and verified.

Keywords: genetic algorithm, optimal sensing, optimizing sensor placements, steel frame structure

Procedia PDF Downloads 507

Authors: Sanjin Kršćanski, Josip Brnić

Abstract:

Virtual Crack Closure Technique (VCCT) is a method used for calculating stress intensity factor (SIF) of a cracked body that is easily implemented on top of basic finite element (FE) codes and as such can be applied on the various component geometries. It is a relatively simple method that does not require any special finite elements to be used and is usually used for calculating stress intensity factors at the crack tip for components made of brittle materials. This paper studies applicability and accuracy of VCCT applied on standard metal specimens containing trough thickness crack, subjected to an in-plane bending load. Finite element analyses were performed using regular 4-node, regular 8-node and a modified quarter-point 8-node 2D elements. Stress intensity factor was calculated from the FE model results for a given crack length, using data available from FE analysis and a custom programmed algorithm based on virtual crack closure technique. Influence of the finite element size on the accuracy of calculated SIF was also studied. The final part of this paper includes a comparison of calculated stress intensity factors with results obtained from analytical expressions found in available literature and in ASTM standard. Results calculated by this algorithm based on VCCT were found to be in good correlation with results obtained with mentioned analytical expressions.

Keywords: VCCT, stress intensity factor, finite element analysis, 2D finite elements, bending

Procedia PDF Downloads 274

Authors: L. Hamra, J. F. Demonceau, V. Denoël

Abstract:

The aim of this paper is to study a beam extracted from a frame and subjected to blast loading. The demand of ductility depends on six dimensionless parameters: two related to the blast loading, two referring to the bending behavior of the beam and two corresponding to the dynamic behavior of the rest of the structure. We develop a full analytical procedure that provides the ductility demand as a function of these six dimensionless parameters.

Keywords: analytical procedure, blast loading, membrane force, P-I diagram

Procedia PDF Downloads 403

Authors: M. Fernanda Salgado, Alfonso Tierra, Wilbert Aguilar

Abstract:

The present project consists in applying the informed search algorithm A star (A*) to solve traveler problems, applying it by urban public transportation routes. The digitization of the information allowed to identify 26% of the total of routes that are registered within the Metropolitan District of Quito. For the validation of this information, data were taken in field on the travel times and the difference with respect to the times estimated by the program, resulting in that the difference between them was not greater than 2:20 minutes. We validate A* algorithm with the Dijkstra algorithm, comparing nodes vectors based on the public transport stops, the validation was established through the student t-test hypothesis. Then we verified that the times estimated by the program using the A* algorithm are similar to those registered on field. Furthermore, we review the performance of the algorithm generating iterations in both algorithms. Finally, with these iterations, a hypothesis test was carried out again with student t-test where it was concluded that the iterations of the base algorithm Dijsktra are greater than those generated by the algorithm A*.

Keywords: algorithm A*, graph, mobility, public transport, travel planning, routes

Procedia PDF Downloads 214

Authors: Mohammad Reza Shahnazari, Reza Kazemi, Ali Saberi

Abstract:

Most of the engineering problems are in nonlinear forms. Nonlinear boundary layer problems defined in infinite intervals contain specific complexities, especially in boundary layer condition conformance. As an example of these nonlinear complex problems, the well-known Blasius equation can be mentioned, which itself is one of the classic boundary layer problems. No analytical solution has been proposed yet for the Blasius equation due to its complexity. In this paper, an analytical method, namely the Kourosh method, based on the singularity perturbation method and the Liao homotopy analysis is utilized to solve the Blasius problem. In this method, an inner solution is developed in the [0,1] interval to expedite the solution convergence. The magnitude of the f ˝(0), as an essential quantity for determining the physical parameters, is directly calculated from the solution of the boundary condition problem. The advantages of this solution are that it does not need any numerical solution, it has a closed form and that its validation is shown in the entire [0,∞] interval. Furthermore, all of the desirable parameters could be extracted through a series of simple analytical operations from the final solution. This solution also satisfies the continuity conditions, which is one of the main contributions of this paper in comparison with most of the other proposed analytical solutions available in the literature. Comparison with numerical solutions reveals that the proposed method is highly accurate and convenient for application.

Keywords: Blasius equation, boundary layer, Kourosh method, analytical solution

Procedia PDF Downloads 359

Authors: E. Behmanesh, J. Pannek

Abstract:

The distribution-allocation problem is known as one of the most comprehensive strategic decision. In real-world cases, it is impossible to solve a distribution-allocation problem in traditional ways with acceptable time. Hence researchers develop efficient non-traditional techniques for the large-term operation of the whole supply chain. These techniques provide near-optimal solutions particularly for large scales test problems. This paper, presents an integrated supply chain model which is flexible in the delivery path. As the solution methodology, we apply a memetic algorithm with a novelty in population presentation. To illustrate the performance of the proposed memetic algorithm, LINGO optimization software serves as a comparison basis for small size problems. In large size cases that we are dealing with in the real world, the Genetic algorithm as the second metaheuristic algorithm is considered to compare the results and show the efficiency of the memetic algorithm.

Keywords: integrated logistics network, flexible path, memetic algorithm, genetic algorithm

Procedia PDF Downloads 351

Authors: Daliyah S. Aljutaili, Redna A. Almutlaq, Suha A. Alharbi, Dina M. Ibrahim

Abstract:

All currencies around the world look very different from each other. For instance, the size, color, and pattern of the paper are different. With the development of modern banking services, automatic methods for paper currency recognition become important in many applications like vending machines. One of the currency recognition architecture’s phases is Feature detection and description. There are many algorithms that are used for this phase, but they still have some disadvantages. This paper proposes a feature detection algorithm, which merges the advantages given in the current SIFT and SURF algorithms, which we call, Speeded up Robust Scale-Invariant Feature Transform (SR-SIFT) algorithm. Our proposed SR-SIFT algorithm overcomes the problems of both the SIFT and SURF algorithms. The proposed algorithm aims to speed up the SIFT feature detection algorithm and keep it robust. Simulation results demonstrate that the proposed SR-SIFT algorithm decreases the average response time, especially in small and minimum number of best key points, increases the distribution of the number of best key points on the surface of the currency. Furthermore, the proposed algorithm increases the accuracy of the true best point distribution inside the currency edge than the other two algorithms.

Keywords: currency recognition, feature detection and description, SIFT algorithm, SURF algorithm, speeded up and robust features

Procedia PDF Downloads 215

Authors: P. Shrivastava, A. Shukla, K. Verma, S. Rungta

Abstract:

Parkinson's disease is a chronic neurological disorder that directly affects human gait. It leads to slowness of movement, causes muscle rigidity and tremors. Gait serve as a primary outcome measure for studies aiming at early recognition of disease. Using gait techniques, this paper implements efficient binary bat algorithm for an early detection of Parkinson's disease by selecting optimal features required for classification of affected patients from others. The data of 166 people, both fit and affected is collected and optimal feature selection is done using PSO and Bat algorithm. The reduced dataset is then classified using neural network. The experiments indicate that binary bat algorithm outperforms traditional PSO and genetic algorithm and gives a fairly good recognition rate even with the reduced dataset.

Keywords: parkinson, gait, feature selection, bat algorithm

Procedia PDF Downloads 516

Authors: Chang Seok Lee, Sang Whan Han, Girbo Ko, Debbie Kim

Abstract:

Existing reinforced concrete structures are designed and built without considering seismic loads. The columns in such buildings generally exhibit widely spaced transverse reinforcements without using seismic hooks. Due to the insufficient reinforcement details in columns, brittle shear failure is expected in columns that may cause pre-mature building collapse mechanism during earthquakes. In order to retrofit those columns, the accurate seismic behavior of the columns needs to be predicted with proper analytical models. In this study, an analytical model is proposed for accurately simulating the cyclic behavior of shear critical columns. The parameters for pinching and cyclic deterioration in strength and stiffness are calibrated using test data of column specimens failed by shear.

Keywords: analytical model, cyclic deterioration, existing reinforced concrete columns, shear failure

Procedia PDF Downloads 240

Authors: Najmeh Mohsenifar, Narjes Mohsenifar, Abbas Kargar

Abstract:

In this paper, has been presented a stable method for predicting the ECG signals through the RBF neural networks, by the PSO algorithm. In spite of quasi-periodic ECG signal from a healthy person, there are distortions in electro cardiographic data for a patient. Therefore, there is no precise mathematical model for prediction. Here, we have exploited neural networks that are capable of complicated nonlinear mapping. Although the architecture and spread of RBF networks are usually selected through trial and error, the PSO algorithm has been used for choosing the best neural network. In this way, 2 second of a recorded ECG signal is employed to predict duration of 20 second in advance. Our simulations show that PSO algorithm can find the RBF neural network with minimum MSE and the accuracy of the predicted ECG signal is 97 %.

Keywords: electrocardiogram, RBF artificial neural network, PSO algorithm, predict, accuracy

Procedia PDF Downloads 596

Authors: A. K. Borah, A. K. Singh

Abstract:

In this paper we deal building blocks of the computer simulation of the multiphase flows. Whole simulation procedure can be viewed as two super procedures; The implementation of VOF method and the solution of Navier Stoke’s Equation. Moreover, a sequential code for a Navier Stoke’s solver has been studied.

Keywords: Bi-conjugate gradient stabilized (Bi-CGSTAB), ILUT function, krylov subspace, multifluid flows preconditioner, simple algorithm

Procedia PDF Downloads 498

Authors: Xiuqin Ma, Hongwu Qin

Abstract:

A new efficient normal parameter reduction algorithm of soft set in decision making was proposed. However, up to the present, few documents have focused on real-life applications of this algorithm. Accordingly, we apply a New Efficient Normal Parameter Reduction algorithm into real-life datasets of online shopping, such as Blackberry Mobile Phone Dataset. Experimental results show that this algorithm is not only suitable but feasible for dealing with the online shopping.

Keywords: soft sets, parameter reduction, normal parameter reduction, online shopping

Procedia PDF Downloads 488

Authors: Mahesh Chudasama, Harit Raval

Abstract:

Conical sections and shells of metal plates manufactured by 3-roller conical bending process are widely used in the industries. The process is completed by first bending the metal plates statically and then dynamic roller bending sequentially. It is required to have an analytical model to get maximum bending force, for optimum design of the machine, for static bending stage. Analytical models assuming various stress conditions are considered and these analytical models are compared considering various parameters and reported in this paper. It is concluded from the study that for higher bottom roller inclination, the shear stress affects greatly to the static bending force whereas for lower bottom roller inclination it can be neglected.

Keywords: roller-bending, static-bending, stress-conditions, analytical-modeling

Procedia PDF Downloads 226

Authors: Elham Kazemi

Abstract:

Quadratic Assignment Problem (QAP) is one the combinatorial optimization problems about which research has been done in many companies for allocating some facilities to some locations. The issue of particular importance in this process is the costs of this allocation and the attempt in this problem is to minimize this group of costs. Since the QAP’s are from NP-hard problem, they cannot be solved by exact solution methods. Cuckoo Optimization Algorithm is a Meta-heuristicmethod which has higher capability to find the global optimal points. It is an algorithm which is basically raised to search a continuous space. The Quadratic Assignment Problem is the issue which can be solved in the discrete space, thus the standard arithmetic operators of Cuckoo Optimization Algorithm need to be redefined on the discrete space in order to apply the Cuckoo Optimization Algorithm on the discrete searching space. This paper represents the way of discretizing the Cuckoo optimization algorithm for solving the quadratic assignment problem.

Keywords: Quadratic Assignment Problem (QAP), Discrete Cuckoo Optimization Algorithm (DCOA), meta-heuristic algorithms, optimization algorithms

Procedia PDF Downloads 485

Authors: M. Salih Taci, N. Tayebi, I. Bozkır

Abstract:

This paper investigates the operation of a sinusoidal supplied autotransformer on the different states of magnetic polarity of primary and secondary terminals for four different step-up and step-down analytical conditions. In this paper, a new analytical modeling and equations for dot-marked and polarity-based step-up and step-down autotransformer are presented. These models are validated by the simulation of current and voltage waveforms for each state. PSpice environment was used for simulation.

Keywords: autotransformer modeling, autotransformer simulation, step-up autotransformer, step-down autotransformer, polarity

Procedia PDF Downloads 285