Optimal design of a 2 DOF parallel robot

This paper is aimed at presenting a study on the optimization of the Biglide mini parallel robot, which comprises two-degree-of-freedom (DOF) mini parallel robots with constant struts. The robot workspace is characterized and the inverse kinematics equation is obtained. In the paper, design optimization is implemented with Genetic Algorithms (GA) for optimization considering transmission quality index and workspace. Here, intended to show the advantages of using the GA, we applied it to a multicriteria optimization problem of 2 DOF mini parallel robot. Genetic algorithms (GA) are so far generally the best and most robust kind of evolutionary algorithms. A GA has a number of advantages. It can quickly scan a vast solution set. Bad proposals do not affect the end solution negatively as they are simply discarded. The obtained results have shown that the use of GA in such kind of optimization problem enhances the quality of the optimization outcome, providing a better and more realistic support for the decision maker. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

A new population seeding technique for permutation-coded Genetic Algorithm: Service transfer approach

Genetic Algorithm (GA) is a popular heuristic method for dealing complex problems with very large search space. Among various phases of GA, the initial phase of population seeding plays an important role in deciding the span of GA to achieve the best fit w.r.t. the time. In other words, the quality of individual solutions generated in the initial population phase plays a critical role in determining the quality of final optimal solution. The traditional GA with random population seeding technique is quite simple and of course efficient to some extent; however, the population may contain poor quality individuals which take long time to converge with optimal solution. On the other hand, the hybrid population seeding techniques which have the benefit of good quality individuals and fast convergence lacks in terms of randomness, individual diversity and ability to converge with global optimal solution. This motivates to design a population seeding technique with multifaceted features of randomness, individual diversity and good quality. In this paper, an efficient Ordered Distance Vector (ODV) based population seeding technique has been proposed for permutation-coded GA using an elitist service transfer approach. One of the famous combinatorial hard problems of Traveling Salesman Problem (TSP) is being chosen as the testbed and the experiments are performed on different sized benchmark TSP instances obtained from standard TSPLIB [54]. The experimental results advocate that the proposed technique outperforms the existing popular initialization methods in terms of convergence rate, error rate and convergence time.     

GA-BP嵌套算法的理论及应用

分析了BP算法、遗传算法以及GA-BP-APARTING算法的特点,提出了GA-BP-NESTING算法.在人工神经网络的在线学习和离线学习方式下,分别对BP算法、GA算法、GA-BP-APARTING算法和GA-BP-NESTING算法进行了比较研究,研究发现:第一,网络初始权值的赋值对人工神经网络训练影响很大;第二,离线学习方式下GA-BP-NESTING算法效果最佳.     

Multiple-objective heuristics for scheduling unrelated parallel machines

This research proposes two heuristics and a Genetic Algorithm (GA) to find non-dominated solutions to multiple-objective unrelated parallel machine scheduling problems. Three criteria are of interest, namely: makespan, total weighted completion time, and total weighted tardiness. Each heuristic seeks to simultaneously minimize a pair of these criteria; the GA seeks to simultaneously minimize all three. The computational results show that the proposed heuristics are computationally efficient and provide solutions of reasonable quality. The proposed GA outperforms other algorithms in terms of the number of non-dominated solutions and the quality of its solutions.     

Retrospective optimization of mixed-integer stochastic systems using dynamic simplex linear interpolation

We propose a family of retrospective optimization (RO) algorithms for optimizing stochastic systems with both integer and continuous decision variables. The algorithms are continuous search procedures embedded in a RO framework using dynamic simplex interpolation (RODSI). By decreasing dimensions (corresponding to the continuous variables) of simplex, the retrospective solutions become closer to an optimizer of the objective function. We present convergence results of RODSI algorithms for stochastic “convex” systems. Numerical results show that a simple implementation of RODSI algorithms significantly outperforms some random search algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO).     

基于遗传算法的生产批量优化问题

本文针对生产费用、生产准备费用和库存费用综合指标最小的最优的能力约束生产批量问题,建立基于遗传算法的数学模型,通过模拟试验及实际问题的计算验证了算法的可行性。     

Self-Adaptive Genetic Algorithm for Clustering

Clustering is a hard combinatorial problem which has many applications in science and practice. Genetic algorithms (GAs) have turned out to be very effective in solving the clustering problem. However, GAs have many parameters, the optimal selection of which depends on the problem instance. We introduce a new self-adaptive GA that finds the parameter setup on-line during the execution of the algorithm. In this way, the algorithm is able to find the most suitable combination of the available components. The method is robust and achieves results comparable to or better than a carefully fine-tuned non-adaptive GA.     

Using support vector machines to learn the efficient set in multiple objective discrete optimization

We propose using support vector machines (SVMs) to learn the efficient set in multiple objective discrete optimization (MODO). We conjecture that a surface generated by SVM could provide a good approximation of the efficient set. As one way of testing this idea, we embed the SVM-approximated efficient set information into a Genetic Algorithm (GA). This is accomplished by using a SVM-based fitness function that guides the GA search. We implement our SVM-guided GA on the multiple objective knapsack and assignment problems. We observe that using SVM improves the performance of the GA compared to a benchmark distance based fitness function and may provide competitive results.     

