• Title/Summary/Keyword: Simplex Algorithm

Search Result 129, Processing Time 0.022 seconds

2D Microwave Image Reconstruction of Breast Cancer Detector Using a Simplex Method and Method of Moments

  • Kim, Ki-Chai;Cho, Byung-Doo;Kim, Tae-Hong;Lee, Jong-Moon;Jeon, Soon-Ik;Pack, Jeong-Ki
    • Journal of electromagnetic engineering and science
    • /
    • v.10 no.4
    • /
    • pp.199-205
    • /
    • 2010
  • This paper presents a tumor detection system for breast cancer that utilizes two-dimensional (2D) image reconstruction with microwave tomographic imaging. The breast cancer detection system under development consists of 16 transmit/receive antennas, and the microwave tomography system operates at 900 MHz. To solve a 2D inverse scattering problem, the method of moments (MoM) is employed for forward problem solving, and the simplex method employed as an optimization algorithm. The results of the reconstructed image show that the method accurately shows the position of a breast tumor.

Multi-Exchange Neighborhood Search Heuristics for the Multi-Source Capacitated Facility Location Problem

  • Chyu, Chiuh-Cheng;Chang, Wei-Shung
    • Industrial Engineering and Management Systems
    • /
    • v.8 no.1
    • /
    • pp.29-36
    • /
    • 2009
  • We present two local-search based metaheuristics for the multi-source capacitated facility location problem. In such a problem, each customer's demand can be supplied by one or more facilities. The problem is NP-hard and the number of locations in the optimal solution is unknown. To keep the search process effective, the proposed methods adopt the following features: (1) a multi-exchange neighborhood structure, (2) a tabu list that keeps track of recently visited solutions, and (3) a multi-start to enhance the diversified search paths. The transportation simplex method is applied in an efficient manner to obtain the optimal solutions to neighbors of the current solution under the algorithm framework. Two in-and-out selection rules are also proposed in the algorithms with the purpose of finding promising solutions in a short computational time. Our computational results for some of the benchmark instances, as well as some instances generated using a method in the literature, have demonstrated the effectiveness of this approach.

An Optimization Method Based on Hybrid Genetic Algorithm for Scramjet Forebody/Inlet Design

  • Zhou, Jianxing;Piao, Ying;Cao, Zhisong;Qi, Xingming;Zhu, Jianhong
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2008.03a
    • /
    • pp.469-475
    • /
    • 2008
  • The design of a scramjet inlet is a process to search global optimization results among those factors influencing the geometry of scramjet in their ranges for some requirements. An optimization algorithm of hybrid genetic algorithm based on genetic algorithm and simplex algorithm was established for this purpose. With the sample provided by a uniform method, the compressive angles which also are wedge angles of the inlet were chosen as the inlet design variables, and the drag coefficient, total pressure recovery coefficient, pressure rising ratio and the combination of these three variables are designed specifically as different optimization objects. The contrasts of these four optimization results show that the hybrid genetic algorithm developed in this paper can capably implement the optimization process effectively for the inlet design and demonstrate some good adaptability.

  • PDF

Nonlinear Blind Equalizer Using Hybrid Genetic Algorithm and RBF Networks

  • Han, Soo-Whan;Han, Chang-Wook
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.12
    • /
    • pp.1689-1699
    • /
    • 2006
  • A nonlinear channel blind equalizer by using a hybrid genetic algorithm, which merges a genetic algorithm with simulated annealing, and a RBF network is presented. In this study, a hybrid genetic algorithm is used to estimate the output states of a nonlinear channel, based on the Bayesian likelihood fitness function, instead of the channel parameters. From these estimated output states, the desired channel states of the nonlinear channel are derived and placed at the center of a RBF equalizer to reconstruct transmitted symbols. In the simulations, binary signals are generated at random with Gaussian noise. The performance of the proposed method is compared with those of a conventional genetic algorithm(GA) and a simplex GA, and the relatively high accuracy and fast convergence of the method are achieved.

  • PDF

A Handling Method of Linear Constraints for the Genetic Algorithm (유전알고리즘에서 선형제약식을 다루는 방법)

  • Sung, Ki-Seok
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.37 no.4
    • /
    • pp.67-72
    • /
    • 2012
  • In this paper a new method of handling linear constraints for the genetic algorithm is suggested. The method is designed to maintain the feasibility of offsprings during the evolution process of the genetic algorithm. In the genetic algorithm, the chromosomes are coded as the vectors in the real vector space constrained by the linear constraints. A method of handling the linear constraints already exists in which all the constraints of equalities are eliminated so that only the constraints of inequalities are considered in the process of the genetic algorithm. In this paper a new method is presented in which all the constraints of inequalities are eliminated so that only the constraints of equalities are considered. Several genetic operators such as arithmetic crossover, simplex crossover, simple crossover and random vector mutation are designed so that the resulting offspring vectors maintain the feasibility subject to the linear constraints in the framework of the new handling method.

