• Title/Summary/Keyword: Simulated Algorithm

Search Result 1,795, Processing Time 0.026 seconds

Extending the SRIV Identification Algorithm to MIMO LMFD Models

  • Akroum, Mohamed;Hariche, Kamel
    • Journal of Electrical Engineering and Technology
    • /
    • v.4 no.1
    • /
    • pp.135-142
    • /
    • 2009
  • In this paper the Simplified Refined Instrumental Variable (SRIV) identification algorithm for SISO systems is extended to MIMO systems described by a Left Matrix Fraction Description (LMFD). The performance of the extended algorithm is compared to the well-known MIMO four-step instrumental variable (IV4) algorithm. Monte Carlo simulations for different signal to noise ratios are conducted to assess the performance of the algorithm. Moreover, the algorithm is applied to a simulated quadruple tank process.

Simulated Annealing Algorithms for Operation Sequencing in Nonlinear Process Planning (비선형공정계획에서 가공순서 결정을 위한 시뮬레이티드 어닐링 알고리듬)

  • Lee, Dong-Ho;Dimitris, Kiritsis;Paul, Xirouchakis
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.27 no.3
    • /
    • pp.315-327
    • /
    • 2001
  • This paper considers the problem of operation sequencing in nonlinear process planning, which is the problem of selecting and sequencing operations required to produce a part with the objective of minimizing the sum of operation processing costs and machine, setup and tool change costs. Main constraints are the precedence relations among operations. The problem can be decomposed into two subproblems: operation selection and operation sequencing. We suggest four simulated annealing algorithms, which solve the two subproblems iteratively until a good solution is obtained. Here, the operation selection problem can be solved using a shortest path algorithm. Application of the algorithms is illustrated using an example. Also, to show the performances of the suggested algorithms, computational experiments were done on randomly generated test problems and the results are reported. In particular, one of the suggested algorithms outperforms an existing simulated annealing algorithm.

  • PDF

SA-selection-based Genetic Algorithm for the Design of Fuzzy Controller

  • Han Chang-Wook;Park Jung-Il
    • International Journal of Control, Automation, and Systems
    • /
    • v.3 no.2
    • /
    • pp.236-243
    • /
    • 2005
  • This paper presents a new stochastic approach for solving combinatorial optimization problems by using a new selection method, i.e. SA-selection, in genetic algorithm (GA). This approach combines GA with simulated annealing (SA) to improve the performance of GA. GA and SA have complementary strengths and weaknesses. While GA explores the search space by means of population of search points, it suffers from poor convergence properties. SA, by contrast, has good convergence properties, but it cannot explore the search space by means of population. However, SA does employ a completely local selection strategy where the current candidate and the new modification are evaluated and compared. To verify the effectiveness of the proposed method, the optimization of a fuzzy controller for balancing an inverted pendulum on a cart is considered.

Performance Comparison of GA, DE, PSO and SA Approaches in Enhancement of Total Transfer Capability using FACTS Devices

  • Chandrasekar, K.;Ramana, N.V.
    • Journal of Electrical Engineering and Technology
    • /
    • v.7 no.4
    • /
    • pp.493-500
    • /
    • 2012
  • In this paper the performance of meta-heuristics algorithms such as GA (Genetic Algorithm), DE (Differential Evolution), PSO (Particle Swarm Optimization) and SA (Simulated Annealing) for the problem of TTC enhancement using FACTS devices are compared. In addition to that in the assessment procedure of TTC two novel techniques are proposed. First the optimization algorithm which is used for TTC enhancement is simultaneously used for assessment of TTC. Second the power flow is done using Broyden - Shamanski method with Sherman - Morrison formula (BSS). The proposed approach is tested on WSCC 9 bus, IEEE 118 bus test systems and the results are compared with the conventional Repeated Power Flow (RPF) using Newton Raphson (NR) method which indicates that the proposed method provides better TTC enhancement and computational efficacy than the conventional procedure.

A Hybrid Genetic Algorithm for the Location-Routing Problem with Simultaneous Pickup and Delivery

  • Karaoglan, Ismail;Altiparmak, Fulya
    • Industrial Engineering and Management Systems
    • /
    • v.10 no.1
    • /
    • pp.24-33
    • /
    • 2011
  • In this paper, we consider the Location-Routing Problem with simultaneous pickup and delivery (LRPSPD) which is a general case of the location-routing problem. The LRPSPD is defined as finding locations of the depots and designing vehicle routes in such a way that pickup and delivery demands of each customer must be performed with same vehicle and the overall cost is minimized. Since the LRPSPD is an NP-hard problem, we propose a hybrid heuristic approach based on genetic algorithms (GA) and simulated annealing (SA) to solve the problem. To evaluate the performance of the proposed approach, we conduct an experimental study and compare its results with those obtained by a branch-and-cut algorithm on a set of instances derived from the literature. Computational results indicate that the proposed hybrid algorithm is able to find optimal or very good quality solutions in a reasonable computation time.