An evolutionary algorithm with the partial sequential forward floating search mutation for large-scale feature selection problems

Several meta-heuristic algorithms, such as evolutionary algorithms (EAs) and genetic algorithms (GAs), have been developed for solving feature selection problems due to their efficiency for searching feature subset spaces in feature selection problems. Recently, hybrid GAs have been proposed to improve the performance of conventional GAs by embedding a local search operation, or sequential forward floating search mutation, into the GA. Existing hybrid algorithms may damage individuals’ genetic information obtained from genetic operations during the local improvement procedure because of a sequential process of the mutation operation and the local improvement operation. Another issue with a local search operation used in the existing hybrid algorithms is its inappropriateness for large-scale problems. Therefore, we propose a novel approach for solving large-sized feature selection problems, namely, an EA with a partial sequential forward floating search mutation (EAwPS). The proposed approach integrates a local search technique, that is, the partial sequential forward floating search mutation into an EA method. Two algorithms, EAwPS-binary representation (EAwPS-BR) for medium-sized problems and EAwPS-integer representation (EAwPS-IR) for large-sized problems, have been developed. The adaptation of a local improvement method into the EA speeds up the search and directs the search into promising solution areas. We compare the performance of the proposed algorithms with other popular meta-heuristic algorithms using the medium- and large-sized data sets. Experimental results demonstrate that the proposed EAwPS extracts better features within reasonable computational times.     

改进GA机制融合的二进制蜂群算法研究

为了克服人工蜂群算法蜜源更新过程中的随机性并保留蜜源中个体序列合理的组合形式,通过分析基本蜂群算法更新公式的机理,提出一种改进GA(Genetic A1gorithm)机制融合的二进制蜂群算法.算法以二进制编码,首先依概率对任意两蜜源进行"去同存异"操作后随机排列,将排列结果放入到其中某个体中形成新个体.然后依概率进行二进制个体的"翻转"操作,上述两种操作从其本质上相当于GA的类交叉和类变异操作;其次利用GA机制收敛性的证明方式在理论上证明算法是收敛的.最后通过应用不同特性的多维基准函数和算法之间的比较验证改进蜂群算法具有良好的收敛能力和鲁棒性.     

Enhancing performance of particle swarm optimization through an algorithmic link with genetic algorithms

Evolutionary Algorithms (EAs) are emerging as competitive and reliable techniques for several optimization tasks. Juxtapositioning their higher-level and implicit correspondence; it is provocative to query if one optimization algorithm can benefit from another by studying underlying similarities and dissimilarities. This paper establishes a clear and fundamental algorithmic linking between particle swarm optimization (PSO) algorithm and genetic algorithms (GAs). Specifically, we select the task of solving unimodal optimization problems, and demonstrate that key algorithmic features of an effective Generalized Generation Gap based Genetic Algorithm can be introduced into the PSO by leveraging this algorithmic linking while significantly enhance the PSO’s performance. However, the goal of this paper is not to solve unimodal problems, neither is to demonstrate that the modified PSO algorithm resembles a GA, but to highlight the concept of algorithmic linking in an attempt towards designing efficient optimization algorithms. We intend to emphasize that the evolutionary and other optimization researchers should direct more efforts in establishing equivalence between different genetic, evolutionary and other nature-inspired or non-traditional algorithms. In addition to achieving performance gains, such an exercise shall deepen the understanding and scope of various operators from different paradigms in Evolutionary Computation (EC) and other optimization methods.     

Learning genetic algorithm parameters using hidden Markov models

Genetic algorithms (GAs) are routinely used to search problem spaces of interest. A lesser known but growing group of applications of GAs is the modeling of so-called “evolutionary processes”, for example, organizational learning and group decision-making. Given such an application, we show it is possible to compute the likely GA parameter settings given observed populations of such an evolutionary process. We examine the parameter estimation process using estimation procedures for learning hidden Markov models, with mathematical models that exactly capture expected GA behavior. We then explore the sampling distributions relevant to this estimation problem using an experimental approach.     

Optimization of an Active Noise Control System Inside an Aircraft, Based on the Simultaneous Optimal Positioning of Microphones and Speakers, with the Use of a Genetic Algorithm

In the last decade, Active Noise Control (ANC) has become a very popular technique for controlling low-frequency noise. The increase in its popularity is a consequence of the rapid development in the fields of computers in general, and more specifically in digital signal processing boards. ANC systems are application specific and therefore they should be optimally designed for each application. Even though the physical background of the ANC systems is well known and understood, efficient tools for the optimization of the sensor and actuator configurations of the ANC system, based on classical optimization methods, do not exist. This is due to the nature of the problem that allows the calculation of the effect of the ANC system only when the sensor and actuator configurations are specified. An additional difficulty in this problem is that the sensor and the actuator configurations cannot be optimized independently, since the effect of the ANC system directly depends on the combined sensor and actuator configuration. For the solution of this problem several other optimization techniques were applied, such as simulated annealing for example. In this paper the successful application of a Genetic Algorithm, an optimization technique that belongs to the broad class of evolutionary algorithms, is presented. The results obtained from the application of the GA are very promising. The GA was able to identify various configurations that achieved a reduction of 6.3 dBs to 6.5 dBs, which corresponds to an actual reduction of 50% of the initial acoustic pressure.     

