WorldWideScience

Sample records for algorithm based optimization

  1. Smell Detection Agent Based Optimization Algorithm

    Science.gov (United States)

    Vinod Chandra S. S.

    2016-09-01

    In this paper, a novel nature-inspired optimization algorithm has been employed and the trained behaviour of dogs in detecting smell trails is adapted into computational agents for problem solving. The algorithm involves creation of a surface with smell trails and subsequent iteration of the agents in resolving a path. This algorithm can be applied in different computational constraints that incorporate path-based problems. Implementation of the algorithm can be treated as a shortest path problem for a variety of datasets. The simulated agents have been used to evolve the shortest path between two nodes in a graph. This algorithm is useful to solve NP-hard problems that are related to path discovery. This algorithm is also useful to solve many practical optimization problems. The extensive derivation of the algorithm can be enabled to solve shortest path problems.

  2. Algorithmic Differentiation for Calculus-based Optimization

    Science.gov (United States)

    Walther, Andrea

    2010-10-01

    For numerous applications, the computation and provision of exact derivative information plays an important role for optimizing the considered system but quite often also for its simulation. This presentation introduces the technique of Algorithmic Differentiation (AD), a method to compute derivatives of arbitrary order within working precision. Quite often an additional structure exploitation is indispensable for a successful coupling of these derivatives with state-of-the-art optimization algorithms. The talk will discuss two important situations where the problem-inherent structure allows a calculus-based optimization. Examples from aerodynamics and nano optics illustrate these advanced optimization approaches.

  3. Drilling Path Optimization Based on Particle Swarm Optimization Algorithm

    Institute of Scientific and Technical Information of China (English)

    ZHU Guangyu; ZHANG Weibo; DU Yuexiang

    2006-01-01

    This paper presents a new approach based on the particle swarm optimization (PSO) algorithm for solving the drilling path optimization problem belonging to discrete space. Because the standard PSO algorithm is not guaranteed to be global convergence or local convergence, based on the mathematical algorithm model, the algorithm is improved by adopting the method of generate the stop evolution particle over again to get the ability of convergence to the global optimization solution. And the operators are improved by establishing the duality transposition method and the handle manner for the elements of the operator, the improved operator can satisfy the need of integer coding in drilling path optimization. The experiment with small node numbers indicates that the improved algorithm has the characteristics of easy realize, fast convergence speed, and better global convergence characteristics, hence the new PSO can play a role in solving the problem of drilling path optimization in drilling holes.

  4. A new optimization algorithm based on chaos

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    In this article, some methods are proposed for enhancing the converging velocity of the COA (chaos optimization algorithm) based on using carrier wave two times, which can greatly increase the speed and efficiency of the first carrier wave's search for the optimal point in implementing the sophisticated searching during the second carrier wave is faster and more accurate.In addition, the concept of using the carrier wave three times is proposed and put into practice to tackle the multi-variables optimization problems, where the searching for the optimal point of the last several variables is frequently worse than the first several ones.

  5. Function Optimization Based on Quantum Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Ying Sun

    2014-01-01

    Full Text Available Optimization method is important in engineering design and application. Quantum genetic algorithm has the characteristics of good population diversity, rapid convergence and good global search capability and so on. It combines quantum algorithm with genetic algorithm. A novel quantum genetic algorithm is proposed, which is called Variable-boundary-coded Quantum Genetic Algorithm (vbQGA in which qubit chromosomes are collapsed into variable-boundary-coded chromosomes instead of binary-coded chromosomes. Therefore much shorter chromosome strings can be gained. The method of encoding and decoding of chromosome is first described before a new adaptive selection scheme for angle parameters used for rotation gate is put forward based on the core ideas and principles of quantum computation. Eight typical functions are selected to optimize to evaluate the effectiveness and performance of vbQGA against standard Genetic Algorithm (sGA and Genetic Quantum Algorithm (GQA. The simulation results show that vbQGA is significantly superior to sGA in all aspects and outperforms GQA in robustness and solving velocity, especially for multidimensional and complicated functions.

  6. Function Optimization Based on Quantum Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Ying Sun

    2013-01-01

    Full Text Available Quantum genetic algorithm has the characteristics of good population diversity, rapid convergence and good global search capability and so on.It combines quantum algorithm with genetic algorithm. A novel quantum genetic algorithm is proposed ,which is called variable-boundary-coded quantum genetic algorithm (vbQGA in which qubit chromosomes are collapsed into variableboundary- coded chromosomes instead of binary-coded chromosomes. Therefore much shorter chromosome strings can be gained.The method of encoding and decoding of chromosome is first described before a new adaptive selection scheme for angle parameters used for rotation gate is put forward based on the core ideas and principles of quantum computation. Eight typical functions are selected to optimize to evaluate the effectiveness and performance of vbQGA against standard genetic algorithm (sGA and genetic quantum algorithm (GQA. The simulation results show that vbQGA is significantly superior to sGA in all aspects and outperforms GQA in robustness and solving velocity, especially for multidimensional and complicated functions.

  7. Genetic algorithm based separation cascade optimization

    International Nuclear Information System (INIS)

    The conventional separation cascade design procedure does not give an optimum design because of squaring-off, variation of flow rates and separation factor of the element with respect to stage location. Multi-component isotope separation further complicates the design procedure. Cascade design can be stated as a constrained multi-objective optimization. Cascade's expectation from the separating element is multi-objective i.e. overall separation factor, cut, optimum feed and separative power. Decision maker may aspire for more comprehensive multi-objective goals where optimization of cascade is coupled with the exploration of separating element optimization vector space. In real life there are many issues which make it important to understand the decision maker's perception of cost-quality-speed trade-off and consistency of preferences. Genetic algorithm (GA) is one such evolutionary technique that can be used for cascade design optimization. This paper addresses various issues involved in the GA based multi-objective optimization of the separation cascade. Reference point based optimization methodology with GA based Pareto optimality concept for separation cascade was found pragmatic and promising. This method should be explored, tested, examined and further developed for binary as well as multi-component separations. (author)

  8. Warehouse Optimization Model Based on Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Guofeng Qin

    2013-01-01

    Full Text Available This paper takes Bao Steel logistics automated warehouse system as an example. The premise is to maintain the focus of the shelf below half of the height of the shelf. As a result, the cost time of getting or putting goods on the shelf is reduced, and the distance of the same kind of goods is also reduced. Construct a multiobjective optimization model, using genetic algorithm to optimize problem. At last, we get a local optimal solution. Before optimization, the average cost time of getting or putting goods is 4.52996 s, and the average distance of the same kinds of goods is 2.35318 m. After optimization, the average cost time is 4.28859 s, and the average distance is 1.97366 m. After analysis, we can draw the conclusion that this model can improve the efficiency of cargo storage.

  9. A hybrid bird mating optimizer algorithm with teaching-learning-based optimization for global numerical optimization

    OpenAIRE

    Qingyang Zhang; Guolin Yu; Hui Song

    2015-01-01

    Bird Mating Optimizer (BMO) is a novel meta-heuristic optimization algorithm inspired by intelligent mating behavior of birds. However, it is still insufficient in convergence of speed and quality of solution. To overcome these drawbacks, this paper proposes a hybrid algorithm (TLBMO), which is established by combining the advantages of Teaching-learning-based optimization (TLBO) and Bird Mating Optimizer (BMO). The performance of TLBMO is evaluated on 23 benchmark functions, and compared wit...

  10. XOR-based artificial bee colony algorithm for binary optimization

    OpenAIRE

    KIRAN, Mustafa Servet; Gündüz, Mesut

    2012-01-01

    The artificial bee colony (ABC) algorithm, which was inspired by the foraging and dance behaviors of real honey bee colonies, was first introduced for solving numerical optimization problems. When the solution space of the optimization problem is binary-structured, the basic ABC algorithm should be modified for solving this class of problems. In this study, we propose XOR-based modification for the solution-updating equation of the ABC algorithm in order to solve binary optimization pro...

  11. AN OPTIMIZATION ALGORITHM BASED ON BACTERIA BEHAVIOR

    Directory of Open Access Journals (Sweden)

    Ricardo Contreras

    2014-09-01

    Full Text Available Paradigms based on competition have shown to be useful for solving difficult problems. In this paper we present a new approach for solving hard problems using a collaborative philosophy. A collaborative philosophy can produce paradigms as interesting as the ones found in algorithms based on a competitive philosophy. Furthermore, we show that the performance - in problems associated to explosive combinatorial - is comparable to the performance obtained using a classic evolutive approach.

  12. Analog Circuit Design Optimization Based on Evolutionary Algorithms

    OpenAIRE

    Mansour Barari; Hamid Reza Karimi; Farhad Razaghian

    2014-01-01

    This paper investigates an evolutionary-based designing system for automated sizing of analog integrated circuits (ICs). Two evolutionary algorithms, genetic algorithm and PSO (Parswal particle swarm optimization) algorithm, are proposed to design analog ICs with practical user-defined specifications. On the basis of the combination of HSPICE and MATLAB, the system links circuit performances, evaluated through specific electrical simulation, to the optimization system in the MATLAB environmen...

  13. A hybrid bird mating optimizer algorithm with teaching-learning-based optimization for global numerical optimization

    Directory of Open Access Journals (Sweden)

    Qingyang Zhang

    2015-02-01

    Full Text Available Bird Mating Optimizer (BMO is a novel meta-heuristic optimization algorithm inspired by intelligent mating behavior of birds. However, it is still insufficient in convergence of speed and quality of solution. To overcome these drawbacks, this paper proposes a hybrid algorithm (TLBMO, which is established by combining the advantages of Teaching-learning-based optimization (TLBO and Bird Mating Optimizer (BMO. The performance of TLBMO is evaluated on 23 benchmark functions, and compared with seven state-of-the-art approaches, namely BMO, TLBO, Artificial Bee Bolony (ABC, Particle Swarm Optimization (PSO, Fast Evolution Programming (FEP, Differential Evolution (DE, Group Search Optimization (GSO. Experimental results indicate that the proposed method performs better than other existing algorithms for global numerical optimization.

  14. Wireless Sensor Network Path Optimization Based on Hybrid Algorithm

    OpenAIRE

    Zeyu Sun; Li, Zhenping

    2013-01-01

    One merit of genetic algorithm is fast overall searching, but this algorithm usually results in low efficiency because of large quantities of redundant codes. The advantages of ant colony algorithm are strong suitability and good robustness while its disadvantages are tendency to stagnation, slow speed of convergence. Put forward based on improved ant colony algorithm for wireless sensor network path optimization approach will first need to pass the data in the shortest path for transmission,...

  15. Teaching learning based optimization algorithm and its engineering applications

    CERN Document Server

    Rao, R Venkata

    2016-01-01

    Describing a new optimization algorithm, the “Teaching-Learning-Based Optimization (TLBO),” in a clear and lucid style, this book maximizes reader insights into how the TLBO algorithm can be used to solve continuous and discrete optimization problems involving single or multiple objectives. As the algorithm operates on the principle of teaching and learning, where teachers influence the quality of learners’ results, the elitist version of TLBO algorithm (ETLBO) is described along with applications of the TLBO algorithm in the fields of electrical engineering, mechanical design, thermal engineering, manufacturing engineering, civil engineering, structural engineering, computer engineering, electronics engineering, physics and biotechnology. The book offers a valuable resource for scientists, engineers and practitioners involved in the development and usage of advanced optimization algorithms.

  16. An optimal scheduling algorithm based on task duplication

    Institute of Scientific and Technical Information of China (English)

    Ruan Youlin; Liu Gan; Zhu Guangxi; Lu Xiaofeng

    2005-01-01

    When the communication time is relatively shorter than the computation time for every task, the task duplication based scheduling (TDS) algorithm proposed by Darbha and Agrawal generates an optimal schedule. Park and Choe also proposed an extended TDS algorithm whose optimality condition is less restricted than that of TDS algorithm, but the condition is very complex and is difficult to satisfy when the number of tasks is large. An efficient algorithm is proposed whose optimality condition is less restricted and simpler than both of the algorithms, and the schedule length is also shorter than both of the algorithms. The time complexity of the proposed algorithm is O ( v2 ), where v represents the number of tasks.

  17. Genetic Algorithm-Based Optimization Used in Rolling Schedule

    Institute of Scientific and Technical Information of China (English)

    YANG Jing-ming; CHE Hai-jun; DOU Fu-ping; ZHOU Tao

    2008-01-01

    A genetic algorithm-based optimization was used for 1 370 mm tandem cold rolling schedule, in which the press rates were coded and operated. The superiority individual is reserved in every generation. Analysis and comparison of optimized schedule with the existing schedule were offered. It is seen that the performance of the optimal rolling schedule is satisfactory and promising.

  18. An Improved Particle Swarm Optimization Algorithm Based on Ensemble Technique

    Institute of Scientific and Technical Information of China (English)

    SHI Yan; HUANG Cong-ming

    2006-01-01

    An improved particle swarm optimization (PSO) algorithm based on ensemble technique is presented. The algorithm combines some previous best positions (pbest) of the particles to get an ensemble position (Epbest), which is used to replace the global best position (gbest). It is compared with the standard PSO algorithm invented by Kennedy and Eberhart and some improved PSO algorithms based on three different benchmark functions. The simulation results show that the improved PSO based on ensemble technique can get better solutions than the standard PSO and some other improved algorithms under all test cases.

  19. QOS-BASED MULTICAST ROUTING OPTIMIZATION ALGORITHMS FOR INTERNET

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    Most of the multimedia applications require strict Quality-of-Service (QoS) guarantee during the communication between a single source and multiple destinations. The paper mainly presents a QoS Multicast Routing algorithms based on Genetic Algorithm (QMRGA). Simulation results demonstrate that the algorithm is capable of discovering a set of QoS-based near optimized, non-dominated multicast routes within a few iterations, even for the networks environment with uncertain parameters.

  20. A danger-theory-based immune network optimization algorithm.

    Science.gov (United States)

    Zhang, Ruirui; Li, Tao; Xiao, Xin; Shi, Yuanquan

    2013-01-01

    Existing artificial immune optimization algorithms reflect a number of shortcomings, such as premature convergence and poor local search ability. This paper proposes a danger-theory-based immune network optimization algorithm, named dt-aiNet. The danger theory emphasizes that danger signals generated from changes of environments will guide different levels of immune responses, and the areas around danger signals are called danger zones. By defining the danger zone to calculate danger signals for each antibody, the algorithm adjusts antibodies' concentrations through its own danger signals and then triggers immune responses of self-regulation. So the population diversity can be maintained. Experimental results show that the algorithm has more advantages in the solution quality and diversity of the population. Compared with influential optimization algorithms, CLONALG, opt-aiNet, and dopt-aiNet, the algorithm has smaller error values and higher success rates and can find solutions to meet the accuracies within the specified function evaluation times.

  1. Analog Circuit Design Optimization Based on Evolutionary Algorithms

    Directory of Open Access Journals (Sweden)

    Mansour Barari

    2014-01-01

    Full Text Available This paper investigates an evolutionary-based designing system for automated sizing of analog integrated circuits (ICs. Two evolutionary algorithms, genetic algorithm and PSO (Parswal particle swarm optimization algorithm, are proposed to design analog ICs with practical user-defined specifications. On the basis of the combination of HSPICE and MATLAB, the system links circuit performances, evaluated through specific electrical simulation, to the optimization system in the MATLAB environment, for the selected topology. The system has been tested by typical and hard-to-design cases, such as complex analog blocks with stringent design requirements. The results show that the design specifications are closely met. Comparisons with available methods like genetic algorithms show that the proposed algorithm offers important advantages in terms of optimization quality and robustness. Moreover, the algorithm is shown to be efficient.

  2. An elitist teaching-learning-based optimization algorithm for solving complex constrained optimization problems

    Directory of Open Access Journals (Sweden)

    Vivek Patel

    2012-08-01

    Full Text Available Nature inspired population based algorithms is a research field which simulates different natural phenomena to solve a wide range of problems. Researchers have proposed several algorithms considering different natural phenomena. Teaching-Learning-based optimization (TLBO is one of the recently proposed population based algorithm which simulates the teaching-learning process of the class room. This algorithm does not require any algorithm-specific control parameters. In this paper, elitism concept is introduced in the TLBO algorithm and its effect on the performance of the algorithm is investigated. The effects of common controlling parameters such as the population size and the number of generations on the performance of the algorithm are also investigated. The proposed algorithm is tested on 35 constrained benchmark functions with different characteristics and the performance of the algorithm is compared with that of other well known optimization algorithms. The proposed algorithm can be applied to various optimization problems of the industrial environment.

  3. PRACTICAL APPLICATION OF POPULATION BASED ANT COLONY OPTIMIZATION ALGORITHM

    OpenAIRE

    Valeeva, A.; Goncharova, Yu

    2013-01-01

    In this paper we consider the Split Delivery Vehicle Routing Problem, which has a wide practical application. The SDVRP is NP-hard problem. We propose a population based ant colony optimization algorithm for solving the SDVRP. Computational experiments for developed algorithm are reported.

  4. Antenna synthesis based on the ant colony optimization algorithm

    OpenAIRE

    Slyusar, V. I.; Ermolaev, S. Y.

    2009-01-01

    This report are described the versions and the synthesis results of new designs of electrically small antenna based on ant colony optimization algorithms. To study the parameters of the frame and non-loopback vibrators MMANA package was used. Geometric forms that were obtained might be used as contour lines of printed, slot antenna or as forming surface of the crystal dielectric resonator antenna. A constructive meta-heuristic search algorithm for optimization of the antennas form...

  5. Task Scheduling Optimization in Cloud Computing Based on Heuristic Algorithm

    Directory of Open Access Journals (Sweden)

    Lizheng Guo

    2012-03-01

    Full Text Available Cloud computing is an emerging technology and it allows users to pay as you need and has the high performance. Cloud computing is a heterogeneous system as well and it holds large amount of application data. In the process of scheduling some intensive data or computing an intensive application, it is acknowledged that optimizing the transferring and processing time is crucial to an application program. In this paper in order to minimize the cost of the processing we formulate a model for task scheduling and propose a particle swarm optimization (PSO algorithm which is based on small position value rule. By virtue of comparing PSO algorithm with the PSO algorithm embedded in crossover and mutation and in the local research, the experiment results show the PSO algorithm not only converges faster but also runs faster than the other two algorithms in a large scale. The experiment results prove that the PSO algorithm is more suitable to cloud computing.

  6. Support vector machines optimization based theory, algorithms, and extensions

    CERN Document Server

    Deng, Naiyang; Zhang, Chunhua

    2013-01-01

    Support Vector Machines: Optimization Based Theory, Algorithms, and Extensions presents an accessible treatment of the two main components of support vector machines (SVMs)-classification problems and regression problems. The book emphasizes the close connection between optimization theory and SVMs since optimization is one of the pillars on which SVMs are built.The authors share insight on many of their research achievements. They give a precise interpretation of statistical leaning theory for C-support vector classification. They also discuss regularized twi

  7. OPTIMIZATION BASED ON LMPROVED REAL—CODED GENETIC ALGORITHM

    Institute of Scientific and Technical Information of China (English)

    ShiYu; YuShenglin

    2002-01-01

    An improved real-coded genetic algorithm is pro-posed for global optimization of functionsl.The new algo-rithm is based om the judgement of the searching perfor-mance of basic real-coded genetic algorithm.The opera-tions of basic real-coded genetic algorithm are briefly dis-cussed and selected.A kind of chaos sequence is described in detail and added in the new algorithm ad a disturbance factor.The strategy of field partition is also used to im-prove the strcture of the new algorithm.Numerical ex-periment shows that the mew genetic algorithm can find the global optimum of complex funtions with satistaiting precision.

  8. Optimizing Combination of Units Commitment Based on Improved Genetic Algorithms

    Institute of Scientific and Technical Information of China (English)

    LAI Yifei; ZHANG Qianhua; JIA Junping

    2007-01-01

    GAs are general purpose optimization techniques based on principles inspired from the biological evolution using metaphors of mechanisms, such as natural selection, genetic recombination and survival of the fittest. By use of coding betterment, the dynamic changes of the mutation rate and the crossover probability, the dynamic choice of subsistence, the reservation of the optimal fitness value, a modified genetic algorithm for optimizing combination of units in thermal power plants is proposed.And through taking examples, test result are analyzed and compared with results of some different algorithms. Numerical results show available value for the unit commitment problem with examples.

  9. A Hybrid Optimization Algorithm based on Genetic Algorithm and Ant Colony Optimization

    OpenAIRE

    Zainudin Zukhri; Irving Vitra Paputungan

    2013-01-01

    In optimization problem, Genetic Algorithm (GA) and Ant Colony Optimization Algorithm (ACO) have been known as good alternative techniques. GA is designed by adopting the natural evolution process, while ACO is inspired by the foraging behaviour of ant species. This paper presents a hybrid GA-ACO for Travelling Salesman Problem (TSP), called Genetic Ant Colony Optimization (GACO). In this method, GA will observe and preserve the fittest ant in each cycle in every generation and on...

  10. Electronic Commerce Logistics Network Optimization Based on Swarm Intelligent Algorithm

    Directory of Open Access Journals (Sweden)

    Yabing Jiao

    2013-09-01

    Full Text Available This article establish an efficient electronic commerce logistics operation system to reduce distribution costs and build a logistics network operation model based on around the B2C electronic commerce enterprise logistics network operation system. B2C electronic commerce transactions features in the enterprise network platform. To solve the NP-hard problem this article use hybrid ant colony algorithm, particle swarm algorithm and group swarm intelligence algorithm to get a best solution. According to the intelligent algorithm, design of electronic commerce logistics network optimization system, enter the national 22 electronic commerce logistics network for validation. Through the experiment to verify the optimized logistics cost greatly decreased. This research can help B2C electronic commerce enterprise logistics network to optimize decision-making under the premise of ensuring the interests of consumers and service levels also can be an effective way for enterprises to improve the efficiency of logistics services and reduce operation costs

  11. Multiobjective Optimization Method Based on Adaptive Parameter Harmony Search Algorithm

    Directory of Open Access Journals (Sweden)

    P. Sabarinath

    2015-01-01

    Full Text Available The present trend in industries is to improve the techniques currently used in design and manufacture of products in order to meet the challenges of the competitive market. The crucial task nowadays is to find the optimal design and machining parameters so as to minimize the production costs. Design optimization involves more numbers of design variables with multiple and conflicting objectives, subjected to complex nonlinear constraints. The complexity of optimal design of machine elements creates the requirement for increasingly effective algorithms. Solving a nonlinear multiobjective optimization problem requires significant computing effort. From the literature it is evident that metaheuristic algorithms are performing better in dealing with multiobjective optimization. In this paper, we extend the recently developed parameter adaptive harmony search algorithm to solve multiobjective design optimization problems using the weighted sum approach. To determine the best weightage set for this analysis, a performance index based on least average error is used to determine the index of each weightage set. The proposed approach is applied to solve a biobjective design optimization of disc brake problem and a newly formulated biobjective design optimization of helical spring problem. The results reveal that the proposed approach is performing better than other algorithms.

  12. Optimization algorithm based characterization scheme for tunable semiconductor lasers.

    Science.gov (United States)

    Chen, Quanan; Liu, Gonghai; Lu, Qiaoyin; Guo, Weihua

    2016-09-01

    In this paper, an optimization algorithm based characterization scheme for tunable semiconductor lasers is proposed and demonstrated. In the process of optimization, the ratio between the power of the desired frequency and the power except of the desired frequency is used as the figure of merit, which approximately represents the side-mode suppression ratio. In practice, we use tunable optical band-pass and band-stop filters to obtain the power of the desired frequency and the power except of the desired frequency separately. With the assistance of optimization algorithms, such as the particle swarm optimization (PSO) algorithm, we can get stable operation conditions for tunable lasers at designated frequencies directly and efficiently. PMID:27607701

  13. Global optimal path planning for mobile robot based on improved Dijkstra algorithm and ant system algorithm

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK graph theory to establish the free space model of the mobile robot, the second step is adopting the improved Dijkstra algorithm to find out a sub-optimal collision-free path, and the third step is using the ant system algorithm to adjust and optimize the location of the sub-optimal path so as to generate the global optimal path for the mobile robot. The computer simulation experiment was carried out and the results show that this method is correct and effective. The comparison of the results confirms that the proposed method is better than the hybrid genetic algorithm in the global optimal path planning.

  14. Comparative performance of an elitist teaching-learning-based optimization algorithm for solving unconstrained optimization problems

    Directory of Open Access Journals (Sweden)

    R. Venkata Rao

    2013-01-01

    Full Text Available Teaching-Learning-based optimization (TLBO is a recently proposed population based algorithm, which simulates the teaching-learning process of the class room. This algorithm requires only the common control parameters and does not require any algorithm-specific control parameters. In this paper, the effect of elitism on the performance of the TLBO algorithm is investigated while solving unconstrained benchmark problems. The effects of common control parameters such as the population size and the number of generations on the performance of the algorithm are also investigated. The proposed algorithm is tested on 76 unconstrained benchmark functions with different characteristics and the performance of the algorithm is compared with that of other well known optimization algorithms. A statistical test is also performed to investigate the results obtained using different algorithms. The results have proved the effectiveness of the proposed elitist TLBO algorithm.

  15. Wireless Sensor Network Path Optimization Based on Hybrid Algorithm

    Directory of Open Access Journals (Sweden)

    Zeyu Sun

    2013-09-01

    Full Text Available One merit of genetic algorithm is fast overall searching, but this algorithm usually results in low efficiency because of large quantities of redundant codes. The advantages of ant colony algorithm are strong suitability and good robustness while its disadvantages are tendency to stagnation, slow speed of convergence. Put forward based on improved ant colony algorithm for wireless sensor network path optimization approach will first need to pass the data in the shortest path for transmission, assuming that transmission path jam, it will clog information sent to the initial position, so the follow-up need to pass data can choose other reasonable path so as to avoid the defects of the traditional method. Genetic ant colony is proposed to avoid the faults of both algorithms above. The proposed algorithm determines distribution of pheromones on path through fast searching and changing the operation of selection operator, crossover operator and mutation operator of genetic ant colony, and then solves the problems efficiently through parallelism, positive feedback and iteration of ant colony algorithm. Therefore, the faults of both algorithms are conquered and the aim of combinational optimization is achieved. At last, the validity and feasibility is demonstrated by means of simulation experiment of traveling salesman problem.  

  16. Optimal design of the heat pipe using TLBO (teaching–learning-based optimization) algorithm

    International Nuclear Information System (INIS)

    Heat pipe is a highly efficient and reliable heat transfer component. It is a closed container designed to transfer a large amount of heat in system. Since the heat pipe operates on a closed two-phase cycle, the heat transfer capacity is greater than for solid conductors. Also, the thermal response time is less than with solid conductors. The three major elemental parts of the rotating heat pipe are: a cylindrical evaporator, a truncated cone condenser, and a fixed amount of working fluid. In this paper, a recently proposed new stochastic advanced optimization algorithm called TLBO (Teaching–Learning-Based Optimization) algorithm is used for single objective as well as multi-objective design optimization of heat pipe. It is easy to implement, does not make use of derivatives and it can be applied to unconstrained or constrained problems. Two examples of heat pipe are presented in this paper. The results of application of TLBO algorithm for the design optimization of heat pipe are compared with the NPGA (Niched Pareto Genetic Algorithm), GEM (Grenade Explosion Method) and GEO (Generalized External optimization). It is found that the TLBO algorithm has produced better results as compared to those obtained by using NPGA, GEM and GEO algorithms. - Highlights: • The TLBO (Teaching–Learning-Based Optimization) algorithm is used for the design and optimization of a heat pipe. • Two examples of heat pipe design and optimization are presented. • The TLBO algorithm is proved better than the other optimization algorithms in terms of results and the convergence

  17. A HYBRID OPTIMIZATION ALGORITHM BASED ON GENETIC ALGORITHM AND ANT COLONY OPTIMIZATION

    Directory of Open Access Journals (Sweden)

    Zainudin Zukhri

    2013-09-01

    Full Text Available In optimization problem, Genetic Algorithm (GA and Ant Colony Optimization Algorithm (ACO have been known as good alternative techniques. GA is designed by adopting the natural evolution process, while ACO is inspired by the foraging behaviour of ant species. This paper presents a hybrid GA-ACO for Travelling Salesman Problem (TSP, called Genetic Ant Colony Optimization (GACO. In this method, GA will observe and preserve the fittest ant in each cycle in every generation and only unvisited cities will be assessed by ACO. From experimental result, GACO performance is significantly improved and its time complexity is fairly equal compared to the GA and ACO.

  18. Routing Optimization Based on Taboo Search Algorithm for Logistic Distribution

    Directory of Open Access Journals (Sweden)

    Hongxue Yang

    2014-04-01

    Full Text Available Along with the widespread application of the electronic commerce in the modern business, the logistic distribution has become increasingly important. More and more enterprises recognize that the logistic distribution plays an important role in the process of production and sales. A good routing for logistic distribution can cut down transport cost and improve efficiency. In order to cut down transport cost and improve efficiency, a routing optimization based on taboo search for logistic distribution is proposed in this paper. Taboo search is a metaheuristic search method to perform local search used for logistic optimization. The taboo search is employed to accelerate convergence and the aspiration criterion is combined with the heuristics algorithm to solve routing optimization. Simulation experimental results demonstrate that the optimal routing in the logistic distribution can be quickly obtained by the taboo search algorithm

  19. Scheme optimization of AT shifting element based on genetic algorithm

    Institute of Scientific and Technical Information of China (English)

    岳会军; 刘艳芳; 马明月; 徐向阳; 王书翰

    2015-01-01

    In order to realize the computer aided design of AT shifting element schemes, a mathematical model of shifting element schemes which can be easily identified by computers was built. Taking the transmission ratio sequence as an optimization objective and simple shifting logic between adjacent gears through operating only one shifting element as a constraint condition, a fitness function of shifting element schemes was proposed. ZF-8AT shifting element schemes were optimized based on GA work-box of MATLAB, and the feasibility of the optimization algorithm was verified.

  20. Optimization Planning based on Improved Ant Colony Algorithm for Robot

    OpenAIRE

    Xin Zhang; Zhanwen Wu

    2014-01-01

    As the ant colony algorithm has the defects in robot optimization path planning such as that low convergence cause local optimum, an improved ant colony algorithm is proposed to apply to the planning of path finding for robot. This algorithm uses the search way of exhumation ant to realize the complementation of advantages and accelerate the convergence of algorithm. The experimental result shows that the algorithm of this paper make the optimization planning of robot more reasonable

  1. Parameter Optimization of Linear Quadratic Controller Based on Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    LI Jimin; SHANG Chaoxuan; ZOU Minghu

    2007-01-01

    The selection of weighting matrix in design of the linear quadratic optimal controller is an important topic in the control theory. In this paper, an approach based on genetic algorithm is presented for selecting the weighting matrix for the optimal controller. Genetic algorithm is adaptive heuristic search algorithm premised on the evolutionary ideas of natural selection and genetic. In this algorithm, the fitness function is used to evaluate individuals and reproductive success varies with fitness. In the design of the linear quadratic optimal controller, the fitness function has relation to the anticipated step response of the system. Not only can the controller designed by this approach meet the demand of the performance indexes of linear quadratic controller, but also satisfy the anticipated step response of close-loop system. The method possesses a higher calculating efficiency and provides technical support for the optimal controller in engineering application. The simulation of a three-order single-input single-output (SISO) system has demonstrated the feasibility and validity of the approach.

  2. GENETIC ALGORITHM BASED CONCEPT DESIGN TO OPTIMIZE NETWORK LOAD BALANCE

    Directory of Open Access Journals (Sweden)

    Ashish Jain

    2012-07-01

    Full Text Available Multiconstraints optimal network load balancing is an NP-hard problem and it is an important part of traffic engineering. In this research we balance the network load using classical method (brute force approach and dynamic programming is used but result shows the limitation of this method but at a certain level we recognized that the optimization of balanced network load with increased number of nodes and demands is intractable using the classical method because the solution set increases exponentially. In such case the optimization techniques like evolutionary techniques can employ for optimizing network load balance. In this paper we analyzed proposed classical algorithm and evolutionary based genetic approach is devise as well as proposed in this paper for optimizing the balance network load.

  3. Sampling-based Algorithms for Optimal Motion Planning

    CERN Document Server

    Karaman, Sertac

    2011-01-01

    During the last decade, sampling-based path planning algorithms, such as Probabilistic RoadMaps (PRM) and Rapidly-exploring Random Trees (RRT), have been shown to work well in practice and possess theoretical guarantees such as probabilistic completeness. However, little effort has been devoted to the formal analysis of the quality of the solution returned by such algorithms, e.g., as a function of the number of samples. The purpose of this paper is to fill this gap, by rigorously analyzing the asymptotic behavior of the cost of the solution returned by stochastic sampling-based algorithms as the number of samples increases. A number of negative results are provided, characterizing existing algorithms, e.g., showing that, under mild technical conditions, the cost of the solution returned by broadly used sampling-based algorithms converges almost surely to a non-optimal value. The main contribution of the paper is the introduction of new algorithms, namely, PRM* and RRT*, which are provably asymptotically opti...

  4. Teaching-learning-based optimization algorithm for unconstrained and constrained real-parameter optimization problems

    Science.gov (United States)

    Rao, R. V.; Savsani, V. J.; Balic, J.

    2012-12-01

    An efficient optimization algorithm called teaching-learning-based optimization (TLBO) is proposed in this article to solve continuous unconstrained and constrained optimization problems. The proposed method is based on the effect of the influence of a teacher on the output of learners in a class. The basic philosophy of the method is explained in detail. The algorithm is tested on 25 different unconstrained benchmark functions and 35 constrained benchmark functions with different characteristics. For the constrained benchmark functions, TLBO is tested with different constraint handling techniques such as superiority of feasible solutions, self-adaptive penalty, ɛ-constraint, stochastic ranking and ensemble of constraints. The performance of the TLBO algorithm is compared with that of other optimization algorithms and the results show the better performance of the proposed algorithm.

  5. Multicast Routing Problem Using Tree-Based Cuckoo Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Mahmood Sardarpour

    2016-06-01

    Full Text Available The problem of QoS multicast routing is to find a multicast tree with the least expense/cost which would meet the limitations such as band width, delay and loss rate. This is a NP-Complete problem. To solve the problem of multicast routing, the entire routes from the source node to every destination node are often recognized. Then the routes are integrated and changed into a single multicast tree. But they are slow and complicated methods. The present paper introduces a new tree-based optimization method to overcome such weaknesses. The recommended method directly optimizes the multicast tree. Therefore a tree-based typology including several spanning trees is created which combines the trees two by two. For this purpose, the Cuckoo Algorithm is used which is proved to be well converged and makes quick calculations. The simulation conducted on different types of network typologies proved that it is a practical and influential algorithm.

  6. Quantum Behaved Particle Swarm Optimization Algorithm Based on Artificial Fish Swarm

    OpenAIRE

    Dong Yumin; Zhao Li

    2014-01-01

    Quantum behaved particle swarm algorithm is a new intelligent optimization algorithm; the algorithm has less parameters and is easily implemented. In view of the existing quantum behaved particle swarm optimization algorithm for the premature convergence problem, put forward a quantum particle swarm optimization algorithm based on artificial fish swarm. The new algorithm based on quantum behaved particle swarm algorithm, introducing the swarm and following activities, meanwhile using the adap...

  7. Genetic based optimization for multicast routing algorithm for MANET

    Indian Academy of Sciences (India)

    C Rajan; N Shanthi

    2015-12-01

    Mobile Ad hoc Network (MANET) is established for a limited period, for special extemporaneous services related to mobile applications. This ad hoc network is set up for a limited period, in environments that change with the application. While in Internet the TCP/IP protocol suite supports a wide range of application, in MANETs protocols are tuned to specific customer/application. Multicasting is emerging as a popular communication format where the same packet is sent to multiple nodes in a network. Routing in multicasting involves maintaining routes and finding new node locations in a group and is NP-complete due to the dynamic nature of the network. In this paper, a Hybrid Genetic Based Optimization for Multicast Routing algorithm is proposed. The proposed algorithm uses the best features of Genetic Algorithm (GA) and particle swarm optimization (PSO) to improve the solution. Simulations were conducted by varying number of mobile nodes and results compared with Multicast AODV (MAODV) protocol, PSO based and GA based solution. The proposed optimization improves jitter, end to end delay and Packet Delivery Ratio (PDR) with faster convergence.

  8. An Energy Consumption Optimized Clustering Algorithm for Radar Sensor Networks Based on an Ant Colony Algorithm

    OpenAIRE

    Ting Jiang; Wei Zang; Chenglin Zhao; Jiong Shi

    2010-01-01

    We optimize the cluster structure to solve problems such as the uneven energy consumption of the radar sensor nodes and random cluster head selection in the traditional clustering routing algorithm. According to the defined cost function for clusters, we present the clustering algorithm which is based on radio-free space path loss. In addition, we propose the energy and distance pheromones based on the residual energy and aggregation of the radar sensor nodes. According to bionic heuristic a...

  9. Composite multiobjective optimization beamforming based on genetic algorithms

    Institute of Scientific and Technical Information of China (English)

    Shi Jing; Meng Weixiao; Zhang Naitong; Wang Zheng

    2006-01-01

    All thc parameters of beamforming are usually optimized simultaneously in implementing the optimization of antenna array pattern with multiple objectives and parameters by genetic algorithms (GAs).Firstly, this paper analyzes the performance of fitness functions of previous algorithms. It shows that original algorithms make the fitness functions too complex leading to large amount of calculation, and also the selection of the weight of parameters very sensitive due to many parameters optimized simultaneously. This paper proposes a kind of algorithm of composite beamforming, which detaches the antenna array into two parts corresponding to optimization of different objective parameters respectively. New algorithm substitutes the previous complex fitness function with two simpler functions. Both theoretical analysis and simulation results show that this method simplifies the selection of weighting parameters and reduces the complexity of calculation. Furthermore, the algorithm has better performance in lowering side lobe and interferences in comparison with conventional algorithms of beamforming in the case of slightly widening the main lobe.

  10. CACONET: Ant Colony Optimization (ACO) Based Clustering Algorithm for VANET.

    Science.gov (United States)

    Aadil, Farhan; Bajwa, Khalid Bashir; Khan, Salabat; Chaudary, Nadeem Majeed; Akram, Adeel

    2016-01-01

    A vehicular ad hoc network (VANET) is a wirelessly connected network of vehicular nodes. A number of techniques, such as message ferrying, data aggregation, and vehicular node clustering aim to improve communication efficiency in VANETs. Cluster heads (CHs), selected in the process of clustering, manage inter-cluster and intra-cluster communication. The lifetime of clusters and number of CHs determines the efficiency of network. In this paper a Clustering algorithm based on Ant Colony Optimization (ACO) for VANETs (CACONET) is proposed. CACONET forms optimized clusters for robust communication. CACONET is compared empirically with state-of-the-art baseline techniques like Multi-Objective Particle Swarm Optimization (MOPSO) and Comprehensive Learning Particle Swarm Optimization (CLPSO). Experiments varying the grid size of the network, the transmission range of nodes, and number of nodes in the network were performed to evaluate the comparative effectiveness of these algorithms. For optimized clustering, the parameters considered are the transmission range, direction and speed of the nodes. The results indicate that CACONET significantly outperforms MOPSO and CLPSO. PMID:27149517

  11. Microwave-based medical diagnosis using particle swarm optimization algorithm

    Science.gov (United States)

    Modiri, Arezoo

    This dissertation proposes and investigates a novel architecture intended for microwave-based medical diagnosis (MBMD). Furthermore, this investigation proposes novel modifications of particle swarm optimization algorithm for achieving enhanced convergence performance. MBMD has been investigated through a variety of innovative techniques in the literature since the 1990's and has shown significant promise in early detection of some specific health threats. In comparison to the X-ray- and gamma-ray-based diagnostic tools, MBMD does not expose patients to ionizing radiation; and due to the maturity of microwave technology, it lends itself to miniaturization of the supporting systems. This modality has been shown to be effective in detecting breast malignancy, and hence, this study focuses on the same modality. A novel radiator device and detection technique is proposed and investigated in this dissertation. As expected, hardware design and implementation are of paramount importance in such a study, and a good deal of research, analysis, and evaluation has been done in this regard which will be reported in ensuing chapters of this dissertation. It is noteworthy that an important element of any detection system is the algorithm used for extracting signatures. Herein, the strong intrinsic potential of the swarm-intelligence-based algorithms in solving complicated electromagnetic problems is brought to bear. This task is accomplished through addressing both mathematical and electromagnetic problems. These problems are called benchmark problems throughout this dissertation, since they have known answers. After evaluating the performance of the algorithm for the chosen benchmark problems, the algorithm is applied to MBMD tumor detection problem. The chosen benchmark problems have already been tackled by solution techniques other than particle swarm optimization (PSO) algorithm, the results of which can be found in the literature. However, due to the relatively high level

  12. CFSO3: A New Supervised Swarm-Based Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Antonino Laudani

    2013-01-01

    Full Text Available We present CFSO3, an optimization heuristic within the class of the swarm intelligence, based on a synergy among three different features of the Continuous Flock-of-Starlings Optimization. One of the main novelties is that this optimizer is no more a classical numerical algorithm since it now can be seen as a continuous dynamic system, which can be treated by using all the mathematical instruments available for managing state equations. In addition, CFSO3 allows passing from stochastic approaches to supervised deterministic ones since the random updating of parameters, a typical feature for numerical swam-based optimization algorithms, is now fully substituted by a supervised strategy: in CFSO3 the tuning of parameters is a priori designed for obtaining both exploration and exploitation. Indeed the exploration, that is, the escaping from a local minimum, as well as the convergence and the refinement to a solution can be designed simply by managing the eigenvalues of the CFSO state equations. Virtually in CFSO3, just the initial values of positions and velocities of the swarm members have to be randomly assigned. Both standard and parallel versions of CFSO3 together with validations on classical benchmarks are presented.

  13. Chaos Time Series Prediction Based on Membrane Optimization Algorithms

    Directory of Open Access Journals (Sweden)

    Meng Li

    2015-01-01

    Full Text Available This paper puts forward a prediction model based on membrane computing optimization algorithm for chaos time series; the model optimizes simultaneously the parameters of phase space reconstruction (τ,m and least squares support vector machine (LS-SVM (γ,σ by using membrane computing optimization algorithm. It is an important basis for spectrum management to predict accurately the change trend of parameters in the electromagnetic environment, which can help decision makers to adopt an optimal action. Then, the model presented in this paper is used to forecast band occupancy rate of frequency modulation (FM broadcasting band and interphone band. To show the applicability and superiority of the proposed model, this paper will compare the forecast model presented in it with conventional similar models. The experimental results show that whether single-step prediction or multistep prediction, the proposed model performs best based on three error measures, namely, normalized mean square error (NMSE, root mean square error (RMSE, and mean absolute percentage error (MAPE.

  14. An Energy Consumption Optimized Clustering Algorithm for Radar Sensor Networks Based on an Ant Colony Algorithm

    Directory of Open Access Journals (Sweden)

    Jiang Ting

    2010-01-01

    Full Text Available We optimize the cluster structure to solve problems such as the uneven energy consumption of the radar sensor nodes and random cluster head selection in the traditional clustering routing algorithm. According to the defined cost function for clusters, we present the clustering algorithm which is based on radio-free space path loss. In addition, we propose the energy and distance pheromones based on the residual energy and aggregation of the radar sensor nodes. According to bionic heuristic algorithm, a new ant colony-based clustering algorithm for radar sensor networks is also proposed. Simulation results show that this algorithm can get a better balance of the energy consumption and then remarkably prolong the lifetime of the radar sensor network.

  15. Extended Range Guided Munition Parameter Optimization Based on Genetic Algorithms

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    Many factors influencing range of extended range guided munition (ERGM) are analyzed. The definition domain of the most important three parameters are ascertained by preparatory mathematical simulation, the optimized mathematical model of ERGM maximum range with boundary conditions is created, and parameter optimization based on genetic algorithm (GA) is adopted. In the GA design, three-point crossover is used and the best chromosome is kept so that the convergence speed becomes rapid. Simulation result shows that GA is feasible, the result is good and it can be easy to attain global optimization solution, especially when the objective function is not the convex one for independent variables and it is a multi-parameter problem.

  16. SNMP Based Network Optimization Technique Using Genetic Algorithms

    Directory of Open Access Journals (Sweden)

    M. Mohamed Surputheen

    2012-03-01

    Full Text Available Genetic Algorithms (GAs has innumerable applications through the optimization techniques and network optimization is one of them. SNMP (Simple Network Management Protocol is used as the basic network protocol for monitoring the network activities health of the systems. This paper deals with adding Intelligence to the various aspects of SNMP by adding optimization techniques derived out of genetic algorithms, which enhances the performance of SNMP processes like routing.

  17. Optimization of Pressurizer Based on Genetic-Simplex Algorithm

    International Nuclear Information System (INIS)

    Pressurizer is one of key components in nuclear power system. It's important to control the dimension in the design of pressurizer through optimization techniques. In this work, a mathematic model of a vertical electric heating pressurizer was established. A new Genetic-Simplex Algorithm (GSA) that combines genetic algorithm and simplex algorithm was developed to enhance the searching ability, and the comparison among modified and original algorithms is conducted by calculating the benchmark function. Furthermore, the optimization design of pressurizer, taking minimization of volume and net weight as objectives, was carried out considering thermal-hydraulic and geometric constraints through GSA. The results indicate that the mathematical model is agreeable for the pressurizer and the new algorithm is more effective than the traditional genetic algorithm. The optimization design shows obvious validity and can provide guidance for real engineering design

  18. Optimal Design of Materials for DJMP Based on Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    FENG Zhong-ren; WANG Xiong-jiang

    2004-01-01

    The genetic algorithm was used in optimal design of deep jet method pile. The cost of deep jetmethod pile in one unit area of foundation was taken as the objective function. All the restrains were listed followingthe corresponding specification. Suggestions were proposed and the modified. The real-coded Genetic Algorithm wasgiven to deal with the problems of excessive computational cost and premature convergence. Software system of opti-mal design of deep jet method pile was developed.

  19. ESSENTIAL MODIFICATIONS ON BIOGEOGRAPHY-BASED OPTIMIZATION ALGORITHM

    Directory of Open Access Journals (Sweden)

    Ali R. Alroomi

    2013-11-01

    Full Text Available Biogeography-based optimization (BBO is a new population-based evolutionary algorithm and is based on an old theory of island biogeography that explains the geographical distribution of biological organisms. BBO was introduced in 2008 and then a lot of modifications were employed to enhance its performance. This paper proposes two modifications; firstly, modifying the probabilistic selection process of the migration and mutation stages to give a fairly randomized selection for all the features of the islands. Secondly, the clear duplication process after the mutation stage is sized to avoid any corruption on the suitability index variables. The obtained results through wide variety range of test functions with different dimensions and complexities proved that the BBO performance can be enhanced effectively without using any complicated form of the immigration and emigration rates. This essential modification has to be considered as an initial step for any other modification.

  20. Parameters optimization on DHSVM model based on a genetic algorithm

    Institute of Scientific and Technical Information of China (English)

    Changqing YAO; Zhifeng YANG

    2009-01-01

    Due to the multiplicity of factors including weather, the underlying surface and human activities, the complexity of parameter optimization for a distributed hydrological model of a watershed land surface goes far beyond the capability of traditional optimization methods. The genetic algorithm is a new attempt to find a solution to this problem. A genetic algorithm design on the Distributed-Hydrology-Soil-Vegetation model (DHSVM) parameter optimization is illustrated in this paper by defining the encoding method, designing the fitness value function, devising the genetic operators, selecting the arithmetic parameters and identifying the arithmetic termination conditions. Finally, a case study of the optimization method is implemented on the Lushi Watershed of the Yellow River Basin and achieves satisfactory results of parameter estimation. The result shows that the genetic algorithm is feasible in optimizing parameters of the DHSVM model.

  1. Genetic Algorithm (GA)-Based Inclinometer Layout Optimization.

    Science.gov (United States)

    Liang, Weijie; Zhang, Ping; Chen, Xianping; Cai, Miao; Yang, Daoguo

    2015-04-17

    This paper presents numerical simulation results of an airflow inclinometer with sensitivity studies and thermal optimization of the printed circuit board (PCB) layout for an airflow inclinometer based on a genetic algorithm (GA). Due to the working principle of the gas sensor, the changes of the ambient temperature may cause dramatic voltage drifts of sensors. Therefore, eliminating the influence of the external environment for the airflow is essential for the performance and reliability of an airflow inclinometer. In this paper, the mechanism of an airflow inclinometer and the influence of different ambient temperatures on the sensitivity of the inclinometer will be examined by the ANSYS-FLOTRAN CFD program. The results show that with changes of the ambient temperature on the sensing element, the sensitivity of the airflow inclinometer is inversely proportional to the ambient temperature and decreases when the ambient temperature increases. GA is used to optimize the PCB thermal layout of the inclinometer. The finite-element simulation method (ANSYS) is introduced to simulate and verify the results of our optimal thermal layout, and the results indicate that the optimal PCB layout greatly improves (by more than 50%) the sensitivity of the inclinometer. The study may be useful in the design of PCB layouts that are related to sensitivity improvement of gas sensors.

  2. Bionic Intelligent Optimization Algorithm Based on MMAS and Fish-Swarm Algorithm

    OpenAIRE

    Jingjing Yang; Benzhen Guo; Jixiang Gou; Xiao Zhang

    2013-01-01

    With large number of ants, the ant colony algorithm would always take a long time or is rather difficult to find the optimal path from complex chapter path, further more, there exists a contradiction between stagnation, accelerated convergence and precocity. In this paper, we propose a new bionic optimization algorithm. The main idea of the algorithm is to introduce the horizons concept in the MMAS fish swarm algorithm, so it would take shorter time to find the optimal path with numerous ants...

  3. Study on Ice Regime Forecast Based on SVR Optimized by Particle Swarm Optimization Algorithm

    Institute of Scientific and Technical Information of China (English)

    WANG; Fu-qiang; RONG; Fei

    2012-01-01

    [Objective] The research aimed to study forecast models for frozen and melted dates of the river water in Ningxia-Inner Mongolia section of the Yellow River based on SVR optimized by particle swarm optimization algorithm. [Method] Correlation analysis and cause analysis were used to select suitable forecast factor combination of the ice regime. Particle swarm optimization algorithm was used to determine the optimal parameter to construct forecast model. The model was used to forecast frozen and melted dates of the river water in Ningxia-Inner Mongolia section of the Yellow River. [Result] The model had high prediction accuracy and short running time. Average forecast error was 3.51 d, and average running time was 10.464 s. Its forecast effect was better than that of the support vector regression optimized by genetic algorithm (GA) and back propagation type neural network (BPNN). It could accurately forecast frozen and melted dates of the river water. [Conclusion] SVR based on particle swarm optimization algorithm could be used for ice regime forecast.

  4. Optimization of Submarine Hydrodynamic Coefficients Based on Immune Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    HU Kun; XU Yi-fan

    2010-01-01

    Aiming at the demand for optimization of hydrodynamic coefficients in submarine's motion equations, an adaptive weight immune genetic algorithm was proposed to optimize hydrodynamic coefficients in motion equations. Some hydrody-namic coefficients of high sensitivity to control and maneuver were chosen as the optimization objects in the algorithm. By using adaptive weight method to determine the weight and target function, the multi-objective optimization could be transla-ted into single-objective optimization. For a certain kind of submarine, three typical maneuvers were chosen to be the objects of study: overshoot maneuver in horizontal plane, overshoot maneuver in vertical plane and turning circle maneuver in horizontal plane. From the results of computer simulations using primal hydrodynamic coefficient and optimized hydrody-namic coefficient, the efficiency of proposed method is proved.

  5. Optimization of heat transfer utilizing graph based evolutionary algorithms

    International Nuclear Information System (INIS)

    This paper examines the use of graph based evolutionary algorithms (GBEAs) for optimization of heat transfer in a complex system. The specific case examined in this paper is the optimization of heat transfer in a biomass cookstove utilizing three-dimensional computational fluid dynamics to generate the fitness function. In this stove hot combustion gases are used to heat a cooking surface. The goal is to provide an even spatial temperature distribution on the cooking surface by redirecting the flow of combustion gases with baffles. The variables in the optimization are the position and size of the baffles, which are described by integer values. GBEAs are a novel type of EA in which a topology or geography is imposed on an evolving population of solutions. The choice of graph controls the rate at which solutions can spread within the population, impacting the diversity of solutions and convergence rate of the EAs. In this study, the choice of graph in the GBEAs changes the number of mating events required for convergence by a factor of approximately 2.25 and the diversity of the population by a factor of 2. These results confirm that by tuning the graph and parameters in GBEAs, computational time can be significantly reduced

  6. An optimization-based iterative algorithm for recovering fluorophore location

    Science.gov (United States)

    Yi, Huangjian; Peng, Jinye; Jin, Chen; He, Xiaowei

    2015-10-01

    Fluorescence molecular tomography (FMT) is a non-invasive technique that allows three-dimensional visualization of fluorophore in vivo in small animals. In practical applications of FMT, however, there are challenges in the image reconstruction since it is a highly ill-posed problem due to the diffusive behaviour of light transportation in tissue and the limited measurement data. In this paper, we presented an iterative algorithm based on an optimization problem for three dimensional reconstruction of fluorescent target. This method alternates weighted algebraic reconstruction technique (WART) with steepest descent method (SDM) for image reconstruction. Numerical simulations experiments and physical phantom experiment are performed to validate our method. Furthermore, compared to conjugate gradient method, the proposed method provides a better three-dimensional (3D) localization of fluorescent target.

  7. Distribution System Optimization Planning Based on Plant Growth Simulation Algorithm

    Institute of Scientific and Technical Information of China (English)

    WANG Chun; CHENG Hao-zhong; HU Ze-chun; WANG Yi

    2008-01-01

    An approach for the integrated optimization of the construction/expansion capacity of high-voltage/medium-voltage (HV/MV) substations and the configuration of MV radial distribution network was presented using plant growth simulation algorithm (PGSA). In the optimization process, fixed costs correspondent to the investment in lines and substations and the variable costs associated to the operation of the system were considered under the constraints of branch capacity, substation capacity and bus voltage. The optimization variables considerably reduce the dimension of variables and speed up the process of optimizing. The effectiveness of the proposed approach was tested by a distribution system planning.

  8. A constrained optimization algorithm based on the simplex search method

    Science.gov (United States)

    Mehta, Vivek Kumar; Dasgupta, Bhaskar

    2012-05-01

    In this article, a robust method is presented for handling constraints with the Nelder and Mead simplex search method, which is a direct search algorithm for multidimensional unconstrained optimization. The proposed method is free from the limitations of previous attempts that demand the initial simplex to be feasible or a projection of infeasible points to the nonlinear constraint boundaries. The method is tested on several benchmark problems and the results are compared with various evolutionary algorithms available in the literature. The proposed method is found to be competitive with respect to the existing algorithms in terms of effectiveness and efficiency.

  9. Improved Ant Colony Optimization Algorithm based Expert System on Nephrology

    Directory of Open Access Journals (Sweden)

    Sri.N.V.Ramana Murty

    2010-07-01

    Full Text Available Expert system Nephrology is a computer program that exhibits, within a specific domain, a degree of expertise in problem solving that is comparable to that of a human expert. The knowledge base consistsof information about a particular problem area. This information is collected from domain experts (doctors. This system mainly contains two modules one is Information System and the other is Expert Advisory system. The Information System contains the static information about different diseases and drugs in the field of Nephrology. This information system helps the patients /users to know about the problems related to kidneys. The Nephrology Advisory system helps the Patients /users to get the required and suitable advice depending on their queries. This medical expert system is developedusing Java Server Pages (JSP as front-end and MYSQL database as Backend in such a way that all the activities are carried out in a user-friendly manner. Improved Ant Colony Optimization Algorithm (ACO along with RETE algorithm is also used for better results.

  10. Graph-based optimization algorithm and software on kidney exchanges.

    Science.gov (United States)

    Chen, Yanhua; Li, Yijiang; Kalbfleisch, John D; Zhou, Yan; Leichtman, Alan; Song, Peter X-K

    2012-07-01

    Kidney transplantation is typically the most effective treatment for patients with end-stage renal disease. However, the supply of kidneys is far short of the fast-growing demand. Kidney paired donation (KPD) programs provide an innovative approach for increasing the number of available kidneys. In a KPD program, willing but incompatible donor-candidate pairs may exchange donor organs to achieve mutual benefit. Recently, research on exchanges initiated by altruistic donors (ADs) has attracted great attention because the resultant organ exchange mechanisms offer advantages that increase the effectiveness of KPD programs. Currently, most KPD programs focus on rule-based strategies of prioritizing kidney donation. In this paper, we consider and compare two graph-based organ allocation algorithms to optimize an outcome-based strategy defined by the overall expected utility of kidney exchanges in a KPD program with both incompatible pairs and ADs. We develop an interactive software-based decision support system to model, monitor, and visualize a conceptual KPD program, which aims to assist clinicians in the evaluation of different kidney allocation strategies. Using this system, we demonstrate empirically that an outcome-based strategy for kidney exchanges leads to improvement in both the quantity and quality of kidney transplantation through comprehensive simulation experiments. PMID:22542649

  11. Ant Colony Optimization Algorithm for Continuous Domains Based on Position Distribution Model of Ant Colony Foraging

    OpenAIRE

    Liqiang Liu; Yuntao Dai; Jinyu Gao

    2014-01-01

    Ant colony optimization algorithm for continuous domains is a major research direction for ant colony optimization algorithm. In this paper, we propose a distribution model of ant colony foraging, through analysis of the relationship between the position distribution and food source in the process of ant colony foraging. We design a continuous domain optimization algorithm based on the model and give the form of solution for the algorithm, the distribution model of pheromone, the update rules...

  12. Bionic Intelligent Optimization Algorithm Based on MMAS and Fish-Swarm Algorithm

    Directory of Open Access Journals (Sweden)

    Jingjing Yang

    2013-09-01

    Full Text Available With large number of ants, the ant colony algorithm would always take a long time or is rather difficult to find the optimal path from complex chapter path, further more, there exists a contradiction between stagnation, accelerated convergence and precocity. In this paper, we propose a new bionic optimization algorithm. The main idea of the algorithm is to introduce the horizons concept in the MMAS fish swarm algorithm, so it would take shorter time to find the optimal path with numerous ants, and the introduction of the concept of fish swarm algorithm congestion level would enable the ant colony find the path of global optimization with a strong crowding limit which avoids the emergence of local extreme and improves the accuracy and efficiency of the algorithm.

  13. CUDA Based Speed Optimization of the PCA Algorithm

    Directory of Open Access Journals (Sweden)

    Salih Görgünoğlu

    2016-05-01

    Full Text Available Principal Component Analysis (PCA is an algorithm involving heavy mathematical operations with matrices. The data extracted from the face images are usually very large and to process this data is time consuming. To reduce the execution time of these operations, parallel programming techniques are used. CUDA is a multipurpose parallel programming architecture supported by graphics cards. In this study we have implemented the PCA algorithm using both the classical programming approach and CUDA based implementation using different configurations. The algorithm is subdivided into its constituent calculation steps and evaluated for the positive effects of parallelization on each step. Therefore, the parts of the algorithm that cannot be improved by parallelization are identified. On the other hand, it is also shown that, with CUDA based approach dramatic improvements in the overall performance of the algorithm arepossible.

  14. Optimization of a Fuzzy-Logic-Control-Based MPPT Algorithm Using the Particle Swarm Optimization Technique

    Directory of Open Access Journals (Sweden)

    Po-Chen Cheng

    2015-06-01

    Full Text Available In this paper, an asymmetrical fuzzy-logic-control (FLC-based maximum power point tracking (MPPT algorithm for photovoltaic (PV systems is presented. Two membership function (MF design methodologies that can improve the effectiveness of the proposed asymmetrical FLC-based MPPT methods are then proposed. The first method can quickly determine the input MF setting values via the power–voltage (P–V curve of solar cells under standard test conditions (STC. The second method uses the particle swarm optimization (PSO technique to optimize the input MF setting values. Because the PSO approach must target and optimize a cost function, a cost function design methodology that meets the performance requirements of practical photovoltaic generation systems (PGSs is also proposed. According to the simulated and experimental results, the proposed asymmetrical FLC-based MPPT method has the highest fitness value, therefore, it can successfully address the tracking speed/tracking accuracy dilemma compared with the traditional perturb and observe (P&O and symmetrical FLC-based MPPT algorithms. Compared to the conventional FLC-based MPPT method, the obtained optimal asymmetrical FLC-based MPPT can improve the transient time and the MPPT tracking accuracy by 25.8% and 0.98% under STC, respectively.

  15. Optimization of Actuators in Smart Truss Based on Genetic Algorithms

    Directory of Open Access Journals (Sweden)

    Ruizhen Gao

    2012-11-01

    Full Text Available Actuators formed from piezoelectric ceramics were embedded in truss rods to make up active rods. The paper used mechanical knowledge, static stiffness method and the finite element method to analyze the active rod and the smart truss structure and then model them. In order to solve the difficult problem of number optimization, the paper put forward the actuator existence variable and optimized number and locations of actuators at the same time, made the structure have the best output effect, so it can reduce the displacement at the designated location of the truss structure and the structure vibration. It also can improve the truss structure accuracy. Then find the optimal solution by genetic algorithms(GA) and MATLAB programming. The results of the example show that the model this paper builds is correct and genetic algorithms are effective in solving the optimization question.  

  16. Optimization Route of Food Logistics Distribution Based on Genetic and Graph Cluster Scheme Algorithm

    Directory of Open Access Journals (Sweden)

    Jing Chen

    2015-06-01

    Full Text Available This study takes the concept of food logistics distribution as the breakthrough point, by means of the aim of optimization of food logistics distribution routes and analysis of the optimization model of food logistics route, as well as the interpretation of the genetic algorithm, it discusses the optimization of food logistics distribution route based on genetic and cluster scheme algorithm.

  17. Decomposition Techniques and Effective Algorithms in Reliability-Based Optimization

    DEFF Research Database (Denmark)

    Enevoldsen, I.; Sørensen, John Dalsgaard

    1995-01-01

    The common problem of an extensive number of limit state function calculations in the various formulations and applications of reliability-based optimization is treated. It is suggested to use a formulation based on decomposition techniques so the nested two-level optimization problem can be solved...

  18. Routing Optimization for Wireless Sensor Network Based on Cloud Adaptive Particle Swarm Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Xu Bao

    2013-11-01

    Full Text Available One of the most important targets of routing algorithm for Wireless Sensor Network (WSN is to prolong the network lifetime. Aimed at the features of WSN, a new routing optimization approach based on cloud adaptive particle swarm optimization algorithm is put forward in this paper. All paths appear at the same time in one round are fused in one particle, and the coding rule of particle is set down. The particle itself is defined as its position, the number of replaceable relay nodes in paths is defined as the velocity of particle. Cloud algorithm is used to optimize the inertia weight of particle. Optimize rules are laid out, and both residual energy of nodes and variance of all paths’ length are considered in objective function. Simulations find out the best value of balance factor in objective function, also prove that this approach can control the energy consumption of network, enhance the viability of nodes, and prolong the lifetime of network.  

  19. Rolling optimization algorithm based on collision window for single machine scheduling problem

    Institute of Scientific and Technical Information of China (English)

    Wang Changjun; Xi Yugeng

    2005-01-01

    Focusing on the single machine scheduling problem which minimizes the total completion time in the presence of dynamic job arrivals, a rolling optimization scheduling algorithm is proposed based on the analysis of the character and structure of scheduling. An optimal scheduling strategy in collision window is presented. Performance evaluation of this algorithm is given. Simulation indicates that the proposed algorithm is better than other common heuristic algorithms on both the total performance and stability.

  20. Optimal Power Allocation Algorithm for Radar Network Systems Based on Low Probability of Intercept Optimization(in English

    Directory of Open Access Journals (Sweden)

    Shi Chen-guang

    2014-08-01

    Full Text Available A novel optimal power allocation algorithm for radar network systems is proposed for Low Probability of Intercept (LPI technology in modern electronic warfare. The algorithm is based on the LPI optimization. First, the Schleher intercept factor for a radar network is derived, and then the Schleher intercept factor is minimized by optimizing the transmission power allocation among netted radars in the network to guarantee target-tracking performance. Furthermore, the Nonlinear Programming Genetic Algorithm (NPGA is used to solve the resulting nonconvex, nonlinear, and constrained optimization problem. Numerical simulation results show the effectiveness of the proposed algorithm.

  1. An Evolutionary Algorithm to Optimization of Discrete Problem Based on Pheromone

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    The pheromone based positive feedback approach of ant algorithmis int r oduced in evolutionary computation of discrete problem, so as to accomplish the optimization of each allele. It ensures stable converge of the algorithm into global optimum. The optimal cutting problem is studied as an example to analyze the performance of the algorithm. The experimental results show the novel performa nce of the algorithm in the optimization of discrete problem.

  2. Design of SVC Controller Based on Improved Biogeography-Based Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Feifei Dong

    2014-01-01

    Full Text Available Considering that common subsynchronous resonance controllers cannot adapt to the characteristics of the time-varying and nonlinear behavior of a power system, the cosine migration model, the improved migration operator, and the mutative scale of chaos and Cauchy mutation strategy are introduced into an improved biogeography-based optimization (IBBO algorithm in order to design an optimal subsynchronous damping controller based on the mechanism of suppressing SSR by static var compensator (SVC. The effectiveness of the improved controller is verified by eigenvalue analysis and electromagnetic simulations. The simulation results of Jinjie plant indicate that the subsynchronous damping controller optimized by the IBBO algorithm can remarkably improve the damping of torsional modes and thus effectively depress SSR, and ensure the safety and stability of units and power grid operation. Moreover, the IBBO algorithm has the merits of a faster searching speed and higher searching accuracy in seeking the optimal control parameters over traditional algorithms, such as BBO algorithm, PSO algorithm, and GA algorithm.

  3. Optimization-Based Image Segmentation by Genetic Algorithms

    Directory of Open Access Journals (Sweden)

    Rosenberger C

    2008-01-01

    Full Text Available Abstract Many works in the literature focus on the definition of evaluation metrics and criteria that enable to quantify the performance of an image processing algorithm. These evaluation criteria can be used to define new image processing algorithms by optimizing them. In this paper, we propose a general scheme to segment images by a genetic algorithm. The developed method uses an evaluation criterion which quantifies the quality of an image segmentation result. The proposed segmentation method can integrate a local ground truth when it is available in order to set the desired level of precision of the final result. A genetic algorithm is then used in order to determine the best combination of information extracted by the selected criterion. Then, we show that this approach can either be applied for gray-levels or multicomponents images in a supervised context or in an unsupervised one. Last, we show the efficiency of the proposed method through some experimental results on several gray-levels and multicomponents images.

  4. Ant colony optimization algorithm for continuous domains based on position distribution model of ant colony foraging.

    Science.gov (United States)

    Liu, Liqiang; Dai, Yuntao; Gao, Jinyu

    2014-01-01

    Ant colony optimization algorithm for continuous domains is a major research direction for ant colony optimization algorithm. In this paper, we propose a distribution model of ant colony foraging, through analysis of the relationship between the position distribution and food source in the process of ant colony foraging. We design a continuous domain optimization algorithm based on the model and give the form of solution for the algorithm, the distribution model of pheromone, the update rules of ant colony position, and the processing method of constraint condition. Algorithm performance against a set of test trials was unconstrained optimization test functions and a set of optimization test functions, and test results of other algorithms are compared and analyzed to verify the correctness and effectiveness of the proposed algorithm. PMID:24955402

  5. Scheduling Optimization of Construction Engineering based on Ant Colony Optimized Hybrid Genetic Algorithm

    OpenAIRE

    Li Hui; Zhang Jingxiao; Ren Lieyan; Shi Zhen

    2013-01-01

    In this paper, the basic theory and procedure for working out solutions of ant colony genetic algorithm were first introduced; the optimization, constraints and objectives of construction project scheduling were described; then a basic model for optimization of construction project scheduling was established; and an improved ant colony genetic algorithm for solving the basic model was put forward. Performance of ant colony genetic algorithm was analyzed and evaluated from the aspect of schedu...

  6. Design of SVC Controller Based on Improved Biogeography-Based Optimization Algorithm

    OpenAIRE

    Feifei Dong; Dichen Liu; Jun Wu; Bingcheng Cen; Haolei Wang; Chunli Song; Lina Ke

    2014-01-01

    Considering that common subsynchronous resonance controllers cannot adapt to the characteristics of the time-varying and nonlinear behavior of a power system, the cosine migration model, the improved migration operator, and the mutative scale of chaos and Cauchy mutation strategy are introduced into an improved biogeography-based optimization (IBBO) algorithm in order to design an optimal subsynchronous damping controller based on the mechanism of suppressing SSR by static var compensator (SV...

  7. Global path planning approach based on ant colony optimization algorithm

    Institute of Scientific and Technical Information of China (English)

    WEN Zhi-qiang; CAI Zi-xing

    2006-01-01

    Ant colony optimization (ACO) algorithm was modified to optimize the global path. In order to simulate the real ant colonies, according to the foraging behavior of ant colonies and the characteristic of food, conceptions of neighboring area and smell area were presented. The former can ensure the diversity of paths and the latter ensures that each ant can reach the goal. Then the whole path was divided into three parts and ACO was used to search the second part path. When the three parts pathes were adjusted,the final path was found. The valid path and invalid path were defined to ensure the path valid. Finally, the strategies of the pheromone search were applied to search the optimum path. However, when only the pheromone was used to search the optimum path, ACO converges easily. In order to avoid this premature convergence, combining pheromone search and random search, a hybrid ant colony algorithm(HACO) was used to find the optimum path. The comparison between ACO and HACO shows that HACO can be used to find the shortest path.

  8. The optimal time-frequency atom search based on a modified ant colony algorithm

    Institute of Scientific and Technical Information of China (English)

    GUO Jun-feng; LI Yan-jun; YU Rui-xing; ZHANG Ke

    2008-01-01

    In this paper,a new optimal time-frequency atom search method based on a modified ant colony algorithm is proposed to improve the precision of the traditional methods.First,the discretization formula of finite length time-frequency atom is inferred at length.Second; a modified ant colony algorithm in continuous space is proposed.Finally,the optimal timefrequency atom search algorithm based on the modified ant colony algorithm is described in detail and the simulation experiment is carried on.The result indicates that the developed algorithm is valid and stable,and the precision of the method is higher than that of the traditional method.

  9. Design Genetic Algorithm Optimization Education Software Based Fuzzy Controller for a Tricopter Fly Path Planning

    Science.gov (United States)

    Tran, Huu-Khoa; Chiou, Juing -Shian; Peng, Shou-Tao

    2016-01-01

    In this paper, the feasibility of a Genetic Algorithm Optimization (GAO) education software based Fuzzy Logic Controller (GAO-FLC) for simulating the flight motion control of Unmanned Aerial Vehicles (UAVs) is designed. The generated flight trajectories integrate the optimized Scaling Factors (SF) fuzzy controller gains by using GAO algorithm. The…

  10. A multi-objective improved teaching-learning based optimization algorithm for unconstrained and constrained optimization problems

    Directory of Open Access Journals (Sweden)

    R. Venkata Rao

    2014-01-01

    Full Text Available The present work proposes a multi-objective improved teaching-learning based optimization (MO-ITLBO algorithm for unconstrained and constrained multi-objective function optimization. The MO-ITLBO algorithm is the improved version of basic teaching-learning based optimization (TLBO algorithm adapted for multi-objective problems. The basic TLBO algorithm is improved to enhance its exploration and exploitation capacities by introducing the concept of number of teachers, adaptive teaching factor, tutorial training and self-motivated learning. The MO-ITLBO algorithm uses a grid-based approach to adaptively assess the non-dominated solutions (i.e. Pareto front maintained in an external archive. The performance of the MO-ITLBO algorithm is assessed by implementing it on unconstrained and constrained test problems proposed for the Congress on Evolutionary Computation 2009 (CEC 2009 competition. The performance assessment is done by using the inverted generational distance (IGD measure. The IGD measures obtained by using the MO-ITLBO algorithm are compared with the IGD measures of the other state-of-the-art algorithms available in the literature. Finally, Lexicographic ordering is used to assess the overall performance of competitive algorithms. Results have shown that the proposed MO-ITLBO algorithm has obtained the 1st rank in the optimization of unconstrained test functions and the 3rd rank in the optimization of constrained test functions.

  11. A ROBUST PHASE-ONLY DIRECT DATA DOMAIN ALGORITHM BASED ON GENERALIZED RAYLEIGH QUOTIENT OPTIMIZATION USING HYBRID GENETIC ALGORITHM

    Institute of Scientific and Technical Information of China (English)

    Shao Wei; Qian Zuping; Yuan Feng

    2007-01-01

    A robust phase-only Direct Data Domain Least Squares (D3LS) algorithm based on generalized Rayleigh quotient optimization using hybrid Genetic Algorithm (GA) is presented in this letter. The optimization efficiency and computational speed are improved via the hybrid GA composed of standard GA and Nelder-Mead simplex algorithms. First, the objective function, with a form of generalized Rayleigh quotient, is derived via the standard D3LS algorithm. It is then taken as a fitness function and the unknown phases of all adaptive weights are taken as decision variables.Then, the nonlinear optimization is performed via the hybrid GA to obtain the optimized solution of phase-only adaptive weights. As a phase-only adaptive algorithm, the proposed algorithm is simpler than conventional algorithms when it comes to hardware implementation. Moreover, it processes only a single snapshot data as opposed to forming sample covariance matrix and operating matrix inversion. Simulation results show that the proposed algorithm has a good signal recovery and interferences nulling performance, which are superior to that of the phase-only D3LS algorithm based on standard GA.

  12. Optimization algorithm of digital watermarking anti-coalition attacks in DWT-domain based on genetic algorithm

    Science.gov (United States)

    Que, Dashun; Li, Gang; Yue, Peng

    2007-12-01

    An adaptive optimization watermarking algorithm based on Genetic Algorithm (GA) and discrete wavelet transform (DWT) is proposed in this paper. The core of this algorithm is the fitness function optimization model for digital watermarking based on GA. The embedding intensity for digital watermarking can be modified adaptively, and the algorithm can effectively ensure the imperceptibility of watermarking while the robustness is ensured. The optimization model research may provide a new idea for anti-coalition attacks of digital watermarking algorithm. The paper has fulfilled many experiments, including the embedding and extracting experiments of watermarking, the influence experiments by the weighting factor, the experiments of embedding same watermarking to the different cover image, the experiments of embedding different watermarking to the same cover image, the comparative analysis experiments between this optimization algorithm and human visual system (HVS) algorithm and etc. The simulation results and the further analysis show the effectiveness and advantage of the new algorithm, which also has versatility and expandability. And meanwhile it has better ability of anti-coalition attacks. Moreover, the robustness and security of watermarking algorithm are improved by scrambling transformation and chaotic encryption while preprocessing the watermarking.

  13. Pixel-based ant colony algorithm for source mask optimization

    Science.gov (United States)

    Kuo, Hung-Fei; Wu, Wei-Chen; Li, Frederick

    2015-03-01

    Source mask optimization (SMO) was considered to be one of the key resolution enhancement techniques for node technology below 20 nm prior to the availability of extreme-ultraviolet tools. SMO has been shown to enlarge the process margins for the critical layer in SRAM and memory cells. In this study, a new illumination shape optimization approach was developed on the basis of the ant colony optimization (ACO) principle. The use of this heuristic pixel-based ACO method in the SMO process provides an advantage over the extant SMO method because of the gradient of the cost function associated with the rapid and stable searching capability of the proposed method. This study was conducted to provide lithographic engineers with references for the quick determination of the optimal illumination shape for complex mask patterns. The test pattern used in this study was a contact layer for SRAM design, with a critical dimension and a minimum pitch of 55 and 110 nm, respectively. The optimized freeform source shape obtained using the ACO method was numerically verified by performing an aerial image investigation, and the result showed that the optimized freeform source shape generated an aerial image profile different from the nominal image profile and with an overall error rate of 9.64%. Furthermore, the overall average critical shape difference was determined to be 1.41, which was lower than that for the other off-axis illumination exposure. The process window results showed an improvement in exposure latitude (EL) and depth of focus (DOF) for the ACO-based freeform source shape compared with those of the Quasar source shape. The maximum EL of the ACO-based freeform source shape reached 7.4% and the DOF was 56 nm at an EL of 5%.

  14. Ant-Based Phylogenetic Reconstruction (ABPR): A new distance algorithm for phylogenetic estimation based on ant colony optimization

    OpenAIRE

    Karla Vittori; Alexandre C B Delbem; Pereira, Sérgio L

    2008-01-01

    We propose a new distance algorithm for phylogenetic estimation based on Ant Colony Optimization (ACO), named Ant-Based Phylogenetic Reconstruction (ABPR). ABPR joins two taxa iteratively based on evolutionary distance among sequences, while also accounting for the quality of the phylogenetic tree built according to the total length of the tree. Similar to optimization algorithms for phylogenetic estimation, the algorithm allows exploration of a larger set of nearly optimal solutions. We appl...

  15. The Role of Vertex Consistency in Sampling-based Algorithms for Optimal Motion Planning

    CERN Document Server

    Arslan, Oktay

    2012-01-01

    Motion planning problems have been studied by both the robotics and the controls research communities for a long time, and many algorithms have been developed for their solution. Among them, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), and the Probabilistic Road Maps (PRMs) have become very popular recently, owing to their implementation simplicity and their advantages in handling high-dimensional problems. Although these algorithms work very well in practice, the quality of the computed solution is often not good, i.e., the solution can be far from the optimal one. A recent variation of RRT, namely the RRT* algorithm, bypasses this drawback of the traditional RRT algorithm, by ensuring asymptotic optimality as the number of samples tends to infinity. Nonetheless, the convergence rate to the optimal solution may still be slow. This paper presents a new incremental sampling-based motion planning algorithm based on Rapidly-exploring Random Graphs (RRG...

  16. An asynchronous metamodel-assisted memetic algorithm for CFD-based shape optimization

    Science.gov (United States)

    Kontoleontos, Evgenia A.; Asouti, Varvara G.; Giannakoglou, Kyriakos C.

    2012-02-01

    This article presents an asynchronous metamodel-assisted memetic algorithm for the solution of CFD-based optimization problems. This algorithm is appropriate for use on multiprocessor platforms and may solve computationally expensive optimization problems in reduced wall-clock time, compared to conventional evolutionary or memetic algorithms. It is, in fact, a hybridization of non-generation-based (asynchronous) evolutionary algorithms, assisted by surrogate evaluation models, a local search method and the Lamarckian learning process. For the objective function gradient computation, in CFD applications, the adjoint method is used. Issues concerning the 'smart' implementation of local search in multi-objective problems are discussed. In this respect, an algorithmic scheme for reducing the number of calls to the adjoint equations to just one, irrespective of the number of objectives, is proposed. The algorithm is applied to the CFD-based shape optimization of the tubes of a heat exchanger and of a turbomachinery cascade.

  17. A priority-based heuristic algorithm (PBHA) for optimizing integrated process planning and scheduling problem

    OpenAIRE

    Muhammad Farhan Ausaf; Liang Gao; Xinyu Li; Ghiath Al Aqel

    2015-01-01

    Process planning and scheduling are two important components of a manufacturing setup. It is important to integrate them to achieve better global optimality and improved system performance. To find optimal solutions for integrated process planning and scheduling (IPPS) problem, numerous algorithm-based approaches exist. Most of these approaches try to use existing meta-heuristic algorithms for solving the IPPS problem. Although these approaches have been shown to be effective in optimizing th...

  18. A hybrid multi-agent based particle swarm optimization algorithm for economic power dispatch

    Energy Technology Data Exchange (ETDEWEB)

    Kumar, Rajesh; Sharma, Devendra; Sadu, Abhinav [Department of Electrical Engineering, Malaviya National Institute of Technology, Jaipur 302 017 (India)

    2011-01-15

    This paper presents a new multi-agent based hybrid particle swarm optimization technique (HMAPSO) applied to the economic power dispatch. The earlier PSO suffers from tuning of variables, randomness and uniqueness of solution. The algorithm integrates the deterministic search, the Multi-agent system (MAS), the particle swarm optimization (PSO) algorithm and the bee decision-making process. Thus making use of deterministic search, multi-agent and bee PSO, the HMAPSO realizes the purpose of optimization. The economic power dispatch problem is a non-linear constrained optimization problem. Classical optimization techniques like direct search and gradient methods fails to give the global optimum solution. Other Evolutionary algorithms provide only a good enough solution. To show the capability, the proposed algorithm is applied to two cases 13 and 40 generators, respectively. The results show that this algorithm is more accurate and robust in finding the global optimum than its counterparts. (author)

  19. Simulated Annealing-Based Krill Herd Algorithm for Global Optimization

    Directory of Open Access Journals (Sweden)

    Gai-Ge Wang

    2013-01-01

    Full Text Available Recently, Gandomi and Alavi proposed a novel swarm intelligent method, called krill herd (KH, for global optimization. To enhance the performance of the KH method, in this paper, a new improved meta-heuristic simulated annealing-based krill herd (SKH method is proposed for optimization tasks. A new krill selecting (KS operator is used to refine krill behavior when updating krill’s position so as to enhance its reliability and robustness dealing with optimization problems. The introduced KS operator involves greedy strategy and accepting few not-so-good solutions with a low probability originally used in simulated annealing (SA. In addition, a kind of elitism scheme is used to save the best individuals in the population in the process of the krill updating. The merits of these improvements are verified by fourteen standard benchmarking functions and experimental results show that, in most cases, the performance of this improved meta-heuristic SKH method is superior to, or at least highly competitive with, the standard KH and other optimization methods.

  20. Identification of Dynamic Parameters Based on Pseudo-Parallel Ant Colony Optimization Algorithm

    Institute of Scientific and Technical Information of China (English)

    ZHAO Feng-yao; MA Zhen-yue; ZHANG Yun-liang

    2007-01-01

    For the parameter identification of dynamic problems, a pseudo-parallel ant colony optimization (PPACO) algorithm based on graph-based ant system (AS) was introduced. On the platform of ANSYS dynamic analysis, the PPACO algorithm was applied to the identification of dynamic parameters successfully. Using simulated data of forces and displacements, elastic modulus E and damping ratio ξ was identified for a designed 3D finite element model, and the detailed identification step was given. Mathematical example and simulation example show that the proposed method has higher precision, faster convergence speed and stronger antinoise ability compared with the standard genetic algorithm and the ant colony optimization (ACO) algorithms.

  1. Time Reversal Reconstruction Algorithm Based on PSO Optimized SVM Interpolation for Photoacoustic Imaging

    Directory of Open Access Journals (Sweden)

    Mingjian Sun

    2015-01-01

    Full Text Available Photoacoustic imaging is an innovative imaging technique to image biomedical tissues. The time reversal reconstruction algorithm in which a numerical model of the acoustic forward problem is run backwards in time is widely used. In the paper, a time reversal reconstruction algorithm based on particle swarm optimization (PSO optimized support vector machine (SVM interpolation method is proposed for photoacoustics imaging. Numerical results show that the reconstructed images of the proposed algorithm are more accurate than those of the nearest neighbor interpolation, linear interpolation, and cubic convolution interpolation based time reversal algorithm, which can provide higher imaging quality by using significantly fewer measurement positions or scanning times.

  2. Optimal design of hydraulic manifold blocks based on niching genetic simulated annealing algorithm

    Institute of Scientific and Technical Information of China (English)

    Jia Chunqiang; Yu Ling; Tian Shujun; Gao Yanming

    2007-01-01

    To solve the combinatorial optimization problem of outer layout and inner connection integrated schemes in the design of hydraulic manifold blocks(HMB),a hybrid genetic simulated annealing algorithm based on niche technology is presented.This hybrid algorithm,which combines genetic algorithm,simulated annealing algorithm and niche technology,has a strong capability in global and local search,and all extrema can be found in a short time without strict requests for preferences.For the complex restricted solid spatial layout problems in HMB,the optimizing mathematical model is presented.The key technologies in the integrated layout and connection design of HMB,including the realization of coding,annealing operation and genetic operation,are discussed.The framework of HMB optimal design system based on hybrid optimization strategy is proposed.An example is given to testify the effectiveness and feasibility of the algorithm.

  3. Optimized Laplacian image sharpening algorithm based on graphic processing unit

    Science.gov (United States)

    Ma, Tinghuai; Li, Lu; Ji, Sai; Wang, Xin; Tian, Yuan; Al-Dhelaan, Abdullah; Al-Rodhaan, Mznah

    2014-12-01

    In classical Laplacian image sharpening, all pixels are processed one by one, which leads to large amount of computation. Traditional Laplacian sharpening processed on CPU is considerably time-consuming especially for those large pictures. In this paper, we propose a parallel implementation of Laplacian sharpening based on Compute Unified Device Architecture (CUDA), which is a computing platform of Graphic Processing Units (GPU), and analyze the impact of picture size on performance and the relationship between the processing time of between data transfer time and parallel computing time. Further, according to different features of different memory, an improved scheme of our method is developed, which exploits shared memory in GPU instead of global memory and further increases the efficiency. Experimental results prove that two novel algorithms outperform traditional consequentially method based on OpenCV in the aspect of computing speed.

  4. A Sequential Optimization Algorithm Using Metamodel-Based Multilevel Analysis

    Energy Technology Data Exchange (ETDEWEB)

    Baek, Seok Heum; Joo, Won Sik [Dong-A University, Busan (Korea, Republic of); Kim, Kang Min [Sunwoo CS, Haman (Korea, Republic of); Cho, Seok Swoo; Jang, Deuk Yul [Kangwon National University, Samcheok (Korea, Republic of)

    2009-09-15

    An efficient sequential optimization approach for metamodel was presented by Choi et al.(13) This paper describes a new approach of the multilevel optimization method studied in Refs. The basic idea is concerned with multilevel iterative methods which combine a descent scheme with a hierarchy of auxiliary problems in lower dimensional subspaces. After fitting a metamodel based on an initial space filling design, this model is sequentially refined by the expected improvement criterion. The advantages of the method are that it does not require optimum sensitivities, nonlinear equality constraints are not needed, and the method is relatively easy to understand and use. As a check on effectiveness, the proposed method is applied to an engineering example.

  5. Optimal control of switched linear systems based on Migrant Particle Swarm Optimization algorithm

    Science.gov (United States)

    Xie, Fuqiang; Wang, Yongji; Zheng, Zongzhun; Li, Chuanfeng

    2009-10-01

    The optimal control problem for switched linear systems with internally forced switching has more constraints than with externally forced switching. Heavy computations and slow convergence in solving this problem is a major obstacle. In this paper we describe a new approach for solving this problem, which is called Migrant Particle Swarm Optimization (Migrant PSO). Imitating the behavior of a flock of migrant birds, the Migrant PSO applies naturally to both continuous and discrete spaces, in which definitive optimization algorithm and stochastic search method are combined. The efficacy of the proposed algorithm is illustrated via a numerical example.

  6. An optimized outlier detection algorithm for jury-based grading of engineering design projects

    DEFF Research Database (Denmark)

    Thompson, Mary Kathryn; Espensen, Christina; Clemmensen, Line Katrine Harder

    2016-01-01

    This work characterizes and optimizes an outlier detection algorithm to identify potentially invalid scores produced by jury members while grading engineering design projects. The paper describes the original algorithm and the associated adjudication process in detail. The impact of the various...... conditions in the algorithm on the false positive and false negative rates is explored. Aresponse surface design is performed to optimize the algorithm using a data set from Fall 2010. Finally, the results are tested against a data set from Fall 2011. It is shown that all elements of the original algorithm...... (the base rule and the three additional conditions) play a role in the algorithm's performance and should be included in the algorithm. Because there is significant interaction between the base rule and the additional conditions, many acceptable combinations that balance the FPR and FNR can be found...

  7. Optimization of unit commitment based on genetic algorithms

    Institute of Scientific and Technical Information of China (English)

    蔡兴国; 初壮

    2002-01-01

    How to solve unit commitment and load dispatch of power system by genetic algorithms is discussed in this paper. A combination encoding scheme of binary encoding and floating number encoding and corresponding genetic operators are developed. Meanwhile a contract mapping genetic algorithm is used to enhance traditional GA' s convergence. The result of a practical example shows that this algorithm is effective.

  8. Function Optimization and Parameter Performance Analysis Based on Gravitation Search Algorithm

    Directory of Open Access Journals (Sweden)

    Jie-Sheng Wang

    2015-12-01

    Full Text Available The gravitational search algorithm (GSA is a kind of swarm intelligence optimization algorithm based on the law of gravitation. The parameter initialization of all swarm intelligence optimization algorithms has an important influence on the global optimization ability. Seen from the basic principle of GSA, the convergence rate of GSA is determined by the gravitational constant and the acceleration of the particles. The optimization performances on six typical test functions are verified by the simulation experiments. The simulation results show that the convergence speed of the GSA algorithm is relatively sensitive to the setting of the algorithm parameters, and the GSA parameter can be used flexibly to improve the algorithm’s convergence velocity and improve the accuracy of the solutions.

  9. An evolutionary algorithm for global optimization based on self-organizing maps

    Science.gov (United States)

    Barmada, Sami; Raugi, Marco; Tucci, Mauro

    2016-10-01

    In this article, a new population-based algorithm for real-parameter global optimization is presented, which is denoted as self-organizing centroids optimization (SOC-opt). The proposed method uses a stochastic approach which is based on the sequential learning paradigm for self-organizing maps (SOMs). A modified version of the SOM is proposed where each cell contains an individual, which performs a search for a locally optimal solution and it is affected by the search for a global optimum. The movement of the individuals in the search space is based on a discrete-time dynamic filter, and various choices of this filter are possible to obtain different dynamics of the centroids. In this way, a general framework is defined where well-known algorithms represent a particular case. The proposed algorithm is validated through a set of problems, which include non-separable problems, and compared with state-of-the-art algorithms for global optimization.

  10. Optimization of thermal performance of a smooth flat-plate solar air heater using teaching–learning-based optimization algorithm

    Directory of Open Access Journals (Sweden)

    R. Venkata Rao

    2015-12-01

    Full Text Available This paper presents the performance of teaching–learning-based optimization (TLBO algorithm to obtain the optimum set of design and operating parameters for a smooth flat plate solar air heater (SFPSAH. The TLBO algorithm is a recently proposed population-based algorithm, which simulates the teaching–learning process of the classroom. Maximization of thermal efficiency is considered as an objective function for the thermal performance of SFPSAH. The number of glass plates, irradiance, and the Reynolds number are considered as the design parameters and wind velocity, tilt angle, ambient temperature, and emissivity of the plate are considered as the operating parameters to obtain the thermal performance of the SFPSAH using the TLBO algorithm. The computational results have shown that the TLBO algorithm is better or competitive to other optimization algorithms recently reported in the literature for the considered problem.

  11. A Novel Particle Swarm Optimization based Algorithm for the Optimal Centralized Wireless Access Network

    Directory of Open Access Journals (Sweden)

    Dac-Nhuong Le

    2013-01-01

    Full Text Available The wireless access networks design problem is formulated as a constrained optimization problem, where the goal is to find a network topology such that an objective function is optimized, subject to a set of constraints. The objective function may be the total cost, or some performance measure like utilization, call blocking or throughput. The constraints may be bounds on link capacities, cost elements, or some network performance measure. However, the optimization problem is too complex. In this paper, we propose a novel Particle Swarm Optimization (PSO algorithm to finding the total cost of connecting the BSs to the MSCs, and connecting the MSCs to the LE called by the optimal centralized wireless access network. Numerical results show that performance of our proposed algorithm is much better than previous studies.

  12. Neural Network Control Optimization based on Improved Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Zhaoyin Zhang

    2013-08-01

    Full Text Available To clearly find the effect of factors in network classification, the classification process of PNN is analyzed in detail. The XOR problem is described by PNN and the elements in PNN are also studied. Through simulations and combined with genetic algorithm, a novel PNN supervised learning algorithm is proposed. This algorithm introduces the classification accuracy of training samples to the network parameter learning. It adopts genetic algorithm to train the PNN smoothing parameter and hidden centric vector. Then the effects of hidden neuron number, hidden centric vector and smoothing parameter in PNN are verified in the experiments. It is shown that this algorithm is superior to other PNN learning algorithms on classification effect.

  13. OPTIMIZATION DESIGN OF HYDRAU-LIC MANIFOLD BLOCKS BASED ON HUMAN-COMPUTER COOPERATIVE GENETIC ALGORITHM

    Institute of Scientific and Technical Information of China (English)

    Feng Yi; Li Li; Tian Shujun

    2003-01-01

    Optimization design of hydraulic manifold blocks (HMB) is studied as a complex solid spatial layout problem. Based on comprehensive research into structure features and design rules of HMB, an optimal mathematical model for this problem is presented. Using human-computer cooperative genetic algorithm (GA) and its hybrid optimization strategies, integrated layout and connection design schemes of HMB can be automatically optimized. An example is given to testify it.

  14. A universal optimization strategy for ant colony optimization algorithms based on the Physarum-inspired mathematical model

    International Nuclear Information System (INIS)

    Ant colony optimization (ACO) algorithms often fall into the local optimal solution and have lower search efficiency for solving the travelling salesman problem (TSP). According to these shortcomings, this paper proposes a universal optimization strategy for updating the pheromone matrix in the ACO algorithms. The new optimization strategy takes advantages of the unique feature of critical paths reserved in the process of evolving adaptive networks of the Physarum-inspired mathematical model (PMM). The optimized algorithms, denoted as PMACO algorithms, can enhance the amount of pheromone in the critical paths and promote the exploitation of the optimal solution. Experimental results in synthetic and real networks show that the PMACO algorithms are more efficient and robust than the traditional ACO algorithms, which are adaptable to solve the TSP with single or multiple objectives. Meanwhile, we further analyse the influence of parameters on the performance of the PMACO algorithms. Based on these analyses, the best values of these parameters are worked out for the TSP. (paper)

  15. A universal optimization strategy for ant colony optimization algorithms based on the Physarum-inspired mathematical model.

    Science.gov (United States)

    Zhang, Zili; Gao, Chao; Liu, Yuxin; Qian, Tao

    2014-09-01

    Ant colony optimization (ACO) algorithms often fall into the local optimal solution and have lower search efficiency for solving the travelling salesman problem (TSP). According to these shortcomings, this paper proposes a universal optimization strategy for updating the pheromone matrix in the ACO algorithms. The new optimization strategy takes advantages of the unique feature of critical paths reserved in the process of evolving adaptive networks of the Physarum-inspired mathematical model (PMM). The optimized algorithms, denoted as PMACO algorithms, can enhance the amount of pheromone in the critical paths and promote the exploitation of the optimal solution. Experimental results in synthetic and real networks show that the PMACO algorithms are more efficient and robust than the traditional ACO algorithms, which are adaptable to solve the TSP with single or multiple objectives. Meanwhile, we further analyse the influence of parameters on the performance of the PMACO algorithms. Based on these analyses, the best values of these parameters are worked out for the TSP. PMID:24613939

  16. An Information Entropy-Based Animal Migration Optimization Algorithm for Data Clustering

    Directory of Open Access Journals (Sweden)

    Lei Hou

    2016-05-01

    Full Text Available Data clustering is useful in a wide range of application areas. The Animal Migration Optimization (AMO algorithm is one of the recently introduced swarm-based algorithms, which has demonstrated good performances for solving numeric optimization problems. In this paper, we presented a modified AMO algorithm with an entropy-based heuristic strategy for data clustering. The main contribution is that we calculate the information entropy of each attribute for a given data set and propose an adaptive strategy that can automatically balance convergence speed and global search efforts according to its entropy in both migration and updating steps. A series of well-known benchmark clustering problems are employed to evaluate the performance of our approach. We compare experimental results with k-means, Artificial Bee Colony (ABC, AMO, and the state-of-the-art algorithms for clustering and show that the proposed AMO algorithm generally performs better than the compared algorithms on the considered clustering problems.

  17. Fuzzy C Means (FCM Clustering Based Hybrid Swarm Intelligence Algorithm for Test Case Optimization

    Directory of Open Access Journals (Sweden)

    Abraham Kiran Joseph

    2014-07-01

    Full Text Available The main objective of an operative testing strategy is the delivery of a reliable and quality oriented software product to the end user. Testing an application entirely from end to end is a time consuming and laborious process. Exhaustive testing utilizes a good chunk of the resources in a project for meticulous scrutiny to identify even a minor bug. A need to optimize the existing suite is highly recommended, with minimum resources and a shorter time span. To achieve this optimization in testing, a technique based on combining Artificial Bee Colony algorithm (ABC integrated with Fuzzy C-Means (FCM and Particle Swarm Optimization (PSO is described here. The initiation is done with the ABC algorithm that consists of three phases-the employed bee, the onlooker bee and the scout bee phase. The artificial bees that are initialized in the ABC algorithm identify the nodes with the highest coverage. This results in the ABC algorithm generating an optimal number of test-cases, which are sufficient to cover the entire paths within the application. The node with the highest usage by a given test case is determined by the PSO algorithm. Based on the above ‘hybrid’ optimization approach of ABC and PSO algorithms, a set of test cases that are optimal are obtained by repeated pruning of the original set of test cases. The performance of the proposed method is evaluated and is compared with other optimization techniques to emphasize the fact of improved quality and reduced complexity.

  18. A Novel Hybrid Crossover based Artificial Bee Colony Algorithm for Optimization Problem

    OpenAIRE

    Kumar, Sandeep; Sharma, Vivek Kumar; Kumari, Rajani

    2014-01-01

    Artificial bee colony (ABC) algorithm has proved its importance in solving a number of problems including engineering optimization problems. ABC algorithm is one of the most popular and youngest member of the family of population based nature inspired meta-heuristic swarm intelligence method. ABC has been proved its superiority over some other Nature Inspired Algorithms (NIA) when applied for both benchmark functions and real world problems. The performance of search process of ABC depends on...

  19. Optimized vehicle scheduling and filling model based on effective space and integrated solving algorithm

    Institute of Scientific and Technical Information of China (English)

    ZHAO Peng; MU Xin; YAO Jin-hua; WANG Yong; YANG Xiu-tai

    2007-01-01

    We established an integrated and optimized model of vehicle scheduling problem and vehicle filling problem for solving an extremely complex delivery mode-multi-type vehicles, non-full loads, pickup and delivery in logistics and delivery system. The integrated and optimized model is based on our previous research result-effective space method. An integrated algorithm suitable for the integrated and optimized model was proposed and corresponding computer programs were designed to solve practical problems. The results indicates the programs can work out optimized delivery routes and concrete loading projects. The model and algorithm have many virtues and are valuable in practice.

  20. Fault Diagnosis of Nonlinear Systems Based on Hybrid PSOSA Optimization Algorithm

    Institute of Scientific and Technical Information of China (English)

    Ling-Lai Li; Dong-Hua Zhou; Ling Wang

    2007-01-01

    Fault diagnosis of nonlinear systems is of great importance in theory and practice, and the parameter estimation method is an effective strategy. Based on the framework of moving horizon estimation, fault parameters are identified by a proposed intelligent optimization algorithm called PSOSA, which could avoid premature convergence of standard particle swarm optimization (PSO) by introducing the probabilistic jumping property of simulated annealing (SA). Simulations on a three-tank system show the effectiveness of this optimization based fault diagnosis strategy.

  1. Dynamic Deployment of Wireless Sensor Networks by Biogeography Based Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Luo Liu

    2012-06-01

    Full Text Available As the usage and development of wireless sensor networks increases, problems related to these networks are becoming apparent. Dynamic deployment is one of the main topics that directly affects the performance of the wireless sensor networks. In this paper, biogeography-based optimization is applied to the dynamic deployment of static and mobile sensor networks to achieve better performance by trying to increase the coverage area of the network. A binary detection model is considered to obtain realistic results while computing the effectively covered area. Performance of the algorithm is compared with that of the artificial bee colony algorithm, Homo-H-VFCPSO and stud genetic algorithm that are also population-based optimization algorithms. Results show biogeography-based optimization can be preferable in the dynamic deployment of wireless sensor networks.

  2. Double global optimum genetic algorithm-particle swarm optimization-based welding robot path planning

    Science.gov (United States)

    Wang, Xuewu; Shi, Yingpan; Ding, Dongyan; Gu, Xingsheng

    2016-02-01

    Spot-welding robots have a wide range of applications in manufacturing industries. There are usually many weld joints in a welding task, and a reasonable welding path to traverse these weld joints has a significant impact on welding efficiency. Traditional manual path planning techniques can handle a few weld joints effectively, but when the number of weld joints is large, it is difficult to obtain the optimal path. The traditional manual path planning method is also time consuming and inefficient, and cannot guarantee optimality. Double global optimum genetic algorithm-particle swarm optimization (GA-PSO) based on the GA and PSO algorithms is proposed to solve the welding robot path planning problem, where the shortest collision-free paths are used as the criteria to optimize the welding path. Besides algorithm effectiveness analysis and verification, the simulation results indicate that the algorithm has strong searching ability and practicality, and is suitable for welding robot path planning.

  3. A novel evolutionary approach for optimizing content-based image indexing algorithms.

    Science.gov (United States)

    Saadatmand-Tarzjan, Mahdi; Moghaddam, Hamid Abrishami

    2007-02-01

    Optimization of content-based image indexing and retrieval (CBIR) algorithms is a complicated and time-consuming task since each time a parameter of the indexing algorithm is changed, all images in the database should be indexed again. In this paper, a novel evolutionary method called evolutionary group algorithm (EGA) is proposed for complicated time-consuming optimization problems such as finding optimal parameters of content-based image indexing algorithms. In the new evolutionary algorithm, the image database is partitioned into several smaller subsets, and each subset is used by an updating process as training patterns for each chromosome during evolution. This is in contrast to genetic algorithms that use the whole database as training patterns for evolution. Additionally, for each chromosome, a parameter called age is defined that implies the progress of the updating process. Similarly, the genes of the proposed chromosomes are divided into two categories: evolutionary genes that participate to evolution and history genes that save previous states of the updating process. Furthermore, a new fitness function is defined which evaluates the fitness of the chromosomes of the current population with different ages in each generation. We used EGA to optimize the quantization thresholds of the wavelet-correlogram algorithm for CBIR. The optimal quantization thresholds computed by EGA improved significantly all the evaluation measures including average precision, average weighted precision, average recall, and average rank for the wavelet-correlogram method.

  4. A computed tomography reconstruction algorithm based on multipurpose optimal criterion and simulated annealing theory

    Institute of Scientific and Technical Information of China (English)

    Hui Li; Xiong Wan; Taoli Liu; Zhongshou Liu; Yanhua Zhu

    2007-01-01

    Although emission spectral tomography (EST) combines emission spectral measurement with optical computed tomography (OCT), it is difficult to gain transient emission data from a large number of views,therefore, high precision OCT algorithms with few views ought to be studied for EST application. To improve the reconstruction precision in the case of few views, a new computed tomography reconstruction algorithm based on multipurpose optimal criterion and simulated annealing theory (multi-criterion simulated annealing reconstruction technique, MCSART) is proposed. This algorithm can suffice criterion of least squares, criterion of most uniformity, and criterion of most smoothness synchronously. We can get global optimal solution by MCSART algorithm with simulated annealing theory. The simulating experiment result shows that this algorithm is superior to the traditional algorithms under various noises.

  5. An efficient hybrid evolutionary optimization algorithm based on PSO and SA for clustering

    Institute of Scientific and Technical Information of China (English)

    Taher NIKNAM; Babak AMIRI; Javad OLAMAEI; Ali AREFI

    2009-01-01

    The K-means algorithm is one of the most popular techniques in clustering. Nevertheless, the performance of the Kmeans algorithm depends highly on initial cluster centers and converges to local minima. This paper proposes a hybrid evolutionary programming based clustering algorithm, called PSO-SA, by combining particle swarm optimization (PSO) and simulated annealing (SA). The basic idea is to search around the global solution by SA and to increase the information exchange among particles using a mutation operator to escape local optima. Three datasets, Iris, Wisconsin Breast Cancer, and Riplcy's Glass, have been considered to show the effectiveness of the proposed clustering algorithm in providing optimal clusters. The simulation results show that the PSO-SA clustering algorithm not only has a better response but also converges more quickly than the K-means, PSO, and SA algorithms.

  6. Optimal Energy Management Strategy of a Plug-in Hybrid Electric Vehicle Based on a Particle Swarm Optimization Algorithm

    OpenAIRE

    Zeyu Chen; Rui Xiong; Kunyu Wang; Bin Jiao

    2015-01-01

    Plug-in hybrid electric vehicles (PHEVs) have been recognized as one of the most promising vehicle categories nowadays due to their low fuel consumption and reduced emissions. Energy management is critical for improving the performance of PHEVs. This paper proposes an energy management approach based on a particle swarm optimization (PSO) algorithm. The optimization objective is to minimize total energy cost (summation of oil and electricity) from vehicle utilization. A main drawback of optim...

  7. Novel integrated optimization algorithm for trajectory planning of robot manipulators based on integrated evolutionary programming

    Institute of Scientific and Technical Information of China (English)

    Xiong LUO; Xiaoping FAN; Heng ZHANG; Tefang CHEN

    2004-01-01

    Optimal trajectory planning for robot manipulators plays an important role in implementing the high productivity for robots.The performance indexes used in optimal trajectory planning are classified into two main categories:optimum traveling time and optimum mechanical energy of the actuators.The current trajectory planning algorithms are designed based on one of the above two performance indexes.So far,there have been few planning algorithms designed to satisfy two performance indexes simultaneously.On the other hand,some deficiencies arise in the existing integrated optimization algorithms of trajectory planning.In order to overcome those deficiencies,the integrated optimization algorithms of trajectory planning are presented based on the complete analysis for trajectory planning of robot manipulators.In the algorithm,two object functions are designed based on the specific weight coefficient method and "ideal point" strategy.Moreover,based on the features of optimization problem,the intensified evolutionary programming is proposed to solve the corresponding optimization model.Especially,for the Stanford Robot,the high-quality solutions are found at a lower cost.

  8. Optimization algorithms and applications

    CERN Document Server

    Arora, Rajesh Kumar

    2015-01-01

    Choose the Correct Solution Method for Your Optimization ProblemOptimization: Algorithms and Applications presents a variety of solution techniques for optimization problems, emphasizing concepts rather than rigorous mathematical details and proofs. The book covers both gradient and stochastic methods as solution techniques for unconstrained and constrained optimization problems. It discusses the conjugate gradient method, Broyden-Fletcher-Goldfarb-Shanno algorithm, Powell method, penalty function, augmented Lagrange multiplier method, sequential quadratic programming, method of feasible direc

  9. RELIABILITY-BASED DESIGN OF COMPOSITES UNDER THE MIXED UNCERTAINTIES AND THE OPTIMIZATION ALGORITHM

    Institute of Scientific and Technical Information of China (English)

    Rui Ge; Jianqiao Chen; Jnnhong Wei

    2008-01-01

    This paper proposed a reliability design model for composite materials under the mixture of random and interval variables. Together with the inverse reliability analysis technique, the sequential single-loop optimization method is applied to the reliability-based design of com-posites. In the sequential single-loop optimization, the optimization and the reliability analysis are decoupled to improve the computational efficiency. As shown in examples, the minimum weight problems under the constraint of structural reliability are solved for laminated composites. The Particle Swarm Optimization (PSO) algorithm is utilized to search for the optimal solutions. The design results indicate that, under the mixture of random and interval variables, the method that combines the sequential single-loop optimization and the PSO algorithm can deal effectively with the reliability-based design of composites.

  10. Target distribution in cooperative combat based on Bayesian optimization algorithm

    Institute of Scientific and Technical Information of China (English)

    Shi Zhifu; Zhang An; Wang Anli

    2006-01-01

    Target distribution in cooperative combat is a difficult and emphases. We build up the optimization model according to the rule of fire distribution. We have researched on the optimization model with BOA. The BOA can estimate the joint probability distribution of the variables with Bayesian network, and the new candidate solutions also can be generated by the joint distribution. The simulation example verified that the method could be used to solve the complex question, the operation was quickly and the solution was best.

  11. Guidelines for Interactive Reliability-Based Structural Optimization using Quasi-Newton Algorithms

    DEFF Research Database (Denmark)

    Pedersen, C.; Thoft-Christensen, Palle

    Guidelines for interactive reliability-based structural optimization problems are outlined in terms of modifications of standard quasi-Newton algorithms. The proposed modifications minimize the condition number of the approximate Hessian matrix in each iteration, restrict the relative and absolute...... increase of the condition number and preserve positive definiteness without discarding previously obtained information. All proposed modifications are also valid for non-interactive optimization problems. Heuristic rules from various optimization problems concerning when and how to impose interactions such...

  12. A New Image Threshold Segmentation based on Fuzzy Entropy and Improved Intelligent Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Yong-sheng Wang

    2014-04-01

    Full Text Available Image segmentation is one of the key techniques in the field of image understanding and computer vision. To determine the optimal threshold in image segmentation, an effective image threshold segmentation method based on fuzzy logic is presented. A new kind of fuzzy entropy is defined, that is not only related to the membership, but also related to probability distribution. According to the maximum entropy criterion, the improved particle swarm optimization algorithm based on chaos bee colony is used to determine the optimal parameters of membership function to automatically determine the optimal threshold segmentation. The experiment results show that proposed algorithm based on fuzzy entropy and chaos bee colony particle swarm optimization has good performance.

  13. Optimum Performance-Based Seismic Design Using a Hybrid Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    S. Talatahari

    2014-01-01

    Full Text Available A hybrid optimization method is presented to optimum seismic design of steel frames considering four performance levels. These performance levels are considered to determine the optimum design of structures to reduce the structural cost. A pushover analysis of steel building frameworks subject to equivalent-static earthquake loading is utilized. The algorithm is based on the concepts of the charged system search in which each agent is affected by local and global best positions stored in the charged memory considering the governing laws of electrical physics. Comparison of the results of the hybrid algorithm with those of other metaheuristic algorithms shows the efficiency of the hybrid algorithm.

  14. Transport path optimization algorithm based on fuzzy integrated weights

    Science.gov (United States)

    Hou, Yuan-Da; Xu, Xiao-Hao

    2014-11-01

    Natural disasters cause significant damage to roads, making route selection a complicated logistical problem. To overcome this complexity, we present a method of using a trapezoidal fuzzy number to select the optimal transport path. Using the given trapezoidal fuzzy edge coefficients, we calculate a fuzzy integrated matrix, and incorporate the fuzzy multi-weights into fuzzy integrated weights. The optimal path is determined by taking two sets of vertices and transforming undiscovered vertices into discoverable ones. Our experimental results show that the model is highly accurate, and requires only a few measurement data to confirm the optimal path. The model provides an effective, feasible, and convenient method to obtain weights for different road sections, and can be applied to road planning in intelligent transportation systems.

  15. An Adaptive Particle Swarm Optimization Algorithm Based on Directed Weighted Complex Network

    Directory of Open Access Journals (Sweden)

    Ming Li

    2014-01-01

    Full Text Available The disadvantages of particle swarm optimization (PSO algorithm are that it is easy to fall into local optimum in high-dimensional space and has a low convergence rate in the iterative process. To deal with these problems, an adaptive particle swarm optimization algorithm based on directed weighted complex network (DWCNPSO is proposed. Particles can be scattered uniformly over the search space by using the topology of small-world network to initialize the particles position. At the same time, an evolutionary mechanism of the directed dynamic network is employed to make the particles evolve into the scale-free network when the in-degree obeys power-law distribution. In the proposed method, not only the diversity of the algorithm was improved, but also particles’ falling into local optimum was avoided. The simulation results indicate that the proposed algorithm can effectively avoid the premature convergence problem. Compared with other algorithms, the convergence rate is faster.

  16. Elevator Group-Control Policy Based on Neural Network Optimized by Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    SHEN Hong; WAN Jianru; ZHANG Zhichao; LIU Yingpei; LI Guangye

    2009-01-01

    Aiming at the diversity and nonlinearity of the elevator system control target, an effective group method based on a hybrid algorithm of genetic algorithm and neural network is presented in this paper. The genetic algo-rithm is used to search the weight of the neural network. At the same time, the multi-objective-based evaluation function is adopted, in which there are three main indicators including the passenger waiting time, car passengers number and the number of stops. Different weights are given to meet the actual needs. The optimal values of the evaluation function are obtained, and the optimal dispatch control of the elevator group control system based on neural network is realized. By analyzing the running of the elevator group control system, all the processes and steps are presented. The validity of the hybrid algorithm is verified by the dynamic imitation performance.

  17. Stellarator Optimization Using a Distributed Swarm Intelligence-Based Algorithm

    OpenAIRE

    Antonio Gómez-Iglesias; Francisco Castejón; Miguel A. Vega-Rodríguez

    2012-01-01

    The design of enhanced fusion devices constitutes a key element for the development of fusion as a commercial source of energy. Stellarator optimization presents high computational requirements because of the complexity of the numerical methods needed as well as the size of the solution space regarding all the possible configurations satisfying the characteristics of a feasible reactor. The size of the solution space does not allow to explore every single feasible configuration. Hence, a meta...

  18. Boiler combustion optimization based on ANN and PSO-Powell algorithm

    Institute of Scientific and Technical Information of China (English)

    DAI Wei-bao; ZOU Ping-hua; FENG Ming-hua; DONG Zhan-shuang

    2009-01-01

    To improve the thermal efficiency and reduce nitrogen oxides (NOx) emissions in a power plant for energy conservation and environment protection, based on the reconstructed section temperature field and other related parameters, dynamic radial basis function (RBF) artificial neural network (ANN) models for forecasting unburned carbon in fly ash and NOx emissions in flue gas ware developed in this paper, together with a multi-objective optimization system utilizing particle swarm optimization and Powell (PSO-Powell) algorithm.To validate the proposed approach, a series of field tests were conducted in a 350 MW power plant. The results indicate that PSO-Powell algorithm can improve the capability to search optimization solution of PSO algorithm,and the effectiveness of system. Its prospective application in the optimization of a pulverized coal (PC) fired boiler is presented as well.

  19. Parameters Identification of Fluxgate Magnetic Core Adopting the Biogeography-Based Optimization Algorithm.

    Science.gov (United States)

    Jiang, Wenjuan; Shi, Yunbo; Zhao, Wenjie; Wang, Xiangxin

    2016-01-01

    The main part of the magnetic fluxgate sensor is the magnetic core, the hysteresis characteristic of which affects the performance of the sensor. When the fluxgate sensors are modelled for design purposes, an accurate model of hysteresis characteristic of the cores is necessary to achieve good agreement between modelled and experimental data. The Jiles-Atherton model is simple and can reflect the hysteresis properties of the magnetic material precisely, which makes it widely used in hysteresis modelling and simulation of ferromagnetic materials. However, in practice, it is difficult to determine the parameters accurately owing to the sensitivity of the parameters. In this paper, the Biogeography-Based Optimization (BBO) algorithm is applied to identify the Jiles-Atherton model parameters. To enhance the performances of the BBO algorithm such as global search capability, search accuracy and convergence rate, an improved Biogeography-Based Optimization (IBBO) algorithm is put forward by using Arnold map and mutation strategy of Differential Evolution (DE) algorithm. Simulation results show that IBBO algorithm is superior to Genetic Algorithm (GA), Particle Swarm Optimization (PSO) algorithm, Differential Evolution algorithm and BBO algorithm in identification accuracy and convergence rate. The IBBO algorithm is applied to identify Jiles-Atherton model parameters of selected permalloy. The simulation hysteresis loop is in high agreement with experimental data. Using permalloy as core of fluxgate probe, the simulation output is consistent with experimental output. The IBBO algorithm can identify the parameters of Jiles-Atherton model accurately, which provides a basis for the precise analysis and design of instruments and equipment with magnetic core. PMID:27347974

  20. A New Image Threshold Segmentation based on Fuzzy Entropy and Improved Intelligent Optimization Algorithm

    OpenAIRE

    Yong-sheng Wang

    2014-01-01

    Image segmentation is one of the key techniques in the field of image understanding and computer vision. To determine the optimal threshold in image segmentation, an effective image threshold segmentation method based on fuzzy logic is presented. A new kind of fuzzy entropy is defined, that is not only related to the membership, but also related to probability distribution. According to the maximum entropy criterion, the improved particle swarm optimization algorithm based on chaos bee colony...

  1. Subjective audio quality evaluation of embedded-optimization-based distortion precompensation algorithms.

    Science.gov (United States)

    Defraene, Bruno; van Waterschoot, Toon; Diehl, Moritz; Moonen, Marc

    2016-07-01

    Subjective audio quality evaluation experiments have been conducted to assess the performance of embedded-optimization-based precompensation algorithms for mitigating perceptible linear and nonlinear distortion in audio signals. It is concluded with statistical significance that the perceived audio quality is improved by applying an embedded-optimization-based precompensation algorithm, both in case (i) nonlinear distortion and (ii) a combination of linear and nonlinear distortion is present. Moreover, a significant positive correlation is reported between the collected subjective and objective PEAQ audio quality scores, supporting the validity of using PEAQ to predict the impact of linear and nonlinear distortion on the perceived audio quality. PMID:27475197

  2. A priority-based heuristic algorithm (PBHA for optimizing integrated process planning and scheduling problem

    Directory of Open Access Journals (Sweden)

    Muhammad Farhan Ausaf

    2015-12-01

    Full Text Available Process planning and scheduling are two important components of a manufacturing setup. It is important to integrate them to achieve better global optimality and improved system performance. To find optimal solutions for integrated process planning and scheduling (IPPS problem, numerous algorithm-based approaches exist. Most of these approaches try to use existing meta-heuristic algorithms for solving the IPPS problem. Although these approaches have been shown to be effective in optimizing the IPPS problem, there is still room for improvement in terms of quality of solution and algorithm efficiency, especially for more complicated problems. Dispatching rules have been successfully utilized for solving complicated scheduling problems, but haven’t been considered extensively for the IPPS problem. This approach incorporates dispatching rules with the concept of prioritizing jobs, in an algorithm called priority-based heuristic algorithm (PBHA. PBHA tries to establish job and machine priority for selecting operations. Priority assignment and a set of dispatching rules are simultaneously used to generate both the process plans and schedules for all jobs and machines. The algorithm was tested for a series of benchmark problems. The proposed algorithm was able to achieve superior results for most complex problems presented in recent literature while utilizing lesser computational resources.

  3. Classification of Medical Datasets Using SVMs with Hybrid Evolutionary Algorithms Based on Endocrine-Based Particle Swarm Optimization and Artificial Bee Colony Algorithms.

    Science.gov (United States)

    Lin, Kuan-Cheng; Hsieh, Yi-Hsiu

    2015-10-01

    The classification and analysis of data is an important issue in today's research. Selecting a suitable set of features makes it possible to classify an enormous quantity of data quickly and efficiently. Feature selection is generally viewed as a problem of feature subset selection, such as combination optimization problems. Evolutionary algorithms using random search methods have proven highly effective in obtaining solutions to problems of optimization in a diversity of applications. In this study, we developed a hybrid evolutionary algorithm based on endocrine-based particle swarm optimization (EPSO) and artificial bee colony (ABC) algorithms in conjunction with a support vector machine (SVM) for the selection of optimal feature subsets for the classification of datasets. The results of experiments using specific UCI medical datasets demonstrate that the accuracy of the proposed hybrid evolutionary algorithm is superior to that of basic PSO, EPSO and ABC algorithms, with regard to classification accuracy using subsets with a reduced number of features. PMID:26289628

  4. Classification of Medical Datasets Using SVMs with Hybrid Evolutionary Algorithms Based on Endocrine-Based Particle Swarm Optimization and Artificial Bee Colony Algorithms.

    Science.gov (United States)

    Lin, Kuan-Cheng; Hsieh, Yi-Hsiu

    2015-10-01

    The classification and analysis of data is an important issue in today's research. Selecting a suitable set of features makes it possible to classify an enormous quantity of data quickly and efficiently. Feature selection is generally viewed as a problem of feature subset selection, such as combination optimization problems. Evolutionary algorithms using random search methods have proven highly effective in obtaining solutions to problems of optimization in a diversity of applications. In this study, we developed a hybrid evolutionary algorithm based on endocrine-based particle swarm optimization (EPSO) and artificial bee colony (ABC) algorithms in conjunction with a support vector machine (SVM) for the selection of optimal feature subsets for the classification of datasets. The results of experiments using specific UCI medical datasets demonstrate that the accuracy of the proposed hybrid evolutionary algorithm is superior to that of basic PSO, EPSO and ABC algorithms, with regard to classification accuracy using subsets with a reduced number of features.

  5. The Distribution Population-based Genetic Algorithm for Parameter Optimization PID Controller

    Institute of Scientific and Technical Information of China (English)

    CHENQing-Geng; WANGNing; HUANGShao-Feng

    2005-01-01

    Enlightened by distribution of creatures in natural ecology environment, the distribution population-based genetic algorithm (DPGA) is presented in this paper. The searching capability of the algorithm is improved by competition between distribution populations to reduce the search zone.This method is applied to design of optimal parameters of PID controllers with examples, and the simulation results show that satisfactory performances are obtained.

  6. An adaptive metamodel-based global optimization algorithm for black-box type problems

    Science.gov (United States)

    Jie, Haoxiang; Wu, Yizhong; Ding, Jianwan

    2015-11-01

    In this article, an adaptive metamodel-based global optimization (AMGO) algorithm is presented to solve unconstrained black-box problems. In the AMGO algorithm, a type of hybrid model composed of kriging and augmented radial basis function (RBF) is used as the surrogate model. The weight factors of hybrid model are adaptively selected in the optimization process. To balance the local and global search, a sub-optimization problem is constructed during each iteration to determine the new iterative points. As numerical experiments, six standard two-dimensional test functions are selected to show the distributions of iterative points. The AMGO algorithm is also tested on seven well-known benchmark optimization problems and contrasted with three representative metamodel-based optimization methods: efficient global optimization (EGO), GutmannRBF and hybrid and adaptive metamodel (HAM). The test results demonstrate the efficiency and robustness of the proposed method. The AMGO algorithm is finally applied to the structural design of the import and export chamber of a cycloid gear pump, achieving satisfactory results.

  7. Optimal Design of Fuzzy Based Power System Stabilizer Self Tuned by Robust Search Algorithm

    CERN Document Server

    Linda, M Mary

    2009-01-01

    In the interconnected power system network, instability problems are caused mainly by the low frequency oscillations of 0.2 to 2.5 Hz .The supplementary control signal in addition with AVR and high gain excitation systems are provided by means of Power System Stabilizer (PSS). Conventional power system stabilizers provide effective damping only on a particular operating point. But fuzzy based PSS provides good damping for a wide range of operating points. The bottlenecks faced in designing a fuzzy logic controller can be minimized by using appropriate optimization techniques like Genetic Algorithm, Particle Swam Optimization, Ant Colony Optimization etc.In this paper the membership functions of FLC are optimized by the new breed optimization technique called Genetic Algorithm. This design methodology is implemented on a Single Machine Infinite Bus (SMIB) system. Simulation results on SMIB show the effectiveness and robustness of the proposed PSS over a wide range of operating conditions and system configurati...

  8. Multi-objective optimization of membrane structures based on Pareto Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    SAN Bing-bing; SUN Xiao-ying; WU Yue

    2010-01-01

    A multi-objective optimization method based on Pareto Genetic Algorithm is presented for shape design of membrane structures from a structural view point.Several non-dimensional variables are defined as optimization variables,which are decision factors of shapes of membrane structures.Three objectives are proposed including maximization of stiffness,maximum uniformity of stress and minimum reaction under external loads.Pareto Muhi-objective Genetic Algorithm is introduced to solve the Pareto solutions.Consequently,the dependence of the optimality upon the optimization variables is derived to provide guidelines on how to determine design parameters.Moreover,several examples illustrate the proposed methods and applications.The study shows that the multi-objective optimization method in this paper is feasible and efficient for membrane structures; the research on Pareto solutions can provide explicit and useful guidelines for shape design of membrane structures.

  9. Computational Fluid Dynamics Based Bulbous Bow Optimization Using a Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    Shahid Mahmood; Debo Huang

    2012-01-01

    Computational fluid dynamics (CFD) plays a major role in predicting the flow behavior of a ship.With the development of fast computers and robust CFD software,CFD has become an important tool for designers and engineers in the ship industry.In this paper,the hull form of a ship was optimized for total resistance using CFD as a calculation tool and a genetic algorithm as an optimization tool.CFD based optimization consists of major steps involving automatic generation of geometry based on design parameters,automatic generation of mesh,automatic analysis of fluid flow to calculate the required objective/cost function,and finally an optimization tool to evaluate the cost for optimization.In this paper,integration of a genetic algorithm program,written in MATLAB,was carried out with the geometry and meshing software GAMBIT and CFD analysis software FLUENT.Different geometries of additive bulbous bow were incorporated in the original hull based on design parameters.These design variables were optimized to achieve a minimum cost function of “total resistance”.Integration of a genetic algorithm with CFD tools proves to be effective for hull form optimization.

  10. A Parallel Global-Local Mixed Evolutionary Algorithm for Multimodal Function Optimization Based on Domain Decomposition

    Institute of Scientific and Technical Information of China (English)

    Wu Zhi-jian; Tang Zhi-long; Kang Li-shan

    2003-01-01

    This paper presents a parallel two level evolutionary algorithm based on domain decomposition for solving function optimization problem containing multiple solutions.By combining the characteristics of the global search and local search in each sub-domain, the former enables individual to draw closer to each optirma and keeps the diversity of individuals, while the latter selects local optimal solutions known as latent solutions in sub-domain. In the end, by selecting the global optimal solutions from latent solutions in each sub-domain, we can discover all the optimal solutions easily and quickly.

  11. Study on the optimal algorithm prediction of corn leaf component information based on hyperspectral imaging

    Science.gov (United States)

    Wu, Qiong; Wang, Jihua; Wang, Cheng; Xu, Tongyu

    2016-09-01

    Genetic algorithm (GA) has a significant effect in the band optimization selection of Partial Least Squares (PLS) correction model. Application of genetic algorithm in selection of characteristic bands can achieve the optimal solution more rapidly, effectively improve measurement accuracy and reduce variables used for modeling. In this study, genetic algorithm as a module conducted band selection for the application of hyperspectral imaging in nondestructive testing of corn seedling leaves, and GA-PLS model was established. In addition, PLS quantitative model of full spectrum and experienced-spectrum region were established in order to suggest the feasibility of genetic algorithm optimizing wave bands, and model robustness was evaluated. There were 12 characteristic bands selected by genetic algorithm. With reflectance values of corn seedling component information at spectral characteristic wavelengths corresponding to 12 characteristic bands as variables, a model about SPAD values of corn leaves acquired was established by PLS, and modeling results showed r = 0.7825. The model results were better than those of PLS model established in full spectrum and experience-based selected bands. The results suggested that genetic algorithm can be used for data optimization and screening before establishing the corn seedling component information model by PLS method and effectively increase measurement accuracy and greatly reduce variables used for modeling.

  12. Comparison of Genetic Algorithm, Particle Swarm Optimization and Biogeography-based Optimization for Feature Selection to Classify Clusters of Microcalcifications

    Science.gov (United States)

    Khehra, Baljit Singh; Pharwaha, Amar Partap Singh

    2016-06-01

    Ductal carcinoma in situ (DCIS) is one type of breast cancer. Clusters of microcalcifications (MCCs) are symptoms of DCIS that are recognized by mammography. Selection of robust features vector is the process of selecting an optimal subset of features from a large number of available features in a given problem domain after the feature extraction and before any classification scheme. Feature selection reduces the feature space that improves the performance of classifier and decreases the computational burden imposed by using many features on classifier. Selection of an optimal subset of features from a large number of available features in a given problem domain is a difficult search problem. For n features, the total numbers of possible subsets of features are 2n. Thus, selection of an optimal subset of features problem belongs to the category of NP-hard problems. In this paper, an attempt is made to find the optimal subset of MCCs features from all possible subsets of features using genetic algorithm (GA), particle swarm optimization (PSO) and biogeography-based optimization (BBO). For simulation, a total of 380 benign and malignant MCCs samples have been selected from mammogram images of DDSM database. A total of 50 features extracted from benign and malignant MCCs samples are used in this study. In these algorithms, fitness function is correct classification rate of classifier. Support vector machine is used as a classifier. From experimental results, it is also observed that the performance of PSO-based and BBO-based algorithms to select an optimal subset of features for classifying MCCs as benign or malignant is better as compared to GA-based algorithm.

  13. Combining Diffusion and Grey Models Based on Evolutionary Optimization Algorithms to Forecast Motherboard Shipments

    Directory of Open Access Journals (Sweden)

    Fu-Kwun Wang

    2012-01-01

    Full Text Available It is important for executives to predict the future trends. Otherwise, their companies cannot make profitable decisions and investments. The Bass diffusion model can describe the empirical adoption curve for new products and technological innovations. The Grey model provides short-term forecasts using four data points. This study develops a combined model based on the rolling Grey model (RGM and the Bass diffusion model to forecast motherboard shipments. In addition, we investigate evolutionary optimization algorithms to determine the optimal parameters. Our results indicate that the combined model using a hybrid algorithm outperforms other methods for the fitting and forecasting processes in terms of mean absolute percentage error.

  14. The Algorithm of Continuous Optimization Based on the Modified Cellular Automaton

    Directory of Open Access Journals (Sweden)

    Oleg Evsutin

    2016-08-01

    Full Text Available This article is devoted to the application of the cellular automata mathematical apparatus to the problem of continuous optimization. The cellular automaton with an objective function is introduced as a new modification of the classic cellular automaton. The algorithm of continuous optimization, which is based on dynamics of the cellular automaton having the property of geometric symmetry, is obtained. The results of the simulation experiments with the obtained algorithm on standard test functions are provided, and a comparison between the analogs is shown.

  15. Comprehensive preference optimization of an irreversible thermal engine using pareto based mutable smart bee algorithm and generalized regression neural network

    DEFF Research Database (Denmark)

    Mozaffari, Ahmad; Gorji-Bandpy, Mofid; Samadian, Pendar;

    2013-01-01

    and stochastic algorithms were proposed to facilitate controlling of the engineering systems. In this study, an extended version of mutable smart bee algorithm (MSBA) called Pareto based mutable smart bee (PBMSB) is inspired to cope with multi-objective problems. Besides, a set of benchmark problems and four...... well-known Pareto based optimizing algorithms i.e. multi-objective bee algorithm (MOBA), multi-objective particle swarm optimization (MOPSO) algorithm, non-dominated sorting genetic algorithm (NSGA-II), and strength Pareto evolutionary algorithm (SPEA 2) are utilized to confirm the acceptable...

  16. A Genetic Algorithm Optimization Technique for Multiwavelet-Based Digital Audio Watermarking

    Directory of Open Access Journals (Sweden)

    Kumsawat Prayoth

    2010-01-01

    Full Text Available We propose a new approach for optimization in digital audio watermarking using genetic algorithm. The watermarks are embedded into the low frequency coefficients in discrete multiwavelet transform domain. The embedding technique is based on quantization process which does not require the original audio signal in the watermark extraction. We have developed an optimization technique using the genetic algorithm to search for four optimal quantization steps in order to improve both quality of watermarked audio and robustness of the watermark. In addition, we analyze the performance of the proposed algorithm in terms of signal-to-noise ratio, normalized correlation, and bit error rate. The experimental results show that the proposed scheme can achieve a good robustness against most of the attacks which were included in this study.

  17. An Improved Multiobjective Optimization Evolutionary Algorithm Based on Decomposition for Complex Pareto Fronts.

    Science.gov (United States)

    Jiang, Shouyong; Yang, Shengxiang

    2016-02-01

    The multiobjective evolutionary algorithm based on decomposition (MOEA/D) has been shown to be very efficient in solving multiobjective optimization problems (MOPs). In practice, the Pareto-optimal front (POF) of many MOPs has complex characteristics. For example, the POF may have a long tail and sharp peak and disconnected regions, which significantly degrades the performance of MOEA/D. This paper proposes an improved MOEA/D for handling such kind of complex problems. In the proposed algorithm, a two-phase strategy (TP) is employed to divide the whole optimization procedure into two phases. Based on the crowdedness of solutions found in the first phase, the algorithm decides whether or not to delicate computational resources to handle unsolved subproblems in the second phase. Besides, a new niche scheme is introduced into the improved MOEA/D to guide the selection of mating parents to avoid producing duplicate solutions, which is very helpful for maintaining the population diversity when the POF of the MOP being optimized is discontinuous. The performance of the proposed algorithm is investigated on some existing benchmark and newly designed MOPs with complex POF shapes in comparison with several MOEA/D variants and other approaches. The experimental results show that the proposed algorithm produces promising performance on these complex problems.

  18. An {epsilon}-dominance-based multiobjective genetic algorithm for economic emission load dispatch optimization problem

    Energy Technology Data Exchange (ETDEWEB)

    Osman, M.S. [High Institute of Technology, 10th Ramadan City (Egypt); Abo-Sinna, M.A.; Mousa, A.A. [Faculty of Engineering, Shebin El-Kom, Menoufia University (Egypt)

    2009-11-15

    In this paper, a novel multiobjective genetic algorithm approach for economic emission load dispatch (EELD) optimization problem is presented. The EELD problem is formulated as a non-linear constrained multiobjective optimization problem with both equality and inequality constraints. A new optimization algorithm which is based on concept of co-evolution and repair algorithm for handling non-linear constraints is presented. The algorithm maintains a finite-sized archive of non-dominated solutions which gets iteratively updated in the presence of new solutions based on the concept of {epsilon}-dominance. The use of {epsilon}-dominance also makes the algorithms practical by allowing a decision maker to control the resolution of the Pareto-set approximation by choosing an appropriate {epsilon} value. The proposed approach is carried out on the standard IEEE 30-bus 6-genrator test system. The results demonstrate the capabilities of the proposed approach to generate true and well-distributed Pareto-optimal non-dominated solutions of the multiobjective EELD problem in one single run. Simulation results with the proposed approach have been compared to those reported in the literature. The comparison demonstrates the superiority of the proposed approach and confirms its potential to solve the multiobjective EELD problem. (author)

  19. An Optimal Parallel Algorithm for the Knapsack Problem Based on EREW

    Institute of Scientific and Technical Information of China (English)

    李肯立; 蒋盛益; 王卉; 李庆华

    2003-01-01

    A new parallel algorithm is proposed for the knapsack problem where the method of divide and conquer is adopted. Based on an EREW-SIMD machine with shared memory, the proposed algorithm utilizes O(2n/4)1-ε processors, 0≤ε≤1, and O(2n/2) memory to find a solution for the n-element knapsack problem in time O(2n/4(2n/4)ε). The cost of the proposed parallel algorithm is O(2n/2), which is an optimal method for solving the knapsack problem without memory conflicts and an improved result over the past researches.

  20. A dynamic programming-based particle swarm optimization algorithm for an inventory management problem under uncertainty

    Science.gov (United States)

    Xu, Jiuping; Zeng, Ziqiang; Han, Bernard; Lei, Xiao

    2013-07-01

    This article presents a dynamic programming-based particle swarm optimization (DP-based PSO) algorithm for solving an inventory management problem for large-scale construction projects under a fuzzy random environment. By taking into account the purchasing behaviour and strategy under rules of international bidding, a multi-objective fuzzy random dynamic programming model is constructed. To deal with the uncertainties, a hybrid crisp approach is used to transform fuzzy random parameters into fuzzy variables that are subsequently defuzzified by using an expected value operator with optimistic-pessimistic index. The iterative nature of the authors' model motivates them to develop a DP-based PSO algorithm. More specifically, their approach treats the state variables as hidden parameters. This in turn eliminates many redundant feasibility checks during initialization and particle updates at each iteration. Results and sensitivity analysis are presented to highlight the performance of the authors' optimization method, which is very effective as compared to the standard PSO algorithm.

  1. Distribution Grid Reactive Power Optimization Based on Improved Cloud Particle Swarm Algorithm

    Directory of Open Access Journals (Sweden)

    Hongsheng Su

    2013-01-01

    Full Text Available To resolve the problems that cloud particle swarm optimization(CPSO was easily trapped in local minimum and possessed slow convergence speed and early-maturing during distribution grid reactive power optimization, CPSO algorithm was improved based on cloud digital features in this paper. The method firstly combined Local search with global search together based on solution space transform, where the crossover and mutation operation of the particles were implemented based on normal cloud operator. And then the dramatic achievements were acquired in time-consuming and storage-cost using the improved algorithm. Finally, applied in bus IEEE30 system, the simulation results show that the better global solution is attained using the improved CPSO algorithm, and its convergence speed and accuracy possesses a dramatic improvement.

  2. A Genetic Algorithms-based Approach for Optimized Self-protection in a Pervasive Service Middleware

    DEFF Research Database (Denmark)

    Zhang, Weishan; Ingstrup, Mads; Hansen, Klaus Marius;

    2009-01-01

    the constraints of heterogeneous devices and networks. In this paper, we present a Genetic Algorithms-based approach for obtaining optimized security configurations at run time, supported by a set of security OWL ontologies and an event-driven framework. This approach has been realized as a prototype for self...

  3. The Study on Food Sensory Evaluation based on Particle Swarm Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Hairong Wang

    2015-07-01

    Full Text Available In this study, it explores the procedures and methods of the system for establishing food sensory evaluation based on particle swarm optimization algorithm, by means of explaining the interpretation of sensory evaluation and sensory analysis, combined with the applying situation of sensory evaluation in food industry.

  4. Dynamic Consensus Algorithm Based Distributed Global Efficiency Optimization of a Droop Controlled DC Microgrid

    DEFF Research Database (Denmark)

    Meng, Lexuan; Dragicevic, Tomislav; Guerrero, Josep M.;

    2014-01-01

    . Accordingly, this paper proposes a dynamic consensus algorithm based distributed optimization method aiming at improving the system efficiency while offering higher expandability and flexibility when compared to centralized control. Hardware-in-the-loop (HIL) results are shown to demonstrate the effectiveness...

  5. The Study on Food Sensory Evaluation based on Particle Swarm Optimization Algorithm

    OpenAIRE

    Hairong Wang; Huijuan Xu

    2015-01-01

    In this study, it explores the procedures and methods of the system for establishing food sensory evaluation based on particle swarm optimization algorithm, by means of explaining the interpretation of sensory evaluation and sensory analysis, combined with the applying situation of sensory evaluation in food industry.

  6. Optimization of a Fuzzy-Logic-Control-Based MPPT Algorithm Using the Particle Swarm Optimization Technique

    OpenAIRE

    Po-Chen Cheng; Bo-Rei Peng; Yi-Hua Liu; Yu-Shan Cheng; Jia-Wei Huang

    2015-01-01

    In this paper, an asymmetrical fuzzy-logic-control (FLC)-based maximum power point tracking (MPPT) algorithm for photovoltaic (PV) systems is presented. Two membership function (MF) design methodologies that can improve the effectiveness of the proposed asymmetrical FLC-based MPPT methods are then proposed. The first method can quickly determine the input MF setting values via the power–voltage (P–V) curve of solar cells under standard test conditions (STC). The second method uses the particl...

  7. Optimal battery sizing in photovoltaic based distributed generation using enhanced opposition-based firefly algorithm for voltage rise mitigation.

    Science.gov (United States)

    Wong, Ling Ai; Shareef, Hussain; Mohamed, Azah; Ibrahim, Ahmad Asrul

    2014-01-01

    This paper presents the application of enhanced opposition-based firefly algorithm in obtaining the optimal battery energy storage systems (BESS) sizing in photovoltaic generation integrated radial distribution network in order to mitigate the voltage rise problem. Initially, the performance of the original firefly algorithm is enhanced by utilizing the opposition-based learning and introducing inertia weight. After evaluating the performance of the enhanced opposition-based firefly algorithm (EOFA) with fifteen benchmark functions, it is then adopted to determine the optimal size for BESS. Two optimization processes are conducted where the first optimization aims to obtain the optimal battery output power on hourly basis and the second optimization aims to obtain the optimal BESS capacity by considering the state of charge constraint of BESS. The effectiveness of the proposed method is validated by applying the algorithm to the 69-bus distribution system and by comparing the performance of EOFA with conventional firefly algorithm and gravitational search algorithm. Results show that EOFA has the best performance comparatively in terms of mitigating the voltage rise problem.

  8. Optimal Battery Sizing in Photovoltaic Based Distributed Generation Using Enhanced Opposition-Based Firefly Algorithm for Voltage Rise Mitigation

    Directory of Open Access Journals (Sweden)

    Ling Ai Wong

    2014-01-01

    Full Text Available This paper presents the application of enhanced opposition-based firefly algorithm in obtaining the optimal battery energy storage systems (BESS sizing in photovoltaic generation integrated radial distribution network in order to mitigate the voltage rise problem. Initially, the performance of the original firefly algorithm is enhanced by utilizing the opposition-based learning and introducing inertia weight. After evaluating the performance of the enhanced opposition-based firefly algorithm (EOFA with fifteen benchmark functions, it is then adopted to determine the optimal size for BESS. Two optimization processes are conducted where the first optimization aims to obtain the optimal battery output power on hourly basis and the second optimization aims to obtain the optimal BESS capacity by considering the state of charge constraint of BESS. The effectiveness of the proposed method is validated by applying the algorithm to the 69-bus distribution system and by comparing the performance of EOFA with conventional firefly algorithm and gravitational search algorithm. Results show that EOFA has the best performance comparatively in terms of mitigating the voltage rise problem.

  9. Channel—Optimized VQ Design Based on Partial Distortion Theorem Using Evolutionary Algorithm

    Institute of Scientific and Technical Information of China (English)

    LITianhao

    2003-01-01

    A partial distortion theorem based channel-optimized vector quantization(COVQ)design algorithm using the evolutionary algorithm on noisy algorithm is introduced into the design of COVQ to achieve a significant improvement of vector quantization(VQ)performance for given noisy channel status.The evolutionary strategy is utilized to adjust the subdistortion of each region determined by each codevector in order to improve the total expected distortion.Finally,compared with other conventional codebook design algorithms,the presented algorithm better adjusts the subdistortion of each region and achieves significant gains in average distortion due to hannel errors,over other conventional VQ design methods,as confirmed by the experimental results.

  10. Chaotic migration-based pseudo parallel genetic algorithm and its application in inventory optimization

    Institute of Scientific and Technical Information of China (English)

    Chen Xiaofang; Gui Weihua; Wang Yalin

    2005-01-01

    Considering premature convergence in the searching process of genetic algorithm, a chaotic migration-based pseudo parallel genetic algorithm (CMPPGA) is proposed, which applies the idea of isolated evolution and information exchanging in distributed Parallel Genetic Algorithm by serial program structure to solve optimization problem of low real-time demand. In this algorithm,asynchronic migration of individuals during parallel evolution is guided by a chaotic migration sequence. Infcrmation exchanging among sub-populations is ensured to be efficient and sufficient due to that the sequence is ergodic and stochastic. Simulation study of CMPPGA shows its strong global search ability, superiority to standard genetic algorithm and high immunity against premature convergence. According to the practice of raw material supply, an inventory prcgramming model is set up and solved by CMPPGA with satisfactory results returned.

  11. Damping of Power Systems Oscillations by using Genetic Algorithm-Based Optimal Controller

    Directory of Open Access Journals (Sweden)

    Akram F. Bat

    2010-06-01

    Full Text Available In this paper, the power system stabilizer (PSS and Thyristor controlled phase shifter(TCPS interaction is investigated . The objective of this work is to study and design a controller capable of doing the task of damping in less economical control effort, and to globally link all controllers of national network in an optimal manner , toward smarter grids . This can be well done if a specific coordination between PSS and FACTS devices , is accomplished . Firstly, A genetic algorithm-based controller is used. Genetic Algorithm (GA is utilized to search for optimum controller parameter settings that optimize a given eigenvalue based objective function. Secondly, an optimal pole shifting, based on modern control theory for multi-input multi-output systems, is used. It requires solving first order or second order linear matrix Lyapunov equation for shifting dominant poles to much better location that guaranteed less overshoot and less settling time of system transient response following a disturbance.

  12. Nature-inspired optimization algorithms

    CERN Document Server

    Yang, Xin-She

    2014-01-01

    Nature-Inspired Optimization Algorithms provides a systematic introduction to all major nature-inspired algorithms for optimization. The book's unified approach, balancing algorithm introduction, theoretical background and practical implementation, complements extensive literature with well-chosen case studies to illustrate how these algorithms work. Topics include particle swarm optimization, ant and bee algorithms, simulated annealing, cuckoo search, firefly algorithm, bat algorithm, flower algorithm, harmony search, algorithm analysis, constraint handling, hybrid methods, parameter tuning

  13. Multi-equipment condition based maintenance optimization by multi- objective genetic algorithm

    Directory of Open Access Journals (Sweden)

    Š. Valčuha

    2011-04-01

    Full Text Available Purpose: This paper deals with the optimization of the condition based maintenance (CBM applied on manufacturing multi-equipment system under cost and benefit criteria.Design/methodology/approach: The system is modeled using Discrete Event Simulation (DES and optimized by means of the application of a Multi-Objective Evolutionary Algorithm (MOEA.Findings: Solution for the joint optimization of the condition based maintenance model applied on several equipment has been obtained.Research limitations/implications: The developed approach has been successfully applied to the optimization of condition based maintenance activities of a hubcap production system composed by three plastic injection machines and a painting station, for management decision support.Originality/value: This paper provides a solution for the joint optimization of CBM strategies applied on several equipments

  14. A Novel Hybrid Algorithm for Software Cost Estimation Based on Cuckoo Optimization and K-Nearest Neighbors Algorithms

    Directory of Open Access Journals (Sweden)

    E. E. Miandoab

    2016-06-01

    Full Text Available The inherent uncertainty to factors such as technology and creativity in evolving software development is a major challenge for the management of software projects. To address these challenges the project manager, in addition to examining the project progress, may cope with problems such as increased operating costs, lack of resources, and lack of implementation of key activities to better plan the project. Software Cost Estimation (SCE models do not fully cover new approaches. And this lack of coverage is causing problems in the consumer and producer ends. In order to avoid these problems, many methods have already been proposed. Model-based methods are the most familiar solving technique. But it should be noted that model-based methods use a single formula and constant values, and these methods are not responsive to the increasing developments in the field of software engineering. Accordingly, researchers have tried to solve the problem of SCE using machine learning algorithms, data mining algorithms, and artificial neural networks. In this paper, a hybrid algorithm that combines COA-Cuckoo optimization and K-Nearest Neighbors (KNN algorithms is used. The so-called composition algorithm runs on six different data sets and is evaluated based on eight evaluation criteria. The results show an improved accuracy of estimated cost.

  15. Resource Optimization in Mobile Communication Networks With User Profile-Based Algorithms

    Directory of Open Access Journals (Sweden)

    R. Bajcsy,

    2012-04-01

    Full Text Available In mobile communications networks, Location Management enables the roaming of the user in the coverage area. The employment of the call and mobility patterns of the user can help minimize the signaling costs involved in Location Management, and optimize the available radio resources. In this paper, we carry out an exhaustive analysis of the location update costs involved in a user profile-based Location Management algorithm, and compare its performance with the classical strategy of static location areas. As original contributions, we introduce two new algorithms to obtain the β parameters, useful for the calculation of the Location Management signaling costs. Making use of these new algorithms, we show the convenience of the application of user profile-based strategies for Location Management in order to optimize the available radio resources, and we obtain practical guidelines for the optimum design of mobile communications networks.

  16. Optimizing of large-number-patterns string matching algorithms based on definite-state automata

    Institute of Scientific and Technical Information of China (English)

    CHEN Xun-xun; FANG Bin-xing

    2007-01-01

    Because the small CACHE size of computers, the scanning speed of DFA based multi-pattern stringmatching algorithms slows down rapidly especially when the number of patterns is very large. For solving such problems, we cut down the scanning time of those algorithms (i.e. DFA based) by rearranging the states table and shrinking the DFA alphabet size. Both the methods can decrease the probability of large-scale random memory accessing and increase the probability of continuously memory accessing. Then the hitting rate of the CACHE is increased and the searching time of on the DFA is reduced. Shrinking the alphabet size of the DFA also reduces the storage complication. The AC + + algorithm, by optimizing the Aho-Corasick ( i. e. AC) algorithm using such methods, proves the theoretical analysis. And the experimentation results show that the scanning time of AC + + and the storage occupied is better than that of AC in most cases and the result is much attractive when the number of patterns is very large. Because DFA is a widely used base algorithm in may string matching algorithms, such as DAWG, SBOM etc. , the optimizing method discussed is significant in practice.

  17. Optimization of Nano-Process Deposition Parameters Based on Gravitational Search Algorithm

    Directory of Open Access Journals (Sweden)

    Norlina Mohd Sabri

    2016-06-01

    Full Text Available This research is focusing on the radio frequency (RF magnetron sputtering process, a physical vapor deposition technique which is widely used in thin film production. This process requires the optimized combination of deposition parameters in order to obtain the desirable thin film. The conventional method in the optimization of the deposition parameters had been reported to be costly and time consuming due to its trial and error nature. Thus, gravitational search algorithm (GSA technique had been proposed to solve this nano-process parameters optimization problem. In this research, the optimized parameter combination was expected to produce the desirable electrical and optical properties of the thin film. The performance of GSA in this research was compared with that of Particle Swarm Optimization (PSO, Genetic Algorithm (GA, Artificial Immune System (AIS and Ant Colony Optimization (ACO. Based on the overall results, the GSA optimized parameter combination had generated the best electrical and an acceptable optical properties of thin film compared to the others. This computational experiment is expected to overcome the problem of having to conduct repetitive laboratory experiments in obtaining the most optimized parameter combination. Based on this initial experiment, the adaptation of GSA into this problem could offer a more efficient and productive way of depositing quality thin film in the fabrication process.

  18. An Optimal Energy Management System for Electric Vehicles using Firefly Optimization Algorithm based Dynamic EDF Scheduling

    Directory of Open Access Journals (Sweden)

    E.Kayalvizhi

    2015-08-01

    Full Text Available Mitigation of global warming gases from burning gasoline for transportation in vehicles is one of the biggest and most complex issues the world has ever faced. In an intention to eradicate the environmental crisis caused due to global warming, electric vehicles were been introduced that are powered by electric motor which works on the energy stored in a battery pack. Inspired by the research on power management in electric vehicles, this paper focuses on the development of an energy management system for electric vehicles (EMSEV to optimally balance the energy from battery pack. The proposed methodology uses firefly optimization algorithm to optimize the power consumption of the devices like electric motor, power steering, air conditioner, power window, automatic door locks, radio, speaker, horn, wiper, GPS, internal and external lights etc., from the battery in electric vehicles. Depending upon the distance to cover and the battery availability, the devices are made to switch down automatically through dynamic EDF scheduling. CAN protocol is used for effective communication between the devices and the controller. Simulation results are obtained using MATLAB.

  19. Optimization of volume to point conduction problem based on a novel thermal conductivity discretization algorithm

    Institute of Scientific and Technical Information of China (English)

    Wenjing Du; Peili Wang; Lipeng Song; Lin Cheng

    2015-01-01

    A conduction heat transfer process is enhanced by filling prescribed quantity and optimized-shaped high thermal conductivity materials to the substrate. Numerical simulations and analyses are performed on a volume to point conduction problem based on the principle of minimum entropy generation. In the optimization, the arrange-ment of high thermal conductivity materials is variable, the quantity of high thermal-conductivity material is constrained, and the objective is to obtain the maximum heat conduction rate as the entropy is the minimum. A novel algorithm of thermal conductivity discretization is proposed based on large quantity of calculations. Compared with other algorithms in literature, the average temperature in the substrate by the new algorithm is lower, while the highest temperature in the substrate is in a reasonable range. Thus the new algorithm is fea-sible. The optimization of volume to point heat conduction is carried out in a rectangular model with radiation boundary condition and constant surface temperature boundary condition. The results demonstrate that the al-gorithm of thermal conductivity discretization is applicable for volume to point heat conduction problems.

  20. A feature extraction method of the particle swarm optimization algorithm based on adaptive inertia weight and chaos optimization for Brillouin scattering spectra

    Science.gov (United States)

    Zhang, Yanjun; Zhao, Yu; Fu, Xinghu; Xu, Jinrui

    2016-10-01

    A novel particle swarm optimization algorithm based on adaptive inertia weight and chaos optimization is proposed for extracting the features of Brillouin scattering spectra. Firstly, the adaptive inertia weight parameter of the velocity is introduced to the basic particle swarm algorithm. Based on the current iteration number of particles and the adaptation value, the algorithm can change the weight coefficient and adjust the iteration speed of searching space for particles, so the local optimization ability can be enhanced. Secondly, the logical self-mapping chaotic search is carried out by using the chaos optimization in particle swarm optimization algorithm, which makes the particle swarm optimization algorithm jump out of local optimum. The novel algorithm is compared with finite element analysis-Levenberg Marquardt algorithm, particle swarm optimization-Levenberg Marquardt algorithm and particle swarm optimization algorithm by changing the linewidth, the signal-to-noise ratio and the linear weight ratio of Brillouin scattering spectra. Then the algorithm is applied to the feature extraction of Brillouin scattering spectra in different temperatures. The simulation analysis and experimental results show that this algorithm has a high fitting degree and small Brillouin frequency shift error for different linewidth, SNR and linear weight ratio. Therefore, this algorithm can be applied to the distributed optical fiber sensing system based on Brillouin optical time domain reflection, which can effectively improve the accuracy of Brillouin frequency shift extraction.

  1. Ant-Based Phylogenetic Reconstruction (ABPR: A new distance algorithm for phylogenetic estimation based on ant colony optimization

    Directory of Open Access Journals (Sweden)

    Karla Vittori

    2008-12-01

    Full Text Available We propose a new distance algorithm for phylogenetic estimation based on Ant Colony Optimization (ACO, named Ant-Based Phylogenetic Reconstruction (ABPR. ABPR joins two taxa iteratively based on evolutionary distance among sequences, while also accounting for the quality of the phylogenetic tree built according to the total length of the tree. Similar to optimization algorithms for phylogenetic estimation, the algorithm allows exploration of a larger set of nearly optimal solutions. We applied the algorithm to four empirical data sets of mitochondrial DNA ranging from 12 to 186 sequences, and from 898 to 16,608 base pairs, and covering taxonomic levels from populations to orders. We show that ABPR performs better than the commonly used Neighbor-Joining algorithm, except when sequences are too closely related (e.g., population-level sequences. The phylogenetic relationships recovered at and above species level by ABPR agree with conventional views. However, like other algorithms of phylogenetic estimation, the proposed algorithm failed to recover expected relationships when distances are too similar or when rates of evolution are very variable, leading to the problem of long-branch attraction. ABPR, as well as other ACO-based algorithms, is emerging as a fast and accurate alternative method of phylogenetic estimation for large data sets.

  2. Model parameters estimation of aero-engine based on hybrid optimization algorithm%Model parameters estimation of aero-engine based on hybrid optimization algorithm

    Institute of Scientific and Technical Information of China (English)

    LI Qiu-hong; LI Ye-bo; JIANG Dian-wen

    2011-01-01

    A hybrid optimization algorithm for the time-domain identification of multivariable,state space model for aero-engine was presented in this paper.The optimization procedure runs particle swarm optimization(PSO) and least squares optimization(LSO) "in series".PSO starts from an initial population and searches for the optimum solution by updating generations.However,it can sometimes run into a suboptimal solution.Then LSO can start from the suboptimal solution of PSO,and get an optimum solution by conjugate gradient algorithm.The algorithm is suitable for the high-order multivariable system which has many parameters to be estimated in wide ranges.Hybrid optimization algorithm is applied to estimate the parameters of a 4-input 4-output state variable model(SVM) for aero-engine.The simulation results demonstrate the effectiveness of the proposed algorithm.

  3. Supercontinuum optimization for dual-soliton based light sources using genetic algorithms in a Grid platform

    CERN Document Server

    Arteaga-Sierra, F R; Torres-Gómez, I; Torres-Cisneros, M; Moltó, G; Ferrando, A

    2014-01-01

    We present a numerical strategy to design fiber based dual pulse light sources exhibiting two predefined spectral peaks in the anomalous group velocity dispersion regime. The frequency conversion is based on the soliton fission and soliton self-frequency shift occurring during supercontinuum generation. The optimization process is carried out by a genetic algorithm that provides the optimum input pulse parameters: wavelength, temporal width and peak power. This algorithm is implemented in a Grid platform in order to take advantage of distributed computing. These results are useful for optical coherence tomography applications where bell-shaped pulses located in the second near-infrared window are needed.

  4. A New Optimization Approach for Maximizing the Photovoltaic Panel Power Based on Genetic Algorithm and Lagrange Multiplier Algorithm

    Directory of Open Access Journals (Sweden)

    Mahdi M. M. El-Arini

    2013-01-01

    Full Text Available In recent years, the solar energy has become one of the most important alternative sources of electric energy, so it is important to operate photovoltaic (PV panel at the optimal point to obtain the possible maximum efficiency. This paper presents a new optimization approach to maximize the electrical power of a PV panel. The technique which is based on objective function represents the output power of the PV panel and constraints, equality and inequality. First the dummy variables that have effect on the output power are classified into two categories: dependent and independent. The proposed approach is a multistage one as the genetic algorithm, GA, is used to obtain the best initial population at optimal solution and this initial population is fed to Lagrange multiplier algorithm (LM, then a comparison between the two algorithms, GA and LM, is performed. The proposed technique is applied to solar radiation measured at Helwan city at latitude 29.87°, Egypt. The results showed that the proposed technique is applicable.

  5. A fuzzy c-means bi-sonar-based Metaheuristic Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Koffka Khan

    2012-12-01

    Full Text Available Fuzzy clustering is an important problem which is the subject of active research in several real world applications. Fuzzy c-means (FCM algorithm is one of the most popular fuzzy clustering techniques because it is efficient, straightforward, and easy to implement. Fuzzy clustering methods allow the objects to belong to several clusters simultaneously, with different degrees of membership. Objects on the boundaries between several classes are not forced to fully belong to one of the classes, but rather are assigned membership degrees between 0 and 1 indicating their partial membership. However FCM is sensitive to initialization and is easily trapped in local optima. Bi-sonar optimization (BSO is a stochastic global Metaheuristic optimization tool and is a relatively new algorithm. In this paper a hybrid fuzzy clustering method FCB based on FCM and BSO is proposed which makes use of the merits of both algorithms. Experimental results show that this proposed method is efficient and reveals encouraging results.

  6. Regenerative Braking Algorithm for an ISG HEV Based on Regenerative Torque Optimization

    Institute of Scientific and Technical Information of China (English)

    XIAO Wen-yong; WANG Feng; ZHUO Bin

    2008-01-01

    A novel regenerative braking algorithm based on regenerative torque optimization with emulate engine compression braking (EECB) was proposed to make effective and maximum use of brake energy in order to improve fuel economy. The actual brake oil pressure of driving wheel which is reduced by the amount of the regenerative braking force is supplied from the electronic hydraulic brake system. Regenerative torque optimization maximizes the actual regenerative power recuperation by energy storage component, and EECB is a useful extended type of regenerative braking. The simulation results show that actual regenerative power recuperation for the novel regenerative braking algorithm is more than using conventional one, and life-span of brake disks is prolonged for the novel algorithm.

  7. Evolutionary Algorithm based on simulated annealing for the multi-objective optimization of combinatorial problems

    Directory of Open Access Journals (Sweden)

    Elias David Nino Ruiz

    2013-05-01

    Full Text Available This paper states a novel hybrid-metaheuristic based on the Theory of Deterministic Swapping, Theory of Evolution and Simulated Annealing Metaheuristic for the multi-objective optimization of combinatorial problems. The proposed algorithm is named EMSA. It is an improvement of MODS algorithm. Unlike MODS, EMSA works using a search direction given through the assignation of weights to each function of the combinatorial problem to optimize. Also, in order to avoid local optimums, EMSA uses crossover strategy of Genetic Algorithm. Lastly, EMSA is tested using well know instances of the Bi-Objective Traveling Salesman Problem (TSP from TSPLIB. Its results were compared with MODS Metaheuristic (its precessor. The comparison was made using metrics from the specialized literature such as Spacing, Generational Distance, Inverse Generational Distance and Non-Dominated Generation Vectors. In every case, the EMSA results on the metrics were always better and in some of those cases, the superiority was 100%.

  8. A Simulation Optimization Algorithm for CTMDPs Based on Randomized Stationary Policies1)

    Institute of Scientific and Technical Information of China (English)

    TANGHao; XIHong-Sheng; YINBao-Qun

    2004-01-01

    Based on the theory of Markov performance potentials and neuro-dynamic programming(NDP) methodology, we study simulation optimization algorithm for a class of continuous timeMarkov decision processes (CTMDPs) under randomized stationary policies. The proposed algo-rithm will estimate the gradient of average cost performance measure with respect to policy param-eters by transforming a continuous time Markov process into a uniform Markov chain and simula-ting a single sample path of the chain. The goal is to look for a suboptimal randomized stationarypolicy. The algorithm derived here can meet the needs of performance optimization of many diffi-cult systems with large-scale state space. Finally, a numerical example for a controlled Markovprocess is provided.

  9. An Enhanced PSO-Based Clustering Energy Optimization Algorithm for Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    C. Vimalarani

    2016-01-01

    Full Text Available Wireless Sensor Network (WSN is a network which formed with a maximum number of sensor nodes which are positioned in an application environment to monitor the physical entities in a target area, for example, temperature monitoring environment, water level, monitoring pressure, and health care, and various military applications. Mostly sensor nodes are equipped with self-supported battery power through which they can perform adequate operations and communication among neighboring nodes. Maximizing the lifetime of the Wireless Sensor networks, energy conservation measures are essential for improving the performance of WSNs. This paper proposes an Enhanced PSO-Based Clustering Energy Optimization (EPSO-CEO algorithm for Wireless Sensor Network in which clustering and clustering head selection are done by using Particle Swarm Optimization (PSO algorithm with respect to minimizing the power consumption in WSN. The performance metrics are evaluated and results are compared with competitive clustering algorithm to validate the reduction in energy consumption.

  10. An Enhanced PSO-Based Clustering Energy Optimization Algorithm for Wireless Sensor Network.

    Science.gov (United States)

    Vimalarani, C; Subramanian, R; Sivanandam, S N

    2016-01-01

    Wireless Sensor Network (WSN) is a network which formed with a maximum number of sensor nodes which are positioned in an application environment to monitor the physical entities in a target area, for example, temperature monitoring environment, water level, monitoring pressure, and health care, and various military applications. Mostly sensor nodes are equipped with self-supported battery power through which they can perform adequate operations and communication among neighboring nodes. Maximizing the lifetime of the Wireless Sensor networks, energy conservation measures are essential for improving the performance of WSNs. This paper proposes an Enhanced PSO-Based Clustering Energy Optimization (EPSO-CEO) algorithm for Wireless Sensor Network in which clustering and clustering head selection are done by using Particle Swarm Optimization (PSO) algorithm with respect to minimizing the power consumption in WSN. The performance metrics are evaluated and results are compared with competitive clustering algorithm to validate the reduction in energy consumption. PMID:26881273

  11. Genetic algorithm based optimization of pulse profile for MOPA based high power fiber lasers

    Science.gov (United States)

    Zhang, Jiawei; Tang, Ming; Shi, Jun; Fu, Songnian; Li, Lihua; Liu, Ying; Cheng, Xueping; Liu, Jian; Shum, Ping

    2015-03-01

    Although the Master Oscillator Power-Amplifier (MOPA) based fiber laser has received much attention for laser marking process due to its large tunabilty of pulse duration (from 10ns to 1ms), repetition rate (100Hz to 500kHz), high peak power and extraordinary heat dissipating capability, the output pulse deformation due to the saturation effect of fiber amplifier is detrimental for many applications. We proposed and demonstrated that, by utilizing Genetic algorithm (GA) based optimization technique, the input pulse profile from the master oscillator (current-driven laser diode) could be conveniently optimized to achieve targeted output pulse shape according to real parameters' constraints. In this work, an Yb-doped high power fiber amplifier is considered and a 200ns square shaped pulse profile is the optimization target. Since the input pulse with longer leading edge and shorter trailing edge can compensate the saturation effect, linear, quadratic and cubic polynomial functions are used to describe the input pulse with limited number of unknowns(cost and hardware limitations, the cubic input pulse with 4 coefficients is found to be the best as the output amplified pulse can achieve excellent flatness within the square shape. Considering the bandwidth constraint of practical electronics, we examined high-frequency component cut-off effect of input pulses and found that the optimized cubic input pulses with 300MHz bandwidth is still quite acceptable to satisfy the requirement for the amplified output pulse and it is feasible to establish such a pulse generator in real applications.

  12. A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem

    Science.gov (United States)

    Lim, Wee Loon; Wibowo, Antoni; Desa, Mohammad Ishak; Haron, Habibollah

    2016-01-01

    The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par with other optimization methods. A classical BBO algorithm employs the mutation operator as its diversification strategy. However, this process will often ruin the quality of solutions in QAP. In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure. Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times. Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them. PMID:26819585

  13. Model-based optimization strategy of chiller driven liquid desiccant dehumidifier with genetic algorithm

    International Nuclear Information System (INIS)

    This study presents a model-based optimization strategy for an actual chiller driven dehumidifier of liquid desiccant dehumidification system operating with lithium chloride solution. By analyzing the characteristics of the components, energy predictive models for the components in the dehumidifier are developed. To minimize the energy usage while maintaining the outlet air conditions at the pre-specified set-points, an optimization problem is formulated with an objective function, the constraints of mechanical limitations and components interactions. Model-based optimization strategy using genetic algorithm is proposed to obtain the optimal set-points for desiccant solution temperature and flow rate, to minimize the energy usage in the dehumidifier. Experimental studies on an actual system are carried out to compare energy consumption between the proposed optimization and the conventional strategies. The results demonstrate that energy consumption using the proposed optimization strategy can be reduced by 12.2% in the dehumidifier operation. - Highlights: • Present a model-based optimization strategy for energy saving in LDDS. • Energy predictive models for components in dehumidifier are developed. • The Optimization strategy are applied and tested in an actual LDDS. • Optimization strategy can achieve energy savings by 12% during operation

  14. Cuckoo Search Algorithm Based on Repeat-Cycle Asymptotic Self-Learning and Self-Evolving Disturbance for Function Optimization.

    Science.gov (United States)

    Wang, Jie-sheng; Li, Shu-xia; Song, Jiang-di

    2015-01-01

    In order to improve convergence velocity and optimization accuracy of the cuckoo search (CS) algorithm for solving the function optimization problems, a new improved cuckoo search algorithm based on the repeat-cycle asymptotic self-learning and self-evolving disturbance (RC-SSCS) is proposed. A disturbance operation is added into the algorithm by constructing a disturbance factor to make a more careful and thorough search near the bird's nests location. In order to select a reasonable repeat-cycled disturbance number, a further study on the choice of disturbance times is made. Finally, six typical test functions are adopted to carry out simulation experiments, meanwhile, compare algorithms of this paper with two typical swarm intelligence algorithms particle swarm optimization (PSO) algorithm and artificial bee colony (ABC) algorithm. The results show that the improved cuckoo search algorithm has better convergence velocity and optimization accuracy. PMID:26366164

  15. Cuckoo Search Algorithm Based on Repeat-Cycle Asymptotic Self-Learning and Self-Evolving Disturbance for Function Optimization

    Directory of Open Access Journals (Sweden)

    Jie-sheng Wang

    2015-01-01

    Full Text Available In order to improve convergence velocity and optimization accuracy of the cuckoo search (CS algorithm for solving the function optimization problems, a new improved cuckoo search algorithm based on the repeat-cycle asymptotic self-learning and self-evolving disturbance (RC-SSCS is proposed. A disturbance operation is added into the algorithm by constructing a disturbance factor to make a more careful and thorough search near the bird’s nests location. In order to select a reasonable repeat-cycled disturbance number, a further study on the choice of disturbance times is made. Finally, six typical test functions are adopted to carry out simulation experiments, meanwhile, compare algorithms of this paper with two typical swarm intelligence algorithms particle swarm optimization (PSO algorithm and artificial bee colony (ABC algorithm. The results show that the improved cuckoo search algorithm has better convergence velocity and optimization accuracy.

  16. Optimal fuzzy PID controller with adjustable factors based on flexible polyhedron search algorithm

    Institute of Scientific and Technical Information of China (English)

    谭冠政; 肖宏峰; 王越超

    2002-01-01

    A new kind of optimal fuzzy PID controller is proposed, which contains two parts. One is an on-line fuzzy inference system, and the other is a conventional PID controller. In the fuzzy inference system, three adjustable factors xp, xi, and xd are introduced. Their functions are to further modify and optimize the result of the fuzzy inference so as to make the controller have the optimal control effect on a given object. The optimal values of these adjustable factors are determined based on the ITAE criterion and the Nelder and Mead′s flexible polyhedron search algorithm. This optimal fuzzy PID controller has been used to control the executive motor of the intelligent artificial leg designed by the authors. The result of computer simulation indicates that this controller is very effective and can be widely used to control different kinds of objects and processes.

  17. Binary teaching-learning-based optimization algorithm is used to investigate the superscattering plasmonic nanodisk

    Science.gov (United States)

    Kaboli, M.; Akhlaghi, M.

    2016-06-01

    A new efficient binary optimization method based on Teaching-Learning-Based Optimization (TLBO) algorithm is proposed to design an array of plasmonic nanodisks in order to achieve maximum scattering coefficient spectrum. In binary TLBO (BTLBO), a group of learner consists of a matrix with binary entries; control the presence (`1') or the absence (`0') of nanodisks in the array. Simulation results show that scattering coefficient strongly depends on the localized position of nanoparticles and non-periodic structures have more appropriate response in term of scattering coefficient. This approach can be useful in optical applications such as plasmonic nanoantennas.

  18. Modeling and Optimization for Heat Exchanger Networks Synthesis Based on Expert System and Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    LIZhihong

    2002-01-01

    A new superstructure from of heat exchanger networks(HEN) is proposed based on expert system (ES). The new superstructure from is combined with the practical engineering.The different investment cost formula for different heat exchanger is also presented based on ES.The mathematical model for the simultaneous optimization of network configuration is established and solved by a genetic algorithm.This method can deal with larger scale HEN synthesis and the optimal HEN configuration is obtained automatically.Finally,a case study is presented to demonstrate the effectiveness of the method.

  19. Optimization of multi-objective integrated process planning and scheduling problem using a priority based optimization algorithm

    Science.gov (United States)

    Ausaf, Muhammad Farhan; Gao, Liang; Li, Xinyu

    2015-12-01

    For increasing the overall performance of modern manufacturing systems, effective integration of process planning and scheduling functions has been an important area of consideration among researchers. Owing to the complexity of handling process planning and scheduling simultaneously, most of the research work has been limited to solving the integrated process planning and scheduling (IPPS) problem for a single objective function. As there are many conflicting objectives when dealing with process planning and scheduling, real world problems cannot be fully captured considering only a single objective for optimization. Therefore considering multi-objective IPPS (MOIPPS) problem is inevitable. Unfortunately, only a handful of research papers are available on solving MOIPPS problem. In this paper, an optimization algorithm for solving MOIPPS problem is presented. The proposed algorithm uses a set of dispatching rules coupled with priority assignment to optimize the IPPS problem for various objectives like makespan, total machine load, total tardiness, etc. A fixed sized external archive coupled with a crowding distance mechanism is used to store and maintain the non-dominated solutions. To compare the results with other algorithms, a C-matric based method has been used. Instances from four recent papers have been solved to demonstrate the effectiveness of the proposed algorithm. The experimental results show that the proposed method is an efficient approach for solving the MOIPPS problem.

  20. A hybrid algorithm for instant optimization of beam weights in anatomy-based intensity modulated radiotherapy: a performance evaluation study

    International Nuclear Information System (INIS)

    The study aims to introduce a hybrid optimization algorithm for anatomy-based intensity modulated radiotherapy (AB-IMRT). Our proposal is that by integrating an exact optimization algorithm with a heuristic optimization algorithm, the advantages of both the algorithms can be combined, which will lead to an efficient global optimizer solving the problem at a very fast rate. Our hybrid approach combines Gaussian elimination algorithm (exact optimizer) with fast simulated annealing algorithm (a heuristic global optimizer) for the optimization of beam weights in AB-IMRT. The algorithm has been implemented using MATLAB software. The optimization efficiency of the hybrid algorithm is clarified by (i) analysis of the numerical characteristics of the algorithm and (ii) analysis of the clinical capabilities of the algorithm. The numerical and clinical characteristics of the hybrid algorithm are compared with Gaussian elimination method (GEM) and fast simulated annealing (FSA). The numerical characteristics include convergence, consistency, number of iterations and overall optimization speed, which were analyzed for the respective cases of 8 patients. The clinical capabilities of the hybrid algorithm are demonstrated in cases of (a) prostate and (b) brain. The analyses reveal that (i) the convergence speed of the hybrid algorithm is approximately three times higher than that of FSA algorithm (ii) the convergence (percentage reduction in the cost function) in hybrid algorithm is about 20% improved as compared to that in GEM algorithm (iii) the hybrid algorithm is capable of producing relatively better treatment plans in terms of Conformity Index (CI) (∼ 2% - 5% improvement) and Homogeneity Index (HI) (∼ 4% - 10% improvement) as compared to GEM and FSA algorithms (iv) the sparing of organs at risk in hybrid algorithm-based plans is better than that in GEM-based plans and comparable to that in FSA-based plans; and (v) the beam weights resulting from the hybrid algorithm are

  1. Integrated Multiobjective Optimal Design for Active Control System Based on Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Ma Yong-Quan

    2014-01-01

    Full Text Available The integrated multiobjective optimal design method for structural active control system is put forward based on improved Pareto multiobjective genetic algorithm, through which the position of actuator is synchronously optimized with active controller. External excitation is simulated by stationary filtered white noise. The root-mean-square (RMS of structural response and active control force can be achieved by solving Lyapunov equation in the state space. The design of active controller adopts linear quadratic regulator (LQR control algorithm. Minimum ratio of the maximum RMS of controlled structural displacement divided by the maximum RMS of uncontrolled structural displacement and minimum ratio of the maximum RMS of controlled structural shear divided by the maximum RMS of uncontrolled structural shear, together with minimization of the sum of RMS of active control force, are used as the three objective functions of multiobjective optimization. The optimization process takes the impact of structure and excitation parameter on the optimized results. An eight-storey six-span plane steel frame was used as an emulational example to demonstrate the validity of this optimization method. Results show that the proposed integrated multiobjective optimal design method is simple, efficient, and practical with good universality.

  2. An ant colony optimization based algorithm for identifying gene regulatory elements.

    Science.gov (United States)

    Liu, Wei; Chen, Hanwu; Chen, Ling

    2013-08-01

    It is one of the most important tasks in bioinformatics to identify the regulatory elements in gene sequences. Most of the existing algorithms for identifying regulatory elements are inclined to converge into a local optimum, and have high time complexity. Ant Colony Optimization (ACO) is a meta-heuristic method based on swarm intelligence and is derived from a model inspired by the collective foraging behavior of real ants. Taking advantage of the ACO in traits such as self-organization and robustness, this paper designs and implements an ACO based algorithm named ACRI (ant-colony-regulatory-identification) for identifying all possible binding sites of transcription factor from the upstream of co-expressed genes. To accelerate the ants' searching process, a strategy of local optimization is presented to adjust the ants' start positions on the searched sequences. By exploiting the powerful optimization ability of ACO, the algorithm ACRI can not only improve precision of the results, but also achieve a very high speed. Experimental results on real world datasets show that ACRI can outperform other traditional algorithms in the respects of speed and quality of solutions. PMID:23746735

  3. A Method for Crude Oil Selection and Blending Optimization Based on Improved Cuckoo Search Algorithm

    Institute of Scientific and Technical Information of China (English)

    Yang Huihua; Ma Wei; Zhang Xiaofeng; Li Hu; Tian Songbai

    2014-01-01

    Reifneries often need to ifnd similar crude oil to replace the scarce crude oil for stabilizing the feedstock prop-erty. We introduced the method for calculation of crude blended properties ifrstly, and then created a crude oil selection and blending optimization model based on the data of crude oil property. The model is a mixed-integer nonlinear programming (MINLP) with constraints, and the target is to maximize the similarity between the blended crude oil and the objective crude oil. Furthermore, the model takes into account the selection of crude oils and their blending ratios simultaneously, and trans-forms the problem of looking for similar crude oil into the crude oil selection and blending optimization problem. We ap-plied the Improved Cuckoo Search (ICS) algorithm to solving the model. Through the simulations, ICS was compared with the genetic algorithm, the particle swarm optimization algorithm and the CPLEX solver. The results show that ICS has very good optimization efifciency. The blending solution can provide a reference for reifneries to ifnd the similar crude oil. And the method proposed can also give some references to selection and blending optimization of other materials.

  4. Internal structural optimization of hollow fan blade based on sequential quadratic programming algorithm

    Institute of Scientific and Technical Information of China (English)

    YANG Jian-qiu; WANG Yan-rong

    2011-01-01

    Several structural design parameters for the description of the geometric features of a hollow fan blade were determined. A structural design optimization model of a hollow fan blade which based on the strength constraint and minimum mass was established based on the finite element method through these parameters. Then, the sequential quadratic programming algorithm was employed to search the optimal solutions. Several groups of value for initial design variables were chosen, for the purpose of not only finding much more local optimal results but also analyzing which discipline that the variables according to could be benefit for the convergence and robustness. Response surface method and Monte Carlo simulations were used to analyze whether the objective function and constraint function are sensitive to the variation of variables or not. Then the robust results could be found among a group of different local optimal solutions.

  5. A Novel Rough Set Reduct Algorithm for Medical Domain Based on Bee Colony Optimization

    CERN Document Server

    Suguna, N

    2010-01-01

    Feature selection refers to the problem of selecting relevant features which produce the most predictive outcome. In particular, feature selection task is involved in datasets containing huge number of features. Rough set theory has been one of the most successful methods used for feature selection. However, this method is still not able to find optimal subsets. This paper proposes a new feature selection method based on Rough set theory hybrid with Bee Colony Optimization (BCO) in an attempt to combat this. This proposed work is applied in the medical domain to find the minimal reducts and experimentally compared with the Quick Reduct, Entropy Based Reduct, and other hybrid Rough Set methods such as Genetic Algorithm (GA), Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO).

  6. Load Distribution of Evolutionary Algorithm for Complex-Process Optimization Based on Differential Evolutionary Strategy in Hot Rolling Process

    OpenAIRE

    Xu Yang; Chang-bin Hu; Kai-xiang Peng; Chao-nan Tong

    2013-01-01

    Based on the hot rolling process, a load distribution optimization model is established, which includes rolling force model, thickness distribution model, and temperature model. The rolling force ratio distribution and good strip shape are integrated as two indicators of objective function in the optimization model. Then, the evolutionary algorithm for complex-process optimization (EACOP) is introduced in the following optimization algorithm. Due to its flexible framework structure on search ...

  7. Dynamic artificial bee colony algorithm for multi-parameters optimization of support vector machine-based soft-margin classifier

    Science.gov (United States)

    Yan, Yiming; Zhang, Ye; Gao, Fengjiao

    2012-12-01

    This article proposes a `dynamic' artificial bee colony (D-ABC) algorithm for solving optimizing problems. It overcomes the poor performance of artificial bee colony (ABC) algorithm, when applied to multi-parameters optimization. A dynamic `activity' factor is introduced to D-ABC algorithm to speed up convergence and improve the quality of solution. This D-ABC algorithm is employed for multi-parameters optimization of support vector machine (SVM)-based soft-margin classifier. Parameter optimization is significant to improve classification performance of SVM-based classifier. Classification accuracy is defined as the objection function, and the many parameters, including `kernel parameter', `cost factor', etc., form a solution vector to be optimized. Experiments demonstrate that D-ABC algorithm has better performance than traditional methods for this optimizing problem, and better parameters of SVM are obtained which lead to higher classification accuracy.

  8. Managing Emergencies Optimally Using a Random Neural Network-Based Algorithm

    Directory of Open Access Journals (Sweden)

    Qing Han

    2013-10-01

    Full Text Available Emergency rescues require that first responders provide support to evacuate injured and other civilians who are obstructed by the hazards. In this case, the emergency personnel can take actions strategically in order to rescue people maximally, efficiently and quickly. The paper studies the effectiveness of a random neural network (RNN-based task assignment algorithm involving optimally matching emergency personnel and injured civilians, so that the emergency personnel can aid trapped people to move towards evacuation exits in real-time. The evaluations are run on a decision support evacuation system using the Distributed Building Evacuation Simulator (DBES multi-agent platform in various emergency scenarios. The simulation results indicate that the RNN-based task assignment algorithm provides a near-optimal solution to resource allocation problems, which avoids resource wastage and improves the efficiency of the emergency rescue process.

  9. Histogram-Based Estimation of Distribution Algorithm: A Competent Method for Continuous Optimization

    Institute of Scientific and Technical Information of China (English)

    Nan Ding; Shu-De Zhou; Zeng-Qi Sun

    2008-01-01

    Designing efficient estimation of distribution algorithms for optimizing complex continuous problems is still a challenging task. This paper utilizes histogram probabilistic model to describe the distribution of population and to generate promising solutions. The advantage of histogram model, its intrinsic multimodality, makes it proper to describe the solution distribution of complex and multimodal continuous problems. To make histogram model more efficiently explore and exploit the search space, several strategies are brought into the algorithms: the surrounding effect reduces the population size in estimating the model with a certain number of the bins and the shrinking strategy guarantees the accuracy of optimal solutions. Furthermore, this paper shows that histogram-based EDA (Estimation of distributiona lgorithm) can give comparable or even much better performance than those predominant EDAs based on Gaussianmodels.

  10. Broadband and Broad-Angle Low-Scattering Metasurface Based on Hybrid Optimization Algorithm

    Science.gov (United States)

    Wang, Ke; Zhao, Jie; Cheng, Qiang; Dong, Di Sha; Cui, Tie Jun

    2014-01-01

    A broadband and broad-angle low-scattering metasurface is designed, fabricated, and characterized. Based on the optimization algorithm and far-field scattering pattern analysis, we propose a rapid and efficient method to design metasurfaces, which avoids the large amount of time-consuming electromagnetic simulations. Full-wave simulation and measurement results show that the proposed metasurface is insensitive to the polarization of incident waves, and presents good scattering-reduction properties for oblique incident waves. PMID:25089367

  11. Broadband and Broad-Angle Low-Scattering Metasurface Based on Hybrid Optimization Algorithm

    OpenAIRE

    Ke Wang; Jie Zhao; Qiang Cheng; Di Sha Dong; Tie Jun Cui

    2014-01-01

    A broadband and broad-angle low-scattering metasurface is designed, fabricated, and characterized. Based on the optimization algorithm and far-field scattering pattern analysis, we propose a rapid and efficient method to design metasurfaces, which avoids the large amount of time-consuming electromagnetic simulations. Full-wave simulation and measurement results show that the proposed metasurface is insensitive to the polarization of incident waves, and presents good scattering-reduction prope...

  12. Optimization of Rolling Force Distribution Based on Niche Genetic Algorithm in Continuous Hot Rolling Mills

    Institute of Scientific and Technical Information of China (English)

    LIU Zi-ping; LI Li-xin

    2013-01-01

    Based on the niche genetic algorithm, the intelligent and optimizing model for the rolling force distribution in hot strip mills was put forward. The research showed that the model had many advantages such as fast searching speed, high calculating pre-cision and suiting for on-line calculation. A good strip shape could be achieved by using the model and it is appropriate and practica-ble for rolling producing.

  13. Bionic Optimization Based Stability and Congestion Aware Routing Algorithm for Airborne Highly Dynamic Network

    OpenAIRE

    Yunlong Yu; Le Ru; Sheng Mao; Kangning Sun; Qiangqiang Yu; Kun Fang

    2016-01-01

    Airborne highly dynamic ad hoc UAV network has features of high node mobility, fast changing network topology, and complex application environment. The performance of traditional routing algorithms is so poor over aspects such as end to end delay, data packet delivery ratio, and routing overhead that they cannot provide efficient communication for multi-UAVs carrying out missions synergistically. A bionic optimization based stability and congestion aware routing algorithm—BSCAR algorithm—is p...

  14. Smoothed Finite Element and Genetic Algorithm based optimization for Shape Adaptive Composite Marine Propellers

    OpenAIRE

    Herath, Manudha T; Natarajan, Sundararajan; Prusty, B Gangadhara; John, Nigel St

    2013-01-01

    An optimization scheme using the Cell-based Smoothed Finite Element Method (CS-FEM) combined with a Genetic Algorithm (GA) framework is proposed in this paper to design shape adaptive laminated composite marine propellers. The proposed scheme utilise the bend-twist coupling characteristics of the composites to achieve the required performance. An iterative procedure to evaluate the unloaded shape of the propeller blade is proposed, confirming the manufacturing requirements at the initial stag...

  15. Application of genetic algorithms to the maintenance scheduling optimization in a nuclear system basing on reliability

    International Nuclear Information System (INIS)

    This paper presents a solution based on genetic algorithm and probabilistic safety analysis that can be applied in the optimization of the preventive maintenance politic of nuclear power plant safety systems. The goal of this approach is to improve the average availability of the system through the optimization of the preventive maintenance scheduling politic. The auxiliary feed water system of a two loops pressurized water reactor is used as a sample case, in order to demonstrate the effectiveness of the proposed method. The results, when compared to those obtained by some standard maintenance politics, reveal quantitative gains and operational safety levels. (author)

  16. Comparison and Application of Metaheuristic Population-Based Optimization Algorithms in Manufacturing Automation

    Directory of Open Access Journals (Sweden)

    Rhythm Suren Wadhwa

    2011-11-01

    Full Text Available The paper presents a comparison and application of metaheuristic population-based optimization algorithms to a flexible manufacturing automation scenario in a metacasting foundry. It presents a novel application and comparison of Bee Colony Algorithm (BCA with variations of Particle Swarm Optimization (PSO and Ant Colony Optimization (ACO for object recognition problem in a robot material handling system. To enable robust pick and place activity of metalcasted parts by a six axis industrial robot manipulator, it is important that the correct orientation of the parts is input to the manipulator, via the digital image captured by the vision system. This information is then used for orienting the robot gripper to grip the part from a moving conveyor belt. The objective is to find the reference templates on the manufactured parts from the target landscape picture which may contain noise. The Normalized cross-correlation (NCC function is used as an objection function in the optimization procedure. The ultimate goal is to test improved algorithms that could prove useful in practical manufacturing automation scenarios.

  17. Algorithm of axial fuel optimization based in progressive steps of turned search

    International Nuclear Information System (INIS)

    The development of an algorithm for the axial optimization of fuel of boiling water reactors (BWR) is presented. The algorithm is based in a serial optimizations process in the one that the best solution in each stage is the starting point of the following stage. The objective function of each stage adapts to orient the search toward better values of one or two parameters leaving the rest like restrictions. Conform to it advances in those optimization stages, it is increased the fineness of the evaluation of the investigated designs. The algorithm is based on three stages, in the first one are used Genetic algorithms and in the two following Tabu Search. The objective function of the first stage it looks for to minimize the average enrichment of the one it assembles and to fulfill with the generation of specified energy for the operation cycle besides not violating none of the limits of the design base. In the following stages the objective function looks for to minimize the power factor peak (PPF) and to maximize the margin of shutdown (SDM), having as restrictions the one average enrichment obtained for the best design in the first stage and those other restrictions. The third stage, very similar to the previous one, it begins with the design of the previous stage but it carries out a search of the margin of shutdown to different exhibition steps with calculations in three dimensions (3D). An application to the case of the design of the fresh assemble for the fourth fuel reload of the Unit 1 reactor of the Laguna Verde power plant (U1-CLV) is presented. The obtained results show an advance in the handling of optimization methods and in the construction of the objective functions that should be used for the different design stages of the fuel assemblies. (Author)

  18. A hybrid genetic algorithm based on mutative scale chaos optimization strategy

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    In order to avoid such problems as low convergent speed and local optimal solution in simple genetic algorithms, a new hybrid genetic algorithm is proposed. In this algorithm, a mutative scale chaos optimization strategy is operated on the population after a genetic operation. And according to the searching process, the searching space of the optimal variables is gradually diminished and the regulating coefficient of the secondary searching process is gradually changed which will lead to the quick evolution of the population. The algorithm has such advantages as fast search, precise results and convenient using etc. The simulation results show that the performance of the method is better than that of simple genetic algorithms.

  19. A wavelet packet based block-partitioning image coding algorithm with rate-distortion optimization

    Institute of Scientific and Technical Information of China (English)

    YANG YongMing; XU Chao

    2008-01-01

    As an elegant generalization of wavelet transform, wavelet packet (WP) provides an effective representation tool for adaptive waveform analysis. Recent work shows that image-coding methods based on WP decomposition can achieve significant gain over those based on a usual wavelet transform. However, most of the work adopts a tree-structured quantization scheme, which is a successful technique for wavelet image coding, but not appropriate for WP subbands. This paper presents an image-coding algorithm based on a rate-distortion optimized wavelet packet decomposition and on an intraband block-partitioning scheme. By encoding each WP subband separately with the block-partitioning algorithm and the JPEG2000 context modeling, the proposed algorithm naturally avoids the difficulty in defining parent-offspring relationships for the WP coefficients, which has to be faced when adopting the tree-structured quantization scheme. The experimental results show that the proposed algorithm significantly outperforms SPIHT and JPEG2000 schemes and also surpasses state-of-the-art WP image coding algorithms, in terms of both PSNR and visual quality.

  20. Multidisciplinary design optimization of vehicle instrument panel based on multi-objective genetic algorithm

    Science.gov (United States)

    Wang, Ping; Wu, Guangqiang

    2013-03-01

    Typical multidisciplinary design optimization(MDO) has gradually been proposed to balance performances of lightweight, noise, vibration and harshness(NVH) and safety for instrument panel(IP) structure in the automotive development. Nevertheless, plastic constitutive relation of Polypropylene(PP) under different strain rates, has not been taken into consideration in current reliability-based and collaborative IP MDO design. In this paper, based on tensile test under different strain rates, the constitutive relation of Polypropylene material is studied. Impact simulation tests for head and knee bolster are carried out to meet the regulation of FMVSS 201 and FMVSS 208, respectively. NVH analysis is performed to obtain mainly the natural frequencies and corresponding mode shapes, while the crashworthiness analysis is employed to examine the crash behavior of IP structure. With the consideration of lightweight, NVH, head and knee bolster impact performance, design of experiment(DOE), response surface model(RSM), and collaborative optimization(CO) are applied to realize the determined and reliability-based optimizations, respectively. Furthermore, based on multi-objective genetic algorithm(MOGA), the optimal Pareto sets are completed to solve the multi-objective optimization(MOO) problem. The proposed research ensures the smoothness of Pareto set, enhances the ability of engineers to make a comprehensive decision about multi-objectives and choose the optimal design, and improves the quality and efficiency of MDO.

  1. Cooperative Localization Algorithm based on Coverage Optimization of Actors for Wireless Sensor and Actor Networks

    Directory of Open Access Journals (Sweden)

    Huanliang Xu

    2014-05-01

    Full Text Available Different from existing range-free algorithms in wireless sensor networks (WSN, a cooperative localization algorithm based on coverage optimization of actors (CLCOA for wireless sensor and actor networks (WSAN is proposed. It uses mobile actors instead of anchors in WSN. Firstly, the area of the unknown node is determined through the movement of positioning actors. Then this area decreases through iteration. When localization accuracy is satisfied, the centroid of this area is calculated and treated as the coordinate of the unknown node. Free actors adjust their positions through virtual force while locating actors work. Accordingly, actors’ coverage is optimized. Via simulation, it is proven that CLCOA has high locating accuracy with RSSI error and GPS error, and the introduction of virtual force improves actors’ coverage and locating speed

  2. Ant System Based Optimization Algorithm and Its Applications in Identical Parallel Machine Scheduling

    Institute of Scientific and Technical Information of China (English)

    陈义保; 姚建初; 钟毅芳

    2002-01-01

    Identical parallel machine scheduling problem for minimizing the makespan is a very important productionscheduling problem. When its scale is large, many difficulties will arise in the course of solving identical parallel machinescheduling problem. Ant system based optimization algorithm (ASBOA) has shown great advantages in solving thecombinatorial optimization problem in view of its characteristics of high efficiency and suitability for practical applications.In this paper, an ASBOA for minimizing the makespan in identical machine scheduling problem is presented. Twodifferent scale numerical examples demonstrate that the ASBOA proposed is efficient and fit for large-scale identicalparallel machine scheduling problem for minimizing the makespan, the quality of its solution has advantages over heuristicprocedure and simulated annealing method, as well as genetic algorithm.

  3. Optimization and Operation Scheduling for a Steel Plate yard Based on Greedy Algorithm

    Directory of Open Access Journals (Sweden)

    Zhiying Zhang

    2013-07-01

    Full Text Available The inbound and outbound operation of plate yards in shipyards lacks effective scheduling with high operation costs. Based on the analysis of steel-in and steel-out operation process, an optimization model aiming to minimize the operation cost was established. The model was formulated as a multi-level combinatorial optimization model, which is finding proper storage locations during the steel-in stage to minimize the cost during the steel-out stage. Furthermore, greedy algorithm was implemented to solve this problem. Finally, application data obtained from a shipyard was used to validate the model, and the result shows that the proposed algorithm is effective to solve the steel stockyards scheduling problem.

  4. Knee Joint Optimization Design of Intelligent Bionic Leg Based on Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Hualong Xie

    2014-09-01

    Full Text Available Intelligent bionic leg (IBL is an advanced prosthesis which can maximum functionally simulate and approach the motion trajectory of human leg. Knee joint is the most important bone of human leg and its bionic design has great significance to prosthesis performance. The structural components of IBL are introduced and virtual prototype is given. The advantages of 4-bar knee joint are analyzed and are adopted in IBL design. The kinematics model of 4-bar knee joint is established. The objective function, constraint condition, parameters selection and setting of genetic algorithm are discussed in detail. Based on genetic algorithm, the optimization design of IBL knee joint is done. The optimization results indicate that the 4-bar mechanism can achieve better anthropomorphic characteristics of human knee joint.

  5. [Study on the Application of NAS-Based Algorithm in the NIR Model Optimization].

    Science.gov (United States)

    Geng, Ying; Xiang, Bing-ren; He, Lan

    2015-10-01

    In this paper, net analysis signal (NAS)-based concept was introduced to the analysis of multi-component Ginkgo biloba leaf extracts. NAS algorithm was utilized for the preprocessing of spectra, and NAS-based two-dimensional correlation analysis was used for the optimization of NIR model building. Simultaneous quantitative models for three flavonol aglycones: quercetin, keampferol and isorhamnetin were established respectively. The NAS vectors calculated using two algorithms introduced from Lorber and Goicoechea and Olivieri (HLA/GO) were applied in the development of calibration models, the reconstructed spectra were used as input of PLS modeling. For the first time, NAS-based two-dimensional correlation spectroscopy was used for wave number selection. The regions appeared in the main diagonal were selected as useful regions for model building. The results implied that two NAS-based preprocessing methods were successfully used for the analysis of quercetin, keampferol and isorhamnetin with a decrease of factor number and an improvement of model robustness. NAS-based algorithm was proven to be a useful tool for the preprocessing of spectra and for optimization of model calibration. The above research showed a practical application value for the NIRS in the analysis of complex multi-component petrochemical medicine with unknown interference. PMID:26904808

  6. Optimal Energy Management Strategy of a Plug-in Hybrid Electric Vehicle Based on a Particle Swarm Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Zeyu Chen

    2015-04-01

    Full Text Available Plug-in hybrid electric vehicles (PHEVs have been recognized as one of the most promising vehicle categories nowadays due to their low fuel consumption and reduced emissions. Energy management is critical for improving the performance of PHEVs. This paper proposes an energy management approach based on a particle swarm optimization (PSO algorithm. The optimization objective is to minimize total energy cost (summation of oil and electricity from vehicle utilization. A main drawback of optimal strategies is that they can hardly be used in real-time control. In order to solve this problem, a rule-based strategy containing three operation modes is proposed first, and then the PSO algorithm is implemented on four threshold values in the presented rule-based strategy. The proposed strategy has been verified by the US06 driving cycle under the MATLAB/Simulink software environment. Two different driving cycles are adopted to evaluate the generalization ability of the proposed strategy. Simulation results indicate that the proposed PSO-based energy management method can achieve better energy efficiency compared with traditional blended strategies. Online control performance of the proposed approach has been demonstrated through a driver-in-the-loop real-time experiment.

  7. A Novel Cluster-head Selection Algorithm Based on Hybrid Genetic Optimization for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Lejiang Guo

    2011-05-01

    Full Text Available Wireless Sensor Networks (WSN represent a new dimension in the field of network research. The cluster algorithm can significantly reduce the energy consumption of wireless sensor networks and prolong the network lifetime. This paper uses neuron to describe the WSN node and constructs neural network model for WSN. The neural network model includes three aspects: WSN node neuron model, WSN node control model and WSN node connection model. Through learning the framework of cluster algorithm for wireless sensor networks, this paper presents a weighted average of cluster-head selection algorithm based on an improved Genetic Optimization which makes the node weights directly related to the decision-making predictions. The Algorithm consists of two stages: single-parent evolution and population evolution. The initial population is formed in the stage of single-parent evolution by using gene pool, then the algorithm continues to the next further evolution process, finally the best solution will be generated and saved in the population. The simulation results illustrate that the new algorithm has the high convergence speed and good global searching capacity. It is to effectively balance the network energy consumption, improve the network life-cycle, ensure the communication quality and provide a certain theoretical foundation for the applications of the neural networks.

  8. Artificial Bee Colony Algorithm Based on K-Means Clustering for Multiobjective Optimal Power Flow Problem

    Directory of Open Access Journals (Sweden)

    Liling Sun

    2015-01-01

    Full Text Available An improved multiobjective ABC algorithm based on K-means clustering, called CMOABC, is proposed. To fasten the convergence rate of the canonical MOABC, the way of information communication in the employed bees’ phase is modified. For keeping the population diversity, the multiswarm technology based on K-means clustering is employed to decompose the population into many clusters. Due to each subcomponent evolving separately, after every specific iteration, the population will be reclustered to facilitate information exchange among different clusters. Application of the new CMOABC on several multiobjective benchmark functions shows a marked improvement in performance over the fast nondominated sorting genetic algorithm (NSGA-II, the multiobjective particle swarm optimizer (MOPSO, and the multiobjective ABC (MOABC. Finally, the CMOABC is applied to solve the real-world optimal power flow (OPF problem that considers the cost, loss, and emission impacts as the objective functions. The 30-bus IEEE test system is presented to illustrate the application of the proposed algorithm. The simulation results demonstrate that, compared to NSGA-II, MOPSO, and MOABC, the proposed CMOABC is superior for solving OPF problem, in terms of optimization accuracy.

  9. Multi-objective optimization of stamping forming process of head using Pareto-based genetic algorithm

    Institute of Scientific and Technical Information of China (English)

    周杰; 卓芳; 黄磊; 罗艳

    2015-01-01

    To obtain the optimal process parameters of stamping forming, finite element analysis and optimization technique were integrated via transforming multi-objective issue into a single-objective issue. A Pareto-based genetic algorithm was applied to optimizing the head stamping forming process. In the proposed optimal model, fracture, wrinkle and thickness varying are a function of several factors, such as fillet radius, draw-bead position, blank size and blank-holding force. Hence, it is necessary to investigate the relationship between the objective functions and the variables in order to make objective functions varying minimized simultaneously. Firstly, the central composite experimental (CCD) with four factors and five levels was applied, and the experimental data based on the central composite experimental were acquired. Then, the response surface model (RSM) was set up and the results of the analysis of variance (ANOVA) show that it is reliable to predict the fracture, wrinkle and thickness varying functions by the response surface model. Finally, a Pareto-based genetic algorithm was used to find out a set of Pareto front, which makes fracture, wrinkle and thickness varying minimized integrally. A head stamping case indicates that the present method has higher precision and practicability compared with the“trial and error”procedure.

  10. Cuckoo Search Algorithm Based on Repeat-Cycle Asymptotic Self-Learning and Self-Evolving Disturbance for Function Optimization

    OpenAIRE

    Jie-sheng Wang; Shu-xia Li; Jiang-di Song

    2015-01-01

    In order to improve convergence velocity and optimization accuracy of the cuckoo search (CS) algorithm for solving the function optimization problems, a new improved cuckoo search algorithm based on the repeat-cycle asymptotic self-learning and self-evolving disturbance (RC-SSCS) is proposed. A disturbance operation is added into the algorithm by constructing a disturbance factor to make a more careful and thorough search near the bird’s nests location. In order to select a reasonable repeat-...

  11. Optimization of chiral lattice based metastructures for broadband vibration suppression using genetic algorithms

    Science.gov (United States)

    Abdeljaber, Osama; Avci, Onur; Inman, Daniel J.

    2016-05-01

    One of the major challenges in civil, mechanical, and aerospace engineering is to develop vibration suppression systems with high efficiency and low cost. Recent studies have shown that high damping performance at broadband frequencies can be achieved by incorporating periodic inserts with tunable dynamic properties as internal resonators in structural systems. Structures featuring these kinds of inserts are referred to as metamaterials inspired structures or metastructures. Chiral lattice inserts exhibit unique characteristics such as frequency bandgaps which can be tuned by varying the parameters that define the lattice topology. Recent analytical and experimental investigations have shown that broadband vibration attenuation can be achieved by including chiral lattices as internal resonators in beam-like structures. However, these studies have suggested that the performance of chiral lattice inserts can be maximized by utilizing an efficient optimization technique to obtain the optimal topology of the inserted lattice. In this study, an automated optimization procedure based on a genetic algorithm is applied to obtain the optimal set of parameters that will result in chiral lattice inserts tuned properly to reduce the global vibration levels of a finite-sized beam. Genetic algorithms are considered in this study due to their capability of dealing with complex and insufficiently understood optimization problems. In the optimization process, the basic parameters that govern the geometry of periodic chiral lattices including the number of circular nodes, the thickness of the ligaments, and the characteristic angle are considered. Additionally, a new set of parameters is introduced to enable the optimization process to explore non-periodic chiral designs. Numerical simulations are carried out to demonstrate the efficiency of the optimization process.

  12. Adaptive Wavelet Threshold Denoising Method for Machinery Sound Based on Improved Fruit Fly Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Jing Xu

    2016-07-01

    Full Text Available As the sound signal of a machine contains abundant information and is easy to measure, acoustic-based monitoring or diagnosis systems exhibit obvious superiority, especially in some extreme conditions. However, the sound directly collected from industrial field is always polluted. In order to eliminate noise components from machinery sound, a wavelet threshold denoising method optimized by an improved fruit fly optimization algorithm (WTD-IFOA is proposed in this paper. The sound is firstly decomposed by wavelet transform (WT to obtain coefficients of each level. As the wavelet threshold functions proposed by Donoho were discontinuous, many modified functions with continuous first and second order derivative were presented to realize adaptively denoising. However, the function-based denoising process is time-consuming and it is difficult to find optimal thresholds. To overcome these problems, fruit fly optimization algorithm (FOA was introduced to the process. Moreover, to avoid falling into local extremes, an improved fly distance range obeying normal distribution was proposed on the basis of original FOA. Then, sound signal of a motor was recorded in a soundproof laboratory, and Gauss white noise was added into the signal. The simulation results illustrated the effectiveness and superiority of the proposed approach by a comprehensive comparison among five typical methods. Finally, an industrial application on a shearer in coal mining working face was performed to demonstrate the practical effect.

  13. Development of optimization model for sputtering process parameter based on gravitational search algorithm

    Science.gov (United States)

    Norlina, M. S.; Diyana, M. S. Nor; Mazidah, P.; Rusop, M.

    2016-07-01

    In the RF magnetron sputtering process, the desirable layer properties are largely influenced by the process parameters and conditions. If the quality of the thin film has not reached up to its intended level, the experiments have to be repeated until the desirable quality has been met. This research is proposing Gravitational Search Algorithm (GSA) as the optimization model to reduce the time and cost to be spent in the thin film fabrication. The optimization model's engine has been developed using Java. The model is developed based on GSA concept, which is inspired by the Newtonian laws of gravity and motion. In this research, the model is expected to optimize four deposition parameters which are RF power, deposition time, oxygen flow rate and substrate temperature. The results have turned out to be promising and it could be concluded that the performance of the model is satisfying in this parameter optimization problem. Future work could compare GSA with other nature based algorithms and test them with various set of data.

  14. Edge Detection of Medical Images Using Modified Ant Colony Optimization Algorithm based on Weighted Heuristics

    Directory of Open Access Journals (Sweden)

    Puneet Rai

    2014-02-01

    Full Text Available Ant Colony Optimization (ACO is nature inspired algorithm based on foraging behavior of ants. The algorithm is based on the fact how ants deposit pheromone while searching for food. ACO generates a pheromone matrix which gives the edge information present at each pixel position of image, formed by ants dispatched on image. The movement of ants depends on local variance of image's intensity value. This paper proposes an improved method based on heuristic which assigns weight to the neighborhood. Thus by assigning the weights or priority to the neighboring pixels, the ant decides in which direction it can move. The method is applied on Medical images and experimental results are provided to support the superior performance of the proposed approach and the existing method.

  15. Automatically Gradient Threshold Estimation of Anisotropic Diffusion for Meyer’s Watershed Algorithm Based Optimal Segmentation

    Directory of Open Access Journals (Sweden)

    Mithun Kumar PK

    2014-11-01

    Full Text Available Medical image segmentation is a fundamental task in the medical imaging field. Optimal segmentation is required for the accurate judgment or appropriate clinical diagnosis. In this paper, we proposed automatically gradient threshold estimator of anisotropic diffusion for Meyer’s Watershed algorithm based optimal segmentation. The Meyer’s Watershed algorithm is the most significant for a large number of regions separations but the over segmentation is the major drawback of the Meyer’s Watershed algorithm. We are able to remove over segmentation after using anisotropic diffusion as a preprocessing step of segmentation in the Meyer’s Watershed algorithm. We used a fixed window size for dynamically gradient threshold estimation. The gradient threshold is the most important parameter of the anisotropic diffusion for image smoothing. The proposed method is able to segment medical image accurately because of obtaining the enhancement image. The introducing method demonstrates better performance without loss of any clinical information while preserving edges. Our investigated method is more efficient and effective in order to segment the region of interests in the medical images indeed.

  16. An ECN-based Optimal Flow Control Algorithm for the Internet

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    According to the Wide Area Network model, we formulate Internet flow control as a constrained convex programming problem, where the objective is to maximize the total utility of all sources over their transmission rates. Based on this formulation, flow control can be converted to a normal unconstrained optimization problem through the barrier function method, so that it can be solved by means of a gradient projection algorithm with properly rate iterations. We prove that the algorithm converges to the global optimal point, which is also a stable proportional fair rate allocation point, provided that the step size is properly chosen. The main difficulty facing the realization of iteration algorithm is the distributed computation of congestion measure. Fortunately, Explicit Congestion Notification (ECN) is likely to be used to improve the performance of TCP in the near future. By using ECN, it is possible to realize the iteration algorithm in IP networks. Our algorithm is divided into two parts, algorithms in the router and in the source. The router marks the ECN bit with a probability that varies as its buffer occupancy varies, so that the congestion measure of links can be communicated to the source when the marked ECN bits are reflected back from its destination. Source rates are then updated by all sessions according to the received congestion measure. The main advantage of our scheme is its fast convergence ability and robustness; it can also provide the network with zero packet loss by properly choosing the queue threshold and provide differentiated service to users by applying different utility functions.

  17. Optimizing the Mixing Proportion with Neural Networks Based on Genetic Algorithms for Recycled Aggregate Concrete

    OpenAIRE

    Sangyong Kim; Hee-Bok Choi; Yoonseok Shin; Gwang-Hee Kim; Deok-Seok Seo

    2013-01-01

    This research aims to optimize the mixing proportion of recycled aggregate concrete (RAC) using neural networks (NNs) based on genetic algorithms (GAs) for increasing the use of recycled aggregate (RA). NN and GA were used to predict the compressive strength of the concrete at 28 days. And sensitivity analysis of the NN based on GA was used to find the mixing ratio of RAC. The mixing criteria for RAC were determined and the replacement ratio of RAs was identified. This research reveal that th...

  18. Fault Detection Based on Multi-Scale Local Binary Patterns Operator and Improved Teaching-Learning-Based Optimization Algorithm

    OpenAIRE

    Hongjian Zhang; Ping He; Xudong Yang

    2015-01-01

    Aiming to effectively recognize train center plate bolt loss faults, this paper presents an improved fault detection method. A multi-scale local binary pattern operator containing the local texture information of different radii is designed to extract more efficient discrimination information. An improved teaching-learning-based optimization algorithm is established to optimize the classification results in the decision level. Two new phases including the worst recombination phase and the cuc...

  19. Research on the Optimization and Simulation of the Shortest Path Based on Algorithm of Dijkstra

    Institute of Scientific and Technical Information of China (English)

    2010-01-01

    <正>Dijkstra algorithm is a theoretical basis to solve transportation network problems of the shortest path, which has a wide range of application in path optimization. Through analyzing traditional Dijkstra algorithm,on account of the insufficiency of this algorithm in path optimization,this paper uses adjacency list and circular linked list with combination to store date,and through the improved quick sorting algorithm for weight sorting, accomplish a quick search to the adjacent node,and so an improved Dijkstra algorithm is got.Then apply it to the optimal path search,and make simulation analysis for this algorithm through the example,also verify the effectiveness of the proposed algorithm.

  20. ETEA: a Euclidean minimum spanning tree-based evolutionary algorithm for multi-objective optimization.

    Science.gov (United States)

    Li, Miqing; Yang, Shengxiang; Zheng, Jinhua; Liu, Xiaohui

    2014-01-01

    The Euclidean minimum spanning tree (EMST), widely used in a variety of domains, is a minimum spanning tree of a set of points in space where the edge weight between each pair of points is their Euclidean distance. Since the generation of an EMST is entirely determined by the Euclidean distance between solutions (points), the properties of EMSTs have a close relation with the distribution and position information of solutions. This paper explores the properties of EMSTs and proposes an EMST-based evolutionary algorithm (ETEA) to solve multi-objective optimization problems (MOPs). Unlike most EMO algorithms that focus on the Pareto dominance relation, the proposed algorithm mainly considers distance-based measures to evaluate and compare individuals during the evolutionary search. Specifically, in ETEA, four strategies are introduced: (1) An EMST-based crowding distance (ETCD) is presented to estimate the density of individuals in the population; (2) A distance comparison approach incorporating ETCD is used to assign the fitness value for individuals; (3) A fitness adjustment technique is designed to avoid the partial overcrowding in environmental selection; (4) Three diversity indicators-the minimum edge, degree, and ETCD-with regard to EMSTs are applied to determine the survival of individuals in archive truncation. From a series of extensive experiments on 32 test instances with different characteristics, ETEA is found to be competitive against five state-of-the-art algorithms and its predecessor in providing a good balance among convergence, uniformity, and spread.

  1. Optimizing the Mixing Proportion with Neural Networks Based on Genetic Algorithms for Recycled Aggregate Concrete

    Directory of Open Access Journals (Sweden)

    Sangyong Kim

    2013-01-01

    Full Text Available This research aims to optimize the mixing proportion of recycled aggregate concrete (RAC using neural networks (NNs based on genetic algorithms (GAs for increasing the use of recycled aggregate (RA. NN and GA were used to predict the compressive strength of the concrete at 28 days. And sensitivity analysis of the NN based on GA was used to find the mixing ratio of RAC. The mixing criteria for RAC were determined and the replacement ratio of RAs was identified. This research reveal that the proposed method, which is NN based on GA, is proper for optimizing appropriate mixing proportion of RAC. Also, this method would help the construction engineers to utilize the recycled aggregate and reduce the concrete waste in construction process.

  2. A Parallel Genetic Algorithm Based Feature Selection and Parameter Optimization for Support Vector Machine

    Directory of Open Access Journals (Sweden)

    Zhi Chen

    2016-01-01

    Full Text Available The extensive applications of support vector machines (SVMs require efficient method of constructing a SVM classifier with high classification ability. The performance of SVM crucially depends on whether optimal feature subset and parameter of SVM can be efficiently obtained. In this paper, a coarse-grained parallel genetic algorithm (CGPGA is used to simultaneously optimize the feature subset and parameters for SVM. The distributed topology and migration policy of CGPGA can help find optimal feature subset and parameters for SVM in significantly shorter time, so as to increase the quality of solution found. In addition, a new fitness function, which combines the classification accuracy obtained from bootstrap method, the number of chosen features, and the number of support vectors, is proposed to lead the search of CGPGA to the direction of optimal generalization error. Experiment results on 12 benchmark datasets show that our proposed approach outperforms genetic algorithm (GA based method and grid search method in terms of classification accuracy, number of chosen features, number of support vectors, and running time.

  3. Optimizing on multiple constrained QoS multicast routing algorithms based on GA

    Institute of Scientific and Technical Information of China (English)

    孙宝林; 李腊元

    2004-01-01

    With the rapid development of Internet, mobile networks and high-performance networking technology,multiple constrained QoS multicast routing optimization in networks with uncertain parameters has become a very important research issue in the areas of networks and distributed systems. It is also a challenging and hard problem to the next generation Internet and high-performance networks, and has attracted the interests of many people. This paper discusses the multiple constrained QoS multicast routing problem, which may deal with the delay, delay jitter,bandwidth and packet loss metrics, and describes a network model for researching the routing problem. The paper mainly presents multiple constrained QoS multicast routing algorithm (MCQMRA), a QoS multicast routing policy for Internet,mobile network or other high-performance networks, which is based on the genetic algorithm (GA) and can provide QoS-sensitive paths in a scalable and flexible wayin the network environment with uncertain parameters. The MCQMRA can also optimize the network resources such as bandwidth, delay, packet loss metrics and can converge to the optimal or near-optimal solution within few iterations, even for the network environment with uncertain parameters. Simulation results show that MCQMRA is an available approach to QoS multicast routing decision.

  4. Risk-Based, genetic algorithm approach to optimize outage maintenance schedule

    Energy Technology Data Exchange (ETDEWEB)

    Hadavi, S. Mohammad Hadi [Department of Nuclear Engineering, School of Engineering, Shiraz University, Shiraz (Iran, Islamic Republic of)], E-mail: smhadihadavi@yahoo.com

    2008-04-15

    A huge number of components are typically scheduled for maintenance when a nuclear power plant is shut down for its planned outage. Among these components, a number of them are risk significant so that their operability as well as reliability is of prime concern. Lack of proper maintenance for such components during the outage would impose substantial risk on the nuclear power plant (NPP) operation. In this paper, a new approach based on genetic algorithm (GA) is presented for the optimization of the NPP maintenance schedule during plant outage/overhaul, and an optimizer is developed accordingly. The developed optimizer, coupled with the suggested risk-cost model, compromises the cost in favor of maintaining the risk imposed by each schedule below regulatory/industry set limits. The suggested cost model consists of two elements, one considering the cost incurred by maintenance activities and the other incorporating the loss of revenues if needed, but unscheduled component maintenance causes further plant shutdown. The optimizer is developed in such a way that any risk and/or cost models the user desires can be applied. The performance of the developed GA/optimizer is evaluated by comparing its predictions with Monte Carlo simulation results. It is shown that the GA/optimizer performs significantly better.

  5. ANFIS Based Time Series Prediction Method of Bank Cash Flow Optimized by Adaptive Population Activity PSO Algorithm

    OpenAIRE

    Jie-Sheng Wang; Chen-Xu Ning

    2015-01-01

    In order to improve the accuracy and real-time of all kinds of information in the cash business, and solve the problem which accuracy and stability is not high of the data linkage between cash inventory forecasting and cash management information in the commercial bank, a hybrid learning algorithm is proposed based on adaptive population activity particle swarm optimization (APAPSO) algorithm combined with the least squares method (LMS) to optimize the adaptive network-based fuzzy inference s...

  6. Cognitive Radio Engine Model Utilizing Soft Fusion Based Genetic Algorithm for Cooperative Spectrum Optimization

    Directory of Open Access Journals (Sweden)

    Kamal Hossain

    2013-04-01

    Full Text Available Cognitive radio (CR is to detect the presence of primary users (PUs reliably in order to reduce theinterference to licensed communications. Genetic algorithms (GAs are well suited for CR optimizationproblems to increase efficiency of bandwidth utilization by manipulating its unused portions of theapparent spectrum. In this paper, a binary genetic algorithm (BGA-based soft fusion (SF scheme forcooperative spectrum sensing in cognitive radio network is proposed to improve detection performance andbandwidth utilization. The BGA-based optimization method is implemented at the fusion centre of a linearSF scheme to optimize the weighting coefficients vector to maximize global probability of detectionperformance. Simulation results and analyses confirm that the proposed scheme meets real timerequirements of cognitive radio spectrum sensing and it outperforms conventional natural deflectioncoefficient- (NDC-, modified deflection coefficient- (MDC-, maximal ratio combining- (MRC- and equalgain combining- (EGC- based SDF schemes as well as the OR-rule based hard decision fusion (HDF. Thepropose BGA scheme also converges fast and achieves the optimum performance, which means that BGAbasedmethod is efficient and quite stable also.

  7. Broadband diffusion metasurface based on a single anisotropic element and optimized by the Simulated Annealing algorithm

    Science.gov (United States)

    Zhao, Yi; Cao, Xiangyu; Gao, Jun; Sun, Yu; Yang, Huanhuan; Liu, Xiao; Zhou, Yulong; Han, Tong; Chen, Wei

    2016-04-01

    We propose a new strategy to design broadband and wide angle diffusion metasurfaces. An anisotropic structure which has opposite phases under x- and y-polarized incidence is employed as the “0” and “1” elements base on the concept of coding metamaterial. To obtain a uniform backward scattering under normal incidence, Simulated Annealing algorithm is utilized in this paper to calculate the optimal layout. The proposed method provides an efficient way to design diffusion metasurface with a simple structure, which has been proved by both simulations and measurements.

  8. Optimization of an Accelerometer and Gyroscope-Based Fall Detection Algorithm

    OpenAIRE

    Huynh, Quoc T.; Nguyen, Uyen D; Irazabal, Lucia B.; Nazanin Ghassemian; Tran, Binh Q.

    2015-01-01

    Falling is a common and significant cause of injury in elderly adults (>65 yrs old), often leading to disability and death. In the USA, one in three of the elderly suffers from fall injuries annually. This study’s purpose is to develop, optimize, and assess the efficacy of a falls detection algorithm based upon a wireless, wearable sensor system (WSS) comprised of a 3-axis accelerometer and gyroscope. For this study, the WSS is placed at the chest center to collect real-time motion data of va...

  9. Broadband diffusion metasurface based on a single anisotropic element and optimized by the Simulated Annealing algorithm.

    Science.gov (United States)

    Zhao, Yi; Cao, Xiangyu; Gao, Jun; Sun, Yu; Yang, Huanhuan; Liu, Xiao; Zhou, Yulong; Han, Tong; Chen, Wei

    2016-01-01

    We propose a new strategy to design broadband and wide angle diffusion metasurfaces. An anisotropic structure which has opposite phases under x- and y-polarized incidence is employed as the "0" and "1" elements base on the concept of coding metamaterial. To obtain a uniform backward scattering under normal incidence, Simulated Annealing algorithm is utilized in this paper to calculate the optimal layout. The proposed method provides an efficient way to design diffusion metasurface with a simple structure, which has been proved by both simulations and measurements. PMID:27034110

  10. The Parameters Optimization of MCR-WPT System Based on the Improved Genetic Simulated Annealing Algorithm

    Directory of Open Access Journals (Sweden)

    Sheng Lu

    2015-01-01

    Full Text Available To solve the problem of parameter selection during the design of magnetically coupled resonant wireless power transmission system (MCR-WPT, this paper proposed an improved genetic simulated annealing algorithm. Firstly, the equivalent circuit of the system is analysis in this study and a nonlinear programming mathematical model is built. Secondly, in place of the penalty function method in the genetic algorithm, the selection strategy based on the distance between individuals is adopted to select individual. In this way, it reduces the excess empirical parameters. Meanwhile, it can improve the convergence rate and the searching ability by calculating crossover probability and mutation probability according to the variance of population’s fitness. At last, the simulated annealing operator is added to increase local search ability of the method. The simulation shows that the improved method can break the limit of the local optimum solution and get the global optimum solution faster. The optimized system can achieve the practical requirements.

  11. Adjoint Algorithm for CAD-Based Shape Optimization Using a Cartesian Method

    Science.gov (United States)

    Nemec, Marian; Aftosmis, Michael J.

    2004-01-01

    Adjoint solutions of the governing flow equations are becoming increasingly important for the development of efficient analysis and optimization algorithms. A well-known use of the adjoint method is gradient-based shape optimization. Given an objective function that defines some measure of performance, such as the lift and drag functionals, its gradient is computed at a cost that is essentially independent of the number of design variables (geometric parameters that control the shape). More recently, emerging adjoint applications focus on the analysis problem, where the adjoint solution is used to drive mesh adaptation, as well as to provide estimates of functional error bounds and corrections. The attractive feature of this approach is that the mesh-adaptation procedure targets a specific functional, thereby localizing the mesh refinement and reducing computational cost. Our focus is on the development of adjoint-based optimization techniques for a Cartesian method with embedded boundaries.12 In contrast t o implementations on structured and unstructured grids, Cartesian methods decouple the surface discretization from the volume mesh. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin et developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the Euler equations. In both approaches, a boundary condition is introduced to approximate the effects of the evolving surface shape that results in accurate gradient computation. Central to automated shape optimization algorithms is the issue of geometry modeling and control. The need to optimize complex, "real-life" geometry provides a strong incentive for the use of parametric-CAD systems within the optimization procedure. In previous work, we presented

  12. Optimization of an Accelerometer and Gyroscope-Based Fall Detection Algorithm

    Directory of Open Access Journals (Sweden)

    Quoc T. Huynh

    2015-01-01

    Full Text Available Falling is a common and significant cause of injury in elderly adults (>65 yrs old, often leading to disability and death. In the USA, one in three of the elderly suffers from fall injuries annually. This study’s purpose is to develop, optimize, and assess the efficacy of a falls detection algorithm based upon a wireless, wearable sensor system (WSS comprised of a 3-axis accelerometer and gyroscope. For this study, the WSS is placed at the chest center to collect real-time motion data of various simulated daily activities (i.e., walking, running, stepping, and falling. Tests were conducted on 36 human subjects with a total of 702 different movements collected in a laboratory setting. Half of the dataset was used for development of the fall detection algorithm including investigations of critical sensor thresholds and the remaining dataset was used for assessment of algorithm sensitivity and specificity. Experimental results show that the algorithm detects falls compared to other daily movements with a sensitivity and specificity of 96.3% and 96.2%, respectively. The addition of gyroscope information enhances sensitivity dramatically from results in the literature as angular velocity changes provide further delineation of a fall event from other activities that may also experience high acceleration peaks.

  13. Genetic algorithm based approach to optimize phenotypical traits of virtual rice.

    Science.gov (United States)

    Ding, Weilong; Xu, Lifeng; Wei, Yang; Wu, Fuli; Zhu, Defeng; Zhang, Yuping; Max, Nelson

    2016-08-21

    How to select and combine good traits of rice to get high-production individuals is one of the key points in developing crop ideotype cultivation technologies. Existing cultivation methods for producing ideal plants, such as field trials and crop modeling, have some limits. In this paper, we propose a method based on a genetic algorithm (GA) and a functional-structural plant model (FSPM) to optimize plant types of virtual rice by dynamically adjusting phenotypical traits. In this algorithm, phenotypical traits such as leaf angles, plant heights, the maximum number of tiller, and the angle of tiller are considered as input parameters of our virtual rice model. We evaluate the photosynthetic output as a function of these parameters, and optimized them using a GA. This method has been implemented on GroIMP using the modeling language XL (eXtended L-System) and RGG (Relational Growth Grammar). A double haploid population of rice is adopted as test material in a case study. Our experimental results show that our method can not only optimize the parameters of rice plant type and increase the amount of light absorption, but can also significantly increase crop yield. PMID:27179460

  14. Optimal Management Of Renewable-Based Mgs An Intelligent Approach Through The Evolutionary Algorithm

    Directory of Open Access Journals (Sweden)

    Mehdi Nafar

    2015-08-01

    Full Text Available Abstract- This article proposes a probabilistic frame built on Scenario fabrication to considerate the uncertainties in the finest action managing of Micro Grids MGs. The MG contains different recoverable energy resources such as Wind Turbine WT Micro Turbine MT Photovoltaic PV Fuel Cell FC and one battery as the storing device. The advised frame is based on scenario generation and Roulette wheel mechanism to produce different circumstances for handling the uncertainties of altered factors. It habits typical spreading role as a probability scattering function of random factors. The uncertainties which are measured in this paper are grid bid alterations cargo request calculating error and PV and WT yield power productions. It is well-intentioned to asset that solving the MG difficult for 24 hours of a day by considering diverse uncertainties and different constraints needs one powerful optimization method that can converge fast when it doesnt fall in local optimal topic. Simultaneously single Group Search Optimization GSO system is presented to vision the total search space globally. The GSO algorithm is instigated from group active of beasts. Also the GSO procedure one change is similarly planned for this algorithm. The planned context and way is applied o one test grid-connected MG as a typical grid.

  15. A Novel Path Planning for Robots Based on Rapidly-Exploring Random Tree and Particle Swarm Optimizer Algorithm

    Directory of Open Access Journals (Sweden)

    Zhou Feng

    2013-09-01

    Full Text Available A based on Rapidly-exploring Random Tree(RRT and Particle Swarm Optimizer (PSO for path planning of the robot is proposed.First the grid method is built to describe the working space of the mobile robot,then the Rapidly-exploring Random Tree algorithm is used to obtain the global navigation path,and the Particle Swarm Optimizer algorithm is adopted to get the better path.Computer experiment results demonstrate that this novel algorithm can plan an optimal path rapidly in a cluttered environment.The successful obstacle avoidance is achieved,and the model is robust and performs reliably.

  16. Optimal waveform-based clutter suppression algorithm for recursive synthetic aperture radar imaging systems

    Science.gov (United States)

    Zhu, Binqi; Gao, Yesheng; Wang, Kaizhi; Liu, Xingzhao

    2016-04-01

    A computational method for suppressing clutter and generating clear microwave images of targets is proposed in this paper, which combines synthetic aperture radar (SAR) principles with recursive method and waveform design theory, and it is suitable for SAR for special applications. The nonlinear recursive model is introduced into the SAR operation principle, and the cubature Kalman filter algorithm is used to estimate target and clutter responses in each azimuth position based on their previous states, which are both assumed to be Gaussian distributions. NP criteria-based optimal waveforms are designed repeatedly as the sensor flies along its azimuth path and are used as the transmitting signals. A clutter suppression filter is then designed and added to suppress the clutter response while maintaining most of the target response. Thus, with fewer disturbances from the clutter response, we can generate the SAR image with traditional azimuth matched filters. Our simulations show that the clutter suppression filter significantly reduces the clutter response, and our algorithm greatly improves the SINR of the SAR image based on different clutter suppression filter parameters. As such, this algorithm may be preferable for special target imaging when prior information on the target is available.

  17. A new technique based on Artificial Bee Colony Algorithm for optimal sizing of stand-alone photovoltaic system

    Directory of Open Access Journals (Sweden)

    Ahmed F. Mohamed

    2014-05-01

    Full Text Available One of the most recent optimization techniques applied to the optimal design of photovoltaic system to supply an isolated load demand is the Artificial Bee Colony Algorithm (ABC. The proposed methodology is applied to optimize the cost of the PV system including photovoltaic, a battery bank, a battery charger controller, and inverter. Two objective functions are proposed: the first one is the PV module output power which is to be maximized and the second one is the life cycle cost (LCC which is to be minimized. The analysis is performed based on measured solar radiation and ambient temperature measured at Helwan city, Egypt. A comparison between ABC algorithm and Genetic Algorithm (GA optimal results is done. Another location is selected which is Zagazig city to check the validity of ABC algorithm in any location. The ABC is more optimal than GA. The results encouraged the use of the PV systems to electrify the rural sites of Egypt.

  18. A new technique based on Artificial Bee Colony Algorithm for optimal sizing of stand-alone photovoltaic system.

    Science.gov (United States)

    Mohamed, Ahmed F; Elarini, Mahdi M; Othman, Ahmed M

    2014-05-01

    One of the most recent optimization techniques applied to the optimal design of photovoltaic system to supply an isolated load demand is the Artificial Bee Colony Algorithm (ABC). The proposed methodology is applied to optimize the cost of the PV system including photovoltaic, a battery bank, a battery charger controller, and inverter. Two objective functions are proposed: the first one is the PV module output power which is to be maximized and the second one is the life cycle cost (LCC) which is to be minimized. The analysis is performed based on measured solar radiation and ambient temperature measured at Helwan city, Egypt. A comparison between ABC algorithm and Genetic Algorithm (GA) optimal results is done. Another location is selected which is Zagazig city to check the validity of ABC algorithm in any location. The ABC is more optimal than GA. The results encouraged the use of the PV systems to electrify the rural sites of Egypt.

  19. A Thrust Allocation Method for Efficient Dynamic Positioning of a Semisubmersible Drilling Rig Based on the Hybrid Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Luman Zhao

    2015-01-01

    Full Text Available A thrust allocation method was proposed based on a hybrid optimization algorithm to efficiently and dynamically position a semisubmersible drilling rig. That is, the thrust allocation was optimized to produce the generalized forces and moment required while at the same time minimizing the total power consumption under the premise that forbidden zones should be taken into account. An optimization problem was mathematically formulated to provide the optimal thrust allocation by introducing the corresponding design variables, objective function, and constraints. A hybrid optimization algorithm consisting of a genetic algorithm and a sequential quadratic programming (SQP algorithm was selected and used to solve this problem. The proposed method was evaluated by applying it to a thrust allocation problem for a semisubmersible drilling rig. The results indicate that the proposed method can be used as part of a cost-effective strategy for thrust allocation of the rig.

  20. LSSVM Network Flow Prediction Based on the Self-adaptive Genetic Algorithm Optimization

    Directory of Open Access Journals (Sweden)

    Liao Wenjing

    2013-02-01

    Full Text Available In order to change the insufficiency of traditional network flow prediction and improve its accuracy, the paper proposed a kind of network flow prediction method based on the self-adaptive genetic least square support vector machine optimization. Through analyzing the individual parameter of the LS-SVM principle and self-adaptive remains algorithm, the network flow prediction model structure of GA-LSSVM, and the genetic model global operation parameters, this paper would conduct a performance test to the network flow simulation experiment. The simulation result showed that: compared with the traditional forecasting methods, the accuracy of its network flow prediction was higher than the traditional forecasting methods by using the least square support vector machine genetic optimization.

  1. FLEXIBLE ASSEMBLY FIXTURING LA-YOUT MODELING AND OPTIMIZATION BASED ON GENETIC ALGORITHM

    Institute of Scientific and Technical Information of China (English)

    Lai Xinmin; Luo Laijun; Lin Zhongqin

    2004-01-01

    There are many welding fixture layout design problems of flexible parts in body-in-white assembly process, which directly cause body assemble variation.The fixture layout design quality is mainly influenced by the position and quantity of fixture locators and clamps.A general analysis model of flexible assembles deformation caused by fixture is set up based on "N-2-1" locating principle, in which the locator and clamper are treated as the same fixture layout elements.An analysis model for the flexible part deformation in fixturing is set up in order to obtain the optimization object function and constraints accordingly.The final fixture element layout could be obtained through global optimal research by using improved genetic algorithm, which effectively decreases fixture elements layout influence on flexible assembles deformation.

  2. Microgenetic optimization algorithm for optimal wavefront shaping

    CERN Document Server

    Anderson, Benjamin R; Gunawidjaja, Ray; Eilers, Hergen

    2015-01-01

    One of the main limitations of utilizing optimal wavefront shaping in imaging and authentication applications is the slow speed of the optimization algorithms currently being used. To address this problem we develop a micro-genetic optimization algorithm ($\\mu$GA) for optimal wavefront shaping. We test the abilities of the $\\mu$GA and make comparisons to previous algorithms (iterative and simple-genetic) by using each algorithm to optimize transmission through an opaque medium. From our experiments we find that the $\\mu$GA is faster than both the iterative and simple-genetic algorithms and that both genetic algorithms are more resistant to noise and sample decoherence than the iterative algorithm.

  3. Quality Assured Optimal Resource Provisioning and Scheduling Technique Based on Improved Hierarchical Agglomerative Clustering Algorithm (IHAC

    Directory of Open Access Journals (Sweden)

    A. Meenakshi

    2016-08-01

    Full Text Available Resource allocation is the task of convenient resources to different uses. In the context of an resources, entire economy, can be assigned by different means, such as markets or central planning. Cloud computing has become a new age technology that has got huge potentials in enterprises and markets. Clouds can make it possible to access applications and associated data from anywhere. The fundamental motive of the resource allocation is to allot the available resource in the most effective manner. In the initial phase, a representative resource usage distribution for a group of nodes with identical resource usage patterns is evaluated as resource bundle which can be easily employed to locate a group of nodes fulfilling a standard criterion. In the document, an innovative clustering-based resource aggregation viz. the Improved Hierarchal Agglomerative Clustering Algorithm (IHAC is elegantly launched to realize the compact illustration of a set of identically behaving nodes for scalability. In the subsequent phase concerned with energetic resource allocation procedure, the hybrid optimization technique is brilliantly brought in. The novel technique is devised for scheduling functions to cloud resources which duly consider both financial and evaluation expenses. The efficiency of the novel Resource allocation system is assessed by means of several parameters such the reliability, reusability and certain other metrics. The optimal path choice is the consequence of the hybrid optimization approach. The new-fangled technique allocates the available resource based on the optimal path.

  4. Manufacturing Supply Chain Optimization Problem with Time Windows Based on Improved Orthogonal Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    ZHANG Xinhua

    2006-01-01

    Aim to the manufacturing supply chain optimization problem with time windows, presents an improved orthogonal genetic algorithm to solve it. At first, we decompose this problem into two sub-problems (distribution and routing) plus an interface mechanism to allow the two algorithms to collaborate in a master-slave fashion, with the distribution algorithm driving the routing algorithm. At second, we describe the proposed improved orthogonal genetic algorithm for solving giving problem detailedly. Finally, the examples suggest that this proposed approach is feasible, correct and valid.

  5. Proton Exchange Membrane Fuel Cell Modeling Based on Seeker Optimization Algorithm

    Institute of Scientific and Technical Information of China (English)

    LI Qi; DAI Chao-hua; Chen Wei-rong; JIA Jun-bo; HAN Ming

    2008-01-01

    Seeker optimization algorithm (SOA) has applications in continuous space of swarm intelligence. In the fields of proton ex-change membrane fuel cell (PEMFC) modeling, SOA was proposed to research a set of optimized parameters in PEMFC polariza-tion curve model. Experimental result showed that the mean square error of the optimization modeling strategy was only 6.9 × 10-23. Hence, the optimization model could fit the experiment data with high precision.

  6. FREQUENCY-CODED OPTIMIZATION OF HOPPED-FREQUENCY PULSE SIGNAL BASED ON GENETIC ALGORITHM

    Institute of Scientific and Technical Information of China (English)

    Liu Zheng; Mu Xuehua

    2005-01-01

    The Frequency-Coded Pulse (FCP) signal has good performance of range and Doppler resolution. This paper first gives the mathematical expression of the ambiguity function for FCP signals, and then presents a coding rule for optimizing FCP signal. The genetic algorithm is presented to solve this kind of problem for optimizing codes. Finally, an example for optimizing calculation is illustrated and the optimized frequency coding results are given with the code length N=64 and N=128 respectively.

  7. Optimization of wavelet- and curvelet-based denoising algorithms by multivariate SURE and GCV

    Science.gov (United States)

    Mortezanejad, R.; Gholami, A.

    2016-06-01

    One of the most crucial challenges in seismic data processing is the reduction of noise in the data or improving the signal-to-noise ratio (SNR). Wavelet- and curvelet-based denoising algorithms have become popular to address random noise attenuation for seismic sections. Wavelet basis, thresholding function, and threshold value are three key factors of such algorithms, having a profound effect on the quality of the denoised section. Therefore, given a signal, it is necessary to optimize the denoising operator over these factors to achieve the best performance. In this paper a general denoising algorithm is developed as a multi-variant (variable) filter which performs in multi-scale transform domains (e.g. wavelet and curvelet). In the wavelet domain this general filter is a function of the type of wavelet, characterized by its smoothness, thresholding rule, and threshold value, while in the curvelet domain it is only a function of thresholding rule and threshold value. Also, two methods, Stein’s unbiased risk estimate (SURE) and generalized cross validation (GCV), evaluated using a Monte Carlo technique, are utilized to optimize the algorithm in both wavelet and curvelet domains for a given seismic signal. The best wavelet function is selected from a family of fractional B-spline wavelets. The optimum thresholding rule is selected from general thresholding functions which contain the most well known thresholding functions, and the threshold value is chosen from a set of possible values. The results obtained from numerical tests show high performance of the proposed method in both wavelet and curvelet domains in comparison to conventional methods when denoising seismic data.

  8. Research on Demand Prediction of Fresh Food Supply Chain Based on Improved Particle Swarm Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    He Wang

    2015-04-01

    Full Text Available Demand prediction of supply chain is an important content and the first premise in supply management of different enterprises and has become one of the difficulties and hot research fields for the researchers related. The paper takes fresh food demand prediction for example and presents a new algorithm for predicting demand of fresh food supply chain. First, the working principle and the root causes of the defects of particle swarm optimization algorithm are analyzed in the study; Second, the study designs a new cloud particle swarm optimization algorithm to guarantee the effectiveness of particles in later searching phase and redesigns its cloud global optimization searching method and crossover operation; Finally, a certain fresh food supply chain is taken for example to illustrate the validity and feasibility of the improved algorithm and the experimental results show that the improved algorithm can improve prediction accuracy and calculation efficiency when used for demand prediction of fresh food supply chain.

  9. HYBRID OPTIMIZING GRIFFON-VULTURE ALGORITHM BASED ON SWARM INTELLIGENCE MECHANISMS

    OpenAIRE

    Chastikova V. A.; Ostapov D. S.

    2014-01-01

    Griffon-vultures with input parameters minimal value for compound functions optimization that change during the time searching hybrid algorithm offered in this article. Researches of its efficiency and comparing analysis with some other systems have been performed

  10. New Optimization Algorithms in Physics

    CERN Document Server

    Hartmann, Alexander K

    2004-01-01

    Many physicists are not aware of the fact that they can solve their problems by applying optimization algorithms. Since the number of such algorithms is steadily increasing, many new algorithms have not been presented comprehensively until now. This presentation of recently developed algorithms applied in physics, including demonstrations of how they work and related results, aims to encourage their application, and as such the algorithms selected cover concepts and methods from statistical physics to optimization problems emerging in theoretical computer science.

  11. Ant Colony Optimization Based Modified Termite Algorithm (MTA with Efficient Stagnation Avoidance Strategy for MANETs

    Directory of Open Access Journals (Sweden)

    Sharvani G S

    2012-10-01

    Full Text Available Designing an effective load balancing algorithm is difficult due to Dynamic topology of MANET. Toaddress the problem, a load balancing routing algorithm namely Modified Termite Algorithm (MTA hasbeen developed based on ant’s food foraging behavior. Stability of the link is determined based on nodestability factor ‘’. The stability factor “ “of the node is the ratio defined between the “hello sent” and“hello replied” by a node to its neighbors. This also indicates the link stability in relation to other pathstowards the destination. A higher ratio of “” indicates that the neighbor node is more stable. Using thisconcept pheromone evaporation for the stable node is fine tuned such that if the ratio “” is more, theevaporation is slow and if “” is less the evaporation is faster. This leads to decreasing of the pheromonecontent in an optimal path which may result in congestion. These paths can be avoided using efficientevaporation technique. The MTA developed by adopting efficient pheromone evaporation technique willaddress the load balancing problems and expected to enhance the performance of the network in terms ofthroughput, and reduces End-to-end delay and Routing overheads

  12. Parameter Determination of Milling Process Using a Novel Teaching-Learning-Based Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Zhibo Zhai

    2015-01-01

    Full Text Available Cutting parameter optimization dramatically affects the production time, cost, profit rate, and the quality of the final products, in milling operations. Aiming to select the optimum machining parameters in multitool milling operations such as corner milling, face milling, pocket milling, and slot milling, this paper presents a novel version of TLBO, TLBO with dynamic assignment learning strategy (DATLBO, in which all the learners are divided into three categories based on their results in “Learner Phase”: good learners, moderate learners, and poor ones. Good learners are self-motivated and try to learn by themselves; each moderate learner uses a probabilistic approach to select one of good learners to learn; each poor learner also uses a probabilistic approach to select several moderate learners to learn. The CEC2005 contest benchmark problems are first used to illustrate the effectiveness of the proposed algorithm. Finally, the DATLBO algorithm is applied to a multitool milling process based on maximum profit rate criterion with five practical technological constraints. The unit time, unit cost, and profit rate from the Handbook (HB, Feasible Direction (FD method, Genetic Algorithm (GA method, five other TLBO variants, and DATLBO are compared, illustrating that the proposed approach is more effective than HB, FD, GA, and five other TLBO variants.

  13. A Multi-Objective Optimal Evolutionary Algorithm Based on Tree-Ranking

    Institute of Scientific and Technical Information of China (English)

    Shi Chuan; Kang Li-shan; Li Yan; Yan Zhen-yu

    2003-01-01

    Multi-objective optimal evolutionary algorithms (MOEAs) are a kind of new effective algorithms to solve Multi-objective optimal problem (MOP). Because ranking, a method which is used by most MOEAs to solve MOP, has some shortcoming s, in this paper, we proposed a new method using tree structure to express the relationship of solutions. Experiments prove that the method can reach the Pare to front, retain the diversity of the population, and use less time.

  14. Global optimization heuristic based on novel heuristics, low-discrepancy sequences and genetic algorithms

    OpenAIRE

    Georgieva, A.; Jordanov, Ivan

    2009-01-01

    In this paper a new heuristic hybrid technique for bound-constrained global optimization is proposed. We developed iterative algorithm called GLPτS that uses genetic algorithms, LPτ low-discrepancy sequences of points and heuristic rules to find regions of attraction when searching a global minimum of an objective function. Subsequently Nelder-Mead Simplex local search technique is used to refine the solution. The combination of the three techniques (Genetic algorithms, LPτO Low-discrepancy s...

  15. An Aircraft Navigation System Fault Diagnosis Method Based on Optimized Neural Network Algorithm

    Institute of Scientific and Technical Information of China (English)

    Jean-dedieu Weyepe

    2014-01-01

    Air data and inertial reference system (ADIRS) is one of the complex sub-system in the aircraft navigation system and it plays an important role into the flight safety of the aircraft. This paper propose an optimize neural network algorithm which is a combination of neural network and ant colony algorithm to improve efficiency of maintenance engineer job task.

  16. Analysis of Ant Colony Optimization and Population-Based Evolutionary Algorithms on Dynamic Problems

    DEFF Research Database (Denmark)

    Lissovoi, Andrei

    This thesis presents new running time analyses of nature-inspired algorithms on various dynamic problems. It aims to identify and analyse the features of algorithms and problem classes which allow efficient optimization to occur in the presence of dynamic behaviour. We consider the following...

  17. Optimization design of wind turbine drive train based on Matlab genetic algorithm toolbox

    International Nuclear Information System (INIS)

    In order to ensure the high efficiency of the whole flexible drive train of the front-end speed adjusting wind turbine, the working principle of the main part of the drive train is analyzed. As critical parameters, rotating speed ratios of three planetary gear trains are selected as the research subject. The mathematical model of the torque converter speed ratio is established based on these three critical variable quantity, and the effect of key parameters on the efficiency of hydraulic mechanical transmission is analyzed. Based on the torque balance and the energy balance, refer to hydraulic mechanical transmission characteristics, the transmission efficiency expression of the whole drive train is established. The fitness function and constraint functions are established respectively based on the drive train transmission efficiency and the torque converter rotating speed ratio range. And the optimization calculation is carried out by using MATLAB genetic algorithm toolbox. The optimization method and results provide an optimization program for exact match of wind turbine rotor, gearbox, hydraulic mechanical transmission, hydraulic torque converter and synchronous generator, ensure that the drive train work with a high efficiency, and give a reference for the selection of the torque converter and hydraulic mechanical transmission

  18. Traffic Congestion Evaluation and Signal Control Optimization Based on Wireless Sensor Networks: Model and Algorithms

    Directory of Open Access Journals (Sweden)

    Wei Zhang

    2012-01-01

    Full Text Available This paper presents the model and algorithms for traffic flow data monitoring and optimal traffic light control based on wireless sensor networks. Given the scenario that sensor nodes are sparsely deployed along the segments between signalized intersections, an analytical model is built using continuum traffic equation and develops the method to estimate traffic parameter with the scattered sensor data. Based on the traffic data and principle of traffic congestion formation, we introduce the congestion factor which can be used to evaluate the real-time traffic congestion status along the segment and to predict the subcritical state of traffic jams. The result is expected to support the timing phase optimization of traffic light control for the purpose of avoiding traffic congestion before its formation. We simulate the traffic monitoring based on the Mobile Century dataset and analyze the performance of traffic light control on VISSIM platform when congestion factor is introduced into the signal timing optimization model. The simulation result shows that this method can improve the spatial-temporal resolution of traffic data monitoring and evaluate traffic congestion status with high precision. It is helpful to remarkably alleviate urban traffic congestion and decrease the average traffic delays and maximum queue length.

  19. Potential Odor Intensity Grid Based UAV Path Planning Algorithm with Particle Swarm Optimization Approach

    Directory of Open Access Journals (Sweden)

    Yang Liu

    2016-01-01

    Full Text Available This paper proposes a potential odor intensity grid based optimization approach for unmanned aerial vehicle (UAV path planning with particle swarm optimization (PSO technique. Odor intensity is created to color the area in the searching space with highest probability where candidate particles may locate. A potential grid construction operator is designed for standard PSO based on different levels of odor intensity. The potential grid construction operator generates two potential location grids with highest odor intensity. Then the middle point will be seen as the final position in current particle dimension. The global optimum solution will be solved as the average. In addition, solution boundaries of searching space in each particle dimension are restricted based on properties of threats in the flying field to avoid prematurity. Objective function is redesigned by taking minimum direction angle to destination into account and a sampling method is introduced. A paired samples t-test is made and an index called straight line rate (SLR is used to evaluate the length of planned path. Experiments are made with other three heuristic evolutionary algorithms. The results demonstrate that the proposed method is capable of generating higher quality paths efficiently for UAV than any other tested optimization techniques.

  20. Optimization design of drilling string by screw coal miner based on ant colony algorithm

    Institute of Scientific and Technical Information of China (English)

    ZHANG Qiang; MAO Jun; DING Fei

    2008-01-01

    It took that the weight minimum and drive efficiency maximal were as double optimizing target,the optimization model had built the drilling string,and the optimization solution was used of the ant colony algorithm to find in progress.Adopted a two-layer search of the continuous space ant colony algorithm with overlapping or variation global ant search operation strategy and conjugated gradient partial ant search operation strategy.The experiment indicates that the spiral drill weight reduces 16.77% and transports the efficiency enhance 7.05% through the optimization design,the ant colony algorithm application on the spiral drill optimized design has provided the basis for the system research screw coal mine machine.

  1. Optimization design of drilling string by screw coal miner based on ant colony algorithm

    Institute of Scientific and Technical Information of China (English)

    ZHANG Qiang; MAO Jun; DING Fei

    2008-01-01

    It took that the weight minimum and drive efficiency maximal were as double optimizing target, the optimization model had built the drilling string, and the optimization solution was used of the ant colony algorithm to find in progress. Adopted a two-layer search of the continuous space ant colony algorithm with overlapping or variation global ant search operation strategy and conjugated gradient partial ant search operation strat-egy. The experiment indicates that the spiral drill weight reduces 16.77% and transports the efficiency enhance 7.05% through the optimization design, the ant colony algorithm application on the spiral drill optimized design has provided the basis for the system re-search screw coal mine machine.

  2. Validation of genetic algorithm-based optimal sampling for ocean data assimilation

    Science.gov (United States)

    Heaney, Kevin D.; Lermusiaux, Pierre F. J.; Duda, Timothy F.; Haley, Patrick J.

    2016-08-01

    Regional ocean models are capable of forecasting conditions for usefully long intervals of time (days) provided that initial and ongoing conditions can be measured. In resource-limited circumstances, the placement of sensors in optimal locations is essential. Here, a nonlinear optimization approach to determine optimal adaptive sampling that uses the genetic algorithm (GA) method is presented. The method determines sampling strategies that minimize a user-defined physics-based cost function. The method is evaluated using identical twin experiments, comparing hindcasts from an ensemble of simulations that assimilate data selected using the GA adaptive sampling and other methods. For skill metrics, we employ the reduction of the ensemble root mean square error (RMSE) between the "true" data-assimilative ocean simulation and the different ensembles of data-assimilative hindcasts. A five-glider optimal sampling study is set up for a 400 km × 400 km domain in the Middle Atlantic Bight region, along the New Jersey shelf-break. Results are compared for several ocean and atmospheric forcing conditions.

  3. AERODYNAMIC OPTIMIZATION FOR TURBINE BLADE BASED ON HIERARCHICAL FAIR COMPETITION GENETIC ALGORITHMS WITH DYNAMIC NICHE

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    A global optimization approach to turbine blade design based on hierarchical fair competition genetic algorithms with dynamic niche (HFCDN-GAs) coupled with Reynolds-averaged Navier-Stokes (RANS) equation is presented. In order to meet the search theory of GAs and the aerodynamic performances of turbine, Bezier curve is adopted to parameterize the turbine blade profile, and a fitness function pertaining to optimization is designed. The design variables are the control points' ordinates of characteristic polygon of Bezier curve representing the turbine blade profile. The object function is the maximum lift-drag ratio of the turbine blade. The constraint conditions take into account the leading and trailing edge metal angle, and the strength and aerodynamic performances of turbine blade. And the treatment method of the constraint conditions is the flexible penalty function. The convergence history of test function indicates that HFCDN-GAs can locate the global optimum within a few search steps and have high robustness. The lift-drag ratio of the optimized blade is 8.3% higher than that of the original one. The results show that the proposed global optimization approach is effective for turbine blade.

  4. Optimization for Cavitation Inception Performance of Pump-Turbine in Pump Mode Based on Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Ran Tao

    2014-01-01

    Full Text Available Cavitation is a negative factor of hydraulic machinery because of its undesirable effects on the operation stability and safety. For reversible pump-turbines, the improvement of cavitation inception performance in pump mode is very important due to the strict requirements. The geometry of blade leading edge is crucial for the local flow separation which affects the scale and position of pressure drop. Hence, the optimization of leading edge shape is helpful for the improvement of cavitation inception performance. Based on the genetic algorithm, optimization under multiple flow rate conditions was conducted by modifying the leading edge ellipse ratio and blade thickness on the front 20% meanline. By using CFD simulation, optimization was completed with obvious improvements on the cavitation inception performance. CFD results show that the pressure drop location had moved downstream with the increasement of the minimum pressure coefficient. Experimental verifications also got an obvious enhancement of cavitation inception performance. The stability and safety was improved by moving the cavitation inception curve out of the operating range. This optimization is proved applicable and effective for the engineering applications of reversible pump-turbines.

  5. Load Distribution of Evolutionary Algorithm for Complex-Process Optimization Based on Differential Evolutionary Strategy in Hot Rolling Process

    Directory of Open Access Journals (Sweden)

    Xu Yang

    2013-01-01

    Full Text Available Based on the hot rolling process, a load distribution optimization model is established, which includes rolling force model, thickness distribution model, and temperature model. The rolling force ratio distribution and good strip shape are integrated as two indicators of objective function in the optimization model. Then, the evolutionary algorithm for complex-process optimization (EACOP is introduced in the following optimization algorithm. Due to its flexible framework structure on search mechanism, the EACOP is improved within differential evolutionary strategy, for better coverage speed and search efficiency. At last, the experimental and simulation result shows that evolutionary algorithm for complex-process optimization based on differential evolutionary strategy (DEACOP is the organism including local search and global search. The comparison with experience distribution and EACOP shows that DEACOP is able to use fewer adjustable parameters and more efficient population differential strategy during solution searching; meanwhile it still can get feasible mathematical solution for actual load distribution problems in hot rolling process.

  6. Antenna optimization using Particle Swarm Optimization algorithm

    Directory of Open Access Journals (Sweden)

    Golubović Ružica M.

    2006-01-01

    Full Text Available We present the results for two different antenna optimization problems that are found using the Particle Swarm Optimization (PSO algorithm. The first problem is finding the maximal forward gain of a Yagi antenna. The second problem is finding the optimal feeding of a broadside antenna array. The optimization problems have 6 and 20 optimization variables, respectively. The preferred values of the parameters of the PSO algorithm are found for presented problems. The results show that the preferred parameters of PSO are somewhat different for optimization problems with different number of dimensions of the optimization space. The results that are found using the PSO algorithm are compared with the results that are found using other optimization algorithms, in order to estimate the efficiency of the PSO.

  7. An efficient algorithm for function optimization: modified stem cells algorithm

    Science.gov (United States)

    Taherdangkoo, Mohammad; Paziresh, Mahsa; Yazdi, Mehran; Bagheri, Mohammad

    2013-03-01

    In this paper, we propose an optimization algorithm based on the intelligent behavior of stem cell swarms in reproduction and self-organization. Optimization algorithms, such as the Genetic Algorithm (GA), Particle Swarm Optimization (PSO) algorithm, Ant Colony Optimization (ACO) algorithm and Artificial Bee Colony (ABC) algorithm, can give solutions to linear and non-linear problems near to the optimum for many applications; however, in some case, they can suffer from becoming trapped in local optima. The Stem Cells Algorithm (SCA) is an optimization algorithm inspired by the natural behavior of stem cells in evolving themselves into new and improved cells. The SCA avoids the local optima problem successfully. In this paper, we have made small changes in the implementation of this algorithm to obtain improved performance over previous versions. Using a series of benchmark functions, we assess the performance of the proposed algorithm and compare it with that of the other aforementioned optimization algorithms. The obtained results prove the superiority of the Modified Stem Cells Algorithm (MSCA).

  8. The island model for parallel implementation of evolutionary algorithm of Population-Based Incremental Learning (PBIL) optimization

    International Nuclear Information System (INIS)

    Genetic algorithms are biologically motivated adaptive systems which have been used, with good results, for function optimization. The purpose of this work is to introduce a new parallelization method to be applied to the Population-Based Incremental Learning (PBIL) algorithm. PBIL combines standard genetic algorithm mechanisms with simple competitive learning and has ben successfully used in combinatorial optimization problems. The development of this algorithm aims its application to the reload optimization of PWR nuclear reactors. Tests have been performed with combinatorial optimization problems similar to the reload problem. Results are compared to the serial PBIL ones, showing the new method's superiority and its viability as a tool for the nuclear core reload problem solution. (author)

  9. Optimal congestion control algorithm for ad hoc networks: Penalty function-based approach

    Institute of Scientific and Technical Information of China (English)

    XU Wet-qiang; WU Tie-jun

    2006-01-01

    In this paper, based on the inherent characteristic of the contention relation between flows in ad hoc networks, we introduce the notion of the link's interference set, extend the utility maximization problem representing congestion control in wireline networks to ad hoc networks, apply the penalty function approach and the subgradient method to solve this problem, and propose the congestion control algorithm Penalty function-based Optical Congestion Control (POCC) which is implemented in NS2 simulator. Specifically, each link transmits periodically the information on its congestion state to its interference set; the session at each source adjusts the transmission rate based on the optimal tradeoffbetween the utility value and the congestion level which the interference set of the links that this session goes though suffers from. MATLAB-based simulation results showed that POCC can approach the globally optimal solution. The NS2-based simulation results showed that POCC outperforms default TCP and ATCP to achieve efficient and fair resource allocation in ad hoc networks.

  10. Optimization of thread partitioning parameters in speculative multithreading based on artificial immune algorithm

    Institute of Scientific and Technical Information of China (English)

    Yu-xiang LI; Yin-liang ZHAO‡; Bin LIU; Shuo JI

    2015-01-01

    Thread partition plays an important role in speculative multithreading (SpMT) for automatic parallelization of ir-regular programs. Using unified values of partition parameters to partition different applications leads to the fact that every ap-plication cannot own its optimal partition scheme. In this paper, five parameters affecting thread partition are extracted from heuristic rules. They are the dependence threshold (DT), lower limit of thread size (TSL), upper limit of thread size (TSU), lower limit of spawning distance (SDL), and upper limit of spawning distance (SDU). Their ranges are determined in accordance with heuristic rules, and their step-sizes are set empirically. Under the condition of setting speedup as an objective function, all com-binations of five threshold values form the solution space, and our aim is to search for the best combination to obtain the best thread granularity, thread dependence, and spawning distance, so that every application has its best partition scheme. The issue can be attributed to a single objective optimization problem. We use the artificial immune algorithm (AIA) to search for the optimal solution. On Prophet, which is a generic SpMT processor to evaluate the performance of multithreaded programs, Olden bench-marks are used to implement the process. Experiments show that we can obtain the optimal parameter values for every benchmark, and Olden benchmarks partitioned with the optimized parameter values deliver a performance improvement of 3.00%on a 4-core platform compared with a machine learning based approach, and 8.92%compared with a heuristics-based approach.

  11. Note: Ultrasonic gas flowmeter based on optimized time-of-flight algorithms

    Science.gov (United States)

    Wang, X. F.; Tang, Z. A.

    2011-04-01

    A new digital signal processor based single path ultrasonic gas flowmeter is designed, constructed, and experimentally tested. To achieve high accuracy measurements, an optimized ultrasound driven method of incorporation of the amplitude modulation and the phase modulation of the transmit-receive technique is used to stimulate the transmitter. Based on the regularities among the received envelope zero-crossings, different received signal's signal-to-noise ratio situations are discriminated and optional time-of-flight algorithms are applied to take flow rate calculations. Experimental results from the dry calibration indicate that the designed flowmeter prototype can meet the zero-flow verification test requirements of the American Gas Association Report No. 9. Furthermore, the results derived from the flow calibration prove that the proposed flowmeter prototype can measure flow rate accurately in the practical experiments, and the nominal accuracies after FWME adjustment are lower than 0.8% throughout the calibration range.

  12. Note: Ultrasonic gas flowmeter based on optimized time-of-flight algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Wang, X. F.; Tang, Z. A. [Department of Electronic Science and Technology, Dalian University of Technology, Dalian, 116023 (China)

    2011-04-15

    A new digital signal processor based single path ultrasonic gas flowmeter is designed, constructed, and experimentally tested. To achieve high accuracy measurements, an optimized ultrasound driven method of incorporation of the amplitude modulation and the phase modulation of the transmit-receive technique is used to stimulate the transmitter. Based on the regularities among the received envelope zero-crossings, different received signal's signal-to-noise ratio situations are discriminated and optional time-of-flight algorithms are applied to take flow rate calculations. Experimental results from the dry calibration indicate that the designed flowmeter prototype can meet the zero-flow verification test requirements of the American Gas Association Report No. 9. Furthermore, the results derived from the flow calibration prove that the proposed flowmeter prototype can measure flow rate accurately in the practical experiments, and the nominal accuracies after FWME adjustment are lower than 0.8% throughout the calibration range.

  13. Optimized Robot Path Planning Using Parallel Genetic Algorithm Based on Visible Midpoint

    Directory of Open Access Journals (Sweden)

    Motahar Reza

    2016-07-01

    Full Text Available An analysis is made for optimized path planning for mobile robot by using parallel genetic algorithm. The parallel genetic algorithm (PGA is applied on the visible midpoint approach to find shortest path for mobile robot. The hybrid ofthese two algorithms provides a better optimized solution for smooth and shortest path for mobile robot. In this problem, the visible midpoint approach is used to make the effectiveness for avoiding local minima. It gives the optimum paths which are always consisting on free trajectories. But the proposedhybrid parallel genetic algorithm converges very fast to obtain the shortest route from source to destination due to the sharing of population. The total population is partitioned into a number subgroups to perform the parallel GA. The master thread is the center of information exchange and making selection with fitness evaluation.The cell to cell crossover makes the algorithm significantly good. The problem converges quickly with in a less number of iteration.

  14. Layout Optimization of Sensor-based Reconstruction of Explosion Overpressure Field Based on the Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Miaomiao Bai

    2014-11-01

    Full Text Available In underwater blasting experiment, the layout of the sensor has always been highly concerned. From the perspective of reconstruction with explosion overpressure field, the paper presents four indicators, which can obtain the optimal sensor layout scheme and guide sensor layout in practical experiment, combining with the genetic algorithm with global search. Then, a multi-scale model in every subregion of underwater blasting field was established to be used simulation experiments. By Matlab, the variation of these four indicators with different sensor layout, and reconstruction accuracy are analyzed and discussed. Finally, a conclusion has been raised through the analysis and comparison of simulation results, that the program can get a better sensor layout. It requires fewer number of sensors to be able to get good results with high accuracy. In the actual test explosions, we can refer to this scheme laid sensors.

  15. A Genetic Algorithm Optimized Decision Tree-SVM based Stock Market Trend Prediction System

    Directory of Open Access Journals (Sweden)

    Binoy B. Nair

    2010-12-01

    Full Text Available Prediction of stock market trends has been an area of great interest both to researchers attempting to uncover the information hidden in the stock market data and for those who wish to profit by trading stocks. The extremely nonlinear nature of the stock market data makes it very difficult to design a system that can predict the future direction of the stock market with sufficient accuracy. This work presents a data mining based stock market trend prediction system, which produces highly accurate stock market forecasts. The proposed system is a genetic algorithm optimized decision tree-support vector machine (SVM hybrid, which can predict one-day-ahead trends in stockmarkets. The uniqueness of the proposed system lies in the use ofthe hybrid system which can adapt itself to the changing market conditions and in the fact that while most of the attempts at stockmarket trend prediction have approached it as a regression problem, present study converts the trend prediction task into a classification problem, thus improving the prediction accuracysignificantly. Performance of the proposed hybrid system isvalidated on the historical time series data from the Bombaystock exchange sensitive index (BSE-Sensex. The system performance is then compared to that of an artificial neural network (ANN based system and a naïve Bayes based system. It is found that the trend prediction accuracy is highest for the hybrid system and the genetic algorithm optimized decision tree- SVM hybrid system outperforms both the artificial neural network and the naïve bayes based trend prediction systems.

  16. Optimal sensor placement for time-domain identification using a wavelet-based genetic algorithm

    Science.gov (United States)

    Mahdavi, Seyed Hossein; Razak, Hashim Abdul

    2016-06-01

    This paper presents a wavelet-based genetic algorithm strategy for optimal sensor placement (OSP) effective for time-domain structural identification. Initially, the GA-based fitness evaluation is significantly improved by using adaptive wavelet functions. Later, a multi-species decimal GA coding system is modified to be suitable for an efficient search around the local optima. In this regard, a local operation of mutation is introduced in addition with regeneration and reintroduction operators. It is concluded that different characteristics of applied force influence the features of structural responses, and therefore the accuracy of time-domain structural identification is directly affected. Thus, the reliable OSP strategy prior to the time-domain identification will be achieved by those methods dealing with minimizing the distance of simulated responses for the entire system and condensed system considering the force effects. The numerical and experimental verification on the effectiveness of the proposed strategy demonstrates the considerably high computational performance of the proposed OSP strategy, in terms of computational cost and the accuracy of identification. It is deduced that the robustness of the proposed OSP algorithm lies in the precise and fast fitness evaluation at larger sampling rates which result in the optimum evaluation of the GA-based exploration and exploitation phases towards the global optimum solution.

  17. New Approach to Optimize the Apfs Placement Based on Instantaneous Reactive Power Theory by Genetic Algorithm

    Science.gov (United States)

    Hashemi-Dezaki, Hamed; Mohammadalizadeh-Shabestary, Masoud; Askarian-Abyaneh, Hossein; Rezaei-Jegarluei, Mohammad

    2014-01-01

    In electrical distribution systems, a great amount of power are wasting across the lines, also nowadays power factors, voltage profiles and total harmonic distortions (THDs) of most loads are not as would be desired. So these important parameters of a system play highly important role in wasting money and energy, and besides both consumers and sources are suffering from a high rate of distortions and even instabilities. Active power filters (APFs) are innovative ideas for solving of this adversity which have recently used instantaneous reactive power theory. In this paper, a novel method is proposed to optimize the allocation of APFs. The introduced method is based on the instantaneous reactive power theory in vectorial representation. By use of this representation, it is possible to asses different compensation strategies. Also, APFs proper placement in the system plays a crucial role in either reducing the losses costs and power quality improvement. To optimize the APFs placement, a new objective function has been defined on the basis of five terms: total losses, power factor, voltage profile, THD and cost. Genetic algorithm has been used to solve the optimization problem. The results of applying this method to a distribution network illustrate the method advantages.

  18. ANFIS Based Time Series Prediction Method of Bank Cash Flow Optimized by Adaptive Population Activity PSO Algorithm

    Directory of Open Access Journals (Sweden)

    Jie-Sheng Wang

    2015-06-01

    Full Text Available In order to improve the accuracy and real-time of all kinds of information in the cash business, and solve the problem which accuracy and stability is not high of the data linkage between cash inventory forecasting and cash management information in the commercial bank, a hybrid learning algorithm is proposed based on adaptive population activity particle swarm optimization (APAPSO algorithm combined with the least squares method (LMS to optimize the adaptive network-based fuzzy inference system (ANFIS model parameters. Through the introduction of metric function of population diversity to ensure the diversity of population and adaptive changes in inertia weight and learning factors, the optimization ability of the particle swarm optimization (PSO algorithm is improved, which avoids the premature convergence problem of the PSO algorithm. The simulation comparison experiments are carried out with BP-LMS algorithm and standard PSO-LMS by adopting real commercial banks’ cash flow data to verify the effectiveness of the proposed time series prediction of bank cash flow based on improved PSO-ANFIS optimization method. Simulation results show that the optimization speed is faster and the prediction accuracy is higher.

  19. Centrifugal compressor blade optimization based on uniform design and genetic algorithms

    Institute of Scientific and Technical Information of China (English)

    Xinwei SHU; Chuangang GU; Jun XIAO; Chuang GAO

    2008-01-01

    An optimization approach to centrifugal com-pressor blade design, incorporating uniform design method (UDM), computational fluid dynamics (CFD) analysis technique, regression analysis method and gen-etic algorithms (GA), is presented. UDM is employed to generate the geometric information of trial samples whose performance is evaluated by CFD technique. Then, func-tion approximation of sample information is performed by regression analysis method. Finally, global optimiza-tion of the approximative function is obtained by genetic algorithms. Taking maximum isentropic efficiency as objective function, this optimization approach has been applied to the optimum design of a certain centrifugal compressor blades. The results, compared with those of the original one, show that isentropic efficiency of the optimized impeller has been improved which indicates the effectiveness of the proposed optimization approach.

  20. Optimal Filtering Algorithm-Based Multiuser Detector for Fast Fading CDMA Systems

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    A multiuser detector was developed for fast fading code-division multiple-access systems by representing the channels as a system with the multiplicative noise (SMN) model and then using the known optimal filtering algorithm for the SMN for multiuser detection (MUD). This multiuser detector allows the channel response to be stochastic in one symbol duration, which can be regarded as an effective method of MUD for fast fading CDMA systems. Performance analyses show that the multiuser detector is theoretically valid for CDMA systems over fast fading channels. Simulations show that the multiuser detector performs better than the Kalman filter-based multiuser detector with a faster convergence rate and lower bit error rate.

  1. Multi-objective optimization based on Genetic Algorithm for PID controller tuning

    Institute of Scientific and Technical Information of China (English)

    WANG Guo-liang; YAN Wei-wu; SHAO Hui-he

    2009-01-01

    To get the satisfying performance of a PID controller, this paper presents a novel Pareto - based multi-objective genetic algorithm ( MOGA), which can be used to find the appropriate setting of the PID controller by analyzing the pareto optimal surfaces. Rated settings of the controller by two criteria, the error between output and reference signals and control moves, are listed on the pareto surface. Appropriate setting can be chosen under a balance between two criteria for different control purposes. A controller tuning problem for a plant with high order and time delay is chosen as an example. Simulation results show that the method of MOGA is more efficient compared with traditional tuning methods.

  2. Optimal operation of water supply systems with tanks based on genetic algorithm

    Institute of Scientific and Technical Information of China (English)

    YU Ting-chao; ZHANG Tu-qiao; LI Xun

    2005-01-01

    In view of the poor water supply system's network properties, the system's complicated network hydraulic equations were replaced by macroscopic nodal pressure model and the model of relationship between supply flow and water source head. By using pump-station pressure head and initial tank water levels as decision variables, the model of optimal allocation of water supply between pump-sources was developed. Genetic algorithm was introduced to deal with the model of optimal allocation of water supply. Methods for handling each constraint condition were put forward, and overcome the shortcoming such as premature convergence of genetic algorithm;a solving method was brought forward in which genetic algorithm was combined with simulated annealing technology and self-adaptive crossover and mutation probabilities were adopted. An application example showed the feasibility of this algorithm.

  3. An Image Filter Based on Shearlet Transformation and Particle Swarm Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Kai Hu

    2015-01-01

    Full Text Available Digital image is always polluted by noise and made data postprocessing difficult. To remove noise and preserve detail of image as much as possible, this paper proposed image filter algorithm which combined the merits of Shearlet transformation and particle swarm optimization (PSO algorithm. Firstly, we use classical Shearlet transform to decompose noised image into many subwavelets under multiscale and multiorientation. Secondly, we gave weighted factor to those subwavelets obtained. Then, using classical Shearlet inverse transform, we obtained a composite image which is composed of those weighted subwavelets. After that, we designed fast and rough evaluation method to evaluate noise level of the new image; by using this method as fitness, we adopted PSO to find the optimal weighted factor we added; after lots of iterations, by the optimal factors and Shearlet inverse transform, we got the best denoised image. Experimental results have shown that proposed algorithm eliminates noise effectively and yields good peak signal noise ratio (PSNR.

  4. An Optimal Pull-Push Scheduling Algorithm Based on Network Coding for Mesh Peer-to-Peer Live Streaming

    Science.gov (United States)

    Cui, Laizhong; Jiang, Yong; Wu, Jianping; Xia, Shutao

    Most large-scale Peer-to-Peer (P2P) live streaming systems are constructed as a mesh structure, which can provide robustness in the dynamic P2P environment. The pull scheduling algorithm is widely used in this mesh structure, which degrades the performance of the entire system. Recently, network coding was introduced in mesh P2P streaming systems to improve the performance, which makes the push strategy feasible. One of the most famous scheduling algorithms based on network coding is R2, with a random push strategy. Although R2 has achieved some success, the push scheduling strategy still lacks a theoretical model and optimal solution. In this paper, we propose a novel optimal pull-push scheduling algorithm based on network coding, which consists of two stages: the initial pull stage and the push stage. The main contributions of this paper are: 1) we put forward a theoretical analysis model that considers the scarcity and timeliness of segments; 2) we formulate the push scheduling problem to be a global optimization problem and decompose it into local optimization problems on individual peers; 3) we introduce some rules to transform the local optimization problem into a classical min-cost optimization problem for solving it; 4) We combine the pull strategy with the push strategy and systematically realize our scheduling algorithm. Simulation results demonstrate that decode delay, decode ratio and redundant fraction of the P2P streaming system with our algorithm can be significantly improved, without losing throughput and increasing overhead.

  5. Modeling and optimizing electrodischarge machine process (EDM) with an approach based on genetic algorithm

    Science.gov (United States)

    Zabbah, Iman

    2012-01-01

    Electro Discharge Machine (EDM) is the commonest untraditional method of production for forming metals and the Non-Oxide ceramics. The increase of smoothness, the increase of the remove of filings, and also the decrease of proportional erosion tool has an important role in this machining. That is directly related to the choosing of input parameters.The complicated and non-linear nature of EDM has made the process impossible with usual and classic method. So far, some methods have been used based on intelligence to optimize this process. At the top of them we can mention artificial neural network that has modelled the process as a black box. The problem of this kind of machining is seen when a workpiece is composited of the collection of carbon-based materials such as silicon carbide. In this article, besides using the new method of mono-pulse technical of EDM, we design a fuzzy neural network and model it. Then the genetic algorithm is used to find the optimal inputs of machine. In our research, workpiece is a Non-Oxide metal called silicon carbide. That makes the control process more difficult. At last, the results are compared with the previous methods.

  6. Optimization of dynamic economic dispatch with valve-point effect using chaotic sequence based differential evolution algorithms

    International Nuclear Information System (INIS)

    A chaotic sequence based differential evolution (DE) approach for solving the dynamic economic dispatch problem (DEDP) with valve-point effect is presented in this paper. The proposed method combines the DE algorithm with the local search technique to improve the performance of the algorithm. DE is the main optimizer, while an approximated model for local search is applied to fine tune in the solution of the DE run. To accelerate convergence of DE, a series of constraints handling rules are adopted. An initial population obtained by using chaotic sequence exerts optimal performance of the proposed algorithm. The combined algorithm is validated for two test systems consisting of 10 and 13 thermal units whose incremental fuel cost function takes into account the valve-point loading effects. The proposed combined method outperforms other algorithms reported in literatures for DEDP considering valve-point effects.

  7. Optimized features selection for gender classification using optimization algorithms

    OpenAIRE

    KHAN, Sajid Ali; Nazir, Muhammad; RIAZ, Naveed

    2013-01-01

    Optimized feature selection is an important task in gender classification. The optimized features not only reduce the dimensions, but also reduce the error rate. In this paper, we have proposed a technique for the extraction of facial features using both appearance-based and geometric-based feature extraction methods. The extracted features are then optimized using particle swarm optimization (PSO) and the bee algorithm. The geometric-based features are optimized by PSO with ensem...

  8. High-performance simulation-based algorithms for an alpine ski racer’s trajectory optimization in heterogeneous computer systems

    Directory of Open Access Journals (Sweden)

    Dębski Roman

    2014-09-01

    Full Text Available Effective, simulation-based trajectory optimization algorithms adapted to heterogeneous computers are studied with reference to the problem taken from alpine ski racing (the presented solution is probably the most general one published so far. The key idea behind these algorithms is to use a grid-based discretization scheme to transform the continuous optimization problem into a search problem over a specially constructed finite graph, and then to apply dynamic programming to find an approximation of the global solution. In the analyzed example it is the minimum-time ski line, represented as a piecewise-linear function (a method of elimination of unfeasible solutions is proposed. Serial and parallel versions of the basic optimization algorithm are presented in detail (pseudo-code, time and memory complexity. Possible extensions of the basic algorithm are also described. The implementation of these algorithms is based on OpenCL. The included experimental results show that contemporary heterogeneous computers can be treated as μ-HPC platforms-they offer high performance (the best speedup was equal to 128 while remaining energy and cost efficient (which is crucial in embedded systems, e.g., trajectory planners of autonomous robots. The presented algorithms can be applied to many trajectory optimization problems, including those having a black-box represented performance measure

  9. Bat algorithm optimized fuzzy PD based speed controller for brushless direct current motor

    Directory of Open Access Journals (Sweden)

    K. Premkumar

    2016-06-01

    Full Text Available In this paper, design of fuzzy proportional derivative controller and fuzzy proportional derivative integral controller for speed control of brushless direct current drive has been presented. Optimization of the above controllers design is carried out using nature inspired optimization algorithms such as particle swarm, cuckoo search, and bat algorithms. Time domain specifications such as overshoot, undershoot, settling time, recovery time, and steady state error and performance indices such as root mean squared error, integral of absolute error, integral of time multiplied absolute error and integral of squared error are measured and compared for the above controllers under different operating conditions such as varying set speed and load disturbance conditions. The precise investigation through simulation is performed using simulink toolbox. From the simulation test results, it is evident that bat optimized fuzzy proportional derivative controller has superior performance than the other controllers considered. Experimental test results have also been taken and analyzed for the optimal controller identified through simulation.

  10. A Schedule Optimization Model on Multirunway Based on Ant Colony Algorithm

    OpenAIRE

    Yu Jiang; Zhaolong Xu; Xinxing Xu; Zhihua Liao; Yuxiao Luo

    2014-01-01

    In order to make full use of the slot of runway, reduce flight delay, and ensure fairness among airlines, a schedule optimization model for arrival-departure flights is established in the paper. The total delay cost and fairness among airlines are two objective functions. The ant colony algorithm is adopted to solve this problem and the result is more efficient and reasonable when compared with FCFS (first come first served) strategy. Optimization results show that the flight delay and fair d...

  11. Big Data: A Parallel Particle Swarm Optimization-Back-Propagation Neural Network Algorithm Based on MapReduce.

    Science.gov (United States)

    Cao, Jianfang; Cui, Hongyan; Shi, Hao; Jiao, Lijuan

    2016-01-01

    A back-propagation (BP) neural network can solve complicated random nonlinear mapping problems; therefore, it can be applied to a wide range of problems. However, as the sample size increases, the time required to train BP neural networks becomes lengthy. Moreover, the classification accuracy decreases as well. To improve the classification accuracy and runtime efficiency of the BP neural network algorithm, we proposed a parallel design and realization method for a particle swarm optimization (PSO)-optimized BP neural network based on MapReduce on the Hadoop platform using both the PSO algorithm and a parallel design. The PSO algorithm was used to optimize the BP neural network's initial weights and thresholds and improve the accuracy of the classification algorithm. The MapReduce parallel programming model was utilized to achieve parallel processing of the BP algorithm, thereby solving the problems of hardware and communication overhead when the BP neural network addresses big data. Datasets on 5 different scales were constructed using the scene image library from the SUN Database. The classification accuracy of the parallel PSO-BP neural network algorithm is approximately 92%, and the system efficiency is approximately 0.85, which presents obvious advantages when processing big data. The algorithm proposed in this study demonstrated both higher classification accuracy and improved time efficiency, which represents a significant improvement obtained from applying parallel processing to an intelligent algorithm on big data. PMID:27304987

  12. Big Data: A Parallel Particle Swarm Optimization-Back-Propagation Neural Network Algorithm Based on MapReduce

    Science.gov (United States)

    Cao, Jianfang; Cui, Hongyan; Shi, Hao; Jiao, Lijuan

    2016-01-01

    A back-propagation (BP) neural network can solve complicated random nonlinear mapping problems; therefore, it can be applied to a wide range of problems. However, as the sample size increases, the time required to train BP neural networks becomes lengthy. Moreover, the classification accuracy decreases as well. To improve the classification accuracy and runtime efficiency of the BP neural network algorithm, we proposed a parallel design and realization method for a particle swarm optimization (PSO)-optimized BP neural network based on MapReduce on the Hadoop platform using both the PSO algorithm and a parallel design. The PSO algorithm was used to optimize the BP neural network’s initial weights and thresholds and improve the accuracy of the classification algorithm. The MapReduce parallel programming model was utilized to achieve parallel processing of the BP algorithm, thereby solving the problems of hardware and communication overhead when the BP neural network addresses big data. Datasets on 5 different scales were constructed using the scene image library from the SUN Database. The classification accuracy of the parallel PSO-BP neural network algorithm is approximately 92%, and the system efficiency is approximately 0.85, which presents obvious advantages when processing big data. The algorithm proposed in this study demonstrated both higher classification accuracy and improved time efficiency, which represents a significant improvement obtained from applying parallel processing to an intelligent algorithm on big data. PMID:27304987

  13. Big Data: A Parallel Particle Swarm Optimization-Back-Propagation Neural Network Algorithm Based on MapReduce.

    Science.gov (United States)

    Cao, Jianfang; Cui, Hongyan; Shi, Hao; Jiao, Lijuan

    2016-01-01

    A back-propagation (BP) neural network can solve complicated random nonlinear mapping problems; therefore, it can be applied to a wide range of problems. However, as the sample size increases, the time required to train BP neural networks becomes lengthy. Moreover, the classification accuracy decreases as well. To improve the classification accuracy and runtime efficiency of the BP neural network algorithm, we proposed a parallel design and realization method for a particle swarm optimization (PSO)-optimized BP neural network based on MapReduce on the Hadoop platform using both the PSO algorithm and a parallel design. The PSO algorithm was used to optimize the BP neural network's initial weights and thresholds and improve the accuracy of the classification algorithm. The MapReduce parallel programming model was utilized to achieve parallel processing of the BP algorithm, thereby solving the problems of hardware and communication overhead when the BP neural network addresses big data. Datasets on 5 different scales were constructed using the scene image library from the SUN Database. The classification accuracy of the parallel PSO-BP neural network algorithm is approximately 92%, and the system efficiency is approximately 0.85, which presents obvious advantages when processing big data. The algorithm proposed in this study demonstrated both higher classification accuracy and improved time efficiency, which represents a significant improvement obtained from applying parallel processing to an intelligent algorithm on big data.

  14. Novel binary PSO algorithm based optimization of transmission expansion planning considering power losses

    Science.gov (United States)

    Astuty; Haryono, T.

    2016-04-01

    Transmission expansion planning (TEP) is one of the issue that have to be faced caused by addition of large scale power generation into the existing power system. Optimization need to be conducted to get optimal solution technically and economically. Several mathematic methods have been applied to provide optimal allocation of new transmission line such us genetic algorithm, particle swarm optimization and tabu search. This paper proposed novel binary particle swarm optimization (NBPSO) to determine which transmission line should be added to the existing power system. There are two scenerios in this simulation. First, considering transmission power losses and the second is regardless transmission power losses. NBPSO method successfully obtain optimal solution in short computation time. Compare to the first scenario, the number of new line in second scenario which regardless power losses is less but produces high power losses that cause the cost becoming extremely expensive.

  15. Global optimization for ducted coaxial-rotors aircraft based on Kriging model and improved particle swarm optimization algorithm

    Institute of Scientific and Technical Information of China (English)

    杨璐鸿; 刘顺安; 张冠宇; 王春雪

    2015-01-01

    To improve the operational efficiency of global optimization in engineering, Kriging model was established to simplify the mathematical model for calculations. Ducted coaxial-rotors aircraft was taken as an example and Fluent software was applied to the virtual prototype simulations. Through simulation sample points, the total lift of the ducted coaxial-rotors aircraft was obtained. The Kriging model was then constructed, and the function was fitted. Improved particle swarm optimization (PSO) was also utilized for the global optimization of the Kriging model of the ducted coaxial-rotors aircraft for the determination of optimized global coordinates. Finally, the optimized results were simulated by Fluent. The results show that the Kriging model and the improved PSO algorithm significantly improve the lift performance of ducted coaxial-rotors aircraft and computer operational efficiency.

  16. Differential search algorithm-based parametric optimization of electrochemical micromachining processes

    Directory of Open Access Journals (Sweden)

    Debkalpa Goswami

    2014-01-01

    Full Text Available Electrochemical micromachining (EMM appears to be a very promising micromachining process for having higher machining rate, better precision and control, reliability, flexibility, environmental acceptability, and capability of machining a wide range of materials. It permits machining of chemically resistant materials, like titanium, copper alloys, super alloys and stainless steel to be used in biomedical, electronic, micro-electromechanical system and nano-electromechanical system applications. Therefore, the optimal use of an EMM process for achieving enhanced machining rate and improved profile accuracy demands selection of its various machining parameters. Various optimization tools, primarily Derringer’s desirability function approach have been employed by the past researchers for deriving the best parametric settings of EMM processes, which inherently lead to sub-optimal or near optimal solutions. In this paper, an attempt is made to apply an almost new optimization tool, i.e. differential search algorithm (DSA for parametric optimization of three EMM processes. A comparative study of optimization performance between DSA, genetic algorithm and desirability function approach proves the wide acceptability of DSA as a global optimization tool.

  17. Side scan sonar image segmentation based on neutrosophic set and quantum-behaved particle swarm optimization algorithm

    Science.gov (United States)

    Zhao, Jianhu; Wang, Xiao; Zhang, Hongmei; Hu, Jun; Jian, Xiaomin

    2016-09-01

    To fulfill side scan sonar (SSS) image segmentation accurately and efficiently, a novel segmentation algorithm based on neutrosophic set (NS) and quantum-behaved particle swarm optimization (QPSO) is proposed in this paper. Firstly, the neutrosophic subset images are obtained by transforming the input image into the NS domain. Then, a co-occurrence matrix is accurately constructed based on these subset images, and the entropy of the gray level image is described to serve as the fitness function of the QPSO algorithm. Moreover, the optimal two-dimensional segmentation threshold vector is quickly obtained by QPSO. Finally, the contours of the interested target are segmented with the threshold vector and extracted by the mathematic morphology operation. To further improve the segmentation efficiency, the single threshold segmentation, an alternative algorithm, is recommended for the shadow segmentation by considering the gray level characteristics of the shadow. The accuracy and efficiency of the proposed algorithm are assessed with experiments of SSS image segmentation.

  18. An optimal-estimation-based aerosol retrieval algorithm using OMI near-UV observations

    Science.gov (United States)

    Jeong, U.; Kim, J.; Ahn, C.; Torres, O.; Liu, X.; Bhartia, P. K.; Spurr, R. J. D.; Haffner, D.; Chance, K.; Holben, B. N.

    2016-01-01

    An optimal-estimation(OE)-based aerosol retrieval algorithm using the OMI (Ozone Monitoring Instrument) near-ultraviolet observation was developed in this study. The OE-based algorithm has the merit of providing useful estimates of errors simultaneously with the inversion products. Furthermore, instead of using the traditional look-up tables for inversion, it performs online radiative transfer calculations with the VLIDORT (linearized pseudo-spherical vector discrete ordinate radiative transfer code) to eliminate interpolation errors and improve stability. The measurements and inversion products of the Distributed Regional Aerosol Gridded Observation Network campaign in northeast Asia (DRAGON NE-Asia 2012) were used to validate the retrieved aerosol optical thickness (AOT) and single scattering albedo (SSA). The retrieved AOT and SSA at 388 nm have a correlation with the Aerosol Robotic Network (AERONET) products that is comparable to or better than the correlation with the operational product during the campaign. The OE-based estimated error represented the variance of actual biases of AOT at 388 nm between the retrieval and AERONET measurements better than the operational error estimates. The forward model parameter errors were analyzed separately for both AOT and SSA retrievals. The surface reflectance at 388 nm, the imaginary part of the refractive index at 354 nm, and the number fine-mode fraction (FMF) were found to be the most important parameters affecting the retrieval accuracy of AOT, while FMF was the most important parameter for the SSA retrieval. The additional information provided with the retrievals, including the estimated error and degrees of freedom, is expected to be valuable for relevant studies. Detailed advantages of using the OE method were described and discussed in this paper.

  19. Optimizing Artificial Neural Networks using Cat Swarm Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    John Paul T. Yusiong

    2012-12-01

    Full Text Available An Artificial Neural Network (ANN is an abstract representation of the biological nervous system which has the ability to solve many complex problems. The interesting attributes it exhibits makes an ANN capable of “learning”. ANN learning is achieved by training the neural network using a training algorithm. Aside from choosing a training algorithm to train ANNs, the ANN structure can also be optimized by applying certain pruning techniques to reduce network complexity. The Cat Swarm Optimization (CSO algorithm, a swarm intelligence-based optimization algorithm mimics the behavior of cats, is used as the training algorithm and the Optimal Brain Damage (OBD method as the pruning algorithm. This study suggests an approach to ANN training through the simultaneous optimization of the connection weights and ANN structure. Experiments performed on benchmark datasets taken from the UCI machine learning repository show that the proposed CSONN-OBD is an effective tool for training neural networks.

  20. Adaptive Reduced-Rank LCMV Beamforming Algorithms Based on Joint Iterative Optimization of Filters: Design and Analysis

    CERN Document Server

    de Lamare, R C; Fa, R

    2012-01-01

    This paper presents reduced-rank linearly constrained minimum variance (LCMV) beamforming algorithms based on joint iterative optimization of filters. The proposed reduced-rank scheme is based on a constrained joint iterative optimization of filters according to the minimum variance criterion. The proposed optimization procedure adjusts the parameters of a projection matrix and an adaptive reducedrank filter that operates at the output of the bank of filters. We describe LCMV expressions for the design of the projection matrix and the reduced-rank filter. We then describe stochastic gradient and develop recursive least-squares adaptive algorithms for their efficient implementation along with automatic rank selection techniques. An analysis of the stability and the convergence properties of the proposed algorithms is presented and semi-analytical expressions are derived for predicting their mean squared error (MSE) performance. Simulations for a beamforming application show that the proposed scheme and algorit...

  1. Optimized QoS Routing Algorithm

    Institute of Scientific and Technical Information of China (English)

    石明洪; 王思兵; 白英彩

    2004-01-01

    QoS routing is one of the key technologies for providing guaranteed service in IP networks. The paper focuses on the optimization problem for bandwidth constrained QoS routing, and proposes an optimal algorithm based on the global optimization of path bandwidth and hop counts. The main goal of the algorithm is to minimize the consumption of network resource, and at the same time to minimize the network congestion caused by irrational path selection. The simulation results show that our algorithm has lower call blocking rate and higher throughput than traditional algorithms.

  2. HYBRID OPTIMIZING GRIFFON-VULTURE ALGORITHM BASED ON SWARM INTELLIGENCE MECHANISMS

    Directory of Open Access Journals (Sweden)

    Chastikova V. A.

    2014-06-01

    Full Text Available Griffon-vultures with input parameters minimal value for compound functions optimization that change during the time searching hybrid algorithm offered in this article. Researches of its efficiency and comparing analysis with some other systems have been performed

  3. Optimal Facility Location Model Based on Genetic Simulated Annealing Algorithm for Siting Urban Refueling Stations

    Directory of Open Access Journals (Sweden)

    Dawei Chen

    2015-01-01

    Full Text Available This paper analyzes the impact factors and principles of siting urban refueling stations and proposes a three-stage method. The main objective of the method is to minimize refueling vehicles’ detour time. The first stage aims at identifying the most frequently traveled road segments for siting refueling stations. The second stage focuses on adding additional refueling stations to serve vehicles whose demands are not directly satisfied by the refueling stations identified in the first stage. The last stage further adjusts and optimizes the refueling station plan generated by the first two stages. A genetic simulated annealing algorithm is proposed to solve the optimization problem in the second stage and the results are compared to those from the genetic algorithm. A case study is also conducted to demonstrate the effectiveness of the proposed method and algorithm. The results indicate the proposed method can provide practical and effective solutions that help planners and government agencies make informed refueling station location decisions.

  4. Ant colony optimization image registration algorithm based on wavelet transform and mutual information

    Science.gov (United States)

    Zhang, Hong; Sun, Yanfeng; Zhai, Bing; Wang, Yiding

    2013-07-01

    This paper studies on the image registration of the medical images. Wavelet transform is adopted to decompose the medical images because the resolution of the medical image is high and the computational amount of the registration is large. Firstly, the low frequency sub-images are matched. Then source images are matched. The image registration was fulfilled by the ant colony optimization algorithm to search the extremum of the mutual information. The experiment result demonstrates the proposed approach can not only reduce calculation amount, but also skip from the local extremum during optimization process, and search the optimization value.

  5. Optimization of Wireless Optical Communication System Based on Augmented Lagrange Algorithm

    International Nuclear Information System (INIS)

    The optimal model for wireless optical communication system with Gaussian pointing loss factor is studied, in which the value of bit error probability (BEP) is prespecified and the optimal system parameters is to be found. For the superiority of augmented Lagrange method, the model considered is solved by using a classical quadratic augmented Lagrange algorithm. The detailed numerical results are reported. Accordingly, the optimal system parameters such as transmitter power, transmitter wavelength, transmitter telescope gain and receiver telescope gain can be established, which provide a scheme for efficient operation of the wireless optical communication system.

  6. Multidisciplinary Design Optimization of Crankshaft Structure Based on Cooptimization and Multi-Island Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Jian Liu

    2016-01-01

    Full Text Available The feasibility design method with multidisciplinary and multiobjective optimization is applied in the research of lightweight design and NVH performances of crankshaft in high-power marine reciprocating compressor. Opt-LHD is explored to obtain the experimental scheme and perform data sampling. The elliptical basis function neural network (EBFNN model considering modal frequency, static strength, torsional vibration angular displacement, and lightweight design of crankshaft is built. Deterministic optimization and reliability optimization for lightweight design of crankshaft are operated separately. Multi-island genetic algorithm (MIGA combined with multidisciplinary cooptimization method is used to carry out the multiobjective optimization of crankshaft structure. Pareto optimal set is obtained. Optimization results demonstrate that the reliability optimization which considers the uncertainties of production process can ensure product stability compared with deterministic optimization. The coupling and decoupling of structure mechanical properties, NVH, and lightweight design are considered during the multiobjective optimization of crankshaft structure. Designers can choose the optimization results according to their demands, which means the production development cycle and the costs can be significantly reduced.

  7. An Optimal-Estimation-Based Aerosol Retrieval Algorithm Using OMI Near-UV Observations

    Science.gov (United States)

    Jeong, U; Kim, J.; Ahn, C.; Torres, O.; Liu, X.; Bhartia, P. K.; Spurr, R. J. D.; Haffner, D.; Chance, K.; Holben, B. N.

    2016-01-01

    An optimal-estimation(OE)-based aerosol retrieval algorithm using the OMI (Ozone Monitoring Instrument) near-ultraviolet observation was developed in this study. The OE-based algorithm has the merit of providing useful estimates of errors simultaneously with the inversion products. Furthermore, instead of using the traditional lookup tables for inversion, it performs online radiative transfer calculations with the VLIDORT (linearized pseudo-spherical vector discrete ordinate radiative transfer code) to eliminate interpolation errors and improve stability. The measurements and inversion products of the Distributed Regional Aerosol Gridded Observation Network campaign in northeast Asia (DRAGON NE-Asia 2012) were used to validate the retrieved aerosol optical thickness (AOT) and single scattering albedo (SSA). The retrieved AOT and SSA at 388 nm have a correlation with the Aerosol Robotic Network (AERONET) products that is comparable to or better than the correlation with the operational product during the campaign. The OEbased estimated error represented the variance of actual biases of AOT at 388 nm between the retrieval and AERONET measurements better than the operational error estimates. The forward model parameter errors were analyzed separately for both AOT and SSA retrievals. The surface reflectance at 388 nm, the imaginary part of the refractive index at 354 nm, and the number fine-mode fraction (FMF) were found to be the most important parameters affecting the retrieval accuracy of AOT, while FMF was the most important parameter for the SSA retrieval. The additional information provided with the retrievals, including the estimated error and degrees of freedom, is expected to be valuable for relevant studies. Detailed advantages of using the OE method were described and discussed in this paper.

  8. Patterns Antennas Arrays Synthesis Based on Adaptive Particle Swarm Optimization and Genetic Algorithms

    Directory of Open Access Journals (Sweden)

    Boufeldja Kadri

    2013-01-01

    Full Text Available In recent years, evolutionary optimization (EO techniques have attracted considerable attention in the design of electromagnetic systems of increasing complexity. This paper presents a comparison between two optimization algorithms for the synthesis of uniform linear and planar antennas arrays, the first one is an adaptive particle swarm optimization (APSO where the inertia weight and acceleration coefficient are adjusted dynamically according to feedback taken from particles best memories to overcome the limitations of the standard PSO which are: premature convergence, low searching accuracy and iterative inefficiency. The second method is the genetic algorithms (GA inspired from the processes of the evolution of the species and the natural genetics. The results show that the design of uniform linear and planar antennas arrays using APSO method provides a low side lobe level and achieve faster convergence speed to the optimum solution than those obtained by a GA.

  9. 基于粒子群算法的布谷鸟搜索算法%Cuckoo search algorithm based on particle swarm optimization algorithm

    Institute of Scientific and Technical Information of China (English)

    李娜; 贺兴时

    2014-01-01

    为进一步提高布谷鸟搜索算法(Cuckoo Search )的收敛速度和计算精度,将PSO算法用于CS算法的位置更新过程,提出了基于PSO算法的布谷鸟搜索算法(CSPSO )。最后,通过6个典型测试函数进行仿真实验。结果表明,CSPSO 算法比CS算法和自适应步长布谷鸟搜索算法(ASCS)具有更快的收敛速度,更高的收敛精度和稳定性。%In order to make further improvement on the convergence speed and computational accuracy of cuckoo search algorithm ,a new cuckoo search algorithm based on particle swarm optimization algorithm is propased ,which uses particle swarm optimization instead of the original Levy flight mechanism into the location update process of CS algorithm .The simulation results show that the CSPSO can search for global optimization more quickly ,precisely and stably than original CS algorithm and self-adaptive step cuckoo search algorithm .

  10. Using an improved association rules mining optimization algorithm in web-based mobile-learning system

    Science.gov (United States)

    Huang, Yin; Chen, Jianhua; Xiong, Shaojun

    2009-07-01

    Mobile-Learning (M-learning) makes many learners get the advantages of both traditional learning and E-learning. Currently, Web-based Mobile-Learning Systems have created many new ways and defined new relationships between educators and learners. Association rule mining is one of the most important fields in data mining and knowledge discovery in databases. Rules explosion is a serious problem which causes great concerns, as conventional mining algorithms often produce too many rules for decision makers to digest. Since Web-based Mobile-Learning System collects vast amounts of student profile data, data mining and knowledge discovery techniques can be applied to find interesting relationships between attributes of learners, assessments, the solution strategies adopted by learners and so on. Therefore ,this paper focus on a new data-mining algorithm, combined with the advantages of genetic algorithm and simulated annealing algorithm , called ARGSA(Association rules based on an improved Genetic Simulated Annealing Algorithm), to mine the association rules. This paper first takes advantage of the Parallel Genetic Algorithm and Simulated Algorithm designed specifically for discovering association rules. Moreover, the analysis and experiment are also made to show the proposed method is superior to the Apriori algorithm in this Mobile-Learning system.

  11. Shape, sizing optimization and material selection based on mixed variables and genetic algorithm

    NARCIS (Netherlands)

    Tang, X.; Bassir, D.H.; Zhang, W.

    2010-01-01

    In this work, we explore simultaneous designs of materials selection and structural optimization. As the material selection turns out to be a discrete process that finds the optimal distribution of materials over the design domain, it cannot be performed with common gradient-based optimization metho

  12. A Time-Domain Structural Damage Detection Method Based on Improved Multiparticle Swarm Coevolution Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Shao-Fei Jiang

    2014-01-01

    Full Text Available Optimization techniques have been applied to structural health monitoring and damage detection of civil infrastructures for two decades. The standard particle swarm optimization (PSO is easy to fall into the local optimum and such deficiency also exists in the multiparticle swarm coevolution optimization (MPSCO. This paper presents an improved MPSCO algorithm (IMPSCO firstly and then integrates it with Newmark’s algorithm to localize and quantify the structural damage by using the damage threshold proposed. To validate the proposed method, a numerical simulation and an experimental study of a seven-story steel frame were employed finally, and a comparison was made between the proposed method and the genetic algorithm (GA. The results show threefold: (1 the proposed method not only is capable of localization and quantification of damage, but also has good noise-tolerance; (2 the damage location can be accurately detected using the damage threshold proposed in this paper; and (3 compared with the GA, the IMPSCO algorithm is more efficient and accurate for damage detection problems in general. This implies that the proposed method is applicable and effective in the community of damage detection and structural health monitoring.

  13. An optimal structural design algorithm using optimality criteria

    Science.gov (United States)

    Taylor, J. E.; Rossow, M. P.

    1976-01-01

    An algorithm for optimal design is given which incorporates several of the desirable features of both mathematical programming and optimality criteria, while avoiding some of the undesirable features. The algorithm proceeds by approaching the optimal solution through the solutions of an associated set of constrained optimal design problems. The solutions of the constrained problems are recognized at each stage through the application of optimality criteria based on energy concepts. Two examples are described in which the optimal member size and layout of a truss is predicted, given the joint locations and loads.

  14. Case Study on Optimal Routing in Logistics Network by Priority-based Genetic Algorithm

    Science.gov (United States)

    Wang, Xiaoguang; Lin, Lin; Gen, Mitsuo; Shiota, Mitsushige

    Recently, research on logistics caught more and more attention. One of the important issues on logistics system is to find optimal delivery routes with the least cost for products delivery. Numerous models have been developed for that reason. However, due to the diversity and complexity of practical problem, the existing models are usually not very satisfying to find the solution efficiently and convinently. In this paper, we treat a real-world logistics case with a company named ABC Co. ltd., in Kitakyusyu Japan. Firstly, based on the natures of this conveyance routing problem, as an extension of transportation problem (TP) and fixed charge transportation problem (fcTP) we formulate the problem as a minimum cost flow (MCF) model. Due to the complexity of fcTP, we proposed a priority-based genetic algorithm (pGA) approach to find the most acceptable solution to this problem. In this pGA approach, a two-stage path decoding method is adopted to develop delivery paths from a chromosome. We also apply the pGA approach to this problem, and compare our results with the current logistics network situation, and calculate the improvement of logistics cost to help the management to make decisions. Finally, in order to check the effectiveness of the proposed method, the results acquired are compared with those come from the two methods/ software, such as LINDO and CPLEX.

  15. The LQR Controller Design of Two-Wheeled Self-Balancing Robot Based on the Particle Swarm Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Jian Fang

    2014-01-01

    Full Text Available The dynamics model is established in view of the self-designed, two-wheeled, and self-balancing robot. This paper uses the particle swarm algorithm to optimize the parameter matrix of LQR controller based on the LQR control method to make the two-wheeled and self-balancing robot realize the stable control and reduce the overshoot amount and the oscillation frequency of the system at the same time. The simulation experiments prove that the LQR controller improves the system stability, obtains the good control effect, and has higher application value through using the particle swarm optimization algorithm.

  16. Novel Genetic Algorithm Based Solutions for Optimal Power Flow under Contingency Conditions

    Directory of Open Access Journals (Sweden)

    S. V. Durga Bhavani,

    2014-06-01

    Full Text Available Power system throughout the world is undergoing tremendous changes and developments due to rapid Restructuring, Deregulation and Open-access policies. Greater liberalization, larger market and increasing dependency on the electricity lead to the system operators to work on limited spinning reserve and to operate on vicinities to maximize the economy compromising on the reliability and security of the system for greater profits, which lead to establishment of a monitoring authority and accurate electronic system to prevent any untoward incidents like Blackouts. In any power system, unexpected outages of lines or transformers occur due to faults or other disturbances. These events may cause significant overloading of transmission lines or transformers, which in turn may lead to a viability crisis of the power system. The main role of power system control is to maintain a secure system state, i.e., to prevent the power system, moving from secure state into emergency state over the widest range of operating conditions. Security Constrained Optimal Power Flow (SCOPF is major tool used to improve the security of the system. In this work, Genetic algorithm has been used to solve the OPF and SCOPF problems. As initial effort conventional GA (binary coded based OPF and SCOPF is going to be attempted. The difficulties of binary coded GA in handling continuous search space lead to the evolution of real coded GA‟s. Solutions obtained using both the algorithms are compared. Case studies are made on the IEEE30 bus test system to demonstrate the ability of real coded GA in solving the OPF and SCOPF problems.

  17. Study on Cloud Computing Resource Scheduling Strategy Based on the Ant Colony Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Lingna He

    2012-09-01

    Full Text Available In order to replace the traditional Internet software usage patterns and enterprise management mode, this paper proposes a new business calculation mode- cloud computing, resources scheduling strategy is the key technology in cloud computing, Based on the study of cloud computing system structure and the mode of operation, The key research for cloud computing the process of the work scheduling and resource allocation problems based on ant colony algorithm , Detailed analysis and design of the specific implementation for cloud resources scheduling . And in CloudSim simulation environment and simulation experiments, the results show that the algorithm has better scheduling performance and load balance than general algorithm.

  18. 距离寻优中Dijkstra算法的优化%A OPTIMIZATION ALGORITHM BASED ON DIJKSTRA'S ALGORITHM IN SEARCH OF SHORTCUT

    Institute of Scientific and Technical Information of China (English)

    鲍培明

    2001-01-01

    When shortcut between two nodes is searched with Dijkstra'salgorithm, a lot of nodes away from the shortcut are involved.So efficiency of Dijkstra's algorithm is low. A optimization algorithm is presented in this paper based on Dijkstra's algorithm in search of shortcut. Based on the idea of beeline distance, the formula for the disposition of nodes is changed in the optimization algorithm. In the course of the optimization algorithm running, only these nodes in the shortcut or close to the shortcut are processed, and those nodes away from the shortcut are not processed. So the number of processed nodes is largely reduced in the optimization algorithm. Efficiency of the optimization algorithm is improved. Validity of this algorithm is proved. Practicablity and efficiency about this algorithm are disscused. This algorithm has been applied in practical task.%Dijkstra算法在求解两指定顶点间最短距离时,对两顶点之间最短路径以外的大量顶点进行了计算,而影响了算法的速度.在对Dijkstra算法分析的基础上,结合网络模型的特点,对Dijkstra算法进行了优化.优化算法基于两点之间直线最短的思想,改变了对顶点处理顺序的规则.在算法流程中只对最短路径上及其附近的顶点做了处理,而与最短路径相距较远的顶点基本不涉及.因此,在优化算法中计算的顶点数量大幅减少,提高了算法的速度.给出了优化算法的正确性证明,对优化算法的实用性和效率加以讨论.优化算法在实际中已经得到应用.

  19. Asymptotically Optimal Algorithm for Short-Term Trading Based on the Method of Calibration

    CERN Document Server

    V'yugin, Vladimir

    2012-01-01

    A trading strategy based on a natural learning process, which asymptotically outperforms any trading strategy from RKHS (Reproduced Kernel Hilbert Space), is presented. In this process, the trader rationally chooses his gambles using predictions made by a randomized well calibrated algorithm. Our strategy is based on Dawid's notion of calibration with more general changing checking rules and on some modification of Kakade and Foster's randomized algorithm for computing calibrated forecasts. We use also Vovk's method of defensive forecasting in RKHS.

  20. Fault Detection Based on Multi-Scale Local Binary Patterns Operator and Improved Teaching-Learning-Based Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Hongjian Zhang

    2015-09-01

    Full Text Available Aiming to effectively recognize train center plate bolt loss faults, this paper presents an improved fault detection method. A multi-scale local binary pattern operator containing the local texture information of different radii is designed to extract more efficient discrimination information. An improved teaching-learning-based optimization algorithm is established to optimize the classification results in the decision level. Two new phases including the worst recombination phase and the cuckoo search phase are incorporated to improve the diversity of the population and enhance the exploration. In the worst recombination phase, the worst solution is updated by a crossover recombination operation to prevent the premature convergence. The cuckoo search phase is adopted to escape the local optima. Experimental results indicate that the recognition accuracy is up to 98.9% which strongly demonstrates the effectiveness and reliability of the proposed detection method.

  1. A Genetic-Algorithms-Based Approach for Programming Linear and Quadratic Optimization Problems with Uncertainty

    Directory of Open Access Journals (Sweden)

    Weihua Jin

    2013-01-01

    Full Text Available This paper proposes a genetic-algorithms-based approach as an all-purpose problem-solving method for operation programming problems under uncertainty. The proposed method was applied for management of a municipal solid waste treatment system. Compared to the traditional interactive binary analysis, this approach has fewer limitations and is able to reduce the complexity in solving the inexact linear programming problems and inexact quadratic programming problems. The implementation of this approach was performed using the Genetic Algorithm Solver of MATLAB (trademark of MathWorks. The paper explains the genetic-algorithms-based method and presents details on the computation procedures for each type of inexact operation programming problems. A comparison of the results generated by the proposed method based on genetic algorithms with those produced by the traditional interactive binary analysis method is also presented.

  2. Optimal design of FIR high pass filter based on L1 error approximation using real coded genetic algorithm

    Directory of Open Access Journals (Sweden)

    Apoorva Aggarwal

    2015-12-01

    Full Text Available In this paper, an optimal design of linear phase digital finite impulse response (FIR highpass (HP filter using the L1-norm based real-coded genetic algorithm (RCGA is investigated. A novel fitness function based on L1 norm is adopted to enhance the design accuracy. Optimized filter coefficients are obtained by defining the filter objective function in L1 sense using RCGA. Simulation analysis unveils that the performance of the RCGA adopting this fitness function is better in terms of signal attenuation ability of the filter, flatter passband and the convergence rate. Observations are made on the percentage improvement of this algorithm over the gradient-based L1 optimization approach on various factors by a large amount. It is concluded that RCGA leads to the best solution under specified parameters for the FIR filter design on account of slight unnoticeable higher transition width.

  3. PMSVM: An Optimized Support Vector Machine Classification Algorithm Based on PCA and Multilevel Grid Search Methods

    Directory of Open Access Journals (Sweden)

    Yukai Yao

    2015-01-01

    Full Text Available We propose an optimized Support Vector Machine classifier, named PMSVM, in which System Normalization, PCA, and Multilevel Grid Search methods are comprehensively considered for data preprocessing and parameters optimization, respectively. The main goals of this study are to improve the classification efficiency and accuracy of SVM. Sensitivity, Specificity, Precision, and ROC curve, and so forth, are adopted to appraise the performances of PMSVM. Experimental results show that PMSVM has relatively better accuracy and remarkable higher efficiency compared with traditional SVM algorithms.

  4. Design for Two-degree-of-freedom PID Regulator Based on Improved Generalized Extremal Optimization Algorithm

    Institute of Scientific and Technical Information of China (English)

    HUO Hai-bo; ZHU Xin-jian; CAO Guang-yi

    2007-01-01

    A kind of new design method for two-degree-of-freedom (2DOF) PID regulator was presented, in which, a new global search heuristic--improved generalized extremal optimization (GEO) algorithm is applied to the parameter optimization design of 2DOF PID regulator. The simulated results show that very good dynamic response performance of both command tracking and disturbance rejection characteristics can be achieved simultaneously. At the same time, the comparisons of simulation results with the improved GA, the basic GEO and the improved GEO were given. From the comparisons, it is shown that the improved GEO algorithm is competitive in performance with the GA and basic GEO and is an attractive tool to be used in the design of two-degree-of-freedom PID regulator.

  5. Sewage flow optimization algorithm for large-scale urban sewer networks based on network community division

    Institute of Scientific and Technical Information of China (English)

    Lihui CEN; Yugeng XI

    2008-01-01

    By considering the flow control of urban sewer networks to minimize the electricity consumption of pumping stations.a decomposition-coordination strategy for energy savings based on network community division is developed in this paper. A mathematical model characterizing the smady-state flow of urball sewer networks is first constructed,consisting of a set of algebraic equations with the structure transportation capacities captured as constraints.Since the sewer networks have no apparent natural hierarchical structure in general.it is very difficult to identify the clustered groups.A fast network division approach through calculating the betweenness of each edge is successfully applied to identify the groups and a sewer network with arbitrary configuration could be then decomposed into subnetworks.By integrating the coupling constraints of the subnetworks.the original problem is separated into N optimization subproblems in accordance with the network decomposition.Each subproblem is solved locally and the solutions to the subproblems are coordinated to form an appropriate global solution.Finally,an application to a specified large-scale sewer network is also investigated to demonstrate the validity of the proposed algorithm.

  6. Cognitive Development Optimization Algorithm Based Support Vector Machines for Determining Diabetes

    Directory of Open Access Journals (Sweden)

    Utku Kose

    2016-03-01

    Full Text Available The definition, diagnosis and classification of Diabetes Mellitus and its complications are very important. First of all, the World Health Organization (WHO and other societies, as well as scientists have done lots of studies regarding this subject. One of the most important research interests of this subject is the computer supported decision systems for diagnosing diabetes. In such systems, Artificial Intelligence techniques are often used for several disease diagnostics to streamline the diagnostic process in daily routine and avoid misdiagnosis. In this study, a diabetes diagnosis system, which is formed via both Support Vector Machines (SVM and Cognitive Development Optimization Algorithm (CoDOA has been proposed. Along the training of SVM, CoDOA was used for determining the sigma parameter of the Gauss (RBF kernel function, and eventually, a classification process was made over the diabetes data set, which is related to Pima Indians. The proposed approach offers an alternative solution to the field of Artificial Intelligence-based diabetes diagnosis, and contributes to the related literature on diagnosis processes.

  7. An Optimization Model for Inventory System and the Algorithm for the Optimal Inventory Costs Based on Supply-Demand Balance

    OpenAIRE

    Qingsong Jiang; Wei Xing; Ruihuan Hou; Baoping Zhou

    2015-01-01

    In order to investigate the inventory optimization of circulation enterprises, demand analysis was carried out firstly considering supply-demand balance. Then, it was assumed that the demand process complied with mutually independent compound Poisson process. Based on this assumption, an optimization model for inventory control of circulation enterprises was established with the goal of minimizing the average total costs in unit time of inventory system. In addition, the optimal computing alg...

  8. On the Idea of a New Artificial Intelligence Based Optimization Algorithm Inspired From the Nature of Vortex

    Directory of Open Access Journals (Sweden)

    Utku Kose

    2015-07-01

    Full Text Available In this paper, the idea of a new artificial intelligence based optimization algorithm, which is inspired from the nature of vortex, has been provided briefly. As also a bio-inspired computation algorithm, the idea is generally focused on a typical vortex flow / behavior in nature and inspires from some dynamics that are occurred in the sense of vortex nature. Briefly, the algorithm is also a swarm-oriented evolutional problem solution approach; because it includes many methods related to elimination of weak swarm members and trying to improve the solution process by supporting the solution space via new swarm members. In order have better idea about success of the algorithm; it has been tested via some benchmark functions. At this point, the obtained results show that the algorithm can be an alternative to the literature in terms of single-objective optimizationsolution ways. Vortex Optimization Algorithm (VOA is the name suggestion by the authors; for this new idea of intelligent optimization approach.

  9. A Parallel Biological Optimization Algorithm to Solve the Unbalanced Assignment Problem Based on DNA Molecular Computing.

    Science.gov (United States)

    Wang, Zhaocai; Pu, Jun; Cao, Liling; Tan, Jian

    2015-10-23

    The unbalanced assignment problem (UAP) is to optimally resolve the problem of assigning n jobs to m individuals (m parallel DNA algorithm for solving the unbalanced assignment problem using DNA molecular operations. We reasonably design flexible-length DNA strands representing different jobs and individuals, take appropriate steps, and get the solutions of the UAP in the proper length range and O(mn) time. We extend the application of DNA molecular operations and simultaneity to simplify the complexity of the computation.

  10. A biogeography-based optimization algorithm with mutation strategies for model parameter estimation of solar and fuel cells

    International Nuclear Information System (INIS)

    Highlights: • Solar cell and PEM fuel cell parameter estimations are investigated in the paper. • A new biogeography-based method (BBO-M) is proposed for cell parameter estimations. • In BBO-M, two mutation operators are designed to enhance optimization performance. • BBO-M provides a competitive alternative in cell parameter estimation problems. - Abstract: Mathematical models are useful tools for simulation, evaluation, optimal operation and control of solar cells and proton exchange membrane fuel cells (PEMFCs). To identify the model parameters of these two type of cells efficiently, a biogeography-based optimization algorithm with mutation strategies (BBO-M) is proposed. The BBO-M uses the structure of biogeography-based optimization algorithm (BBO), and both the mutation motivated from the differential evolution (DE) algorithm and the chaos theory are incorporated into the BBO structure for improving the global searching capability of the algorithm. Numerical experiments have been conducted on ten benchmark functions with 50 dimensions, and the results show that BBO-M can produce solutions of high quality and has fast convergence rate. Then, the proposed BBO-M is applied to the model parameter estimation of the two type of cells. The experimental results clearly demonstrate the power of the proposed BBO-M in estimating model parameters of both solar and fuel cells

  11. A Novel Maximum Power Point Tracking Algorithm Based on Glowworm Swarm Optimization for Photovoltaic Systems

    Directory of Open Access Journals (Sweden)

    Wenhui Hou

    2016-01-01

    Full Text Available In order to extract the maximum power from PV system, the maximum power point tracking (MPPT technology has always been applied in PV system. At present, various MPPT control methods have been presented. The perturb and observe (P&O and conductance increment methods are the most popular and widely used under the constant irradiance. However, these methods exhibit fluctuations among the maximum power point (MPP. In addition, the changes of the environmental parameters, such as cloud cover, plant shelter, and the building block, will lead to the radiation change and then have a direct effect on the location of MPP. In this paper, a feasible MPPT method is proposed to adapt to the variation of the irradiance. This work applies the glowworm swarm optimization (GSO algorithm to determine the optimal value of a reference voltage in the PV system. The performance of the proposed GSO algorithm is evaluated by comparing it with the conventional P&O method in terms of tracking speed and accuracy by utilizing MATLAB/SIMULINK. The simulation results demonstrate that the tracking capability of the GSO algorithm is superior to that of the traditional P&O algorithm, particularly under low radiance and sudden mutation irradiance conditions.

  12. Database query optimization based on Bat Algorithm and Cuckoo Search Algorithm%基于BACS算法的数据库查询优化

    Institute of Scientific and Technical Information of China (English)

    王磊

    2015-01-01

    针对布谷鸟算法局部搜索能力弱、寻优精度低等缺陷,提出一种蝙蝠算法和布谷鸟算法相融合的数据库查询优化算法(BACS)。按照布谷鸟优化算法对鸟巢位置进行更新,利用蝙蝠算法的动态转换策略对鸟巢位置进一步更新,避免算法陷入局部最优;最后将BACS应用于数据库查询优化问题求解,并通过仿真实验对BACS的性能进行测试。实验结果表明,BACS加快了数据库查询优化求解的收敛速度,获得了质量更高的查询优化方案。%In order to solve the problems of bat algorithm which has low optimizing accuracy and weak local search ability, a novel query optimization method of database is proposed based on Bat Algorithm and Cuckoo Search Algorithm (BACS). Firstly, nest location is updated according to the cuckoo search optimization algorithm, and then cuckoo nest location is further replaced according to the dynamic conversion strategy in the bat algorithm and avoids falling into local optimum, finally it is applied to solve the query optimization problem of database, and the performance of BACS is tested by simulation experiments. The results show that, BACS accelerates the convergence speed of database query optimiza-tion and can obtain higher quality query optimization scheme.

  13. An optimization algorithm of collaborative indoor locating

    Directory of Open Access Journals (Sweden)

    SHI Ying

    2014-06-01

    Full Text Available Based on triangular centroid locating algorithm,this paper will use the idea of collaboration to indoor locating system.On account of the condition which has two nodes to be located in the test environment,we have designed a circular type optimization algorithm.Verified simulation results show that the circular type optimization algorithm,compared with the triangular centroid locating algorithm,can decrease the average error by 11.62%,decrease the maximum error by 7.74% and decrease the minimum error by 22.66%.The maximum value of the optimize degree of the circular type optimization algorithm is 28.63%,and the minimum value of that is 0.05%.

  14. An Energy-Efficient Multipath Routing Algorithm Based on Ant Colony Optimization for Wireless Sensor Networks

    OpenAIRE

    Mengjun Tong; Yangli Chen; Fangxiang Chen; Xiaoping Wu; Guozhong Shou

    2015-01-01

    An energy-efficient ACO-based multipath routing algorithm (EAMR) is proposed for energy-constrained wireless sensor networks. EAMR is a hybrid multipath algorithm, which is reactive in path discovery and proactive in route maintenance. EAMR has improvement and innovation in the ant packet structure, pheromone update formula, pheromone update mode, and the mechanism of multipath. Average energy consumption and congestion of path make pheromone update formula more reasonable. Incremental pherom...

  15. Acoustic Radiation Optimization Using the Particle Swarm Optimization Algorithm

    Science.gov (United States)

    Jeon, Jin-Young; Okuma, Masaaki

    The present paper describes a fundamental study on structural bending design to reduce noise using a new evolutionary population-based heuristic algorithm called the particle swarm optimization algorithm (PSOA). The particle swarm optimization algorithm is a parallel evolutionary computation technique proposed by Kennedy and Eberhart in 1995. This algorithm is based on the social behavior models for bird flocking, fish schooling and other models investigated by zoologists. Optimal structural design problems to reduce noise are highly nonlinear, so that most conventional methods are difficult to apply. The present paper investigates the applicability of PSOA to such problems. Optimal bending design of a vibrating plate using PSOA is performed in order to minimize noise radiation. PSOA can be effectively applied to such nonlinear acoustic radiation optimization.

  16. Interval-value Based Particle Swarm Optimization algorithm for cancer-type specific gene selection and sample classification

    Directory of Open Access Journals (Sweden)

    D. Ramyachitra

    2015-09-01

    Full Text Available Microarray technology allows simultaneous measurement of the expression levels of thousands of genes within a biological tissue sample. The fundamental power of microarrays lies within the ability to conduct parallel surveys of gene expression using microarray data. The classification of tissue samples based on gene expression data is an important problem in medical diagnosis of diseases such as cancer. In gene expression data, the number of genes is usually very high compared to the number of data samples. Thus the difficulty that lies with data are of high dimensionality and the sample size is small. This research work addresses the problem by classifying resultant dataset using the existing algorithms such as Support Vector Machine (SVM, K-nearest neighbor (KNN, Interval Valued Classification (IVC and the improvised Interval Value based Particle Swarm Optimization (IVPSO algorithm. Thus the results show that the IVPSO algorithm outperformed compared with other algorithms under several performance evaluation functions.

  17. Automatic generation control of multi-area power systems with diverse energy sources using Teaching Learning Based Optimization algorithm

    Directory of Open Access Journals (Sweden)

    Rabindra Kumar Sahu

    2016-03-01

    Full Text Available This paper presents the design and analysis of Proportional-Integral-Double Derivative (PIDD controller for Automatic Generation Control (AGC of multi-area power systems with diverse energy sources using Teaching Learning Based Optimization (TLBO algorithm. At first, a two-area reheat thermal power system with appropriate Generation Rate Constraint (GRC is considered. The design problem is formulated as an optimization problem and TLBO is employed to optimize the parameters of the PIDD controller. The superiority of the proposed TLBO based PIDD controller has been demonstrated by comparing the results with recently published optimization technique such as hybrid Firefly Algorithm and Pattern Search (hFA-PS, Firefly Algorithm (FA, Bacteria Foraging Optimization Algorithm (BFOA, Genetic Algorithm (GA and conventional Ziegler Nichols (ZN for the same interconnected power system. Also, the proposed approach has been extended to two-area power system with diverse sources of generation like thermal, hydro, wind and diesel units. The system model includes boiler dynamics, GRC and Governor Dead Band (GDB non-linearity. It is observed from simulation results that the performance of the proposed approach provides better dynamic responses by comparing the results with recently published in the literature. Further, the study is extended to a three unequal-area thermal power system with different controllers in each area and the results are compared with published FA optimized PID controller for the same system under study. Finally, sensitivity analysis is performed by varying the system parameters and operating load conditions in the range of ±25% from their nominal values to test the robustness.

  18. Fruit fly optimization algorithm based high efficiency and low NOx combustion modeling for a boiler

    Institute of Scientific and Technical Information of China (English)

    ZHANG Zhenxing∗; SUN Baomin; XIN Jing

    2014-01-01

    In order to control NOx emissions and enhance boiler efficiency in coal-fired boilers,the thermal operating data from an ultra-supercritical 1 000 MW unit boiler were analyzed.On the basis of the support vector regression machine (SVM),the fruit fly optimization algorithm (FOA)was applied to optimize the penalty parameter C,ker-nel parameter g and insensitive loss coefficient of the model.Then,the FOA-SVM model was established to predict the NOx emissions and boiler efficiency,and the performance of this model was compared with that of the GA-SVM model optimized by genetic algorithm (GA).The results show the FOA-SVM model has better prediction accuracy and generalization capability,of which the maximum average relative error of testing set lies in the NOx emissions model,which is only 3 .5 9%.The above models can predict the NOx emissions and boiler efficiency accurately,so they are very suitable for on-line modeling prediction,which provides a good model foundation for further optimiza-tion operation of large capacity boilers.

  19. Control parameter optimal tuning method based on annealing-genetic algorithm for complex electromechanical system

    Institute of Scientific and Technical Information of China (English)

    贺建军; 喻寿益; 钟掘

    2003-01-01

    A new searching algorithm named the annealing-genetic algorithm(AGA) was proposed by skillfully merging GA with SAA. It draws on merits of both GA and SAA ,and offsets their shortcomings. The difference from GA is that AGA takes objective function as adaptability function directly, so it cuts down some unnecessary time expense because of float-point calculation of function conversion. The difference from SAA is that AGA need not execute a very long Markov chain iteration at each point of temperature, so it speeds up the convergence of solution and makes no assumption on the search space,so it is simple and easy to be implemented. It can be applied to a wide class of problems. The optimizing principle and the implementing steps of AGA were expounded. The example of the parameter optimization of a typical complex electromechanical system named temper mill shows that AGA is effective and superior to the conventional GA and SAA. The control system of temper mill optimized by AGA has the optimal performance in the adjustable ranges of its parameters.

  20. An adaptive multi-spline refinement algorithm in simulation based sailboat trajectory optimization using onboard multi-core computer systems

    Directory of Open Access Journals (Sweden)

    Dębski Roman

    2016-06-01

    Full Text Available A new dynamic programming based parallel algorithm adapted to on-board heterogeneous computers for simulation based trajectory optimization is studied in the context of “high-performance sailing”. The algorithm uses a new discrete space of continuously differentiable functions called the multi-splines as its search space representation. A basic version of the algorithm is presented in detail (pseudo-code, time and space complexity, search space auto-adaptation properties. Possible extensions of the basic algorithm are also described. The presented experimental results show that contemporary heterogeneous on-board computers can be effectively used for solving simulation based trajectory optimization problems. These computers can be considered micro high performance computing (HPC platforms-they offer high performance while remaining energy and cost efficient. The simulation based approach can potentially give highly accurate results since the mathematical model that the simulator is built upon may be as complex as required. The approach described is applicable to many trajectory optimization problems due to its black-box represented performance measure and use of OpenCL.

  1. Algorithms for optimizing drug therapy

    Directory of Open Access Journals (Sweden)

    Martin Lene

    2004-07-01

    Full Text Available Abstract Background Drug therapy has become increasingly efficient, with more drugs available for treatment of an ever-growing number of conditions. Yet, drug use is reported to be sub optimal in several aspects, such as dosage, patient's adherence and outcome of therapy. The aim of the current study was to investigate the possibility to optimize drug therapy using computer programs, available on the Internet. Methods One hundred and ten officially endorsed text documents, published between 1996 and 2004, containing guidelines for drug therapy in 246 disorders, were analyzed with regard to information about patient-, disease- and drug-related factors and relationships between these factors. This information was used to construct algorithms for identifying optimum treatment in each of the studied disorders. These algorithms were categorized in order to define as few models as possible that still could accommodate the identified factors and the relationships between them. The resulting program prototypes were implemented in HTML (user interface and JavaScript (program logic. Results Three types of algorithms were sufficient for the intended purpose. The simplest type is a list of factors, each of which implies that the particular patient should or should not receive treatment. This is adequate in situations where only one treatment exists. The second type, a more elaborate model, is required when treatment can by provided using drugs from different pharmacological classes and the selection of drug class is dependent on patient characteristics. An easily implemented set of if-then statements was able to manage the identified information in such instances. The third type was needed in the few situations where the selection and dosage of drugs were depending on the degree to which one or more patient-specific factors were present. In these cases the implementation of an established decision model based on fuzzy sets was required. Computer programs

  2. Trajectory Optimization Algorithm Studies

    OpenAIRE

    Gandhi, Manan

    2015-01-01

    In complex engineered systems, completing an objective is sometimes not enough. The system must be able to reach a set performance characteristic, such as an unmanned aerial vehicle flying from point A to point B, \\textit{under 10 seconds}. This introduces the notion of optimality, what is the most efficient, the fastest, the cheapest way to complete a task. This report explores the two pillars of optimal control, Bellman's Dynamic Programming and Pontryagin's Maximum Principle, and compares ...

  3. Harmony search algorithm with differential evolution based control parameter co-evolution and its application in chemical process dynamic optimization

    Institute of Scientific and Technical Information of China (English)

    范勤勤; 王循华; 颜学峰

    2015-01-01

    A modified harmony search algorithm with co-evolutional control parameters (DEHS), applied through differential evolution optimization, is proposed. In DEHS, two control parameters, i.e., harmony memory considering rate and pitch adjusting rate, are encoded as a symbiotic individual of an original individual (i.e., harmony vector). Harmony search operators are applied to evolving the original population. DE is applied to co-evolving the symbiotic population based on feedback information from the original population. Thus, with the evolution of the original population in DEHS, the symbiotic population is dynamically and self-adaptively adjusted, and real-time optimum control parameters are obtained. The proposed DEHS algorithm has been applied to various benchmark functions and two typical dynamic optimization problems. The experimental results show that the performance of the proposed algorithm is better than that of other HS variants. Satisfactory results are obtained in the application.

  4. Simulation-based Optimization of a Real-world Travelling Salesman Problem Using an Evolutionary Algorithm with a Repair Function

    Directory of Open Access Journals (Sweden)

    Anna Syberfeldt

    2015-10-01

    Full Text Available This paper presents a real-world case study of optimizing waste collection in Sweden. The problem, involving approximately 17,000 garbage bins served by three bin lorries, is approached as a travelling salesman problem and solved using simulation-based optimization and an evolutionary algorithm. To improve the performance of the evolutionary algorithm, it is enhanced with a repair function that adjusts its genome values so that shorter routes are found more quickly. The algorithm is tested using two crossover operators, i.e., the order crossover and heuristic crossover, combined with different mutation rates. The results indicate that the order crossover is superior to the heuristics crossover, but that the driving force of the search process is the mutation operator combined with the repair function.

  5. A Novel Optimization Technique to Improve Gas Recognition by Electronic Noses Based on the Enhanced Krill Herd Algorithm.

    Science.gov (United States)

    Wang, Li; Jia, Pengfei; Huang, Tailai; Duan, Shukai; Yan, Jia; Wang, Lidan

    2016-01-01

    An electronic nose (E-nose) is an intelligent system that we will use in this paper to distinguish three indoor pollutant gases (benzene (C₆H₆), toluene (C₇H₈), formaldehyde (CH₂O)) and carbon monoxide (CO). The algorithm is a key part of an E-nose system mainly composed of data processing and pattern recognition. In this paper, we employ support vector machine (SVM) to distinguish indoor pollutant gases and two of its parameters need to be optimized, so in order to improve the performance of SVM, in other words, to get a higher gas recognition rate, an effective enhanced krill herd algorithm (EKH) based on a novel decision weighting factor computing method is proposed to optimize the two SVM parameters. Krill herd (KH) is an effective method in practice, however, on occasion, it cannot avoid the influence of some local best solutions so it cannot always find the global optimization value. In addition its search ability relies fully on randomness, so it cannot always converge rapidly. To address these issues we propose an enhanced KH (EKH) to improve the global searching and convergence speed performance of KH. To obtain a more accurate model of the krill behavior, an updated crossover operator is added to the approach. We can guarantee the krill group are diversiform at the early stage of iterations, and have a good performance in local searching ability at the later stage of iterations. The recognition results of EKH are compared with those of other optimization algorithms (including KH, chaotic KH (CKH), quantum-behaved particle swarm optimization (QPSO), particle swarm optimization (PSO) and genetic algorithm (GA)), and we can find that EKH is better than the other considered methods. The research results verify that EKH not only significantly improves the performance of our E-nose system, but also provides a good beginning and theoretical basis for further study about other improved krill algorithms' applications in all E-nose application areas. PMID

  6. Advances in metaheuristic algorithms for optimal design of structures

    CERN Document Server

    Kaveh, A

    2014-01-01

    This book presents efficient metaheuristic algorithms for optimal design of structures. Many of these algorithms are developed by the author and his colleagues, consisting of Democratic Particle Swarm Optimization, Charged System Search, Magnetic Charged System Search, Field of Forces Optimization, Dolphin Echolocation Optimization, Colliding Bodies Optimization, Ray Optimization. These are presented together with algorithms which were developed by other authors and have been successfully applied to various optimization problems. These consist of Particle Swarm Optimization, Big Bang-Big Crunch Algorithm, Cuckoo Search Optimization, Imperialist Competitive Algorithm, and Chaos Embedded Metaheuristic Algorithms. Finally a multi-objective optimization method is presented to solve large-scale structural problems based on the Charged System Search algorithm. The concepts and algorithms presented in this book are not only applicable to optimization of skeletal structures and finite element models, but can equally ...

  7. Optimized Angular a Star Algorithm for Global Path Search Based on Neighbor Node Evaluation

    Directory of Open Access Journals (Sweden)

    Ankit Bhadoria

    2014-07-01

    Full Text Available Any electromechanical device can be termed as Robot, which imitates human actions and in some of the situation can be used as a replacement for human. These days Robots are the integral part of our life and can be applied in several applications and tasks by giving respective commands. The research in robotics domain is to make it as autonomous and as much independent as it can be. The problem that arises is of controlling a mobile robot with the energy constraint. A lot of energy is wasted, if it takes wrong trajectory motion, this motion depends upon the robot knowledge which indeed in not constant. The variation in the environment results in making difficult for the robot to take precise and accurate measurements to reach the destination without much of the energy loss. An autonomous robot is expected to take decision according to the situation. For this precise decisions of robot path planning there are algorithms like A*, Dijkstra, D* etc. In this paper we have done analysis on partially known environment situation. Optimal path is planned by new heuristic approach over the A star algorithm, robot moving at an appropriate angle cuts down the unnecessary cost of path planning. Experimental results show that the proposed algorithm is much effective for more than 8% than the conventional A* algorithm in the same map environment.

  8. A methodology based in particle swarm optimization algorithm for preventive maintenance focused in reliability and cost

    International Nuclear Information System (INIS)

    In this work, a Particle Swarm Optimization Algorithm (PSO) is developed for preventive maintenance optimization. The proposed methodology, which allows the use flexible intervals between maintenance interventions, instead of considering fixed periods (as usual), allows a better adaptation of scheduling in order to deal with the failure rates of components under aging. Moreover, because of this flexibility, the planning of preventive maintenance becomes a difficult task. Motivated by the fact that the PSO has proved to be very competitive compared to other optimization tools, this work investigates the use of PSO as an alternative tool of optimization. Considering that PSO works in a real and continuous space, it is a challenge to use it for discrete optimization, in which scheduling may comprise variable number of maintenance interventions. The PSO model developed in this work overcome such difficulty. The proposed PSO searches for the best policy for maintaining and considers several aspects, such as: probability of needing repair (corrective maintenance), the cost of such repairs, typical outage times, costs of preventive maintenance, the impact of maintaining the reliability of systems as a whole, and the probability of imperfect maintenance. To evaluate the proposed methodology, we investigate an electro-mechanical system consisting of three pumps and four valves, High Pressure Injection System (HPIS) of a PWR. Results show that PSO is quite efficient in finding the optimum preventive maintenance policies for the HPIS. (author)

  9. Chemical optimization algorithm for fuzzy controller design

    CERN Document Server

    Astudillo, Leslie; Castillo, Oscar

    2014-01-01

    In this book, a novel optimization method inspired by a paradigm from nature is introduced. The chemical reactions are used as a paradigm to propose an optimization method that simulates these natural processes. The proposed algorithm is described in detail and then a set of typical complex benchmark functions is used to evaluate the performance of the algorithm. Simulation results show that the proposed optimization algorithm can outperform other methods in a set of benchmark functions. This chemical reaction optimization paradigm is also applied to solve the tracking problem for the dynamic model of a unicycle mobile robot by integrating a kinematic and a torque controller based on fuzzy logic theory. Computer simulations are presented confirming that this optimization paradigm is able to outperform other optimization techniques applied to this particular robot application

  10. Location Model and Optimization of Seaborne Petroleum Logistics Distribution Center Based on Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Chu-Liangyong

    2013-06-01

    Full Text Available The network of Chinese Waterborne Petroleum Logistics (CWPL is so complex that reasonably disposing and choosing Chinese Waterborne Petroleum Logistics Distribution Center (CWPLDC take on the important theory value and the practical significance. In the study, the network construct of CWPL distribution is provided and the corresponding mathematical model for locating CWPLDC is established, which is a nonlinear mixed interger model. In view of the nonlinerar programming characteristic of model, the genetic algorithm as the solution strategy is put forward here, the strategies of hybrid coding, constraint elimination , fitness function and genetic operator are given followed the algorithm. The result indicates that this model is effective and reliable. This method could also be applicable for other types of large-scale logistics distribution center optimization.

  11. RBF neural network based PI pitch controller for a class of 5-MW wind turbines using particle swarm optimization algorithm.

    Science.gov (United States)

    Poultangari, Iman; Shahnazi, Reza; Sheikhan, Mansour

    2012-09-01

    In order to control the pitch angle of blades in wind turbines, commonly the proportional and integral (PI) controller due to its simplicity and industrial usability is employed. The neural networks and evolutionary algorithms are tools that provide a suitable ground to determine the optimal PI gains. In this paper, a radial basis function (RBF) neural network based PI controller is proposed for collective pitch control (CPC) of a 5-MW wind turbine. In order to provide an optimal dataset to train the RBF neural network, particle swarm optimization (PSO) evolutionary algorithm is used. The proposed method does not need the complexities, nonlinearities and uncertainties of the system under control. The simulation results show that the proposed controller has satisfactory performance.

  12. Optimal Design of Broadband Loaded Wire Antennas Based on Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    Xu Peng; Xiao Bo-xun; Zhu Guo-qiang; Ke Heng-yu

    2003-01-01

    This paper, using the frequency bandwidth, where both the gain and the VSWR (Voltage Standing Wave Ratio) of a monopole can satisfy the design requirement, as object function, mainly describes the process, in which the load locations, the matching network topology and their component values are optimized by the AGA (Adaptive Genetic Algorithm), to achieve a gain more than -2 dB in horizontal direction and a VSWR less than 3 in bandwidth as wide as possible. Moreover the design results are presented for monopoles with two concentrated loadings. It shows that the AGA is an effective method for designing wideband antennas.

  13. Optimal Design of Broadband Loaded Wire Antennas Based on Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    Xu; Peng; Xiao; Bo-xun; 等

    2003-01-01

    This paper, using the frequency bandwidth, where both the gain and the VSWR(Voltage Standing Wave Ratio) of a monopole can satisfy the design requirement, as object function, mainly describes the process, in which the load locations, the matching network topology and their component values are optimized by the AGA(Adaptive Genetic Algorithm), to achieve a gain more than -2dB in horizontal direction and a VSWR less than 3 in bandwidth as wide as possible. Moreover the design results are presented for monopoles with two concentrated loadings. It shows that the AGA is an effective method for designing wideband antennas.

  14. Spaceborne SAR Imaging Algorithm for Coherence Optimized.

    Directory of Open Access Journals (Sweden)

    Zhiwei Qiu

    Full Text Available This paper proposes SAR imaging algorithm with largest coherence based on the existing SAR imaging algorithm. The basic idea of SAR imaging algorithm in imaging processing is that output signal can have maximum signal-to-noise ratio (SNR by using the optimal imaging parameters. Traditional imaging algorithm can acquire the best focusing effect, but would bring the decoherence phenomenon in subsequent interference process. Algorithm proposed in this paper is that SAR echo adopts consistent imaging parameters in focusing processing. Although the SNR of the output signal is reduced slightly, their coherence is ensured greatly, and finally the interferogram with high quality is obtained. In this paper, two scenes of Envisat ASAR data in Zhangbei are employed to conduct experiment for this algorithm. Compared with the interferogram from the traditional algorithm, the results show that this algorithm is more suitable for SAR interferometry (InSAR research and application.

  15. Spaceborne SAR Imaging Algorithm for Coherence Optimized.

    Science.gov (United States)

    Qiu, Zhiwei; Yue, Jianping; Wang, Xueqin; Yue, Shun

    2016-01-01

    This paper proposes SAR imaging algorithm with largest coherence based on the existing SAR imaging algorithm. The basic idea of SAR imaging algorithm in imaging processing is that output signal can have maximum signal-to-noise ratio (SNR) by using the optimal imaging parameters. Traditional imaging algorithm can acquire the best focusing effect, but would bring the decoherence phenomenon in subsequent interference process. Algorithm proposed in this paper is that SAR echo adopts consistent imaging parameters in focusing processing. Although the SNR of the output signal is reduced slightly, their coherence is ensured greatly, and finally the interferogram with high quality is obtained. In this paper, two scenes of Envisat ASAR data in Zhangbei are employed to conduct experiment for this algorithm. Compared with the interferogram from the traditional algorithm, the results show that this algorithm is more suitable for SAR interferometry (InSAR) research and application. PMID:26871446

  16. Spaceborne SAR Imaging Algorithm for Coherence Optimized

    Science.gov (United States)

    Qiu, Zhiwei; Yue, Jianping; Wang, Xueqin; Yue, Shun

    2016-01-01

    This paper proposes SAR imaging algorithm with largest coherence based on the existing SAR imaging algorithm. The basic idea of SAR imaging algorithm in imaging processing is that output signal can have maximum signal-to-noise ratio (SNR) by using the optimal imaging parameters. Traditional imaging algorithm can acquire the best focusing effect, but would bring the decoherence phenomenon in subsequent interference process. Algorithm proposed in this paper is that SAR echo adopts consistent imaging parameters in focusing processing. Although the SNR of the output signal is reduced slightly, their coherence is ensured greatly, and finally the interferogram with high quality is obtained. In this paper, two scenes of Envisat ASAR data in Zhangbei are employed to conduct experiment for this algorithm. Compared with the interferogram from the traditional algorithm, the results show that this algorithm is more suitable for SAR interferometry (InSAR) research and application. PMID:26871446

  17. Novel multi-objective optimization algorithm

    Institute of Scientific and Technical Information of China (English)

    Jie Zeng; Wei Nie

    2014-01-01

    Many multi-objective evolutionary algorithms (MOEAs) can converge to the Pareto optimal front and work wel on two or three objectives, but they deteriorate when faced with many-objective problems. Indicator-based MOEAs, which adopt various indicators to evaluate the fitness values (instead of the Pareto-dominance relation to select candidate solutions), have been regarded as promising schemes that yield more satisfactory re-sults than wel-known algorithms, such as non-dominated sort-ing genetic algorithm (NSGA-II) and strength Pareto evolution-ary algorithm (SPEA2). However, they can suffer from having a slow convergence speed. This paper proposes a new indicator-based multi-objective optimization algorithm, namely, the multi-objective shuffled frog leaping algorithm based on the ε indicator (ε-MOSFLA). This algorithm adopts a memetic meta-heuristic, namely, the SFLA, which is characterized by the powerful capa-bility of global search and quick convergence as an evolutionary strategy and a simple and effective ε-indicator as a fitness as-signment scheme to conduct the search procedure. Experimental results, in comparison with other representative indicator-based MOEAs and traditional Pareto-based MOEAs on several standard test problems with up to 50 objectives, show thatε-MOSFLA is the best algorithm for solving many-objective optimization problems in terms of the solution quality as wel as the speed of convergence.

  18. Multiple People Picking Assignment and Routing Optimization Based on Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    孙慧

    2014-01-01

    In order to improve the picking efficiency, reduce the picking time, this paper take artificial picking operation of a certain distribution center which has double-area warehouse as the studying object. Discuss the picking task allocation and routing problems. Establish the TSP model of order-picking system. Create a heuristic algorithm bases on the Genetic Algorithm (GA) which help to solve the task allocating problem and to get the associated order-picking routes. And achieve the simulation experiment with the Visual 6.0C++platform to prove the rationality of the model and the effectiveness of the arithmetic.

  19. Optimal approximation of head-related transfer function's pole-zero model based on genetic algorithm

    Institute of Scientific and Technical Information of China (English)

    ZHANG Jie; MA Hao; WU Zhen-yang

    2006-01-01

    In the research on spatial hearing and virtual auditory space,it is important to effectively model the head-related transfer functions (HRTFs).Based on the analysis of the HRTFs' spectrum and some perspectives of psychoacoustics,this paper applied multiple demes' parallel and real-valued coding genetic algorithm (GA) to approximate the HRTFs' zero-pole model.Using the logarithmic magnitude's error criterion for the human auditory sense,the results show that the performance of the GA is on the average 39% better than that of the traditional Prony method,and 46% better than that of the Yule-Walker algorithm.

  20. Space mapping optimization algorithms for engineering design

    DEFF Research Database (Denmark)

    Koziel, Slawomir; Bandler, John W.; Madsen, Kaj

    2006-01-01

    A simple, efficient optimization algorithm based on space mapping (SM) is presented. It utilizes input SM to reduce the misalignment between the coarse and fine models of the optimized object over a region of interest, and output space mapping (OSM) to ensure matching of response and first-order ...

  1. Genetic Algorithm Based Optimal Testing Effort Allocation Problem for Modular Software

    Directory of Open Access Journals (Sweden)

    Gurjeet Kaur

    2012-01-01

    Full Text Available Software reliability growth models (SRGM are used to assess modular software quantitatively and predict the reliability of each of the modules during module testing phase. In the last few decades various SRGM’s have been proposed in literature. However, it is difficult to select the best model from a plethora of models available. To reduce this difficulty, unified modeling approaches have been proposed by many researchers. In this paper we present a generalized framework for software reliability growth modeling with respect to testing effort expenditure and incorporate the faults of different severity. We have used different standard probability distribution functions for representing failure observation and fault detection/ correction times. The faults in the software are labeled as simple, hard and complex faults. Developing reliable modular software is necessary. But, at the same time the testing effort available during the testing time is limited. Consequently, it is important for the project manager to allocate these limited resources among the modules optimally during the testing process. In this paper we have formulated an optimization problem in which the total number of faults removed from modular software is (which include simple, hard and complex faults maximized subject to budgetary and reliability constraints. To solve the optimization problem we have used genetic algorithm. One numerical example has been discussed to illustrate the solution of the formulated optimal effort allocation problem.

  2. Computational Intelligence Optimization Algorithm Based on Meta-heuristic Social-Spider: Case Study on CT Liver Tumor Diagnosis

    Directory of Open Access Journals (Sweden)

    Mohamed Abu ElSoud

    2016-04-01

    Full Text Available Feature selection is an importance step in classification phase and directly affects the classification performance. Feature selection algorithm explores the data to eliminate noisy, redundant, irrelevant data, and optimize the classification performance. This paper addresses a new subset feature selection performed by a new Social Spider Optimizer algorithm (SSOA to find optimal regions of the complex search space through the interaction of individuals in the population. SSOA is a new natural meta-heuristic computation algorithm which mimics the behavior of cooperative social-spiders based on the biological laws of the cooperative colony. Different combinatorial set of feature extraction is obtained from different methods in order to keep and achieve optimal accuracy. Normalization function is applied to smooth features between [0,1] and decrease gap between features. SSOA based on feature selection and reduction compared with other methods over CT liver tumor dataset, the proposed approach proves better performance in both feature size reduction and classification accuracy. Improvements are observed consistently among 4 classification methods. A theoretical analysis that models the number of correctly classified data is proposed using Confusion Matrix, Precision, Recall, and Accuracy. The achieved accuracy is 99.27%, precision is 99.37%, and recall is 99.19%. The results show that, the mechanism of SSOA provides very good exploration, exploitation and local minima avoidance.

  3. OPTIMIZATION OF GRID RESOURCE SCHEDULING USING PARTICLE SWARM OPTIMIZATION ALGORITHM

    Directory of Open Access Journals (Sweden)

    S. Selvakrishnan

    2010-10-01

    Full Text Available Job allocation process is one of the big issues in grid environment and it is one of the research areas in Grid Computing. Hence a new area of research is developed to design optimal methods. It focuses on new heuristic techniques that provide an optimal or near optimal solution for large grids. By learning grid resource scheduling and PSO (Particle Swarm Optimization algorithm, this proposed scheduler allocates an application to a host from a pool of available hosts and applications by selecting the best match. PSO-based algorithm is more effective in grid resources scheduling with the favor of reducing the executing time and completing time.

  4. Feature Selection and Parameter Optimization of Support Vector Machines Based on Modified Artificial Fish Swarm Algorithms

    Directory of Open Access Journals (Sweden)

    Kuan-Cheng Lin

    2015-01-01

    Full Text Available Rapid advances in information and communication technology have made ubiquitous computing and the Internet of Things popular and practicable. These applications create enormous volumes of data, which are available for analysis and classification as an aid to decision-making. Among the classification methods used to deal with big data, feature selection has proven particularly effective. One common approach involves searching through a subset of the features that are the most relevant to the topic or represent the most accurate description of the dataset. Unfortunately, searching through this kind of subset is a combinatorial problem that can be very time consuming. Meaheuristic algorithms are commonly used to facilitate the selection of features. The artificial fish swarm algorithm (AFSA employs the intelligence underlying fish swarming behavior as a means to overcome optimization of combinatorial problems. AFSA has proven highly successful in a diversity of applications; however, there remain shortcomings, such as the likelihood of falling into a local optimum and a lack of multiplicity. This study proposes a modified AFSA (MAFSA to improve feature selection and parameter optimization for support vector machine classifiers. Experiment results demonstrate the superiority of MAFSA in classification accuracy using subsets with fewer features for given UCI datasets, compared to the original FASA.

  5. Optimal clustering of MGs based on droop controller for improving reliability using a hybrid of harmony search and genetic algorithms.

    Science.gov (United States)

    Abedini, Mohammad; Moradi, Mohammad H; Hosseinian, S M

    2016-03-01

    This paper proposes a novel method to address reliability and technical problems of microgrids (MGs) based on designing a number of self-adequate autonomous sub-MGs via adopting MGs clustering thinking. In doing so, a multi-objective optimization problem is developed where power losses reduction, voltage profile improvement and reliability enhancement are considered as the objective functions. To solve the optimization problem a hybrid algorithm, named HS-GA, is provided, based on genetic and harmony search algorithms, and a load flow method is given to model different types of DGs as droop controller. The performance of the proposed method is evaluated in two case studies. The results provide support for the performance of the proposed method. PMID:26767800

  6. A Novel Rough Set Reduct Algorithm for Medical Domain Based on Bee Colony Optimization

    OpenAIRE

    Suguna, N.; k. Thanushkodi

    2010-01-01

    Feature selection refers to the problem of selecting relevant features which produce the most predictive outcome. In particular, feature selection task is involved in datasets containing huge number of features. Rough set theory has been one of the most successful methods used for feature selection. However, this method is still not able to find optimal subsets. This paper proposes a new feature selection method based on Rough set theory hybrid with Bee Colony Optimization (BCO) in an attempt...

  7. Energy transmission modes based on Tabu search and particle swarm hybrid optimization algorithm

    Institute of Scientific and Technical Information of China (English)

    LI xiang; CUI Ji-feng; QI Jian-xun; YANG Shang-dong

    2007-01-01

    In China, economic centers are far from energy storage bases, so it is significant to select a proper energy transferring mode to improve the efficiency of energy usage, To solve this problem, an optimal allocation model based on energy transfer mode was proposed after objective function for optimizing energy using efficiency Was established, and then, a new Tabu search and power transmission was gained.Based on the above discussion, some proposals were put forward for optimal allocation of energy transfer modes in China. By comparing other three traditional methodsthat are based on regional price differences. freight rates and annual cost witll the proposed method, the result indicates that the economic efficiency of the energy transfer Can be enhanced by 3.14%, 5.78% and 6.01%, respectively.

  8. BBLAWN: A combined use of best management practices and an optimization model based on a pseudo-genetic algorithm

    OpenAIRE

    Iglesias Rey, Pedro Luís; Martínez-Solano, F. Javier; Mora Melia, Daniel; MARTINEZ SOLANO, PEDRO DANIEL

    2014-01-01

    The paper presents a solution to the problem of the Battle of Background Leakage Assessment for Water Networks (BBLAWN) using a methodology that combines the use of Best Management Practices (BMPs) and an optimization model based on a Pseudo- Genetic Algorithm (PGA) as described in [1]. In a first stage, an analysis of marginal costs of pipes whose replacement would be potentially recommended was performed. Next, a network topological analysis to study the pipes that could potentiall...

  9. Enhanced Bee Colony Algorithm for Complex Optimization Problems

    OpenAIRE

    S.Suriya; R. Deepalakshmi; S.Suresh kannan; Dr.S.P.SHANTHARAJAH

    2012-01-01

    Optimization problems are considered to be one kind of NP hard problems. Usually heuristic approaches are found to provide solutions for NP hard problems. There are a plenty of heuristic algorithmsavailable to solve optimization problems namely: Ant Colony Optimization, Particle Swarm Optimization, Bee Colony Optimization, etc. The basic Bee Colony algorithm, a population based search algorithm, is analyzed to be a novel tool for complex optimization problems. The algorithm mimics the food fo...

  10. Powertrain Matching and Optimization of Dual-Motor Hybrid Driving System for Electric Vehicle Based on Quantum Genetic Intelligent Algorithm

    Directory of Open Access Journals (Sweden)

    Yong Wang

    2014-01-01

    Full Text Available In order to increase the driving range and improve the overall performance of all-electric vehicles, a new dual-motor hybrid driving system with two power sources was proposed. This system achieved torque-speed coupling between the two power sources and greatly improved the high performance working range of the motors; at the same time, continuously variable transmission (CVT was achieved to efficiently increase the driving range. The power system parameters were determined using the “global optimization method”; thus, the vehicle’s dynamics and economy were used as the optimization indexes. Based on preliminary matches, quantum genetic algorithm was introduced to optimize the matching in the dual-motor hybrid power system. Backward simulation was performed on the combined simulation platform of Matlab/Simulink and AVL-Cruise to optimize, simulate, and verify the system parameters of the transmission system. Results showed that quantum genetic algorithms exhibited good global optimization capability and convergence in dealing with multiobjective and multiparameter optimization. The dual-motor hybrid-driving system for electric cars satisfied the dynamic performance and economy requirements of design, efficiently increasing the driving range of the car, having high performance, and reducing energy consumption of 15.6% compared with the conventional electric vehicle with single-speed reducers.

  11. An extended particle swarm optimization algorithm based on coarse-grained and fine-grained criteria and its application

    Institute of Scientific and Technical Information of China (English)

    LI Xing-mei; ZHANG Li-hui; QI Jian-xun; ZHANG Su-fang

    2008-01-01

    In order to study the problem that particle swarm optimization (PSO) algorithm can easily trap into local mechanism when analyzing the high dimensional complex optimization problems, the optimization calculation using the information in the iterative process of more particles was analyzed and the optimal system of particle swarm algorithm was improved. The extended particle swarm optimization algorithm (EPSO) was proposed. The coarse-grained and free-grained criteria that can control the selection were given to ensure the convergence of the algorithm. The two criteria considered the parameter selection mechanism under the situation of random probability. By adopting MATLAB7.1, the extended particle swarm optimization algorithm was demonstrated in the resource leveling of power project scheduling. EPSO was compared with genetic algorithm (GA) and common PSO, the result indicates that the variance of the objective function of resource leveling is decreased by 7.9%, 18.2%, respectively, certifying thee effectiveness and stronger global convergence ability of the EPSO.

  12. Arc-based constrained ant colony optimisation algorithms for the optimal solution of hydropower reservoir operation problems

    Energy Technology Data Exchange (ETDEWEB)

    Moeini, R.; Afshar, M.H.

    2011-07-15

    Hydropower is currently the number one source of electricity production in the world. For the design and construction of such systems, mathematical modelling is often use for reservoir operations. As conventional methods present some shortcomings in solving reservoir operation problems, a new method is presented here. It consists in an arc-based formulation of hydropower reservoir operation problems which can be applied to ant colony optimization algorithms. This paper first described this formulation and then applied it to solve two hydropower reservoir operation problems. The results showed that this formulation can optimally solve large-scale hydropower reservoir operation problems while offering a clear definition of heuristic information.

  13. Combinatorial optimization theory and algorithms

    CERN Document Server

    Korte, Bernhard

    2002-01-01

    Combinatorial optimization is one of the youngest and most active areas of discrete mathematics, and is probably its driving force today. This book describes the most important ideas, theoretical results, and algorithms of this field. It is conceived as an advanced graduate text, and it can also be used as an up-to-date reference work for current research. The book includes the essential fundamentals of graph theory, linear and integer programming, and complexity theory. It covers classical topics in combinatorial optimization as well as very recent ones. The emphasis is on theoretical results and algorithms with provably good performance. Some applications and heuristics are mentioned, too.

  14. Image Watermarking Algorithm Based on Multiobjective Ant Colony Optimization and Singular Value Decomposition in Wavelet Domain

    Directory of Open Access Journals (Sweden)

    Khaled Loukhaoukha

    2013-01-01

    Full Text Available We present a new optimal watermarking scheme based on discrete wavelet transform (DWT and singular value decomposition (SVD using multiobjective ant colony optimization (MOACO. A binary watermark is decomposed using a singular value decomposition. Then, the singular values are embedded in a detailed subband of host image. The trade-off between watermark transparency and robustness is controlled by multiple scaling factors (MSFs instead of a single scaling factor (SSF. Determining the optimal values of the multiple scaling factors (MSFs is a difficult problem. However, a multiobjective ant colony optimization is used to determine these values. Experimental results show much improved performances of the proposed scheme in terms of transparency and robustness compared to other watermarking schemes. Furthermore, it does not suffer from the problem of high probability of false positive detection of the watermarks.

  15. Optimization of Consumed Power in Two Different DC Motors Coupled Based on Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Mehrdad Jafarboland

    2011-01-01

    Full Text Available A single DC motor can be substituted by two different couple DC motors in submarines. By this way, by varying the speed of submarine, the power of propellant and subsequently the mechanical power of these motors would vary. One important promlem in controlling the mechanical coupling of these motors is the power sharing between them. In the previous reports the mechanical power was shared between them in nonoptimized manner. In this paper an optimized cantroller is indroduced that optimize the efficiency of the system. The power sharing between these motors would vary according to their speed. The proposed controller is based on Genetic Algoritm and is able to share the mechanical power between the motors in an optimized manner at different speeds. The simutation results shows the well behavior of system and also the optimize power sharing.

  16. SVM-Based Synthetic Fingerprint Discrimination Algorithm and Quantitative Optimization Strategy

    Science.gov (United States)

    Chen, Suhang; Chang, Sheng; Huang, Qijun; He, Jin; Wang, Hao; Huang, Qiangui

    2014-01-01

    Synthetic fingerprints are a potential threat to automatic fingerprint identification systems (AFISs). In this paper, we propose an algorithm to discriminate synthetic fingerprints from real ones. First, four typical characteristic factors—the ridge distance features, global gray features, frequency feature and Harris Corner feature—are extracted. Then, a support vector machine (SVM) is used to distinguish synthetic fingerprints from real fingerprints. The experiments demonstrate that this method can achieve a recognition accuracy rate of over 98% for two discrete synthetic fingerprint databases as well as a mixed database. Furthermore, a performance factor that can evaluate the SVM's accuracy and efficiency is presented, and a quantitative optimization strategy is established for the first time. After the optimization of our synthetic fingerprint discrimination task, the polynomial kernel with a training sample proportion of 5% is the optimized value when the minimum accuracy requirement is 95%. The radial basis function (RBF) kernel with a training sample proportion of 15% is a more suitable choice when the minimum accuracy requirement is 98%. PMID:25347063

  17. ANFIS-based genetic algorithm for predicting the optimal sizing coefficient of photovoltaic supply systems

    Energy Technology Data Exchange (ETDEWEB)

    Mellit, A. [Medea Univ., Medea (Algeria). Inst. of Science Engineering, Dept. of Electronics

    2007-07-01

    Stand-alone photovoltaic (PV) power supply systems are regarded as reliable and economical sources of electricity in rural remote areas, particularly in developing countries. However, the sizing of stand-alone photovoltaic (PV) systems is an important part of the system design. Choosing the optimal number of solar cell panels and the size of the storage battery to be used for a certain application at a particular site is an important economical problem. In this paper, a genetic algorithm (GA) and an adaptive neuro-fuzzy inference scheme (ANFIS) were proposed as a means for determining the optimal size of PV system, particularly, in isolated areas. The GA-ANFIS model was shown to be suitable for modelling the optimal sizing parameters of PVS systems. The GA was used to determine the PV-array capacity and the storage capacity for 60 sites. From this database, 56 pairs relative to 56 sites were used for training the network. Four pairs were used for testing and validating the ANFIS model. A correlation of 99 per cent was achieved when complete unknown data parameters were presented to the model. The proposed technique provided more accurate results than the alternative artificial neural network (ANN) with GA. The advantage of this model was that it could estimate the PV-array area and the useful capacity of the battery from only geographical coordinates. Although the technique was applied and tested in Algeria, it can be generalized for any location in the world. 15 refs., 4 tabs., 8 figs.

  18. Optimization to the Culture Conditions for Phellinus Production with Regression Analysis and Gene-Set Based Genetic Algorithm.

    Science.gov (United States)

    Li, Zhongwei; Xin, Yuezhen; Wang, Xun; Sun, Beibei; Xia, Shengyu; Li, Hui; Zhu, Hu

    2016-01-01

    Phellinus is a kind of fungus and is known as one of the elemental components in drugs to avoid cancers. With the purpose of finding optimized culture conditions for Phellinus production in the laboratory, plenty of experiments focusing on single factor were operated and large scale of experimental data were generated. In this work, we use the data collected from experiments for regression analysis, and then a mathematical model of predicting Phellinus production is achieved. Subsequently, a gene-set based genetic algorithm is developed to optimize the values of parameters involved in culture conditions, including inoculum size, PH value, initial liquid volume, temperature, seed age, fermentation time, and rotation speed. These optimized values of the parameters have accordance with biological experimental results, which indicate that our method has a good predictability for culture conditions optimization. PMID:27610365

  19. Staged optimization algorithms based MAC dynamic bandwidth allocation for OFDMA-PON

    Science.gov (United States)

    Liu, Yafan; Qian, Chen; Cao, Bingyao; Dun, Han; Shi, Yan; Zou, Junni; Lin, Rujian; Wang, Min

    2016-06-01

    Orthogonal frequency division multiple access passive optical network (OFDMA-PON) has being considered as a promising solution for next generation PONs due to its high spectral efficiency and flexible bandwidth allocation scheme. In order to take full advantage of these merits of OFDMA-PON, a high-efficiency medium access control (MAC) dynamic bandwidth allocation (DBA) scheme is needed. In this paper, we propose two DBA algorithms which can act on two different stages of a resource allocation process. To achieve higher bandwidth utilization and ensure the equity of ONUs, we propose a DBA algorithm based on frame structure for the stage of physical layer mapping. Targeting the global quality of service (QoS) of OFDMA-PON, we propose a full-range DBA algorithm with service level agreement (SLA) and class of service (CoS) for the stage of bandwidth allocation arbitration. The performance of the proposed MAC DBA scheme containing these two algorithms is evaluated using numerical simulations. Simulations of a 15 Gbps network with 1024 sub-carriers and 32 ONUs demonstrate the maximum network throughput of 14.87 Gbps and the maximum packet delay of 1.45 ms for the highest priority CoS under high load condition.

  20. Flow Based Algorithm

    Directory of Open Access Journals (Sweden)

    T. Karpagam

    2012-01-01

    Full Text Available Problem statement: Network topology design problems find application in several real life scenario. Approach: Most designs in the past either optimize for a single criterion like shortest or cost minimization or maximum flow. Results: This study discussed about solving a multi objective network topology design problem for a realistic traffic model specifically in the pipeline transportation. Here flow based algorithm focusing to transport liquid goods with maximum capacity with shortest distance, this algorithm developed with the sense of basic pert and critical path method. Conclusion/Recommendations: This flow based algorithm helps to give optimal result for transporting maximum capacity with minimum cost. It could be used in the juice factory, milk industry and its best alternate for the vehicle routing problem.

  1. Optimized Ant Colony Algorithm by Local Pheromone Update

    OpenAIRE

    Hui Yu

    2013-01-01

    Ant colony algorithm, a heuristic simulated algorithm, provides better solutions for non-convex, non-linear and discontinuous optimization problems. For ant colony algorithm, it is frequently to be trapped into local optimum, which might lead to stagnation. This article presents the  city-select strategy, local pheromone update strategy, optimum solution prediction strategy and local optimization strategy to optimize ant colony algorithm, provides ant colony algorithm based on local pheromone...

  2. An Approach In Optimization Of Ad-Hoc Routing Algorithms

    Directory of Open Access Journals (Sweden)

    Sarvesh Kumar Sharma

    2012-06-01

    Full Text Available In this paper different optimization of Ad-hoc routing algorithm is surveyed and a new method using training based optimization algorithm for reducing the complexity of routing algorithms is suggested. A binary matrix is assigned to each node in the network and gets updated after each data transfer using the protocols. The use of optimization algorithm in routing algorithm can reduce the complexity of routing to the least amount possible.

  3. AN OPTIMIZED WEIGHT BASED CLUSTERING ALGORITHM IN HETEROGENEOUS WIRELESS SENSOR NETWORKS

    Directory of Open Access Journals (Sweden)

    Babu.N.V

    2012-12-01

    Full Text Available The last few years have seen an increased interest in the potential use of wireless sensor networks (WSNs in various fields like disaster management, battle field surveillance, and border security surveillance. In such applications, a large number of sensor nodes are deployed, which are often unattended and work autonomously. The process of dividing the network into interconnected substructures is called clustering and the interconnected substructures are called clusters. The cluster head (CH of each cluster act as a coordinator within the substructure. Each CH acts as a temporary base station within its zone or cluster. It also communicates with other CHs. Clustering is a key technique used to extend the lifetime of a sensor network by reducing energy consumption. It can also increase network scalability. Researchers in all fields of wireless sensor network believe that nodes are homogeneous, but some nodes may be of different characteristics to prolong the lifetime of a WSN and its reliability. We have proposed an algorithm for better cluster head selection based on weights for different parameter that influence on energy consumption which includes distance from base station as a new parameter to reduce number of transmissions and reduce energy consumption by sensor nodes. Finally proposed algorithm compared with the WCA, IWCA algorithm in terms of number of clusters and energy consumption.

  4. Optimized design on condensing tubes high-speed TIG welding technology magnetic control based on genetic algorithm

    Science.gov (United States)

    Lu, Lin; Chang, Yunlong; Li, Yingmin; Lu, Ming

    2013-05-01

    An orthogonal experiment was conducted by the means of multivariate nonlinear regression equation to adjust the influence of external transverse magnetic field and Ar flow rate on welding quality in the process of welding condenser pipe by high-speed argon tungsten-arc welding (TIG for short). The magnetic induction and flow rate of Ar gas were used as optimum variables, and tensile strength of weld was set to objective function on the base of genetic algorithm theory, and then an optimal design was conducted. According to the request of physical production, the optimum variables were restrained. The genetic algorithm in the MATLAB was used for computing. A comparison between optimum results and experiment parameters was made. The results showed that the optimum technologic parameters could be chosen by the means of genetic algorithm with the conditions of excessive optimum variables in the process of high-speed welding. And optimum technologic parameters of welding coincided with experiment results.

  5. A Study of the Optimal Allocation of Shunt Capacitor Based on Modified Loss Sensitivity Algorithm

    Directory of Open Access Journals (Sweden)

    Warid Sayel Warid

    2010-06-01

    Full Text Available Minimization of active power losses is one of the essential aims for any electric utility, due to its importance in improvement of system properties towards minimum production cost and to support increase load requirement. In this paper we have studied the possibility of reducing the value of real power losses for (IEEE-14- Bus bar global system transmission lines by choosing the best location to install shunt capacitor depending on new algorithm for calculate the optimal allocation, which considering the value of real power losses derivative with injection reactive power as an indicator of the ability of reducing losses at load buses. The results show the validity of this method for application in electric power transmission lines.

  6. A Parallel Biological Optimization Algorithm to Solve the Unbalanced Assignment Problem Based on DNA Molecular Computing

    Directory of Open Access Journals (Sweden)

    Zhaocai Wang

    2015-10-01

    Full Text Available The unbalanced assignment problem (UAP is to optimally resolve the problem of assigning n jobs to m individuals (m < n, such that minimum cost or maximum profit obtained. It is a vitally important Non-deterministic Polynomial (NP complete problem in operation management and applied mathematics, having numerous real life applications. In this paper, we present a new parallel DNA algorithm for solving the unbalanced assignment problem using DNA molecular operations. We reasonably design flexible-length DNA strands representing different jobs and individuals, take appropriate steps, and get the solutions of the UAP in the proper length range and O(mn time. We extend the application of DNA molecular operations and simultaneity to simplify the complexity of the computation.

  7. A novel bee swarm optimization algorithm for numerical function optimization

    Science.gov (United States)

    Akbari, Reza; Mohammadi, Alireza; Ziarati, Koorush

    2010-10-01

    The optimization algorithms which are inspired from intelligent behavior of honey bees are among the most recently introduced population based techniques. In this paper, a novel algorithm called bee swarm optimization, or BSO, and its two extensions for improving its performance are presented. The BSO is a population based optimization technique which is inspired from foraging behavior of honey bees. The proposed approach provides different patterns which are used by the bees to adjust their flying trajectories. As the first extension, the BSO algorithm introduces different approaches such as repulsion factor and penalizing fitness (RP) to mitigate the stagnation problem. Second, to maintain efficiently the balance between exploration and exploitation, time-varying weights (TVW) are introduced into the BSO algorithm. The proposed algorithm (BSO) and its two extensions (BSO-RP and BSO-RPTVW) are compared with existing algorithms which are based on intelligent behavior of honey bees, on a set of well known numerical test functions. The experimental results show that the BSO algorithms are effective and robust; produce excellent results, and outperform other algorithms investigated in this consideration.

  8. Loading pattern optimization using ant colony algorithm

    International Nuclear Information System (INIS)

    Electricite de France (EDF) operates 58 nuclear power plants (NPP), of the Pressurized Water Reactor type. The loading pattern optimization of these NPP is currently done by EDF expert engineers. Within this framework, EDF R and D has developed automatic optimization tools that assist the experts. LOOP is an industrial tool, developed by EDF R and D and based on a simulated annealing algorithm. In order to improve the results of such automatic tools, new optimization methods have to be tested. Ant Colony Optimization (ACO) algorithms are recent methods that have given very good results on combinatorial optimization problems. In order to evaluate the performance of such methods on loading pattern optimization, direct comparisons between LOOP and a mock-up based on the Max-Min Ant System algorithm (a particular variant of ACO algorithms) were made on realistic test-cases. It is shown that the results obtained by the ACO mock-up are very similar to those of LOOP. Future research will consist in improving these encouraging results by using parallelization and by hybridizing the ACO algorithm with local search procedures. (author)

  9. Loading pattern optimization using ant colony algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Hoareau, Fabrice [EDF R and D, Clamart (France)

    2008-07-01

    Electricite de France (EDF) operates 58 nuclear power plants (NPP), of the Pressurized Water Reactor type. The loading pattern optimization of these NPP is currently done by EDF expert engineers. Within this framework, EDF R and D has developed automatic optimization tools that assist the experts. LOOP is an industrial tool, developed by EDF R and D and based on a simulated annealing algorithm. In order to improve the results of such automatic tools, new optimization methods have to be tested. Ant Colony Optimization (ACO) algorithms are recent methods that have given very good results on combinatorial optimization problems. In order to evaluate the performance of such methods on loading pattern optimization, direct comparisons between LOOP and a mock-up based on the Max-Min Ant System algorithm (a particular variant of ACO algorithms) were made on realistic test-cases. It is shown that the results obtained by the ACO mock-up are very similar to those of LOOP. Future research will consist in improving these encouraging results by using parallelization and by hybridizing the ACO algorithm with local search procedures. (author)

  10. NUMERICAL SIMULATION ALGORITHM FOR RELIABILITY ANALYSIS OF COMPLEX STRUCTURAL SYSTEM BASED ON INTELLIGENT OPTIMIZATION

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    An efficient importance sampling algorithm is presented to analyze reliability of complex structural system with multiple failure modes and fuzzy-random uncertainties in basic variables and failure modes. In order to improve the sampling efficiency, the simulated annealing algorithm is adopted to optimize the density center of the importance sampling for each failure mode, and results that the more significant contribution the points make to fuzzy failure probability, the higher occurrence possibility the points are sampled. For the system with multiple fuzzy failure modes, a weighted and mixed importance sampling function is constructed. The contribution of each fuzzy failure mode to the system failure probability is represented by the appropriate factors, and the efficiency of sampling is improved furthermore. The variances and the coefficients of variation are derived for the failure probability estimations. Two examples are introduced to illustrate the rationality of the present method. Comparing with the direct Monte-Carlo method, the improved efficiency and the precision of the method are verified by the examples.

  11. Modified evolutionary algorithm for global optimization

    Institute of Scientific and Technical Information of China (English)

    郭崇慧; 陆玉昌; 唐焕文

    2004-01-01

    A modification of evolutionary programming or evolution strategies for n-dimensional global optimization is proposed. Based on the ergodicity and inherent-randomness of chaos, the main characteristic of the new algorithm which includes two phases is that chaotic behavior is exploited to conduct a rough search of the problem space in order to find the promising individuals in Phase Ⅰ. Adjustment strategy of step-length and intensive searches in Phase Ⅱ are employed.The population sequences generated by the algorithm asymptotically converge to global optimal solutions with probability one. The proposed algorithm is applied to several typical test problems. Numerical results illustrate that this algorithm can more efficiently solve complex global optimization problems than evolutionary programming and evolution strategies in most cases.

  12. An optimized item-based collaborative filtering recommendation algorithm based on item genre prediction

    Science.gov (United States)

    Zhang, De-Jia

    2009-07-01

    With the fast development of Internet, many systems have emerged in e-commerce applications to support the product recommendation. Collaborative filtering is one of the most promising techniques in recommender systems, providing personalized recommendations to users based on their previously expressed preferences in the form of ratings and those of other similar users. In practice, with the adding of user and item scales, user-item ratings are becoming extremely sparsity and recommender systems utilizing traditional collaborative filtering are facing serious challenges. To address the issue, this paper presents an approach to compute item genre similarity, through mapping each item with a corresponding descriptive genre, and computing similarity between genres as similarity, then make basic predictions according to those similarities to lower sparsity of the user-item ratings. After that, item-based collaborative filtering steps are taken to generate predictions. Compared with previous methods, the presented collaborative filtering employs the item genre similarity can alleviate the sparsity issue in the recommender systems, and can improve accuracy of recommendation.

  13. An optimization algorithm for simulation-based planning of low-income housing projects

    Directory of Open Access Journals (Sweden)

    Mohamed M. Marzouk

    2010-10-01

    Full Text Available Construction of low-income housing projects is a replicated process and is associated with uncertainties that arise from the unavailability of resources. Government agencies and/or contractors have to select a construction system that meets low-income housing projects constraints including project conditions, technical, financial and time constraints. This research presents a framework, using computer simulation, which aids government authorities and contractors in the planning of low-income housing projects. The proposed framework estimates the time and cost required for the construction of low-income housing using pre-cast hollow core with hollow blocks bearing walls. Five main components constitute the proposed framework: a network builder module, a construction alternative selection module, a simulation module, an optimization module and a reporting module. An optimization module utilizing a genetic algorithm enables the defining of different options and ranges of parameters associated with low-income housing projects that influence the duration and total cost of the pre-cast hollow core with hollow blocks bearing walls method. A computer prototype, named LIHouse_Sim, was developed in MS Visual Basic 6.0 as proof of concept for the proposed framework. A numerical example is presented to demonstrate the use of the developed framework and to illustrate its essential features.

  14. Structure Design of the 3-D Braided Composite Based on a Hybrid Optimization Algorithm

    Science.gov (United States)

    Zhang, Ke

    Three-dimensional braided composite has the better designable characteristic. Whereas wide application of hollow-rectangular-section three-dimensional braided composite in engineering, optimization design of the three-dimensional braided composite made by 4-step method were introduced. Firstly, the stiffness and damping characteristic analysis of the composite is presented. Then, the mathematical models for structure design of the three-dimensional braided composite were established. The objective functions are based on the specific damping capacity and stiffness of the composite. The design variables are the braiding parameters of the composites and sectional geometrical size of the composite. The optimization problem is solved by using ant colony optimization (ACO), contenting the determinate restriction. The results of numeral examples show that the better damping and stiffness characteristic could be obtained. The method proposed here is useful for the structure design of the kind of member and its engineering application.

  15. A novel hybrid approach based on Particle Swarm Optimization and Ant Colony Algorithm to forecast energy demand of Turkey

    International Nuclear Information System (INIS)

    Highlights: ► PSO and ACO algorithms are hybridized for forecasting energy demands of Turkey. ► Linear and quadratic forms are developed to meet the fluctuations of indicators. ► GDP, population, export and import have significant impacts on energy demand. ► Quadratic form provides better fit solution than linear form. ► Proposed approach gives lower estimation error than ACO and PSO, separately. - Abstract: This paper proposes a new hybrid method (HAP) for estimating energy demand of Turkey using Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO). Proposed energy demand model (HAPE) is the first model which integrates two mentioned meta-heuristic techniques. While, PSO, developed for solving continuous optimization problems, is a population based stochastic technique; ACO, simulating behaviors between nest and food source of real ants, is generally used for discrete optimizations. Hybrid method based PSO and ACO is developed to estimate energy demand using gross domestic product (GDP), population, import and export. HAPE is developed in two forms which are linear (HAPEL) and quadratic (HAPEQ). The future energy demand is estimated under different scenarios. In order to show the accuracy of the algorithm, a comparison is made with ACO and PSO which are developed for the same problem. According to obtained results, relative estimation errors of the HAPE model are the lowest of them and quadratic form (HAPEQ) provides better-fit solutions due to fluctuations of the socio-economic indicators.

  16. Optimization-Based Artificial Bee Colony Algorithm for Data Collection in Large-Scale Mobile Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Yinggao Yue

    2016-01-01

    Full Text Available Data collection is a fundamental operation in various mobile wireless sensor networks (MWSN applications. The energy of nodes around the Sink can be untimely depleted owing to the fact that sensor nodes must transmit vast amounts of data, readily forming a bottleneck in energy consumption; mobile wireless sensor networks have been designed to address this issue. In this study, we focused on a large-scale and intensive MWSN which allows a certain amount of data latency by investigating mobile Sink balance from three aspects: data collection maximization, mobile path length minimization, and network reliability optimization. We also derived a corresponding formula to represent the MWSN and proved that it represents an NP-hard problem. Traditional data collection methods only focus on increasing the amount data collection or reducing the overall network energy consumption, which is why we designed the proposed heuristic algorithm to jointly consider cluster head selection, the routing path from ordinary nodes to the cluster head node, and mobile Sink path planning optimization. The proposed data collection algorithm for mobile Sinks is, in effect, based on artificial bee colony. Simulation results show that, in comparison with other algorithms, the proposed algorithm can effectively reduce data transmission, save energy, improve network data collection efficiency and reliability, and extend the network lifetime.

  17. Medium optimization to improve astaxanthin production of Xanthophyllomyces dendrorhous mutant W6-8 based on genetic algorithms

    Institute of Scientific and Technical Information of China (English)

    WangWenjun; YuLongjiang; HePu; ZhouPengpeng

    2004-01-01

    Genetic algorithms (GA) based on the principle of mimicing Darwinian evolution and survival of the fittest in a natural environment was used to optimize the medium for astaxanthin production by the mutant strain W6-8 of Xantho-phyllomyces dendrorhous. The 50 concentration levels of 6 medium components were optimized within 50 experiments (full experimental plan: 506 experiments). The results showed that GA could be applied in the medium optimization and better results were obtained. By employing optimized medium components (glucose 39.8 g l-1, yeast extract 4.08 g l-1,(NH4)2SO4 7.36 g l-1, MgSO4 2 g l-1, K2HPO4 2.04 g l-1 and KH2PO4 3.48 g l-1), the highest astaxanthin production was 9.855 mg l-1, approximately 31% higher than that under the initial conditions, and was approximately 15.46% higher than that by orthogonal array but only slightly higher than that by response surface methodology. In the sequent scale-up experiments, the astaxanthin yield was obtained approximately 14.753 mg l-1, employing the optimal medium. The results indicated that GA, as an euiicient method for medium optimization, was superior to other optimal means such as orthogonal array.

  18. Constrained Optimization Based on Hybrid Evolutionary Algorithm and Adaptive Constraint-Handling Technique

    DEFF Research Database (Denmark)

    Wang, Yong; Cai, Zixing; Zhou, Yuren;

    2009-01-01

    mutation operators to generate the offspring population. Additionally, the adaptive constraint-handling technique consists of three main situations. In detail, at each situation, one constraint-handling mechanism is designed based on current population state. Experiments on 13 benchmark test functions...... and four well-known constrained design problems verify the effectiveness and efficiency of the proposed method. The experimental results show that integrating the hybrid evolutionary algorithm with the adaptive constraint-handling technique is beneficial, and the proposed method achieves competitive...

  19. Synergetic Optimization of Missile Shapes for Aerodynamic and Radar Cross-Section Performance Based on Multi- objective Evolutionary Algorithm

    Institute of Scientific and Technical Information of China (English)

    刘洪

    2004-01-01

    A multiple-objective evolutionary algorithm (MOEA) with a new Decision Making (DM) scheme for MOD of conceptual missile shapes was presented, which is contrived to determine suitable tradeoffs from Pareto optimal set using interactive preference articulation. There are two objective functions, to maximize ratio of lift to drag and to minimize radar cross-section (RCS) value. 3D computational electromagnetic solver was used to evaluate RCS, electromagnetic performance. 3D Navier-Stokes flow solver was adopted to evaluate aerodynamic performance. A flight mechanics solver was used to analyze the stability of the missile. Based on the MOEA, a synergetic optimization of missile shapes for aerodynamic and radar cross-section performance is completed. The results show that the proposed approach can be used in more complex optimization case of flight vehicles.

  20. Algorithms for worst-case tolerance optimization

    DEFF Research Database (Denmark)

    Schjær-Jacobsen, Hans; Madsen, Kaj

    1979-01-01

    New algorithms are presented for the solution of optimum tolerance assignment problems. The problems considered are defined mathematically as a worst-case problem (WCP), a fixed tolerance problem (FTP), and a variable tolerance problem (VTP). The basic optimization problem without tolerances...... is denoted the zero tolerance problem (ZTP). For solution of the WCP we suggest application of interval arithmetic and also alternative methods. For solution of the FTP an algorithm is suggested which is conceptually similar to algorithms previously developed by the authors for the ZTP. Finally, the VTP...... is solved by a double-iterative algorithm in which the inner iteration is performed by the FTP- algorithm. The application of the algorithm is demonstrated by means of relatively simple numerical examples. Basic properties, such as convergence properties, are displayed based on the examples....

  1. COMPARATIVE ANALYSIS OF EV-MOGA AND GODLIKE MULTIOBJECTIVE EVOLUTIONARY ALGORITHMS FOR RISK BASED OPTIMAL POWER SCHEDULING OF A VIRTUAL POWER PLANT

    Directory of Open Access Journals (Sweden)

    Mahesh S. Narkhede

    2015-01-01

    Full Text Available An attempt has been made in this article to compare the performances of two multiobjective evolutionary algorithms namely ev-MOGA and GODLIKE. The performances of both are evaluated on risk based optimal power scheduling of virtual power plant. The risk based scheduling is proposed as a conflicting bi objective optimization problem with increased number of durations of day. Both the algorithms are elaborated in detail. Results based on the performance analysis are depicted at the end.

  2. Effective hybrid teaching-learning-based optimization algorithm for balancing two-sided assembly lines with multiple constraints

    Science.gov (United States)

    Tang, Qiuhua; Li, Zixiang; Zhang, Liping; Floudas, C. A.; Cao, Xiaojun

    2015-09-01

    Due to the NP-hardness of the two-sided assembly line balancing (TALB) problem, multiple constraints existing in real applications are less studied, especially when one task is involved with several constraints. In this paper, an effective hybrid algorithm is proposed to address the TALB problem with multiple constraints (TALB-MC). Considering the discrete attribute of TALB-MC and the continuous attribute of the standard teaching-learning-based optimization (TLBO) algorithm, the random-keys method is hired in task permutation representation, for the purpose of bridging the gap between them. Subsequently, a special mechanism for handling multiple constraints is developed. In the mechanism, the directions constraint of each task is ensured by the direction check and adjustment. The zoning constraints and the synchronism constraints are satisfied by teasing out the hidden correlations among constraints. The positional constraint is allowed to be violated to some extent in decoding and punished in cost function. Finally, with the TLBO seeking for the global optimum, the variable neighborhood search (VNS) is further hybridized to extend the local search space. The experimental results show that the proposed hybrid algorithm outperforms the late acceptance hill-climbing algorithm (LAHC) for TALB-MC in most cases, especially for large-size problems with multiple constraints, and demonstrates well balance between the exploration and the exploitation. This research proposes an effective and efficient algorithm for solving TALB-MC problem by hybridizing the TLBO and VNS.

  3. Particle swarm optimization algorithm based parameters estimation and control of epileptiform spikes in a neural mass model

    Science.gov (United States)

    Shan, Bonan; Wang, Jiang; Deng, Bin; Wei, Xile; Yu, Haitao; Zhang, Zhen; Li, Huiyan

    2016-07-01

    This paper proposes an epilepsy detection and closed-loop control strategy based on Particle Swarm Optimization (PSO) algorithm. The proposed strategy can effectively suppress the epileptic spikes in neural mass models, where the epileptiform spikes are recognized as the biomarkers of transitions from the normal (interictal) activity to the seizure (ictal) activity. In addition, the PSO algorithm shows capabilities of accurate estimation for the time evolution of key model parameters and practical detection for all the epileptic spikes. The estimation effects of unmeasurable parameters are improved significantly compared with unscented Kalman filter. When the estimated excitatory-inhibitory ratio exceeds a threshold value, the epileptiform spikes can be inhibited immediately by adopting the proportion-integration controller. Besides, numerical simulations are carried out to illustrate the effectiveness of the proposed method as well as the potential value for the model-based early seizure detection and closed-loop control treatment design.

  4. Multi-objective genetic algorithms based structural optimization and experimental investigation of the planet carrier in wind turbine gearbox

    Science.gov (United States)

    Yi, Pengxing; Dong, Lijian; Shi, Tielin

    2014-12-01

    To improve the dynamic performance and reduce the weight of the planet carrier in wind turbine gearbox, a multi-objective optimization method, which is driven by the maximum deformation, the maximum stress and the minimum mass of the studied part, is proposed by combining the response surface method and genetic algorithms in this paper. Firstly, the design points' distribution for the design variables of the planet carrier is established with the central composite design (CCD) method. Then, based on the computing results of finite element analysis (FEA), the response surface analysis is conducted to find out the proper sets of design variable values. And a multi-objective genetic algorithm (MOGA) is applied to determine the direction of optimization. As well, this method is applied to design and optimize the planet carrier in a 1.5MW wind turbine gearbox, the results of which are validated by an experimental modal test. Compared with the original design, the mass and the stress of the optimized planet carrier are respectively reduced by 9.3% and 40%. Consequently, the cost of planet carrier is greatly reduced and its stability is also improved.

  5. Research on a Distribution Center Location Model Based on a Particle Swarm Optimization Algorithm

    Institute of Scientific and Technical Information of China (English)

    WANG Fei; HU Xin-bu; JIA Tao

    2009-01-01

    Logistics is supposed to be the important source of profits for the enterprises besides reducing material consumption and improving labor productivity.Transportation costs,distribution center construction costs,ordering costs,safe inventory costs and inventory holding costs are the important parts of the total logistics costs.In this paper,based on the research results of LMRP( location model of risk pooling) location with fixed construction cost,the LMRPVCC (location model of risk pooling based on variable construction cost) will be introduced.Applying particle swarm optimization to several computational instances,the authors find the suboptimum solution of the model.

  6. Species co-evolutionary algorithm: a novel evolutionary algorithm based on the ecology and environments for optimization

    DEFF Research Database (Denmark)

    Li, Wuzhao; Wang, Lei; Cai, Xingjuan;

    2015-01-01

    In classic evolutionary algorithms (EAs), solutions communicate each other in a very simple way so the recombination operator design is simple, which is easy in algorithms’ implementation. However, it is not in accord with nature world. In nature, the species have various kinds of relationships a...

  7. Genetic Algorithm for Optimization: Preprocessor and Algorithm

    Science.gov (United States)

    Sen, S. K.; Shaykhian, Gholam A.

    2006-01-01

    Genetic algorithm (GA) inspired by Darwin's theory of evolution and employed to solve optimization problems - unconstrained or constrained - uses an evolutionary process. A GA has several parameters such the population size, search space, crossover and mutation probabilities, and fitness criterion. These parameters are not universally known/determined a priori for all problems. Depending on the problem at hand, these parameters need to be decided such that the resulting GA performs the best. We present here a preprocessor that achieves just that, i.e., it determines, for a specified problem, the foregoing parameters so that the consequent GA is a best for the problem. We stress also the need for such a preprocessor both for quality (error) and for cost (complexity) to produce the solution. The preprocessor includes, as its first step, making use of all the information such as that of nature/character of the function/system, search space, physical/laboratory experimentation (if already done/available), and the physical environment. It also includes the information that can be generated through any means - deterministic/nondeterministic/graphics. Instead of attempting a solution of the problem straightway through a GA without having/using the information/knowledge of the character of the system, we would do consciously a much better job of producing a solution by using the information generated/created in the very first step of the preprocessor. We, therefore, unstintingly advocate the use of a preprocessor to solve a real-world optimization problem including NP-complete ones before using the statistically most appropriate GA. We also include such a GA for unconstrained function optimization problems.

  8. FACE RECOGNITION BASED ON CUCKOO SEARCH ALGORITHM

    OpenAIRE

    VIPINKUMAR TIWARI

    2012-01-01

    Feature Selection is a optimization technique used in face recognition technology. Feature selection removes the irrelevant, noisy and redundant data thus leading to the more accurate recognition of face from the database.Cuckko Algorithm is one of the recent optimization algorithm in the league of nature based algorithm. Its optimization results are better than the PSO and ACO optimization algorithms. The proposal of applying the Cuckoo algorithm for feature selection in the process of face ...

  9. A new optimization algorithm based on a combination of particle swarm optimization, convergence and divergence operators for single-objective and multi-objective problems

    Science.gov (United States)

    Mahmoodabadi, M. J.; Bagheri, A.; Nariman-zadeh, N.; Jamali, A.

    2012-10-01

    Particle swarm optimization (PSO) is a randomized and population-based optimization method that was inspired by the flocking behaviour of birds and human social interactions. In this work, multi-objective PSO is modified in two stages. In the first stage, PSO is combined with convergence and divergence operators. Here, this method is named CDPSO. In the second stage, to produce a set of Pareto optimal solutions which has good convergence, diversity and distribution, two mechanisms are used. In the first mechanism, a new leader selection method is defined, which uses the periodic iteration and the concept of the particle's neighbour number. This method is named periodic multi-objective algorithm. In the second mechanism, an adaptive elimination method is employed to limit the number of non-dominated solutions in the archive, which has influences on computational time, convergence and diversity of solution. Single-objective results show that CDPSO performs very well on the complex test functions in terms of solution accuracy and convergence speed. Furthermore, some benchmark functions are used to evaluate the performance of periodic multi-objective CDPSO. This analysis demonstrates that the proposed algorithm operates better in three metrics through comparison with three well-known elitist multi-objective evolutionary algorithms. Finally, the algorithm is used for Pareto optimal design of a two-degree of freedom vehicle vibration model. The conflicting objective functions are sprung mass acceleration and relative displacement between sprung mass and tyre. The feasibility and efficiency of periodic multi-objective CDPSO are assessed in comparison with multi-objective modified NSGAII.

  10. A data mining approach to optimize pellets manufacturing process based on a decision tree algorithm.

    Science.gov (United States)

    Ronowicz, Joanna; Thommes, Markus; Kleinebudde, Peter; Krysiński, Jerzy

    2015-06-20

    The present study is focused on the thorough analysis of cause-effect relationships between pellet formulation characteristics (pellet composition as well as process parameters) and the selected quality attribute of the final product. The shape using the aspect ratio value expressed the quality of pellets. A data matrix for chemometric analysis consisted of 224 pellet formulations performed by means of eight different active pharmaceutical ingredients and several various excipients, using different extrusion/spheronization process conditions. The data set contained 14 input variables (both formulation and process variables) and one output variable (pellet aspect ratio). A tree regression algorithm consistent with the Quality by Design concept was applied to obtain deeper understanding and knowledge of formulation and process parameters affecting the final pellet sphericity. The clear interpretable set of decision rules were generated. The spehronization speed, spheronization time, number of holes and water content of extrudate have been recognized as the key factors influencing pellet aspect ratio. The most spherical pellets were achieved by using a large number of holes during extrusion, a high spheronizer speed and longer time of spheronization. The described data mining approach enhances knowledge about pelletization process and simultaneously facilitates searching for the optimal process conditions which are necessary to achieve ideal spherical pellets, resulting in good flow characteristics. This data mining approach can be taken into consideration by industrial formulation scientists to support rational decision making in the field of pellets technology. PMID:25835791

  11. A short-term load forecasting model of natural gas based on optimized genetic algorithm and improved BP neural network

    International Nuclear Information System (INIS)

    Highlights: • A detailed data processing will make more accurate results prediction. • Taking a full account of more load factors to improve the prediction precision. • Improved BP network obtains higher learning convergence. • Genetic algorithm optimized by chaotic cat map enhances the global search ability. • The combined GA–BP model improved by modified additional momentum factor is superior to others. - Abstract: This paper proposes an appropriate combinational approach which is based on improved BP neural network for short-term gas load forecasting, and the network is optimized by the real-coded genetic algorithm. Firstly, several kinds of modifications are carried out on the standard neural network to accelerate the convergence speed of network, including improved additional momentum factor, improved self-adaptive learning rate and improved momentum and self-adaptive learning rate. Then, it is available to use the global search capability of optimized genetic algorithm to determine the initial weights and thresholds of BP neural network to avoid being trapped in local minima. The ability of GA is enhanced by cat chaotic mapping. In light of the characteristic of natural gas load for Shanghai, a series of data preprocessing methods are adopted and more comprehensive load factors are taken into account to improve the prediction accuracy. Such improvements facilitate forecasting efficiency and exert maximum performance of the model. As a result, the integration model improved by modified additional momentum factor gets more ideal solutions for short-term gas load forecasting, through analyses and comparisons of the above several different combinational algorithms

  12. Optimal Detection Range of RFID Tag for RFID-based Positioning System Using the k-NN Algorithm

    Directory of Open Access Journals (Sweden)

    Joon Heo

    2009-06-01

    Full Text Available Positioning technology to track a moving object is an important and essential component of ubiquitous computing environments and applications. An RFID-based positioning system using the k-nearest neighbor (k-NN algorithm can determine the position of a moving reader from observed reference data. In this study, the optimal detection range of an RFID-based positioning system was determined on the principle that tag spacing can be derived from the detection range. It was assumed that reference tags without signal strength information are regularly distributed in 1-, 2- and 3-dimensional spaces. The optimal detection range was determined, through analytical and numerical approaches, to be 125% of the tag-spacing distance in 1-dimensional space. Through numerical approaches, the range was 134% in 2-dimensional space, 143% in 3-dimensional space.

  13. Land Surface Model and Particle Swarm Optimization Algorithm Based on the Model-Optimization Method for Improving Soil Moisture Simulation in a Semi-Arid Region.

    Science.gov (United States)

    Yang, Qidong; Zuo, Hongchao; Li, Weidong

    2016-01-01

    Improving the capability of land-surface process models to simulate soil moisture assists in better understanding the atmosphere-land interaction. In semi-arid regions, due to limited near-surface observational data and large errors in large-scale parameters obtained by the remote sensing method, there exist uncertainties in land surface parameters, which can cause large offsets between the simulated results of land-surface process models and the observational data for the soil moisture. In this study, observational data from the Semi-Arid Climate Observatory and Laboratory (SACOL) station in the semi-arid loess plateau of China were divided into three datasets: summer, autumn, and summer-autumn. By combing the particle swarm optimization (PSO) algorithm and the land-surface process model SHAW (Simultaneous Heat and Water), the soil and vegetation parameters that are related to the soil moisture but difficult to obtain by observations are optimized using three datasets. On this basis, the SHAW model was run with the optimized parameters to simulate the characteristics of the land-surface process in the semi-arid loess plateau. Simultaneously, the default SHAW model was run with the same atmospheric forcing as a comparison test. Simulation results revealed the following: parameters optimized by the particle swarm optimization algorithm in all simulation tests improved simulations of the soil moisture and latent heat flux; differences between simulated results and observational data are clearly reduced, but simulation tests involving the adoption of optimized parameters cannot simultaneously improve the simulation results for the net radiation, sensible heat flux, and soil temperature. Optimized soil and vegetation parameters based on different datasets have the same order of magnitude but are not identical; soil parameters only vary to a small degree, but the variation range of vegetation parameters is large. PMID:26991786

  14. FIDER: A Force-Balance-Based Interconnect Delay Driven Re-Synthesis Algorithm for Data-Path Optimization After Floorplan

    Institute of Scientific and Technical Information of China (English)

    WANG Yunfeng; BIAN Jinian; HONG Xianlong; ZHOU Qiang; WU Qiang

    2007-01-01

    As the feature size of integrated circuits is reduced to the deep sub-micron level or the nanometer level, the interconnect delay is becoming more and more important in determining the total delay of a circuit. Re-synthesis after floorptan is expected to be very helpful for reducing the interconnect delay of a circuit. In this paper,a force-balance-based re-synthesis algorithm for interconnect delay o ptimization after floorplan is proposed. The algorithm optimizes the inter connect delay by changing the operation scheduling and the functional unit allocation andbinding. With this method the number and positions of all functional units are not changed, but some operations are allocated or bound to different units. Preliminary experimental results show that the interconnect wire delays are reduced efficiently without destroying the floorplan performance.

  15. Genetic algorithm based optimal control of smart composite shell structures under mechanical loading and thermal gradient

    International Nuclear Information System (INIS)

    In the present paper an improved genetic algorithm (GA) based linear quadratic regulator (LQR) control scheme has been proposed for active vibration control of smart fiber reinforced polymer (FRP) composite shell structures under combined mechanical and thermal loading. A layered shell finite element formulation has been done to obtain the electro-thermo-mechanical response of fiber reinforced polymer (FRP) composite shell structures bonded with piezoelectric patches. Based on the responses obtained from finite element analysis, a real coded GA based improved LQR control scheme has been incorporated, which maximizes the closed loop damping while keeping the actuator voltages within limit. It has been observed that the developed FE code can be used for determination of the accurate response of smart FRP shell structures for the simulation of active vibration control of such structures. The proposed GA based LQR control scheme could control both dynamic oscillation due to mechanical load as well as the static displacement due to a thermal gradient, which was not possible with conventional LQR control scheme

  16. Decision optimization of case-based computer-aided decision systems using genetic algorithms with application to mammography

    International Nuclear Information System (INIS)

    This paper presents an optimization framework for improving case-based computer-aided decision (CB-CAD) systems. The underlying hypothesis of the study is that each example in the knowledge database of a medical decision support system has different importance in the decision making process. A new decision algorithm incorporating an importance weight for each example is proposed to account for these differences. The search for the best set of importance weights is defined as an optimization problem and a genetic algorithm is employed to solve it. The optimization process is tailored to maximize the system's performance according to clinically relevant evaluation criteria. The study was performed using a CAD system developed for the classification of regions of interests (ROIs) in mammograms as depicting masses or normal tissue. The system was constructed and evaluated using a dataset of ROIs extracted from the Digital Database for Screening Mammography (DDSM). Experimental results show that, according to receiver operator characteristic (ROC) analysis, the proposed method significantly improves the overall performance of the CAD system as well as its average specificity for high breast mass detection rates

  17. River Trip Optimization Scheduling Based on Artificial Intelligence Simulation and the Bee-Swarm Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Zhan Wenting

    2012-09-01

    Full Text Available The study on the impacts of human activities on natural resources is of critical importance in constructing effective management strategies in rafting trips. The Camping Schedule Intelligent Generator (CSIG, the computer program developed in the study, which successfully models the complex, dynamic human-environment interactions in the rafting river. This generator includes two parts: artificial intelligence simulation and BSGA-based Optimization. It employs artificial intelligence in creating an individual-based modeling system. With the help of BSGA, this simulation system successfully models the recreatinal rafting behavior and captures the decision making of rafting trips as they responsively seek to optimize their functions. After modeling, the paper applys CSIG to the Colorado River, which is a famous rafting river and find that: the numbers of short motor-trips (6-8 day and long-oar trips (15-18 day are obviously larger than the other two. Finally, the study analyzes the sensitivity of the model and finds that when the water velocity varies in the actual range.

  18. Simulated Annealing-Based Ant Colony Algorithm for Tugboat Scheduling Optimization

    Directory of Open Access Journals (Sweden)

    Qi Xu

    2012-01-01

    Full Text Available As the “first service station” for ships in the whole port logistics system, the tugboat operation system is one of the most important systems in port logistics. This paper formulated the tugboat scheduling problem as a multiprocessor task scheduling problem (MTSP after analyzing the characteristics of tugboat operation. The model considers factors of multianchorage bases, different operation modes, and three stages of operations (berthing/shifting-berth/unberthing. The objective is to minimize the total operation times for all tugboats in a port. A hybrid simulated annealing-based ant colony algorithm is proposed to solve the addressed problem. By the numerical experiments without the shifting-berth operation, the effectiveness was verified, and the fact that more effective sailing may be possible if tugboats return to the anchorage base timely was pointed out; by the experiments with the shifting-berth operation, one can see that the objective is most sensitive to the proportion of the shifting-berth operation, influenced slightly by the tugboat deployment scheme, and not sensitive to the handling operation times.

  19. An Optimized Clustering Algorithm Using Genetic Algorithm and Rough set Theory based on Kohonen self organizing map

    OpenAIRE

    Asgarali Bouyer; Abdolreza Hatamlou; Abdul Hanan Abdullah

    2010-01-01

    The Kohonen self organizing map is an efficient tool in exploratory phase of data mining and pattern recognition. The SOM is a popular tool that maps high dimensional space into a small number of dimensions by placing similar elements close together, forming clusters. Recently, most of the researchers found that to take the uncertainty concerned in cluster analysis, using the crisp boundaries in some clustering operations is not necessary. In this paper, an optimized two-level clustering algo...

  20. Optimization of HMM Parameters Based on Chaos and Genetic Algorithm for Hand Gesture Recognition

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    In order to prevent standard genetic algorithm (SGA) from being premature, chaos is introduced into GA,thus forming chaotic anneal genetic algorithm (CAGA). Chaos' ergodicity is used to initialize the population, and chaoticanneal mutation operator is used as the substitute for the mutation operator in SGA. CAGA is a unified framework of theexisting chaotic mutation methods. To validate the proposed algorithm, three algorithms, i.e. Baum-Welch, SGA andCAGA, are compared on training hidden Markov model (HMM) to recognize the hand gestures. Experiments on twenty-six alphabetical gestures show the CAGA's validity.

  1. A Novel Two-Stage Dynamic Decision Support based Optimal Threat Evaluation and Defensive Resource Scheduling Algorithm for Multi Air-borne threats

    CERN Document Server

    Naeem, Huma; Hussain, Mukhtar; Khan, Shoab A

    2009-01-01

    This paper presents a novel two-stage flexible dynamic decision support based optimal threat evaluation and defensive resource scheduling algorithm for multi-target air-borne threats. The algorithm provides flexibility and optimality by swapping between two objective functions, i.e. the preferential and subtractive defense strategies as and when required. To further enhance the solution quality, it outlines and divides the critical parameters used in Threat Evaluation and Weapon Assignment (TEWA) into three broad categories (Triggering, Scheduling and Ranking parameters). Proposed algorithm uses a variant of many-to-many Stable Marriage Algorithm (SMA) to solve Threat Evaluation (TE) and Weapon Assignment (WA) problem. In TE stage, Threat Ranking and Threat-Asset pairing is done. Stage two is based on a new flexible dynamic weapon scheduling algorithm, allowing multiple engagements using shoot-look-shoot strategy, to compute near-optimal solution for a range of scenarios. Analysis part of this paper presents ...

  2. Method of Inequalities-based Multiobjective Genetic Algorithm for Optimizing a Cart-double-pendulum System

    Institute of Scientific and Technical Information of China (English)

    Tung-Kuan Liu; Chiu-Hung Chen; Zu-Shu Li; Jyh-Horng Chou

    2009-01-01

    This article presents a multiobjective approach to the design of the controller for the swing-up and handstand control of a general cart-double-pendulum system (CDPS).The designed controller,which is based on the human-simulated intelligent control (HSIC) method,builds up different control modes to monitor and control the CDPS during four kinetic phases consisting of an initial oscillation phase,a swing-up phase,a posture adjustment phase,and a balance control phase.For the approach,the original method of inequalities-based (MoI) multiobjective genetic algorithm (MMGA) is extended and applied to the case study which uses a set of performance indices that includes the cart displacement over the rail boundary,the number of swings,the settling time,the overshoot of the total energy,and the control effort.The simulation results show good responses of the CDPS with the controllers obtained by the proposed approach.

  3. Optimization-Based Channel Constrained Data Aggregation Routing Algorithms in Multi-Radio Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Hong-Hsu Yen

    2009-06-01

    Full Text Available In wireless sensor networks, data aggregation routing could reduce the number of data transmissions so as to achieve energy efficient transmission. However, data aggregation introduces data retransmission that is caused by co-channel interference from neighboring sensor nodes. This kind of co-channel interference could result in extra energy consumption and significant latency from retransmission. This will jeopardize the benefits of data aggregation. One possible solution to circumvent data retransmission caused by co-channel interference is to assign different channels to every sensor node that is within each other’s interference range on the data aggregation tree. By associating each radio with a different channel, a sensor node could receive data from all the children nodes on the data aggregation tree simultaneously. This could reduce the latency from the data source nodes back to the sink so as to meet the user’s delay QoS. Since the number of radios on each sensor node and the number of non-overlapping channels are all limited resources in wireless sensor networks, a challenging question here is to minimize the total transmission cost under limited number of non-overlapping channels in multi-radio wireless sensor networks. This channel constrained data aggregation routing problem in multi-radio wireless sensor networks is an NP-hard problem. I first model this problem as a mixed integer and linear programming problem where the objective is to minimize the total transmission subject to the data aggregation routing, channel and radio resources constraints. The solution approach is based on the Lagrangean relaxation technique to relax some constraints into the objective function and then to derive a set of independent subproblems. By optimally solving these subproblems, it can not only calculate the lower bound of the original primal problem but also provide useful information to get the primal feasible solutions. By incorporating these

  4. Quantum dot ternary-valued full-adder: Logic synthesis by a multiobjective design optimization based on a genetic algorithm

    International Nuclear Information System (INIS)

    A methodology is proposed for designing a low-energy consuming ternary-valued full adder based on a quantum dot (QD) electrostatically coupled with a single electron transistor operating as a charge sensor. The methodology is based on design optimization: the values of the physical parameters of the system required for implementing the logic operations are optimized using a multiobjective genetic algorithm. The searching space is determined by elements of the capacitance matrix describing the electrostatic couplings in the entire device. The objective functions are defined as the maximal absolute error over actual device logic outputs relative to the ideal truth tables for the sum and the carry-out in base 3. The logic units are implemented on the same device: a single dual-gate quantum dot and a charge sensor. Their physical parameters are optimized to compute either the sum or the carry out outputs and are compatible with current experimental capabilities. The outputs are encoded in the value of the electric current passing through the charge sensor, while the logic inputs are supplied by the voltage levels on the two gate electrodes attached to the QD. The complex logic ternary operations are directly implemented on an extremely simple device, characterized by small sizes and low-energy consumption compared to devices based on switching single-electron transistors. The design methodology is general and provides a rational approach for realizing non-switching logic operations on QD devices.

  5. Evaluation of the selection methods used in the exIWO algorithm based on the optimization of multidimensional functions

    Science.gov (United States)

    Kostrzewa, Daniel; Josiński, Henryk

    2016-06-01

    The expanded Invasive Weed Optimization algorithm (exIWO) is an optimization metaheuristic modelled on the original IWO version inspired by dynamic growth of weeds colony. The authors of the present paper have modified the exIWO algorithm introducing a set of both deterministic and non-deterministic strategies of individuals' selection. The goal of the project was to evaluate the modified exIWO by testing its usefulness for multidimensional numerical functions optimization. The optimized functions: Griewank, Rastrigin, and Rosenbrock are frequently used as benchmarks because of their characteristics.

  6. FPGA Based Optimized Discontinuous SVPWM Algorithm for Three Phase VSI in AC Drives

    Directory of Open Access Journals (Sweden)

    Tole Sutikno

    2013-02-01

    Full Text Available The discontinuous space vector pulse width modulation (SVPWM has well-known that can reduce switching losses. By simplifying the thermal management issues, the discontinuous SVPWM can potentially reduce the inverter size and cost. However, using the modulation due to different time interval equations for each sector can introduce glitches at the points when the sector is changed. The more main problem, it can increase unwanted harmonic content and current ripple. Consider the decrease in switching losses associated with discontinuous modulation allows the system to utilize a higher switching frequency, this paper present high frequency switching of optimized discontinuous SVPWM based on FPGA to overcome the problems above. The proposed SVPWM has been successfully implemented by using APEX20KE Altera FPGA to drive on a three phase inverter system with 1.5 kW induction machine as load. The results have proved that the method can reduce harmonic content and current ripple without glitches.

  7. Near optimal power allocation algorithm for OFDM-based cognitive using adaptive relaying strategy

    KAUST Repository

    Soury, Hamza

    2012-01-01

    Relayed transmission increases the coverage and achievable capacity of communication systems. Adaptive relaying scheme is a relaying technique by which the benefits of the amplifying or decode and forward techniques can be achieved by switching the forwarding technique according to the quality of the signal. A cognitive Orthogonal Frequency-Division Multiplexing (OFDM) based adaptive relaying protocol is considered in this paper. The objective is to maximize the capacity of the cognitive radio system while ensuring that the interference introduced to the primary user is below the tolerated limit. A Near optimal power allocation in the source and the relay is presented for two pairing techniques such that the matching and random pairing. The simulation results confirm the efficiency of the proposed adaptive relaying protocol, and the consequence of choice of pairing technique. © 2012 ICST.

  8. Search tree-based approach for the p-median problem using the ant colony optimization algorithm

    OpenAIRE

    Gabriel Bodnariuc; Sergiu Cataranciuc

    2014-01-01

    In this paper we present an approximation algorithm for the $p$-median problem that uses the principles of ant colony optimization technique. We introduce a search tree that keeps the partial solutions during the solution process of the $p$-median problem. An adaptation is proposed that allows ant colony optimization algorithm to perform on this tree and obtain good results in short time.

  9. Enhanced Bee Colony Algorithm for Complex Optimization Problems

    Directory of Open Access Journals (Sweden)

    S.Suriya

    2012-01-01

    Full Text Available Optimization problems are considered to be one kind of NP hard problems. Usually heuristic approaches are found to provide solutions for NP hard problems. There are a plenty of heuristic algorithmsavailable to solve optimization problems namely: Ant Colony Optimization, Particle Swarm Optimization, Bee Colony Optimization, etc. The basic Bee Colony algorithm, a population based search algorithm, is analyzed to be a novel tool for complex optimization problems. The algorithm mimics the food foraging behavior of swarmsof honey bees. This paper deals with a modified fitness function of Bee Colony algorithm. The effect of problem dimensionality on the performance of the algorithms will be investigated. This enhanced Bee Colony Optimization will be evaluated based on the well-known benchmark problems. The testing functions like Rastrigin, Rosenbrock, Ackley, Griewank and Sphere are used to evaluavate the performance of the enhanced Bee Colony algorithm. The simulation will be developed on MATLAB.

  10. NEW HMM ALGORITHM FOR TOPOLOGY OPTIMIZATION

    Institute of Scientific and Technical Information of China (English)

    Zuo Kongtian; Zhao Yudong; Chen Liping; Zhong Yifang; Huang Yuying

    2005-01-01

    A new hybrid MMA-MGCMMA (HMM) algorithm for solving topology optimization problems is presented. This algorithm combines the method of moving asymptotes (MMA) algorithm and the modified globally convergent version of the method of moving asymptotes (MGCMMA) algorithm in the optimization process. This algorithm preserves the advantages of both MMA and MGCMMA. The optimizer is switched from MMA to MGCMMA automatically, depending on the numerical oscillation value existing in the calculation. This algorithm can improve calculation efficiency and accelerate convergence compared with simplex MMA or MGCMMA algorithms, which is proven with an example.

  11. Optimal Genetic View Selection Algorithm for Data Warehouse

    Institute of Scientific and Technical Information of China (English)

    Wang Ziqiang; Feng Boqin

    2005-01-01

    To efficiently solve the materialized view selection problem, an optimal genetic algorithm of how to select a set of views to be materialized is proposed so as to achieve both good query performance and low view maintenance cost under a storage space constraint. First, a pre-processing algorithm based on the maximum benefit per unit space is used to generate initial solutions. Then, the initial solutions are improved by the genetic algorithm having the mixture of optimal strategies. Furthermore, the generated infeasible solutions during the evolution process are repaired by loss function. The experimental results show that the proposed algorithm outperforms the heuristic algorithm and canonical genetic algorithm in finding optimal solutions.

  12. Fault Diagnosis of Plunger Pump in Truck Crane Based on Relevance Vector Machine with Particle Swarm Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Wenliao Du

    2013-01-01

    Full Text Available Promptly and accurately dealing with the equipment breakdown is very important in terms of enhancing reliability and decreasing downtime. A novel fault diagnosis method PSO-RVM based on relevance vector machines (RVM with particle swarm optimization (PSO algorithm for plunger pump in truck crane is proposed. The particle swarm optimization algorithm is utilized to determine the kernel width parameter of the kernel function in RVM, and the five two-class RVMs with binary tree architecture are trained to recognize the condition of mechanism. The proposed method is employed in the diagnosis of plunger pump in truck crane. The six states, including normal state, bearing inner race fault, bearing roller fault, plunger wear fault, thrust plate wear fault, and swash plate wear fault, are used to test the classification performance of the proposed PSO-RVM model, which compared with the classical models, such as back-propagation artificial neural network (BP-ANN, ant colony optimization artificial neural network (ANT-ANN, RVM, and support vectors, machines with particle swarm optimization (PSO-SVM, respectively. The experimental results show that the PSO-RVM is superior to the first three classical models, and has a comparative performance to the PSO-SVM, the corresponding diagnostic accuracy achieving as high as 99.17% and 99.58%, respectively. But the number of relevance vectors is far fewer than that of support vector, and the former is about 1/12–1/3 of the latter, which indicates that the proposed PSO-RVM model is more suitable for applications that require low complexity and real-time monitoring.

  13. Optimal design of structural parameters for shield cutterhead based on fuzzy mathematics and multi-objective genetic algorithm

    Institute of Scientific and Technical Information of China (English)

    夏毅敏; 唐露; 暨智勇; 程永亮; 卞章括

    2015-01-01

    In order to improve the strength and stiffness of shield cutterhead, the method of fuzzy mathematics theory in combination with the finite element analysis is adopted. An optimal design model of structural parameters for shield cutterhead is formulated, based on the complex engineering technical requirements. In the model, as the objective function of the model is a composite function of the strength and stiffness, the response surface method is applied to formulate the approximate function of objective function in order to reduce the solution scale of optimal problem. A multi-objective genetic algorithm is used to solve the cutterhead structure design problem and the change rule of the stress−strain with various structural parameters as well as their optimal values were researched under specific geological conditions. The results show that compared with original cutterhead structure scheme, the obtained optimal scheme of the cutterhead structure can greatly improve the strength and stiffness of the cutterhead, which can be seen from the reduction of its maximum equivalent stress by 21.2%, that of its maximum deformation by 0.75%, and that of its mass by 1.04%.

  14. A novel metaheuristic for continuous optimization problems: Virus optimization algorithm

    Science.gov (United States)

    Liang, Yun-Chia; Rodolfo Cuevas Juarez, Josue

    2016-01-01

    A novel metaheuristic for continuous optimization problems, named the virus optimization algorithm (VOA), is introduced and investigated. VOA is an iteratively population-based method that imitates the behaviour of viruses attacking a living cell. The number of viruses grows at each replication and is controlled by an immune system (a so-called 'antivirus') to prevent the explosive growth of the virus population. The viruses are divided into two classes (strong and common) to balance the exploitation and exploration effects. The performance of the VOA is validated through a set of eight benchmark functions, which are also subject to rotation and shifting effects to test its robustness. Extensive comparisons were conducted with over 40 well-known metaheuristic algorithms and their variations, such as artificial bee colony, artificial immune system, differential evolution, evolutionary programming, evolutionary strategy, genetic algorithm, harmony search, invasive weed optimization, memetic algorithm, particle swarm optimization and simulated annealing. The results showed that the VOA is a viable solution for continuous optimization.

  15. A Hybrid Algorithm for Optimizing Multi- Modal Functions

    Institute of Scientific and Technical Information of China (English)

    Li Qinghua; Yang Shida; Ruan Youlin

    2006-01-01

    A new genetic algorithm is presented based on the musical performance. The novelty of this algorithm is that a new genetic algorithm, mimicking the musical process of searching for a perfect state of harmony, which increases the robustness of it greatly and gives a new meaning of it in the meantime, has been developed. Combining the advantages of the new genetic algorithm, simplex algorithm and tabu search, a hybrid algorithm is proposed. In order to verify the effectiveness of the hybrid algorithm, it is applied to solving some typical numerical function optimization problems which are poorly solved by traditional genetic algorithms. The experimental results show that the hybrid algorithm is fast and reliable.

  16. Optimization of the reflux ratio for a stage distillation column based on an improved particle swarm algorithm

    DEFF Research Database (Denmark)

    Ren, Jingzheng; Tan, Shiyu; Dong, Lichun;

    2010-01-01

    A mathematical model relating operation profits with reflux ratio of a stage distillation column was established. In order to optimize the reflux ratio by solving the nonlinear objective function, an improved particle swarm algorithm was developed and has been proved to be able to enhance...... the searching ability of basic particle swarm algorithm significantly. An example of utilizing the improved algorithm to solve the mathematical model was demonstrated; the result showed that it is efficient and convenient to optimize the reflux ratio for a distillation column by using the mathematical model...

  17. Optimization of IC Separation Based on Isocratic-to-Gradient Retention Modeling in Combination with Sequential Searching or Evolutionary Algorithm

    Directory of Open Access Journals (Sweden)

    Šime Ukić

    2013-01-01

    Full Text Available Gradient ion chromatography was used for the separation of eight sugars: arabitol, cellobiose, fructose, fucose, lactulose, melibiose, N-acetyl-D-glucosamine, and raffinose. The separation method was optimized using a combination of simplex or genetic algorithm with the isocratic-to-gradient retention modeling. Both the simplex and genetic algorithms provided well separated chromatograms in a similar analysis time. However, the simplex methodology showed severe drawbacks when dealing with local minima. Thus the genetic algorithm methodology proved as a method of choice for gradient optimization in this case. All the calculated/predicted chromatograms were compared with the real sample data, showing more than a satisfactory agreement.

  18. Temperature drift modeling and compensation of fiber optical gyroscope based on improved support vector machine and particle swarm optimization algorithms.

    Science.gov (United States)

    Wang, Wei; Chen, Xiyuan

    2016-08-10

    Modeling and compensation of temperature drift is an important method for improving the precision of fiber-optic gyroscopes (FOGs). In this paper, a new method of modeling and compensation for FOGs based on improved particle swarm optimization (PSO) and support vector machine (SVM) algorithms is proposed. The convergence speed and reliability of PSO are improved by introducing a dynamic inertia factor. The regression accuracy of SVM is improved by introducing a combined kernel function with four parameters and piecewise regression with fixed steps. The steps are as follows. First, the parameters of the combined kernel functions are optimized by the improved PSO algorithm. Second, the proposed kernel function of SVM is used to carry out piecewise regression, and the regression model is also obtained. Third, the temperature drift is compensated for by the regression data. The regression accuracy of the proposed method (in the case of mean square percentage error indicators) increased by 83.81% compared to the traditional SVM. PMID:27534465

  19. Azcaxalli: A system based on Ant Colony Optimization algorithms, applied to fuel reloads design in a Boiling Water Reactor

    International Nuclear Information System (INIS)

    This paper presents some results of the implementation of several optimization algorithms based on ant colonies, applied to the fuel reload design in a Boiling Water Reactor. The system called Azcaxalli is constructed with the following algorithms: Ant Colony System, Ant System, Best-Worst Ant System and MAX-MIN Ant System. Azcaxalli starts with a random fuel reload. Ants move into reactor core channels according to the State Transition Rule in order to select two fuel assemblies into a 1/8 part of the reactor core and change positions between them. This rule takes into account pheromone trails and acquired knowledge. Acquired knowledge is obtained from load cycle values of fuel assemblies. Azcaxalli claim is to work in order to maximize the cycle length taking into account several safety parameters. Azcaxalli's objective function involves thermal limits at the end of the cycle, cold shutdown margin at the beginning of the cycle and the neutron effective multiplication factor for a given cycle exposure. Those parameters are calculated by CM-PRESTO code. Through the Haling Principle is possible to calculate the end of the cycle. This system was applied to an equilibrium cycle of 18 months of Laguna Verde Nuclear Power Plant in Mexico. The results show that the system obtains fuel reloads with higher cycle lengths than the original fuel reload. Azcaxalli results are compared with genetic algorithms, tabu search and neural networks results.

  20. Azcaxalli: A system based on Ant Colony Optimization algorithms, applied to fuel reloads design in a Boiling Water Reactor

    Energy Technology Data Exchange (ETDEWEB)

    Esquivel-Estrada, Jaime, E-mail: jaime.esquivel@fi.uaemex.m [Facultad de Ingenieria, Universidad Autonoma del Estado de Mexico, Cerro de Coatepec S/N, Toluca de Lerdo, Estado de Mexico 50000 (Mexico); Instituto Nacional de Investigaciones Nucleares, Carr. Mexico Toluca S/N, Ocoyoacac, Estado de Mexico 52750 (Mexico); Ortiz-Servin, Juan Jose, E-mail: juanjose.ortiz@inin.gob.m [Instituto Nacional de Investigaciones Nucleares, Carr. Mexico Toluca S/N, Ocoyoacac, Estado de Mexico 52750 (Mexico); Castillo, Jose Alejandro; Perusquia, Raul [Instituto Nacional de Investigaciones Nucleares, Carr. Mexico Toluca S/N, Ocoyoacac, Estado de Mexico 52750 (Mexico)

    2011-01-15

    This paper presents some results of the implementation of several optimization algorithms based on ant colonies, applied to the fuel reload design in a Boiling Water Reactor. The system called Azcaxalli is constructed with the following algorithms: Ant Colony System, Ant System, Best-Worst Ant System and MAX-MIN Ant System. Azcaxalli starts with a random fuel reload. Ants move into reactor core channels according to the State Transition Rule in order to select two fuel assemblies into a 1/8 part of the reactor core and change positions between them. This rule takes into account pheromone trails and acquired knowledge. Acquired knowledge is obtained from load cycle values of fuel assemblies. Azcaxalli claim is to work in order to maximize the cycle length taking into account several safety parameters. Azcaxalli's objective function involves thermal limits at the end of the cycle, cold shutdown margin at the beginning of the cycle and the neutron effective multiplication factor for a given cycle exposure. Those parameters are calculated by CM-PRESTO code. Through the Haling Principle is possible to calculate the end of the cycle. This system was applied to an equilibrium cycle of 18 months of Laguna Verde Nuclear Power Plant in Mexico. The results show that the system obtains fuel reloads with higher cycle lengths than the original fuel reload. Azcaxalli results are compared with genetic algorithms, tabu search and neural networks results.

  1. Worst-case Optimal Join Algorithms

    CERN Document Server

    Ngo, Hung Q; Ré, Christopher; Rudra, Atri

    2012-01-01

    Efficient join processing is one of the most fundamental and well-studied tasks in database research. In this work, we examine algorithms for natural join queries over many relations and describe a novel algorithm to process these queries optimally in terms of worst-case data complexity. Our result builds on recent work by Atserias, Grohe, and Marx, who gave bounds on the size of a full conjunctive query in terms of the sizes of the individual relations in the body of the query. These bounds, however, are not constructive: they rely on Shearer's entropy inequality which is information-theoretic. Thus, the previous results leave open the question of whether there exist algorithms whose running time achieve these optimal bounds. An answer to this question may be interesting to database practice, as it is known that any algorithm based on the traditional select-project-join style plans typically employed in an RDBMS are asymptotically slower than the optimal for some queries. We construct an algorithm whose runn...

  2. Optimal configuration algorithm of a satellite transponder

    Science.gov (United States)

    Sukhodoev, M. S.; Savenko, I. I.; Martynov, Y. A.; Savina, N. I.; Asmolovskiy, V. V.

    2016-04-01

    This paper describes the algorithm of determining the optimal transponder configuration of the communication satellite while in service. This method uses a mathematical model of the pay load scheme based on the finite-state machine. The repeater scheme is shown as a weighted oriented graph that is represented as plexus in the program view. This paper considers an algorithm example for application with a typical transparent repeater scheme. In addition, the complexity of the current algorithm has been calculated. The main peculiarity of this algorithm is that it takes into account the functionality and state of devices, reserved equipment and input-output ports ranged in accordance with their priority. All described limitations allow a significant decrease in possible payload commutation variants and enable a satellite operator to make reconfiguration solutions operatively.

  3. Immune Genetic Algorithm for Optimal Design

    Institute of Scientific and Technical Information of China (English)

    YANG Jian-guo; LI Bei-zhi; XIANG Qian

    2002-01-01

    A computing model employing the immune and genetic algorithm (IGA) for the optimization of part design is presented. This model operates on a population of points in search space simultaneously, not on just one point. It uses the objective function itself, not derivative or any other additional information and guarantees the fast convergence toward the global optimum. This method avoids some weak points in genetic algorithm, such as inefficient to some local searching problems and its convergence is too early. Based on this model, an optimal design support system (IGBODS) is developed.IGBODS has been used in practice and the result shows that this model has great advantage than traditional one and promises good application in optimal design.

  4. A Cuckoo Search Algorithm for Multimodal Optimization

    OpenAIRE

    Erik Cuevas; Adolfo Reyna-Orta

    2014-01-01

    Interest in multimodal optimization is expanding rapidly, since many practical engineering problems demand the localization of multiple optima within a search space. On the other hand, the cuckoo search (CS) algorithm is a simple and effective global optimization algorithm which can not be directly applied to solve multimodal optimization problems. This paper proposes a new multimodal optimization algorithm called the multimodal cuckoo search (MCS). Under MCS, the original CS is enhanced with...

  5. An optimal algorithm based on extended kalman filter and the data fusion for infrared touch overlay

    Science.gov (United States)

    Zhou, AiGuo; Cheng, ShuYi; Pan, Qiang Biao; Sun, Dong Yu

    2016-01-01

    Current infrared touch overlay has problems on the touch point recognition which bring some burrs on the touch trajectory. This paper uses the target tracking algorithm to improve the recognition and smoothness of infrared touch overlay. In order to deal with the nonlinear state estimate problem for touch point tracking, we use the extended Kalman filter in the target tracking algorithm. And we also use the data fusion algorithm to match the estimate value with the original target trajectory. The experimental results of the infrared touch overlay demonstrate that the proposed target tracking approach can improve the touch point recognition of the infrared touch overlay and achieve much smoother tracking trajectory than the existing tracking approach.

  6. Genetic algorithm and particle swarm optimization combined with Powell method

    Science.gov (United States)

    Bento, David; Pinho, Diana; Pereira, Ana I.; Lima, Rui

    2013-10-01

    In recent years, the population algorithms are becoming increasingly robust and easy to use, based on Darwin's Theory of Evolution, perform a search for the best solution around a population that will progress according to several generations. This paper present variants of hybrid genetic algorithm - Genetic Algorithm and a bio-inspired hybrid algorithm - Particle Swarm Optimization, both combined with the local method - Powell Method. The developed methods were tested with twelve test functions from unconstrained optimization context.

  7. Sizing Optimization of Truss Structures using a Hybridized Genetic Algorithm

    OpenAIRE

    Asl, Reza Najian; Aslani, Mohamad; Panahi, Masoud Shariat

    2013-01-01

    This paper presents a genetic-based hybrid algorithm that combines the exploration power of Genetic Algorithm (GA) with the exploitation capacity of a phenotypical probabilistic local search algorithm. Though not limited to a certain class of optimization problems, the proposed algorithm has been \\?ne tuned" to work particularly e?ciently on the optimal design of planar and space structures, a class of problems characterized by the large number of design variables and constraints, high degree...

  8. Fuzzy C Means (FCM) Clustering Based Hybrid Swarm Intelligence Algorithm for Test Case Optimization

    OpenAIRE

    Abraham Kiran Joseph; G. Radhamani

    2014-01-01

    The main objective of an operative testing strategy is the delivery of a reliable and quality oriented software product to the end user. Testing an application entirely from end to end is a time consuming and laborious process. Exhaustive testing utilizes a good chunk of the resources in a project for meticulous scrutiny to identify even a minor bug. A need to optimize the existing suite is highly recommended, with minimum resources and a shorter time span. To achieve this optimization in tes...

  9. Short-Term Load Forecasting Based on Wavelet Transform and Least Squares Support Vector Machine Optimized by Fruit Fly Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Wei Sun

    2015-01-01

    Full Text Available Electric power is a kind of unstorable energy concerning the national welfare and the people’s livelihood, the stability of which is attracting more and more attention. Because the short-term power load is always interfered by various external factors with the characteristics like high volatility and instability, a single model is not suitable for short-term load forecasting due to low accuracy. In order to solve this problem, this paper proposes a new model based on wavelet transform and the least squares support vector machine (LSSVM which is optimized by fruit fly algorithm (FOA for short-term load forecasting. Wavelet transform is used to remove error points and enhance the stability of the data. Fruit fly algorithm is applied to optimize the parameters of LSSVM, avoiding the randomness and inaccuracy to parameters setting. The result of implementation of short-term load forecasting demonstrates that the hybrid model can be used in the short-term forecasting of the power system.

  10. A Data Compression Algorithm for Wireless Sensor Networks Based on an Optimal Order Estimation Model and Distributed Coding

    Directory of Open Access Journals (Sweden)

    Sheng-Qiang Li

    2010-10-01

    Full Text Available In many wireless sensor network applications, the possibility of exceptions occurring is relatively small, so in a normal situation, data obtained at sequential time points by the same node are time correlated, while, spatial correlation may exist in data obtained at the same time by adjacent nodes. A great deal of node energy will be wasted if data which include time and space correlation is transmitted. Therefore, this paper proposes a data compression algorithm for wireless sensor networks based on optimal order estimation and distributed coding. Sinks can obtain correlation parameters based on optimal order estimation by exploring time and space redundancy included in data which is obtained by sensors. Then the sink restores all data based on time and space correlation parameters and only a little necessary data needs to be transmitted by nodes. Because of the decrease of redundancy, the average energy cost per node will be reduced and the life of the wireless sensor network will obviously be extended as a result.

  11. An Improved Point-track Optimal Assignment Algorithm

    OpenAIRE

    Zhonglei Zhang; Weihua Zhang; Li Zhou

    2013-01-01

    In order to improve the accuracy of data association of the Optimal Assignment (OA) algorithm based on dynamic information, an improved Point-Track Optimal Assignment (IPTOA) algorithm based on multi-source information is proposed. The improved algorithm gets valid 3-tuple of measurement set by solving 3-Dimensional (3-D) assignment problem which is based on dynamic information. Then fuses multi-source information by combination rule of D-S evidence theory and constructs the point-track corre...

  12. A Multi-Sensor RSS Spatial Sensing-Based Robust Stochastic Optimization Algorithm for Enhanced Wireless Tethering

    CERN Document Server

    Parasuraman, Ramviyas; Molinari, Luca; Kershaw, Keith; Di Castro, Mario; Masi, Alessandro; Ferre, Manuel

    2014-01-01

    The reliability of wireless communication in a network of mobile wireless robot nodes depends on the received radio signal strength (RSS). When the robot nodes are deployed in hostile environments with ionizing radiations (such as in some scientific facilities), there is a possibility that some electronic components may fail randomly (due to radiation effects), which causes problems in wireless connectivity. The objective of this paper is to maximize robot mission capabilities by maximizing the wireless network capacity and to reduce the risk of communication failure. Thus, in this paper, we consider a multi-node wireless tethering structure called the “server-relay-client” framework that uses (multiple) relay nodes in between a server and a client node. We propose a robust stochastic optimization (RSO) algorithm using a multi-sensor-based RSS sampling method at the relay nodes to efficiently improve and balance the RSS between the source and client nodes to improve the network capacity and to provide red...

  13. Multi-objective exergy based optimization of a polygeneration system using an evolutionary algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Ahmadi, Pouria; Rosen, Marc A.; Dincer, Ibrahim [Faculty of Engineering and Applied Science, University of Ontario Institute of Technology (Canada)], email: Pouria.Ahmadi@uoit.ca, email: Marc.Rosen@uoit.ca, email: Ibrahim.Dincer@uoit.ca

    2011-07-01

    World-wide, many applications are significant users of energy and with the depletion of fossil fuels and climate change, it is important that energy be used more efficiently and sustainably. Exergy analysis uses the second law of thermodynamics to identify and understand sustainable energy options. The aim of this paper is to present the thermodynamic modeling and optimization of a polygeneration energy system. A multi-objective optimization method was used to find the best design parameters of the polygeneration energy system and 2 objective functions were used to minimize the total cost rate and maximize the system exergy efficiency. In addition, the impacts of different parameters on the exergy efficiency and CO2 emission were studied. This study provided a better understanding of the performance of polygeneration energy systems and provided a closed form equation to help designers in optimizing polygeneration plants.

  14. A cross-layer optimization algorithm for wireless sensor network

    Science.gov (United States)

    Wang, Yan; Liu, Le Qing

    2010-07-01

    Energy is critical for typical wireless sensor networks (WSN) and how to energy consumption and maximize network lifetime are big challenges for Wireless sensor networks; cross layer algorithm is main method to solve this problem. In this paper, firstly, we analyze current layer-based optimal methods in wireless sensor network and summarize the physical, link and routing optimization techniques. Secondly we compare some strategies in cross-layer optimization algorithms. According to the analysis and summary of the current lifetime algorithms in wireless sensor network A cross layer optimization algorithm is proposed,. Then this optimization algorithm proposed in the paper is adopted to improve the traditional Leach routing protocol. Simulation results show that this algorithm is an excellent cross layer algorithm for reducing energy consumption.

  15. Optimal Search Mechanism Analysis of Light Ray Optimization Algorithm

    Institute of Scientific and Technical Information of China (English)

    Jihong SHEN; Jialian LI; Bin WEI

    2012-01-01

    Based on Fermat's principle and the automatic optimization mechanism in the propagation process of light,an optimal searching algorithm named light ray optimization is presented,where the laws of refraction and reflection of light rays are integrated into searching process of optimization.In this algorithm,coordinate space is assumed to be the space that is full of media with different refractivities,then the space is divided by grids,and finally the searching path is assumed to be the propagation path of light rays.With the law of refraction,the search direction is deflected to the direction that makes the value of objective function decrease.With the law of reflection,the search direction is changed,which makes the search continue when it cannot keep going with refraction.Only the function values of objective problems are used and there is no artificial rule in light ray optimization,so it is simple and easy to realize.Theoretical analysis and the results of numerical experiments show that the algorithm is feasible and effective.

  16. An estimation method for direct maintenance cost of aircraft components based on particle swarm optimization with immunity algorithm

    Institute of Scientific and Technical Information of China (English)

    WU Jing-min; ZUO Hong-fu; CHEN Yong

    2005-01-01

    A particle swarm optimization (PSO) algorithm improved by immunity algorithm (IA) was presented.Memory and self-regulation mechanisms of IA were used to avoid PSO plunging into local optima. Vaccination and immune selection mechanisms were used to prevent the undulate phenomenon during the evolutionary process. The algorithm was introduced through an application in the direct maintenance cost (DMC) estimation of aircraft components. Experiments results show that the algorithm can compute simply and run quickly. It resolves the combinatorial optimization problem of component DMC estimation with simple and available parameters. And it has higher accuracy than individual methods, such as PLS, BP and v-SVM, and also has better performance than other combined methods, such as basic PSO and BP neural network.

  17. NEW SIMULATED ANNEALING ALGORITHMS FOR CONSTRAINED OPTIMIZATION

    OpenAIRE

    LINET ÖZDAMAR; CHANDRA SEKHAR PEDAMALLU

    2010-01-01

    We propose a Population based dual-sequence Non-Penalty Annealing algorithm (PNPA) for solving the general nonlinear constrained optimization problem. The PNPA maintains a population of solutions that are intermixed by crossover to supply a new starting solution for simulated annealing throughout the search. Every time the search gets stuck at a local optimum, this crossover procedure is triggered and simulated annealing search re-starts from a new subspace. In both the crossover and simulate...

  18. Generalized Weiszfeld Algorithms for Lq Optimization.

    Science.gov (United States)

    Aftab, Khurrum; Hartley, Richard; Trumpf, Jochen

    2015-04-01

    In many computer vision applications, a desired model of some type is computed by minimizing a cost function based on several measurements. Typically, one may compute the model that minimizes the L2 cost, that is the sum of squares of measurement errors with respect to the model. However, the Lq solution which minimizes the sum of the qth power of errors usually gives more robust results in the presence of outliers for some values of q, for example, q = 1. The Weiszfeld algorithm is a classic algorithm for finding the geometric L1 mean of a set of points in Euclidean space. It is provably optimal and requires neither differentiation, nor line search. The Weiszfeld algorithm has also been generalized to find the L1 mean of a set of points on a Riemannian manifold of non-negative curvature. This paper shows that the Weiszfeld approach may be extended to a wide variety of problems to find an Lq mean for 1 ≤ q algorithm provably finds the global Lq optimum) and multiple rotation averaging (for which no such proof exists). Experimental results of Lq optimization for rotations show the improved reliability and robustness compared to L2 optimization.

  19. Strength Pareto Evolutionary Algorithm based Multi-Objective Optimization for Shortest Path Routing Problem in Computer Networks

    Directory of Open Access Journals (Sweden)

    Subbaraj Potti

    2011-01-01

    Full Text Available Problem statement: A new multi-objective approach, Strength Pareto Evolutionary Algorithm (SPEA, is presented in this paper to solve the shortest path routing problem. The routing problem is formulated as a multi-objective mathematical programming problem which attempts to minimize both cost and delay objectives simultaneously. Approach: SPEA handles the shortest path routing problem as a true multi-objective optimization problem with competing and noncommensurable objectives. Results: SPEA combines several features of previous multi-objective evolutionary algorithms in a unique manner. SPEA stores nondominated solutions externally in another continuously-updated population and uses a hierarchical clustering algorithm to provide the decision maker with a manageable pareto-optimal set. SPEA is applied to a 20 node network as well as to large size networks ranging from 50-200 nodes. Conclusion: The results demonstrate the capabilities of the proposed approach to generate true and well distributed pareto-optimal nondominated solutions.

  20. Intelligent optimization of the structure of the large section highway tunnel based on improved immune genetic algorithm

    Institute of Scientific and Technical Information of China (English)

    Hai-tao Bo; Xiao-feng Jia; Xiao-rui Wang

    2009-01-01

    As in the building of deep buried long tunnels, there are complicated conditions such as great deformation, high stress, multi-variables, high non-linearity and so on, the algorithm for structure optimization and its application in tunnel engineering are still in the starting stage. Along with the rapid development of highways across the country, It has become a very urgent task to be tackled to carry out the optimization design of the structure of the section of the tunnel to lessen excavation workload and to reinforce the support. Artificial intelligence demonstrates an extremely strong capability of identifying, expressing and disposing such kind of multiple variables and complicated non- linear relations. In this paper, a comprehensive consideration of the strategy of the selection and updating of the concentration and adaptability of the immune algorithm is made to replace the selection mode in the original genetic algorithm which depends simply on the adaptability value. Such an algorithm has the advantages of both the immune algorithm and the genetic algorithm, thus serving the purpose of not only enhancing the individual adaptability but maintaining the individual diversity as well. By use of the identifying function of the antigen memory, the global search capability of the immune genetic algorithm is raised, thereby avoiding the occurrence of the premature phenomenon. By optimizing the structure of the section of the Huayuan tunnel, the current excavation area and support design are adjusted. A conclusion with applicable value is arrived at. At a higher computational speed and a higher efficiency, the current method is verified to have advantages in the optimization computation of the tunnel project. This also suggests that the application of the immune genetic algorithm has a practical significance to the stability assessment and informationlzation design of the wall rock of the tunnel.

  1. Novel Approach to Nonlinear PID Parameter Optimization Using Ant Colony Optimization Algorithm

    Institute of Scientific and Technical Information of China (English)

    Duan Hai-bin; Wang Dao-bo; Yu Xiu-fen

    2006-01-01

    This paper presents an application of an Ant Colony Optimization (ACO) algorithm to optimize the parameters in the design of a type of nonlinear PID controller. The ACO algorithm is a novel heuristic bionic algorithm, which is based on the behaviour of real ants in nature searching for food. In order to optimize the parameters of the nonlinear PID controller using ACO algorithm,an objective function based on position tracing error was constructed, and elitist strategy was adopted in the improved ACO algorithm. Detailed simulation steps are presented. This nonlinear PID controller using the ACO algorithm has high precision of control and quick response.

  2. Genetic algorithms and fuzzy multiobjective optimization

    CERN Document Server

    Sakawa, Masatoshi

    2002-01-01

    Since the introduction of genetic algorithms in the 1970s, an enormous number of articles together with several significant monographs and books have been published on this methodology. As a result, genetic algorithms have made a major contribution to optimization, adaptation, and learning in a wide variety of unexpected fields. Over the years, many excellent books in genetic algorithm optimization have been published; however, they focus mainly on single-objective discrete or other hard optimization problems under certainty. There appears to be no book that is designed to present genetic algorithms for solving not only single-objective but also fuzzy and multiobjective optimization problems in a unified way. Genetic Algorithms And Fuzzy Multiobjective Optimization introduces the latest advances in the field of genetic algorithm optimization for 0-1 programming, integer programming, nonconvex programming, and job-shop scheduling problems under multiobjectiveness and fuzziness. In addition, the book treats a w...

  3. Optimal sensor placement of a bridge based on memetic algorithm%基于Memetic算法的桥梁传感器优化布置

    Institute of Scientific and Technical Information of China (English)

    彭珍瑞; 赵宇; 殷红; 彭宝瑞

    2014-01-01

    In this paper, an optimal sensor placement algorithm based on the memetic algorithm is proposed to solve the problem of optimal sensor placement of a bridge. Firstly the optimal sensor placement is transformed into an op⁃timization problem. Next, the mathematic model is established and the memetic algorithm is used to solve the prob⁃lem. The memetic algorithm combines global search of the genetic algorithm with local search of the simulated an⁃nealing algorithm to overcome the premature convergence problem and local best solution in genetic algorithm. This algorithm was applied in the optimal sensor placement of a suspension bridge. The results indicated that the memetic algorithm can be used to solve the problem, showing better optimization performance and faster convergence speed in comparison with the genetic algorithm.%针对桥梁传感器优化布置问题,提出了一种基于Memetic算法的传感器优化布置方法。首先将传感器优化布置问题转化为最优化问题,建立其数学模型,并运用Memetic优化算法求解传感器最优化布置。该算法将遗传算法的全局搜索与模拟退火算法的局部搜索相结合,克服了遗传算法易早熟和陷入局部最优等问题。某悬索桥算例表明,该算法可以解决桥梁传感器优化布置问题,且与遗传算法对比,Memetic算法显示出较好的收敛速度及寻优能力。

  4. Semi-optimal Practicable Algorithmic Cooling

    CERN Document Server

    Elias, Yuval; Weinstein, Yossi; 10.1103/PhysRevA.83.042340

    2011-01-01

    Algorithmic Cooling (AC) of spins applies entropy manipulation algorithms in open spin-systems in order to cool spins far beyond Shannon's entropy bound. AC of nuclear spins was demonstrated experimentally, and may contribute to nuclear magnetic resonance (NMR) spectroscopy. Several cooling algorithms were suggested in recent years, including practicable algorithmic cooling (PAC) and exhaustive AC. Practicable algorithms have simple implementations, yet their level of cooling is far from optimal; Exhaustive algorithms, on the other hand, cool much better, and some even reach (asymptotically) an optimal level of cooling, but they are not practicable. We introduce here semi-optimal practicable AC (SOPAC), wherein few cycles (typically 2-6) are performed at each recursive level. Two classes of SOPAC algorithms are proposed and analyzed. Both attain cooling levels significantly better than PAC, and are much more efficient than the exhaustive algorithms. The new algorithms are shown to bridge the gap between PAC a...

  5. A PMBGA to Optimize the Selection of Rules for Job Shop Scheduling Based on the Giffler-Thompson Algorithm

    Directory of Open Access Journals (Sweden)

    Rui Zhang

    2012-01-01

    Full Text Available Most existing research on the job shop scheduling problem has been focused on the minimization of makespan (i.e., the completion time of the last job. However, in the fiercely competitive market nowadays, delivery punctuality is more important for maintaining a high service reputation. So in this paper, we aim at solving job shop scheduling problems with the total weighted tardiness objective. Several dispatching rules are adopted in the Giffler-Thompson algorithm for constructing active schedules. It is noticeable that the rule selections for scheduling consecutive operations are not mutually independent but actually interrelated. Under such circumstances, a probabilistic model-building genetic algorithm (PMBGA is proposed to optimize the sequence of selected rules. First, we use Bayesian networks to model the distribution characteristics of high-quality solutions in the population. Then, the new generation of individuals is produced by sampling the established Bayesian network. Finally, some elitist individuals are further improved by a special local search module based on parameter perturbation. The superiority of the proposed approach is verified by extensive computational experiments and comparisons.

  6. Multi-objective optimal design of lithium-ion battery packs based on evolutionary algorithms

    Science.gov (United States)

    Severino, Bernardo; Gana, Felipe; Palma-Behnke, Rodrigo; Estévez, Pablo A.; Calderón-Muñoz, Williams R.; Orchard, Marcos E.; Reyes, Jorge; Cortés, Marcelo

    2014-12-01

    Lithium-battery energy storage systems (LiBESS) are increasingly being used on electric mobility and stationary applications. Despite its increasing use and improvements of the technology there are still challenges associated with cost reduction, increasing lifetime and capacity, and higher safety. A correct battery thermal management system (BTMS) design is critical to achieve these goals. In this paper, a general framework for obtaining optimal BTMS designs is proposed. Due to the trade-off between the BTMS's design goals and the complex modeling of thermal response inside the battery pack, this paper proposes to solve this problem using a novel Multi-Objective Particle Swarm Optimization (MOPSO) approach. A theoretical case of a module with 6 cells and a real case of a pack used in a Solar Race Car are presented. The results show the capabilities of the proposal methodology, in which improved designs for battery packs are obtained.

  7. A novel MPPT algorithm based on particle swarm optimization for photovoltaic systems

    OpenAIRE

    Koad, RBA; Zobaa, AF; El-Shahat, A

    2016-01-01

    © 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works In this paper a new maximum-power-point-tracking (MPPT) method for the photovoltaic (PV) system using an improved particle swarm optimization...

  8. Workspace Analysis and Optimization of 3-PUU Parallel Mechanism in Medicine Base on Genetic Algorithm

    OpenAIRE

    Hou, Yongchao; Zhao, Yang

    2015-01-01

    A novel 3-PUU parallel robot was put forward, on which kinematic analysis was conducted to obtain its inverse kinematics solution, and on this basis, the limitations of the sliding pair and the Hooke joint on the workspace were analyzed. Moreover, the workspace was solved through the three dimensional limit search method, and then optimization analysis was performed on the workspace of this parallel robot, which laid the foundations for the configuration design and further analysis of the par...

  9. Wind farm optimization using evolutionary algorithms

    Science.gov (United States)

    Ituarte-Villarreal, Carlos M.

    In recent years, the wind power industry has focused its efforts on solving the Wind Farm Layout Optimization (WFLO) problem. Wind resource assessment is a pivotal step in optimizing the wind-farm design and siting and, in determining whether a project is economically feasible or not. In the present work, three (3) different optimization methods are proposed for the solution of the WFLO: (i) A modified Viral System Algorithm applied to the optimization of the proper location of the components in a wind-farm to maximize the energy output given a stated wind environment of the site. The optimization problem is formulated as the minimization of energy cost per unit produced and applies a penalization for the lack of system reliability. The viral system algorithm utilized in this research solves three (3) well-known problems in the wind-energy literature; (ii) a new multiple objective evolutionary algorithm to obtain optimal placement of wind turbines while considering the power output, cost, and reliability of the system. The algorithm presented is based on evolutionary computation and the objective functions considered are the maximization of power output, the minimization of wind farm cost and the maximization of system reliability. The final solution to this multiple objective problem is presented as a set of Pareto solutions and, (iii) A hybrid viral-based optimization algorithm adapted to find the proper component configuration for a wind farm with the introduction of the universal generating function (UGF) analytical approach to discretize the different operating or mechanical levels of the wind turbines in addition to the various wind speed states. The proposed methodology considers the specific probability functions of the wind resource to describe their proper behaviors to account for the stochastic comportment of the renewable energy components, aiming to increase their power output and the reliability of these systems. The developed heuristic considers a

  10. Wind Speed Forecasting Based on FEEMD and LSSVM Optimized by the Bat Algorithm

    Directory of Open Access Journals (Sweden)

    Wei Sun

    2015-06-01

    Full Text Available Affected by various environmental factors, wind speed presents high fluctuation, nonlinear and non-stationary characteristics. To evaluate wind energy properly and efficiently, this paper proposes a modified fast ensemble empirical model decomposition (FEEMD-bat algorithm (BA-least support vector machines (LSSVM (FEEMD-BA-LSSVM model combined with input selected by deep quantitative analysis. The original wind speed series are first decomposed into a limited number of intrinsic mode functions (IMFs with one residual series. Then a LSSVM is built to forecast these sub-series. In order to select input from environment variables, Cointegration and Granger causality tests are proposed to check the influence of temperature with different leading lengths. Partial correlation is applied to analyze the inner relationships between the historical speeds thus to select the LSSVM input. The parameters in LSSVM are fine-tuned by BA to ensure the generalization of LSSVM. The forecasting results suggest the hybrid approach outperforms the compared models.

  11. Evolutionary algorithm based index assignment algorithm for noisy channel

    Institute of Scientific and Technical Information of China (English)

    李天昊; 余松煜

    2004-01-01

    A globally optimal solution to vector quantization (VQ) index assignment on noisy channel, the evolutionary algorithm based index assignment algorithm (EAIAA), is presented. The algorithm yields a significant reduction in average distortion due to channel errors, over conventional arbitrary index assignment, as confirmed by experimental results over the memoryless binary symmetric channel (BSC) for any bit error.

  12. Genetic algorithm optimization for finned channel performance

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    Compared to a smooth channel, a finned channel provides a higher heat transfer coefficient; increasing the fin height enhances the heat transfer. However, this heat transfer enhancement is associated with an increase in the pressure drop. This leads to an increased pumping power requirement so that one may seek an optimum design for such systems. The main goal of this paper is to define the exact location and size of fins in such a way that a minimal pressure drop coincides with an optimal heat transfer based on the genetic algorithm. Each fin arrangement is considered a solution to the problem(an individual for genetic algorithm). An initial population is generated randomly at the first step. Then the algorithm has been searched among these solutions and made new solutions iteratively by its functions to find an optimum design as reported in this article.

  13. Gas pipeline optimization using adaptive algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Smati, A.; Zemmour, N. [INH, Boumerdes (Algeria)

    1996-12-31

    Transmission gas pipeline network consume significant amounts of energy. Then, minimizing the energy requirements is a challenging task. Due to the nonlinearity and poor knowledge of the system states, several results, based on the optimal control theory, are obtained only for simple configurations. In this paper an optimization scheme in the face of varying demand is carried out. It is based on the use of a dynamic simulation program as a plant model and the Pareto set technique to sell out useful experiments. Experiments are used for the identification of regression models based on an original class of functions. The nonlinear programming algorithm results. Its connection with regression models permits the definition off-line, and for a long time horizon, of the optimal discharge pressure trajectory for all the compressor stations. The use of adaptive algorithms, with high frequency, permits one to cancel the effect of unknown disturbances and errors in demand forecasts. In this way, an on-line optimization scheme using data of SCADA system is presented.

  14. Neural network based on adaptive chaotic gradient descending optimization algorithm and its application in matte converting process

    Institute of Scientific and Technical Information of China (English)

    胡志坤; 彭小奇; 桂卫华

    2004-01-01

    An adaptive chaotic gradient descending optimization algorithm for single objective optimization was presented. A local minimum judged by two rules was obtained by an improved mutative-step gradient descending method. A new optimal minimum was obtained to replace the local minimum by mutative-scale chaotic search algorithm whose scales are magnified gradually from a small scale in order to escape local minima. The global optimal value was attained by repeatedly iterating. At last, a BP (back-propagation) neural network model for forecasting slag output in matte converting was established. The algorithm was used to train the weights of the BP neural network model. The simulation results with a training data set of 400 samples show that the training process can be finished within 300 steps to obtain the global optimal value, and escape local minima effectively. An optimization system for operation parameters, which includes the forecasting model, is achieved, in which the output of converter increases by 6.0%, and the amount of the treated cool materials rises by 7.8% in the matte converting process.

  15. Genetic Algorithm-Based Design Optimization of Electromagnetic Valve Actuators in Combustion Engines

    Directory of Open Access Journals (Sweden)

    Seung Hwan Lee

    2015-11-01

    Full Text Available In this research, the design of a new electromagnetic engine valve in the limited space of combustion engine is optimized by multidisciplinary simulation using MATLAB and Maxwell. An electromagnetic engine valve actuator using a permanent magnet is a new actuator concept for overcoming the inherent drawbacks of the conventional solenoid-driven electromagnetic engine valve actuator, such as high power consumption and so on. This study aims to maximize the vibration frequency of the armature to reduce the transition time of the engine valve. The higher performance of the new actuator is demonstrated by dynamic finite element analysis.

  16. Hybrid Optimization Algorithm Based on Particle Swarm Optimization and Artificial Bee Colony Algorithm%基于粒子群和人工蜂群算法的混合优化算法

    Institute of Scientific and Technical Information of China (English)

    王志刚

    2012-01-01

    提出一种基于粒子群(PSO)和人工蜂群算法(ABC)相结合的新型混合优化算法-PSOABC.该算法基于一种双种群进化策略,一个种群中的个体由粒子群算法进化而来,另一种群的个体由人工蜂群算法进化而来,并且在人工蜂群算法中按轮盘赌的方式选择个体进化所需的随机个体.此外,算法采用一种信息分享机制,使两个种群中的个体可以实现协同进化.对4个基准函数进行仿真实验并与ABC进行比较,表明提出的算法能有效地改善寻优性能,增强摆脱局部极值的能力.%A new hybrid global optimization algorithm PSOABC is presented, which is based on the combination of the particle swarm optimization ( PSO) and artificial bee colony algorithm (ABC). PSOABC is based on a two population evolution scheme, in which the individuals of one population are evolved by PSO and the individuals of the other population are evolved by ABC. Random individuals in which evolution of individual required are selected by roulette in ABC. The individuals both in PSO and ABC are coevolved by employing an information sharing mechanism. Four benchmark functions are tested, and the performance of the proposed PSOABC algorithm is compared with ABC. Which demonstrate that PSOABC can improve optimizing performance effectively, and it can avoid getting struck at local optima effectively.

  17. Parallel algorithms for unconstrained optimizations by multisplitting

    Energy Technology Data Exchange (ETDEWEB)

    He, Qing [Arizona State Univ., Tempe, AZ (United States)

    1994-12-31

    In this paper a new parallel iterative algorithm for unconstrained optimization using the idea of multisplitting is proposed. This algorithm uses the existing sequential algorithms without any parallelization. Some convergence and numerical results for this algorithm are presented. The experiments are performed on an Intel iPSC/860 Hyper Cube with 64 nodes. It is interesting that the sequential implementation on one node shows that if the problem is split properly, the algorithm converges much faster than one without splitting.

  18. Microprocessor-based integration of microfluidic control for the implementation of automated sensor monitoring and multithreaded optimization algorithms.

    Science.gov (United States)

    Ezra, Elishai; Maor, Idan; Bavli, Danny; Shalom, Itai; Levy, Gahl; Prill, Sebastian; Jaeger, Magnus S; Nahmias, Yaakov

    2015-08-01

    Microfluidic applications range from combinatorial synthesis to high throughput screening, with platforms integrating analog perfusion components, digitally controlled micro-valves and a range of sensors that demand a variety of communication protocols. Currently, discrete control units are used to regulate and monitor each component, resulting in scattered control interfaces that limit data integration and synchronization. Here, we present a microprocessor-based control unit, utilizing the MS Gadgeteer open framework that integrates all aspects of microfluidics through a high-current electronic circuit that supports and synchronizes digital and analog signals for perfusion components, pressure elements, and arbitrary sensor communication protocols using a plug-and-play interface. The control unit supports an integrated touch screen and TCP/IP interface that provides local and remote control of flow and data acquisition. To establish the ability of our control unit to integrate and synchronize complex microfluidic circuits we developed an equi-pressure combinatorial mixer. We demonstrate the generation of complex perfusion sequences, allowing the automated sampling, washing, and calibrating of an electrochemical lactate sensor continuously monitoring hepatocyte viability following exposure to the pesticide rotenone. Importantly, integration of an optical sensor allowed us to implement automated optimization protocols that require different computational challenges including: prioritized data structures in a genetic algorithm, distributed computational efforts in multiple-hill climbing searches and real-time realization of probabilistic models in simulated annealing. Our system offers a comprehensive solution for establishing optimization protocols and perfusion sequences in complex microfluidic circuits. PMID:26227212

  19. Microprocessor-based integration of microfluidic control for the implementation of automated sensor monitoring and multithreaded optimization algorithms.

    Science.gov (United States)

    Ezra, Elishai; Maor, Idan; Bavli, Danny; Shalom, Itai; Levy, Gahl; Prill, Sebastian; Jaeger, Magnus S; Nahmias, Yaakov

    2015-08-01

    Microfluidic applications range from combinatorial synthesis to high throughput screening, with platforms integrating analog perfusion components, digitally controlled micro-valves and a range of sensors that demand a variety of communication protocols. Currently, discrete control units are used to regulate and monitor each component, resulting in scattered control interfaces that limit data integration and synchronization. Here, we present a microprocessor-based control unit, utilizing the MS Gadgeteer open framework that integrates all aspects of microfluidics through a high-current electronic circuit that supports and synchronizes digital and analog signals for perfusion components, pressure elements, and arbitrary sensor communication protocols using a plug-and-play interface. The control unit supports an integrated touch screen and TCP/IP interface that provides local and remote control of flow and data acquisition. To establish the ability of our control unit to integrate and synchronize complex microfluidic circuits we developed an equi-pressure combinatorial mixer. We demonstrate the generation of complex perfusion sequences, allowing the automated sampling, washing, and calibrating of an electrochemical lactate sensor continuously monitoring hepatocyte viability following exposure to the pesticide rotenone. Importantly, integration of an optical sensor allowed us to implement automated optimization protocols that require different computational challenges including: prioritized data structures in a genetic algorithm, distributed computational efforts in multiple-hill climbing searches and real-time realization of probabilistic models in simulated annealing. Our system offers a comprehensive solution for establishing optimization protocols and perfusion sequences in complex microfluidic circuits.

  20. The use of the SCEM-UA optimization algorithm in the calibration of the physically based hydrological model SWAP

    Science.gov (United States)

    Rienzner, Michele; Facchi, Arianna; Cesari de Maria, Sandra; Gandolfi, Claudio

    2013-04-01

    experimentation as well as the exact irrigation amount in each IMPs in 2010. These variables were estimated using an automatic calibration procedure based on the optimization algorithm SCEM-UA (Shuffled Complex Evolution Metropolis, Vrugt et al, 2003), one of the most powerful algorithms for the search of the global optimum currently available. SCEM-UA is available as a set of MATLAB functions (i.e. a toolbox) and has been designed to optimize models working within the MATLAB environment. The need to optimize a stand-alone executable code (SWAP.exe), whose parameters are controlled by means of a text file, required the development of an interface between SWAP and SCEM-UA. The calibration procedure as well as the simulation results will be presented and discussed.