基于烟花混合蚁群的移动机器人路径规划研究

目的 以应用于包装车间的移动机器人的路径规划作为研究对象,解决蚁群算法收敛速度慢、寻找到的路径不优等缺陷。方法 引入改进烟花和蚁群融合的方法进行搜索,首先建立移动机器人的栅格地图,其次采用改进烟花算法进行路径粗搜索,将得到的路径作为信息素增量,再运用蚁群细搜索求解。结果 文中方法与传统方法相比,收敛速度得到提高,并寻找到了更优的路径。结论 通过采用融合算法,弥补了烟花寻优的不足,加快了蚁群的收敛,可以对2种算法互相取长补短。     

考虑半托盘出库的堆垛机复合作业拣选路径优化研究

结合自动化立体仓库中堆垛机执行出入库作业的实际情况，提出了考虑半托盘出库情况下的堆垛机复合作业拣选路径优化问题，并构建了该问题的数学模型。针对研究问题的特点，利用一种离散烟花算法进行模型求解，采用爆炸算子和变异算子执行烟花的爆炸操作，实现算法的全局搜索和局部搜索；应用精英选择策略和类似轮盘赌策略以提高收敛效果。最后以某烟草物流公司自动化立体仓库的堆垛机拣选作业为例，将离散烟花算法与其他算法的运算结果作对比，验证了该算法更具求解优势。     

SSABA: Search Step Adjustment Based Algorithm

Finding the suitable solution to optimization problems is a fundamental challenge in various sciences. Optimization algorithms are one of the effective stochastic methods in solving optimization problems. In this paper, a new stochastic optimization algorithm called Search Step Adjustment Based Algorithm (SSABA) is presented to provide quasi-optimal solutions to various optimization problems. In the initial iterations of the algorithm, the step index is set to the highest value for a comprehensive search of the search space. Then, with increasing repetitions in order to focus the search of the algorithm in achieving the optimal solution closer to the global optimal, the step index is reduced to reach the minimum value at the end of the algorithm implementation. SSABA is mathematically modeled and its performance in optimization is evaluated on twenty-three different standard objective functions of unimodal and multimodal types. The results of optimization of unimodal functions show that the proposed algorithm SSABA has high exploitation power and the results of optimization of multimodal functions show the appropriate exploration power of the proposed algorithm. In addition, the performance of the proposed SSABA is compared with the performance of eight well-known algorithms, including Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Teaching-Learning Based Optimization (TLBO), Gravitational Search Algorithm (GSA), Grey Wolf Optimization (GWO), Whale Optimization Algorithm (WOA), Marine Predators Algorithm (MPA), and Tunicate Swarm Algorithm (TSA). The simulation results show that the proposed SSABA is better and more competitive than the eight compared algorithms with better performance.     

A TABOO SEARCH BASED APPROACH TO FIND THE PARETO OPTIMAL SET IN MULTIPLE OBJECTIVE OPTIMIZATION

Taboo search is a heuristic optimization technique which works with a neighbourhood of solutions to optimize a given objective function. It is generally applied to single objective optimization problems. Taboo search has the potential for solving multiple objective optimization (MOO) problems, because it works with more than one solution at a time, and this gives it the opportunity to evaluate multiple objective functions simultaneously. In this paper, a taboo search based algorithm is developed to find Pareto optimal solutions in multiple objective optimization problems. The developed algorithm has been tested with a number of problems and compared with other techniques. Results obtained from this work have proved that a taboo search based algorithm can find Pareto optimal solutions in MOO effectively.     

Archery Algorithm: A Novel Stochastic Optimization Algorithm for Solving Optimization Problems

Finding a suitable solution to an optimization problem designed in science is a major challenge. Therefore, these must be addressed utilizing proper approaches. Based on a random search space, optimization algorithms can find acceptable solutions to problems. Archery Algorithm (AA) is a new stochastic approach for addressing optimization problems that is discussed in this study. The fundamental idea of developing the suggested AA is to imitate the archer's shooting behavior toward the target panel. The proposed algorithm updates the location of each member of the population in each dimension of the search space by a member randomly marked by the archer. The AA is mathematically described, and its capacity to solve optimization problems is evaluated on twenty-three distinct types of objective functions. Furthermore, the proposed algorithm's performance is compared vs. eight approaches, including teaching-learning based optimization, marine predators algorithm, genetic algorithm, grey wolf optimization, particle swarm optimization, whale optimization algorithm, gravitational search algorithm, and tunicate swarm algorithm. According to the simulation findings, the AA has a good capacity to tackle optimization issues in both unimodal and multimodal scenarios, and it can give adequate quasi-optimal solutions to these problems. The analysis and comparison of competing algorithms’ performance with the proposed algorithm demonstrates the superiority and competitiveness of the AA.     

