A hybrid genetic-simulated annealing algorithm for optimization of hydraulic manifold blocks

This paper establishes a mathematical model of multi-objective optimization with behavior constraints in solid space based on the problem of optimal design of hydraulic manifold blocks （HMB）. Due to the limitation of its local search ability of genetic algorithm （GA） in solving a massive combinatorial optimization problem, simulated annealing （SA） is combined, the multi-parameter concatenated coding is adopted, and the memory function is added. Thus a hybrid genetic-simulated annealing with memory function is formed. Examples show that the modified algorithm can improve the local search ability in the solution space, and the solution quality.

Optimization of the seismic processing phase-shift plus finite-difference migration operator based on a hybrid genetic and simulated annealing algorithm

Although the phase-shift seismic processing method has characteristics of high accuracy, good stability, high efficiency, and high-dip imaging, it is not able to adapt to strong lateral velocity variation. To overcome this defect, a finite-difference method in the frequency-space domain is introduced in the migration process, because it can adapt to strong lateral velocity variation and the coefficient is optimized by a hybrid genetic and simulated annealing algorithm. The two measures improve the precision of the approximation dispersion equation. Thus, the imaging effect is improved for areas of high-dip structure and strong lateral velocity variation. The migration imaging of a 2-D SEG/EAGE salt dome model proves that a better imaging effect in these areas is achieved by optimized phase-shift migration operator plus a finite-difference method based on a hybrid genetic and simulated annealing algorithm. The method proposed in this paper is better than conventional methods in imaging of areas of high-dip angle and strong lateral velocity variation.

Compound Genetics Annealing Optimal Algorithm for Realization of Locus Deduction of a Plane Link

A compound algorithm of genetic annealing is designed for optimizing the luffing mechanism locus of a plane link by means of random optimal algorithm, genetic and annealing algorithm. The computing experiment shows that the algorithm has much better steady convergence performance of optimal process and can hunt out the global optimal solution by biggish probability for objective function of multi peak value.

Revenue Optimization of Pipelines Construction and Operation Management Based on Quantum Genetic Algorithm and Simulated Annealing Algorithm

For the optimization of pipelines, most researchers are mainly concerned with designing the most reasonable section to meet the requirements of strength and stiffness, and at the same time reduce the cost as much as possible. It is undeniable that they do achieve this goal by using the lowest cost in design phase to achieve maximum benefits. However, for pipelines, the cost and incomes of operation management are far greater than those in design phase. Therefore, the novelty of this paper is to propose an optimization model that considers the costs and incomes of the construction and operation phases, and combines them into one model. By comparing three optimization algorithms (genetic algorithm, quantum genetic algorithm and simulated annealing algorithm), the same optimization problem is solved. Then the most suitable algorithm is selected and the optimal solution is obtained, which provides reference for construction and operation management during the whole life cycle of pipelines.

A Computational Comparison between Optimization Techniques for Wells Placement Problem: Mathematical Formulations, Genetic Algorithms and Very Fast Simulated Annealing

This study considers several computational techniques for solving one formulation of the wells placement problem (WPP). Usually the wells placement problem is tackled through the combined efforts of many teams using conventional approaches, which include gathering seismic data, conducting real-time surveys, and performing production interpretations in order to define the sweet spots. This work considers one formulation of the wells placement problem in heterogeneous reservoirs with constraints on inter-well spacing. The performance of three different types of algorithms for optimizing the well placement problem is compared. These three techniques are: genetic algorithm, simulated annealing, and mixed integer programming (IP). Example case studies show that integer programming is the best approach in terms of reaching the global optimum. However, in many cases, the other approaches can often reach a close to optimal solution with much more computational efficiency.

Investigation into the Computational Costs of Using Genetic Algorithm and Simulated Annealing for the Optimization of Explicit Friction Factor Models