Optimization of Fuzzy Neural Network based Nonlinear Process System Model using Genetic Algorithm (유전자 알고리즘을 이용한 FNNs 기반 비선형공정시스템 모델의 최적화)

  • 최재호;오성권;안태천
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1997.11a
    • /
    • pp.267-270
    • /
    • 1997
  • In this paper, we proposed an optimazation method using Genetic Algorithm for nonlinear system modeling. Fuzzy Neural Network(FNNs) was used as basic model of nonlinear system. FNNs was fused of Fuzzy Inference which has linguistic property and Neural Network which has learning ability and high tolerence level. This paper, We used FNNs which was proposed by Yamakawa. The FNNs was composed Simple Inference and Error Back Propagation Algorithm. To obtain optimal model, parameter of membership function, learning rate and momentum coefficient of FNNs are tuned using genetic algorithm. And we used simplex algorithm additionaly to overcome limit of genetic algorithm. For the purpose of evaluation of proposed method, we applied proposed method to traffic choice process and waste water treatment process, and then obtained more precise model than other previous optimization methods and objective model.

  • PDF

Simple Algorithm for Large-scale Unbalanced Transportation Problem (대규모 불균형 수송문제의 간단한 해법)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.4
    • /
    • pp.223-230
    • /
    • 2015
  • As the Transportation Simplex Method of the general transportation problem are inapplicable to the large-scale unbalanced transportation problem, a commercialized linear programming package remains as the only viable means. There is, however, no method made available to verify the optimality of solutions attained by the package. This paper therefore proposes a simple heuristic algorithm to the large-scale unbalanced transportation problem. From a given problem of $31{\times}15$supply and demand areas, the proposed algorithm determines the number of demands areas for each supply area and executes on the latter in the ascending order of each of their corresponding demand areas. Next, given a single corresponding demand area, it supplies the full demand volume and else, it supplies first to an area of minimum associated costs and subsequently to the rest so as to meet the demand to the fullest extent. This initial optimal value is then optimized through an adjustment process whereby costs are minimized as much as possible. When tested on the $31{\times}15$cost matrix, the proposed algorithm has obtained an optimal result improved from the commercial linear programming package by 8.9%.

FE Model Updating on the Grillage Model for Plate Girder Bridge Using the Hybrid Genetic Algorithm and the Multi-objective Function (하이브리드 유전자 알고리즘과 다중목적함수를 적용한 플레이트 거더교의 격자모델에 대한 유한요소 모델개선)

  • Jung, Dae-Sung;Kim, Chul-Young
    • Journal of the Earthquake Engineering Society of Korea
    • /
    • v.12 no.6
    • /
    • pp.13-23
    • /
    • 2008
  • In this study, a finite element (FE) model updating method based on the hybrid genetic algorithm (HGA) is proposed to improve the grillage FE model for plate girder bridges. HGA consists of a genetic algorithm (GA) and direct search method (DS) based on a modification of Nelder & Mead's simplex optimization method (NMS). Fitness functions based on natural frequencies, mode shapes, and static deflections making use of the measurements and analytical results are also presented to apply in the proposed method. In addition, a multi-objective function has been formulated as a linear combination of fitness functions in order to simultaneously improve both stiffness and mass. The applicability of the proposed method to girder bridge structures has been verified through a numerical example on a two-span continuous grillage FE model, as well as through an experimental test on a simply supported plate girder skew bridge. In addition, the effect of measuring error is considered as random noise, and its effect is investigated by numerical simulation. Through numerical and experimental verification, it has been proven that the proposed method is feasible and effective for FE model updating on plate girder bridges.

The Assignment-Swap Algorithm for Large-scale Transportation Problem with Incomplete Cost Lists (불완전 비용 리스트를 가진 대규모 수송문제의 배정-교환 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.6
    • /
    • pp.51-58
    • /
    • 2015
  • This paper suggests assignment-swap algorithm with time complexity O(mn) to obtain the optimal solution for large-scale of transportation problem (TP) with incomplete cost lists. Generally, the TP with complete cost lists can be solved with TSM (Transportation Simplex Method). But, we can't be solved for large-scale of TP with TSM. Especially. It is hard to solve for large-scale TP with incomplete cost lists using TSM. Therefore, experts simply using commercial linear programming package. Firstly, the proposed algorithm applies assignment strategy of transportation quantity to ascending order of transportation cost. Then, we reassign from surplus of supply to shortage of demand. Secondly, we perform the 2-opt and 1-opt swap optimization to obtain the optimal solution. Upon application to $31{\times}15$ incomplete cost matrix problem, the proposed assignment-swap algorithm more improves the solution than LINGO of commercial linear programming.

Optimal Design of a Squeeze Film Damper Using an Enhanced Genetic Algorithm

  • Ahn, Young-Kong;Kim, Young-Chan;Yang, Bo-Suk
    • Journal of Mechanical Science and Technology
    • /
    • v.17 no.12
    • /
    • pp.1938-1948
    • /
    • 2003
  • This paper represents that an enhanced genetic algorithm (EGA) is applied to optimal design of a squeeze film damper (SFD) to minimize the maximum transmitted load between the bearing and foundation in the operational speed range. A general genetic algorithm (GA) is well known as a useful global optimization technique for complex and nonlinear optimization problems. The EGA consists of the GA to optimize multi-modal functions and the simplex method to search intensively the candidate solutions by the GA for optimal solutions. The performance of the EGA with a benchmark function is compared to them by the IGA (Immune-Genetic Algorithm) and SQP (Sequential Quadratic Programming). The radius, length and radial clearance of the SFD are defined as the design parameters. The objective function is the minimization of a maximum transmitted load of a flexible rotor system with the nonlinear SFDs in the operating speed range. The effectiveness of the EGA for the optimal design of the SFD is discussed from a numerical example.