Flower Pollination Heuristics for Nonlinear Active Noise Control Systems

Abstract In this paper, a novel design of the flower pollination algorithm is presented for model identification problems in nonlinear active noise control systems. The recently introduced flower pollination based heuristics is implemented to minimize the mean squared error based merit/cost function representing the scenarios of active noise control system with linear/nonlinear and primary/secondary paths based on the sinusoidal signal, random and complex random signals as noise interferences. The flower pollination heuristics based active noise controllers are formulated through exploitation of nonlinear filtering with Volterra series. The comparative study on statistical observations in terms of accuracy, convergence and complexity measures demonstrates that the proposed meta-heuristic of flower pollination algorithm is reliable, accurate, stable as well as robust for active noise control system. The accuracy of the proposed nature inspired computing of flower pollination is in good agreement with the state of the art counterpart solvers based on variants of genetic algorithms, particle swarm optimization, backtracking search optimization algorithm, fireworks optimization algorithm along with their memetic combination with local search methodologies. Moreover, the central tendency and variation based statistical indices further validate the consistency and reliability of the proposed scheme mimic the mathematical model for the process of flower pollination systems.     

Skill Optimization Algorithm: A New Human-Based Metaheuristic Technique

Metaheuristic algorithms are widely used in solving optimization problems. In this paper, a new metaheuristic algorithm called Skill Optimization Algorithm (SOA) is proposed to solve optimization problems. The fundamental inspiration in designing SOA is human efforts to acquire and improve skills. Various stages of SOA are mathematically modeled in two phases, including: (i) exploration, skill acquisition from experts and (ii) exploitation, skill improvement based on practice and individual effort. The efficiency of SOA in optimization applications is analyzed through testing this algorithm on a set of twenty-three standard benchmark functions of a variety of unimodal, high-dimensional multimodal, and fixed-dimensional multimodal types. The optimization results show that SOA, by balancing exploration and exploitation, is able to provide good performance and appropriate solutions for optimization problems. In addition, the performance of SOA in optimization is compared with ten metaheuristic algorithms to evaluate the quality of the results obtained by the proposed approach. Analysis and comparison of the obtained simulation results show that the proposed SOA has a superior performance over the considered algorithms and achieves much more competitive results.     

A weight-based multiobjective immune algorithm: WBMOIA

A novel immune algorithm is suggested for finding Pareto-optimal solutions to multiobjective optimization problems based on opt-aiNET, the artificial immune system algorithm for multi-modal optimization. In the proposed algorithm, a randomly weighted sum of multiple objectives is used as a fitness function, and a local search algorithm is incorporated to facilitate the exploitation of the search space. Specifically, a new truncation algorithm with similar individuals (TASI) is proposed to preserve the diversity of the population. Also, a new selection operator is presented to create the new population based on TASI. Simulation results on seven standard problems (ZDT2, ZDT6, DEB, VNT, BNH, OSY and KIT) show that the proposed algorithm is able to find a much better spread of solutions and better convergence near the true Pareto-optimal front compared to the vector immune algorithm and the elitist non-dominated sorting genetic system.     

Co-evolutionary algorithm: An efficient approach for bilevel programming problems

The bilevel programming problem involves two optimization problems, which is hierarchical, strongly NP-hard and very challenging for most existing optimization approaches. An efficient universal co-evolutionary algorithm is developed in this article to deal with various bilevel programming problems. In the proposed algorithm, evolutionary algorithms are used to explore the leader's and the follower's decision-making spaces interactively. Unlike other existing approaches, in the suggested procedure the follower's problem is solved in two phases. First, an evolutionary algorithm is run for a few generations to obtain an approximation of lower level solutions. In the second phase, from all approximate solutions obtained above, only a small number of good points are selected and evolved again by a newly designed multi-criteria evolutionary algorithm. The technique refines some candidate solutions and can efficiently reduce the computational cost of obtaining feasible solutions. Proof-of-principle experiments demonstrate the efficiency of the proposed approach.     

A new multi-objective particle swarm optimizer using empirical movement and diversified search strategies

Most real-world optimization problems involve the optimization task of more than a single objective function and, therefore, require a great amount of computational effort as the solution procedure is designed to anchor multiple compromised optimal solutions. Abundant multi-objective evolutionary algorithms (MOEAs) for multi-objective optimization have appeared in the literature over the past two decades. In this article, a new proposal by means of particle swarm optimization is addressed for solving multi-objective optimization problems. The proposed algorithm is constructed based on the concept of Pareto dominance, taking both the diversified search and empirical movement strategies into account. The proposed particle swarm MOEA with these two strategies is thus dubbed the empirical-movement diversified-search multi-objective particle swarm optimizer (EMDS-MOPSO). Its performance is assessed in terms of a suite of standard benchmark functions taken from the literature and compared to other four state-of-the-art MOEAs. The computational results demonstrate that the proposed algorithm shows great promise in solving multi-objective optimization problems.     