Research reports show that the accuracies of many explicit friction factor models, having different levels of accuracies and complexities, have been improved using genetic algorithm (GA), a global optimization approach. However, the computational cost associated with the use of GA has yet to be discussed. In this study, the parameters of sixteen explicit models for the estimation of friction factor in the turbulent flow regime were optimized using two popular global search methods namely genetic algorithm (GA) and simulated annealing (SA). Based on 1000 interval values of Reynolds number (Re) in the range of and 100 interval values of relative roughness () in the range of , corresponding friction factor (f) data were obtained by solving Colebrook-White equation using Microsoft Excel spreadsheet. These data were then used to modify the parameters of the selected explicit models. Although both GA and SA led to either moderate or significant improvements in the accuracies of the existing friction factor models, SA outperforms the GA. Moreover, the SA requires far less computational time than the GA to complete the corresponding optimization process. It can therefore be concluded that SA is a better global optimizer than GA in the process of finding an improved explicit friction factor model as an alternative to the implicit Colebrook-White equation in the turbulent flow regime.

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

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.

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

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 algo- rithm 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.

Optimization of Cognitive Radio System Using Enhanced Firefly Algorithm

The optimization of cognitive radio(CR)system using an enhanced firefly algorithm(EFA)is presented in this work.The Firefly algorithm(FA)is a nature-inspired algorithm based on the unique light-flashing behavior of fireflies.It has already proved its competence in various optimization prob-lems,but it suffers from slow convergence issues.To improve the convergence performance of FA,a new variant named EFA is proposed.The effectiveness of EFA as a good optimizer is demonstrated by optimizing benchmark functions,and simulation results show its superior performance compared to biogeography-based optimization(BBO),bat algorithm,artificial bee colony,and FA.As an application of this algorithm to real-world problems,EFA is also applied to optimize the CR system.CR is a revolutionary technique that uses a dynamic spectrum allocation strategy to solve the spectrum scarcity problem.However,it requires optimization to meet specific performance objectives.The results obtained by EFA in CR system optimization are compared with results in the literature of BBO,simulated annealing,and genetic algorithm.Statistical results further prove that the proposed algorithm is highly efficient and provides superior results.

Optimal design of pressure vessel using an improved genetic algorithm

As the idea of simulated annealing (SA) is introduced into the fitness function, an improved genetic algorithm (GA) is proposed to perform the optimal design of a pressure vessel which aims to attain the minimum weight under burst pressure con- straint. The actual burst pressure is calculated using the arc-length and restart analysis in finite element analysis (FEA). A penalty function in the fitness function is proposed to deal with the constrained problem. The effects of the population size and the number of generations in the GA on the weight and burst pressure of the vessel are explored. The optimization results using the proposed GA are also compared with those using the simple GA and the conventional Monte Carlo method.

Hybrid Optimization Based PID Controller Design for Unstable System

PID controllers play an important function in determining tuning para-meters in any process sector to deliver optimal and resilient performance for non-linear,stable and unstable processes.The effectiveness of the presented hybrid metaheuristic algorithms for a class of time-delayed unstable systems is described in this study when applicable to the problems of PID controller and Smith PID controller.The Direct Multi Search(DMS)algorithm is utilised in this research to combine the local search ability of global heuristic algorithms to tune a PID controller for a time-delayed unstable process model.A Metaheuristics Algorithm such as,SA(Simulated Annealing),MBBO(Modified Biogeography Based Opti-mization),BBO(Biogeography Based Optimization),PBIL(Population Based Incremental Learning),ES(Evolution Strategy),StudGA(Stud Genetic Algo-rithms),PSO(Particle Swarm Optimization),StudGA(Stud Genetic Algorithms),ES(Evolution Strategy),PSO(Particle Swarm Optimization)and ACO(Ant Col-ony Optimization)are used to tune the PID controller and Smith predictor design.The effectiveness of the suggested algorithms DMS-SA,DMS-BBO,DMS-MBBO,DMS-PBIL,DMS-StudGA,DMS-ES,DMS-ACO,and DMS-PSO for a class of dead-time structures employing PID controller and Smith predictor design controllers is illustrated using unit step set point response.When compared to other optimizations,the suggested hybrid metaheuristics approach improves the time response analysis when extended to the problem of smith predictor and PID controller designed tuning.

Research on Optimization of Dual-Resource Batch Scheduling in Flexible Job Shop