Comparison of metaheuristic algorithms for Examination Timetabling Problem

SA, TS, GA and ACS are four of the main algorithms for solving challenging problems of intelligent systems. In this paper we consider Examination Timetabling Problem that is a common problem for all universities and institutions of higher education. There are many methods to solve this problem, In this paper we use Simulated Annealing, Tabu Search, Genetic Algorithm and Ant Colony System in their basic frameworks for solving this problem and compare results of them with each other.     

A genetic algorithm approach to nonlinear least squares estimation

A common type of problem encountered in mathematics is optimizing nonlinear functions. Many popular algorithms that are currently available for finding nonlinear least squares estimators, a special class of nonlinear problems, are sometimes inadequate. They might not converge to an optimal value, or if they do, it could be to a local rather than global optimum. Genetic algorithms have been applied successfully to function optimization and therefore would be effective for nonlinear least squares estimation. This paper provides an illustration of a genetic algorithm applied to a simple nonlinear least squares example.     

On solving the forward kinematics of 3RPR planar parallel manipulator using hybrid metaheuristics

Hybrid metaheuristics have been applied with success in solving many real-world problems. This work introduces hybrid metaheuristics to the field of kinematics problem, in particular, for solving the forward kinematics of the 3RPR parallel manipulator. It implements a combination of genetic algorithms and simulated annealing into two popular hybrid metaheuristic techniques. They are combined as teamwork and relay collaborative hybrid metaheuristics and compared to the performance of genetic algorithms and simulated annealing alone. The results show that the meta-heuristic approaches give robust and high quality solutions. Genetic algorithms and teamwork collaborative metaheuristics showed better performance than simulated annealing and relay collaborative metaheuristics. The given metaheuristic methods obtain all the unique solutions and comparisons with algebraic methods show promising results.     

阶梯状黄土边坡稳定性分析的改进遗传算法及应用

阶梯状黄土边坡稳定性分析的关键是估算其稳定系数的最小值.稳定系数的求解涉及诸多因素且计算过程繁杂,传统优化算法往往不能有效地搜索到其全局最小解.为此,提出一种改进的自适应遗传算法.算法对基因变量空间进行网格状划分,采用迭代选优法建立均匀分布的初始种群,运用优质个体保留遗传策略,并按照特定的准则自适应地调整交叉概率和变异概率,提高算法的全局搜索能力和收敛速度.实例应用表明算法能够快速有效地收敛于土坡稳定系数的全局最小解,且计算结果与实际情况更加吻合.     

基于遗传算法与贪婪策略的多港口集装箱配载研究

在物流运输行业中,集装箱运输已经成为我国长江沿岸各大港口的主要运输业务。集装箱的处理流程,尤其是集装箱的配载过程直接影响着班轮的运输效率,配载方案的制定对班轮运输起着至关重要的作用。本文针对多港口集装箱船的配载情况,利用CPLEX对该线性规划问题进行求解,并设计遗传算法和贪婪算法对长江沿岸多港口集装箱船配载情形进行对比。通过仿真实验,在小规模时遗传算法与CPLEX求解的精确解相同,验证了遗传算法的有效性。并且在大规模运输情形下,遗传算法得出的结果明显优于贪婪策略,进一步说明了遗传算法是行之有效的。得出的解决方案降低了班轮公司的运输成本,提高了港口的工作效率,对我国长江沿岸港口集装箱配载计划的制定具有一定的指导作用。     

Fuzzy adaptive search method for parallel genetic algorithm with island combination process

Genetic algorithms (GAs) pose several problems. Probably, the most important one is that the search ability of ordinary GAs is not always optimal in the early and final stages of the search because of fixed GA parameters. To solve this problem, we proposed the fuzzy adaptive search method for genetic algorithms (FASGA) that is able to tune the genetic parameters according to the search stage by the fuzzy reasoning. In this paper, a fuzzy adaptive search method for parallel genetic algorithms (FASPGA) is proposed, in which the high-speed search ability of fuzzy adaptive tuning by FASGA is combined with the high-quality solution finding capacity of parallel genetic algorithms. The proposed method offers improved search performance, and produces high-quality solutions. Moreover, we also propose FASPGA with an operation of combining dynamically sub-populations (C-FASPGA) which combines two elite islands in the final stage of the evolution to find a better solution as early as possible. Simulations are performed to confirm the efficiency of the proposed method, which is shown to be superior to both ordinary and parallel genetic algorithms.