基于改进烟花算法的传感器动态特性补偿方法研究

为了提高传感器的动态测量精度,提出了一种基于改进烟花算法的动态补偿器设计方法。依据传感器输入输出的动态标定数据,运用改进后的烟花算法逆向建模获取动态补偿滤波器,以改善原传感器系统的动态性能。经仿真实验测试,验证了该方法的可行性。将方法应用于科氏质量流量计变送器的动态补偿测试。实验结果表明,基于改进烟花算法的动态补偿方法可以有效提高科氏质量流量计变送器的动态特性,动态响应时间减小了将近90%。     

A SIMULATED ANNEALING ALGORITHM FOR MULTIOBJECTIVE OPTIMIZATION

This paper describes a novel implementation of the Simulated Annealing algorithm designed to explore the trade-off between multiple objectives in optimization problems. During search, the algorithm maintains and updates an archive of non-dominated solutions between each of the competing objectives. At the end of search, the final archive corresponds to a number of optimal solutions from which the designer may choose a particular configuration. A new acceptance probability formulation based on an annealing schedule with multiple temperatures (one for each objective) is proposed along with a novel restart strategy. The performance of the algorithm is demonstrated on three examples. It is concluded that the proposed algorithm offers an effective and easily implemented method for exploring the trade-off in multiobjective optimization problems.     

增强差异演化算法及其应用

针对约束优化问题,提出一种适于约束优化的增强差异演化算法(enhanced differential evolution algorithm for constrained optimization, ECDE).在约束处理上采用不可行域与可行域更新规则的方法,避免了传统的惩罚函数方法中对惩罚因子的设置,使算法的实现变得简单.改进了DE算法的变异操作,对选择的3个父代个体进行操作遍历,产生6个候选解,取适应值最优的为变异操作的解,大大改善了算法的稳定性、鲁棒性和搜索性能.通过4个测试函数和1个设计实例仿真,表明所提出的算法具有较快的收敛速度和较好的稳定性和鲁棒性.     

Multiple colony ant algorithm for job-shop scheduling problem

Ant colony optimization (ACO) is a metaheuristic that takes inspiration from the foraging behaviour of a real ant colony to solve the optimization problem. This paper presents a multiple colony ant algorithm to solve the Job-shop Scheduling Problem with the objective that minimizes the makespan. In a multiple colony ant algorithm, ants cooperate to find good solutions by exchanging information among colonies which are stored in a master pheromone matrix that serves the role of global memory. The exploration of the search space in each colony is guided by different heuristic information. Several specific features are introduced in the algorithm in order to improve the efficiency of the search. Among others is the local search method by which the ant can fine-tune their neighbourhood solutions. The proposed algorithm is tested over set of benchmark problems and the computational results demonstrate that the multiple colony ant algorithm performs well on the benchmark problems.     

A Hopfield Neural Network Approach to the Dual Response Problem

The application of neural networks to optimization problems has been an active research area since the early 1980s. Unconstrained optimization, constrained optimization and combinatorial optimization problems have been solved using neural networks. This study presents a new approach using Hopfield neural networks (HNNs) for solving the dual response system (DRS) problems. The major aim of the proposed method is to produce a string of solutions, rather than a ‘one‐shot’ optimum solution, to make the trade‐offs available between the mean and standard deviation responses. This gives more flexibility to the decision‐maker in exploring alternative solutions. The proposed method has been tested on two examples. The HNN results are very close to those obtained by using the NIMBUS (Nondifferentiable Interactive Multiobjective Bundle‐based Optimization System) algorithm. Choosing an appropriate solution method for a certain multi‐objective optimization problem is not easy, as has been made abundantly clear. Unlike the NIMBUS method, the HNN approach does not set any specific assumptions on the behaviour or the preference structure of the decision maker. As a result, the proposed method will still work and generate alternative solutions whether or not the decision maker has enough time and capabilities for co‐operation. Copyright © 2005 John Wiley & Sons, Ltd.     

AMGA2: improving the performance of the archive-based micro-genetic algorithm for multi-objective optimization