With the rapid development of intelligent manufacturing and the changes in market demand,the current manufacturing industry presents the characteristics of multi-varieties,small batches,customization,and a short production cycle,with the whole production process having certain flexibility.In this paper,a mathematical model is established with the minimum production cycle as the optimization objective for the dual-resource batch scheduling of the flexible job shop,and an improved nested optimization algorithm is designed to solve the problem.The outer layer batch optimization problem is solved by the improved simulated annealing algorithm.The inner double resource scheduling problem is solved by the improved adaptive genetic algorithm,the double coding scheme,and the decoding scheme of Automated Guided Vehicle(AGV)scheduling based on the scheduling rules.The time consumption of collision-free paths is solved with the path planning algorithm which uses the Dijkstra algorithm based on a time window.Finally,the effectiveness of the algorithm is verified by actual cases,and the influence of AGV with different configurations on workshop production efficiency is analyzed.

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

Identical parallel machine scheduling problem for minimizing the makespan is a very important production scheduling problem. When its scale is large, many difficulties will arise in the course of solving identical parallel machine scheduling problem. Ant system based optimization algorithm (ASBOA) has shown great advantages in solving the combinatorial optimization problem in view of its characteristics of high efficiency and suitability for practical applications. An ASBOA for minimizing the makespan in identical machine scheduling problem is presented. Two different scale numerical examples demonstrate that the ASBOA proposed is efficient and fit for large-scale identical parallel machine scheduling problem for minimizing the makespan, the quality of its solution has advantages over heuristic procedure and simulated annealing method, as well as genetic algorithm.

Test selection and optimization for PHM based on failure evolution mechanism model

The test selection and optimization （TSO） can improve the abilities of fault diagnosis, prognosis and health-state evalua- tion for prognostics and health management （PHM） systems. Traditionally, TSO mainly focuses on fault detection and isolation, but they cannot provide an effective guide for the design for testability （DFT） to improve the PHM performance level. To solve the problem, a model of TSO for PHM systems is proposed. Firstly, through integrating the characteristics of fault severity and propa- gation time, and analyzing the test timing and sensitivity, a testability model based on failure evolution mechanism model （FEMM） for PHM systems is built up. This model describes the fault evolution- test dependency using the fault-symptom parameter matrix and symptom parameter-test matrix. Secondly, a novel method of in- herent testability analysis for PHM systems is developed based on the above information. Having completed the analysis, a TSO model, whose objective is to maximize fault trackability and mini- mize the test cost, is proposed through inherent testability analysis results, and an adaptive simulated annealing genetic algorithm （ASAGA） is introduced to solve the TSO problem. Finally, a case of a centrifugal pump system is used to verify the feasibility and effectiveness of the proposed models and methods. The results show that the proposed technology is important for PHM systems to select and optimize the test set in order to improve their performance level.

Overview of multi-objective optimization methods

To assist readers to have a comprehensive understanding, the classical and intelligent methods roundly based on precursory research achievements are summarized in this paper. First, basic conception and description about multi-objective (MO) optimization are introduced. Then some definitions and related terminologies are given. Furthermore several MO optimization methods including classical and current intelligent methods are discussed one by one succinctly. Finally evaluations on advantages and disadvantages about these methods are made at the end of the paper.

Enhanced Heap-Based Optimizer Algorithm for Solving Team Formation Problem