Path-Planning for Cleaning Robot Using a Wall Tracing

  • kwang sik Jung;No, Yong-Jun;Lim, Young-Cheol;Ryoo, Young-Jae
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.108.1-108
    • /
    • 2002
  • This paper is willing to propose a method of wall tracing, a moving algorithm between two points, when a Cleaning robot between two points moves. We use the information about obstacles and wall side in calculating different weight vector the each infrared sensors in cleaning robot. Therefore the cleaning robot navigates the wall. In the algorithm of wall tracing, the value of error in angle and distance between starting point and ending point should be zero to navigate the wall safely. The propriety of algorithm of the wall tracing is simulated as this method by using Visual C++. The result simulated proved to the simulation.

  • PDF

Optimizing Simulated Annealing Algorithms Using Taguchi Method (다구치 기법을 이용한 시뮬레이티드 어닐링 알고리듬의 최적화)

  • Kim Ho Gyun;Jo Hyeong Su;Bae Chang Ok
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.05a
    • /
    • pp.1077-1084
    • /
    • 2003
  • The performance of simulated annealing (SA) algorithm such as solution optimality and computation time mainly depends on how to determine the SA-related parameters Several schemes have been suggested to improve the performance of SA and several parameter design methods have been utilized to select parameter values of each scheme. In this paper, we propose a new SA algorithm design method that can determine schemes as well as parameter values simultaneously The new SA algorithm design method is based on the Taguchl method which primarily selects the design parameters for a product or process to minimize the effect of noise parameters. so that the response is close to the desired target with minimum variation. To show the effectiveness of the proposed method, extensive computation experiments are conducted.

  • PDF

Study on Hybrid Search Method Using Neural Network and Simulated Annealing Algorithm for Apparel Pattern Layout Design (뉴럴 네트워크와 시뮬레이티드 어닐링법을 하이브리드 탐색 형식으로 이용한 어패럴 패턴 자동배치 프로그램에 관한 연구)

  • Jang, Seung Ho
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.24 no.1
    • /
    • pp.63-68
    • /
    • 2015
  • Pattern layout design is very important to the automation of apparel industry. Until now, the genetic algorithm and Tabu search method have been applied to layout design automation. With the genetic algorithm and Tabu search method, the obtained values are not always consistent depending on the initial conditions, number of iterations, and scheduling. In addition, the selection of various parameters for these methods is not easy. This paper presents a hybrid search method that uses a neural network and simulated annealing to solve these problems. The layout of pattern elements was optimized to verify the potential application of the suggested method to apparel pattern layout design.

Real Protein Prediction in an Off-Lattice BLN Model via Annealing Contour Monte Carlo

  • Cheon, Soo-Young
    • The Korean Journal of Applied Statistics
    • /
    • v.22 no.3
    • /
    • pp.627-634
    • /
    • 2009
  • Recently, the general contour Monte Carlo has been proposed by Liang (2004) as a space annealing version(ACMC) for optimization problems. The algorithm can be applied successfully to determine the ground configurations for the prediction of protein folding. In this approach, we use the distances between the consecutive $C_{\alpha}$ atoms along the peptide chain and the mapping sequences between the 20-letter amino acids and a coarse-grained three-letter code. The algorithm was tested on the real proteins. The comparison showed that the algorithm made a significant improvement over the simulated annealing(SA) and the Metropolis Monte Carlo method in determining the ground configurations.

Tool-Path Optimization of Magnetic Abrasive Polishing Using Heuristic Algorithm (휴리스틱 알고리즘을 이용한 평면 자기연마 공구경로 최적화)

  • Kim, Sang-Oh;You, Man-Hee;Kwak, Jae-Seob
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.20 no.2
    • /
    • pp.174-179
    • /
    • 2011
  • This paper focuses on the optimal step-over value for magnetic tool path. Since magnetic flux density is changed according to distance from center of magnetic tool. Enhanced surface roughness is also different according to change of radius. Therefore, to get a identical surface roughness on workpiece, it is necessary to find optimal tool path including step-over. In this study, response surface models for surface roughness according to change of radiuses were developed, and then optimal enhanced surface roughness for each radius was selected using genetic algorithm and simulated annealing to investigate relation between radius and surface roughness. As a result, it found that step-over value of 6.6mm is suitable for MAP of magnesium alloy.