In this article, an improved Archive-based Micro Genetic Algorithm (referred to as AMGA2) for constrained multi-objective optimization is proposed. AMGA2 is designed to obtain fast and reliable convergence on a wide variety of optimization problems. AMGA2 benefits from the existing literature in that it borrows and improves upon several concepts from existing multi-objective optimization algorithms. Improvements and modifications to the existing diversity assessment techniques and genetic variation operators are also proposed. AMGA2 employs a new kind of selection strategy that attempts to reduce the probability of exploring less desirable search regions. The proposed AMGA2 is a steady-state genetic algorithm that maintains an external archive of best and diverse solutions and a very small working population. AMGA2 has been designed to facilitate the decoupling of the working population, the external archive, and the number of solutions desired as the outcome of the optimization process. Comprehensive benchmarking and comparison of AMGA2 with the current state-of-the-art multi-objective optimization algorithms demonstrate its improved search capability.     

Dark Forest Algorithm: A Novel Metaheuristic Algorithm for Global Optimization Problems

Metaheuristic algorithms, as effective methods for solving optimization problems, have recently attracted considerable attention in science and engineering fields. They are popular and have broad applications owing to their high efficiency and low complexity. These algorithms are generally based on the behaviors observed in nature, physical sciences, or humans. This study proposes a novel metaheuristic algorithm called dark forest algorithm (DFA), which can yield improved optimization results for global optimization problems. In DFA, the population is divided into four groups: highest civilization, advanced civilization, normal civilization, and low civilization. Each civilization has a unique way of iteration. To verify DFA’s capability, the performance of DFA on 35 well-known benchmark functions is compared with that of six other metaheuristic algorithms, including artificial bee colony algorithm, firefly algorithm, grey wolf optimizer, harmony search algorithm, grasshopper optimization algorithm, and whale optimization algorithm. The results show that DFA provides solutions with improved efficiency for problems with low dimensions and outperforms most other algorithms when solving high dimensional problems. DFA is applied to five engineering projects to demonstrate its applicability. The results show that the performance of DFA is competitive to that of current well-known metaheuristic algorithms. Finally, potential upgrading routes for DFA are proposed as possible future developments.     

Simultaneous topology,shape and size optimization of truss structures by fully stressed design based on evolution strategy

The most effective scheme of truss optimization considers the combined effect of topology, shape and size (TSS); however, most available studies on truss optimization by metaheuristics concentrated on one or two of the above aspects. The presence of diverse design variables and constraints in TSS optimization may account for such limited applicability of metaheuristics to this field. In this article, a recently proposed algorithm for simultaneous shape and size optimization, fully stressed design based on evolution strategy (FSD-ES), is enhanced to handle TSS optimization problems. FSD-ES combines advantages of the well-known deterministic approach of fully stressed design with potential global search of the state-of-the-art evolution strategy. A comparison of results demonstrates that the proposed optimizer reaches the same or similar solutions faster and/or is able to find lighter designs than those previously reported in the literature. Moreover, the proposed variant of FSD-ES requires no user-based tuning effort, which is desired in a practical application. The proposed methodology has been tested on a number of problems and is now ready to be applied to more complex TSS problems.     

A particle swarm optimizer for constrained multi-objective engineering design problems

This article presents a particle swarm optimizer (PSO) capable of handling constrained multi-objective optimization problems. The latter occur frequently in engineering design, especially when cost and performance are simultaneously optimized. The proposed algorithm combines the swarm intelligence fundamentals with elements from bio-inspired algorithms. A distinctive feature of the algorithm is the utilization of an arithmetic recombination operator, which allows interaction between non-dominated particles. Furthermore, there is no utilization of an external archive to store optimal solutions. The PSO algorithm is applied to multi-objective optimization benchmark problems and also to constrained multi-objective engineering design problems. The algorithmic effectiveness is demonstrated through comparisons of the PSO results with those obtained from other evolutionary optimization algorithms. The proposed particle swarm optimizer was able to perform in a very satisfactory manner in problems with multiple constraints and/or high dimensionality. Promising results were also obtained for a multi-objective engineering design problem with mixed variables.     

A Bound Heuristic Technique for Solving DRAMA Spares Optimizations

1IntroductionTodaythePublicrequiresthatallcomplexellgilleering,suchasatomicPOwerplants,airCrafl,automobilesandcomputer,etc.,behighlyreliable.Generally,tilesystemsarerepairableinventorysystemsthatarecomposedofitemswhicharerepairedalldretUrnedtouseratherthandiscarded.TherepairableinventoryProblemistypicallyconcernedwilhtheoptimalstockingofpartsatbases(orforwardlocations)andacentereddelx)t1'llcilitywhichrepairedunitsreturnedfromthehaseswhileprovidingsomePredeterminedlevelofservice.Themathemati…