Team Formation(TF)is considered one of the most significant problems in computer science and optimization.TF is defined as forming the best team of experts in a social network to complete a task with least cost.Many real-world problems,such as task assignment,vehicle routing,nurse scheduling,resource allocation,and airline crew scheduling,are based on the TF problem.TF has been shown to be a Nondeterministic Polynomial time(NP)problem,and high-dimensional problem with several local optima that can be solved using efficient approximation algorithms.This paper proposes two improved swarm-based algorithms for solving team formation problem.The first algorithm,entitled Hybrid Heap-Based Optimizer with Simulated Annealing Algorithm(HBOSA),uses a single crossover operator to improve the performance of a standard heap-based optimizer(HBO)algorithm.It also employs the simulated annealing(SA)approach to improve model convergence and avoid local minima trapping.The second algorithm is the Chaotic Heap-based Optimizer Algorithm(CHBO).CHBO aids in the discovery of new solutions in the search space by directing particles to different regions of the search space.During HBO’s optimization process,a logistic chaotic map is used.The performance of the two proposed algorithms(HBOSA)and(CHBO)is evaluated using thirteen benchmark functions and tested in solving the TF problem with varying number of experts and skills.Furthermore,the proposed algorithms were compared to well-known optimization algorithms such as the Heap-Based Optimizer(HBO),Developed Simulated Annealing(DSA),Particle SwarmOptimization(PSO),GreyWolfOptimization(GWO),and Genetic Algorithm(GA).Finally,the proposed algorithms were applied to a real-world benchmark dataset known as the Internet Movie Database(IMDB).The simulation results revealed that the proposed algorithms outperformed the compared algorithms in terms of efficiency and performance,with fast convergence to the global minimum.

基于取送作业能耗分析的高架低温库货位与尺寸优化

目的减少高架低温库内作业的碳排放,构建出入库效率最大、货架稳定性最高和取送作业能耗最小的货位优化模型。方法从货品存放顺序出发,采用整数编码设计遗传模拟退火算法进行求解,依据案例实际需求及面积选取了3种尺寸的备选方案,并通过MATLAB仿真对比分析各算法的结果,利用BIM建模可视化3种方案的优化结果。结果采用整数编码设计的遗传模拟退火算法较模拟退火算法、遗传算法分别约早41代、148代收敛到最优解,计算效率分别高出21.01%、13.24%,GASA适合解决同种货品集中放置的低温库货位优化问题,建议低温库尺寸长宽比为2.25∶1。结论优化后的货位与尺寸能够有效地降低库内作业的碳排放,保证安全的同时提高出入库效率。

既有地铁线非站站停列车开行方案与越行站设置协同优化研究

研究既有地铁非站站停列车开行方案和越行站设置协同优化对提高线路通过能力和运输效率具有重要意义。将非站站停列车开行方案编制与越行站设置协同考虑,出行乘客以出行OD分类,构建以企业运营成本、乘客出行成本以及列车越行成本最低为目标的既有地铁线非站站停列车开行方案优化模型,考虑线路通过能力及快车停靠等约束,依据模型特点选用遗传模拟退火算法进行模型求解。以西安地铁14号线为例验证构建模型有效性,求解结果表明:与传统的站站停运营组织模式相比,乘客总在车时间降低29.84%,企业运营成本降低4.33%,车底购置成本降低5.23%,同时讨论不同越行站位置选择对企业运营成本的影响,为轨道公司实施非站站停运营组织模式及相关车站改造提供决策支撑。

模拟退火遗传算法在自由曲面数控加工中的实验

在自由曲面的加工中,一直面临着加工时间长的问题,本研究以提高加工效率为目的,通过分析待加工自由曲面的面曲率、残余高度等参数,计算出合理的加工步长和行距,并以此为依据将待加工曲面离散成点云即为刀触点。将刀具路径规划问题转化为求解TSP问题的最优解,为避免遗传算法早熟陷入局部最优解,引入了模拟退火算法进行改进,使用改进后的混合算法进行刀具路径寻优。对优化方法进行了仿真加工、实验加工及测量,结果表明优化方法相比传统方法刀路长度最多减少303.4mm,相对缩短了12.3%,加工效率提升较为明显,并且加工表面也取得了较好的加工效果。

Using genetic algorithm based simulated annealing penalty function to solve groundwater management model

The genetic algorithm (GA) is a global and random search procedure based on the mechanics of natural selection and natural genetics. A new optimization method of the genetic algorithm-based simulated annealing penalty function (GASAPF) is presented to solve groundwater management model. Compared with the traditional gradient-based algorithms, the GA is straightfoward and there is no need to calculate derivatives of the objective function. The GA is able to generate both convex and nonconvex points within the feasible region. It can be sure that the GA converges to the global or at least near-global optimal solution to handle the constraints by simulated annealing technique. Maximum pumping example results show that the GASAPF to solve optimization model is very efficient and robust.