Study on Multi-stream Heat Exchanger Network Synthesis with Parallel Genetic/Simulated Annealing Algorithm

The multi-stream heat exchanger network synthesis (HENS) problem can be formulated as a mixed integer nonlinear programming model according to Yee et al. Its nonconvexity nature leads to existence of more than one optimum and computational difficulty for traditional algorithms to find the global optimum. Compared with deterministic algorithms, evolutionary computation provides a promising approach to tackle this problem. In this paper, a mathematical model of multi-stream heat exchangers network synthesis problem is setup. Different from the assumption of isothermal mixing of stream splits and thus linearity constraints of Yee et al., non-isothermal mixing is supported. As a consequence, nonlinear constraints are resulted and nonconvexity of the objective function is added. To solve the mathematical model, an algorithm named GA/SA (parallel genetic/simulated annealing algorithm) is detailed for application to the multi-stream heat exchanger network synthesis problem. The performance of the proposed approach is demonstrated with three examples and the obtained solutions indicate the presented approach is effective for multi-stream HENS.

Using genetic/simulated annealing algorithm to solve disassembly sequence planning

Disassembly sequence planning （DSP） plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassembly sequence planning problems efficiently, a product disassembly hybrid graph model, which describes the connection, non-connection and precedence relationships between the product parts, is established based on the characteristic of disassembly. Farther, the optimization model is provided to optimize disassembly sequence. And the solution methodology based on the genetic/simulated annealing algorithm with binaxy-tree algorithm is given. Finally, an example is analyzed in detail, and the result shows that the model is correct and efficient.

Simulated annealing algorithm for detecting graph isomorphism

Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem （GIP） is a nondeterministic polynomial problem. A simulated annealing （SA） algorithm for detecting graph isomorphism is proposed, and the proposed SA algorithm is well suited to deal with random graphs with large size. To verify the validity of the proposed SA algorithm, simulations are performed on three pairs of small graphs and four pairs of large random graphs with edge densities 0.5, 0.1, and 0.01, respectively. The simulation results show that the proposed SA algorithm can detect graph isomorphism with a high probability.

Annealing Harmony Search Algorithm to Solve the Nurse Rostering Problem

A real-life problem is the rostering of nurses at hospitals.It is a famous nondeterministic,polynomial time(NP)-hard combinatorial optimization problem.Handling the real-world nurse rostering problem(NRP)constraints in distributing workload equally between available nurses is still a difficult task to achieve.The international shortage of nurses,in addition to the spread of COVID-19,has made it more difficult to provide convenient rosters for nurses.Based on the literature,heuristic-based methods are the most commonly used methods to solve the NRP due to its computational complexity,especially for large rosters.Heuristic-based algorithms in general have problems striking the balance between diversification and intensification.Therefore,this paper aims to introduce a novel metaheuristic hybridization that combines the enhanced harmony search algorithm(EHSA)with the simulated annealing(SA)algorithm called the annealing harmony search algorithm(AHSA).The AHSA is used to solve NRP from a Malaysian hospital.The AHSA performance is compared to the EHSA,climbing harmony search algorithm(CHSA),deluge harmony search algorithm(DHSA),and harmony annealing search algorithm(HAS).The results show that the AHSA performs better than the other compared algorithms for all the tested instances where the best ever results reported for the UKMMC dataset.

A Hybrid Algorithm Based on Comprehensive Search Mechanisms for Job Shop Scheduling Problem

The research on complex workshop scheduling methods has important academic significance and has wide applications in industrial manufacturing.Aiming at the job shop scheduling problem,a hybrid algorithm based on comprehensive search mechanisms(HACSM)is proposed to optimize the maximum completion time.HACSM combines three search methods with different optimization scales,including fireworks algorithm(FW),extended Akers graphical method(LS1+_AKERS_EXT),and tabu search algorithm(TS).FW realizes global search through information interaction and resource allocation,ensuring the diversity of the population.LS1+_AKERS_EXT realizes compound movement with Akers graphical method,so it has advanced global and local search capabilities.In LS1+_AKERS_EXT,the shortest path is the core of the algorithm,which directly affects the encoding and decoding of scheduling.In order to find the shortest path,an effective node expansion method is designed to improve the node expansion efficiency.In the part of centralized search,TS based on the neighborhood structure is used.Finally,the effectiveness and superiority of HACSM are verified by testing the relevant instances in the literature.

Identification of vibration loads on hydro generator by using hybrid genetic algorithm

Vibration dynamic characteristics have been a major issue in the modeling and mechanical analysis of large hydro generators. An algorithm is developed for identifying vibration dynamic characteristics by means of hybrid genetic algorithm. From the measured dynamic responses of a hydro generator, an appropriate estimation algorithm is needed to identify the loading parameters, including the main frequencies and amplitudes of vibrating forces. In order to identify parameters in an efficient and robust manner, an optimization method is proposed that combines genetic algorithm with simulated annealing and elitist strategy. The hybrid genetic algorithm is then used to tackle an ill-posed problem of parameter identification, in which the effectiveness of the proposed optimization method is confirmed by its comparison with actual observation data.

No Fit Polygon for Nesting Problem Solving with Hybridizing Ant Algorithms

In design science, these two kinds of problems are mutually nested, however, the nesting could not blind us for the fact that their problem-solving and solution justification methods are different. The ant algorithms research field, builds on the idea that the study of the behavior of ant colonies or other social insects is interesting, because it provides models of distributed organization which could be utilized as a source of inspiration for the design of optimization and distributed control algorithms. In this paper, a relatively new type of hybridizing ant search algorithm is developed, and the results are compared against other algorithms. The intelligence of this heuristic approach is not portrayed by individual ants, but rather is expressed by the colony as a whole inspired by labor division and brood sorting. This solution obtained by this method will be evaluated against the one obtained by other traditional heuristics.

Age estimation from facial images based on Gabor feature fusion and the CIASO-SA algorithm

Aiming at the problem of long time-consuming and low accuracy of existing age estimation approaches,a new age estimation method using Gabor feature fusion,and an improved atomic search algorithm for feature selection is proposed.Firstly,texture features of five scales and eight directions in the face region are extracted by Gabor wavelet transform.The statistical histogram is introduced to encode and fuse the directional index with the largest feature value on Gabor scales.Secondly,a new hybrid feature selection algorithm chaotic improved atom search optimisation with simulated annealing(CIASO-SA)is presented,which is based on an improved atomic search algorithm and the simulated annealing algorithm.Besides,the CIASO-SA algorithm introduces a chaos mechanism during atomic initialisation,significantly improving the convergence speed and accuracy of the algorithm.Finally,a support vector machine(SVM)is used to get classification results of the age group.To verify the performance of the proposed algorithm,face images with three resolutions in the Adience dataset are tested.Using the Gabor real part fusion feature at 48�48 resolution,the average accuracy and 1-off accuracy of age classification exhibit a maximum of 60.4%and 85.9%,respectively.Obtained results prove the superiority of the proposed algorithm over the state-of-the-art methods,which is of great referential value for application to the mobile terminals.

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.

基于LocalSearch的智能货运路线匹配设计与实现

传统物流行业中,货主需要向全国各个省市区发送货物,存在上千条线路。这就导致了货主每次招标时都要对这些线路的报价进行计算后选择2~3家承运商,靠手工Excel填写统计计算非常浪费时间。为了解决这个问题,设计并实现了基于LocalSearch的智能货运路线匹配系统,通过采用退火模拟和禁忌搜索等方式,能够在极短的时间内计算一个满足货主复杂招标要求的近似最优解,且计算结果要比手工计算优于20%以上,有助于节约人力成本,降低运费。

基于改进蚁群算法的邮船舱室模块移运路径规划

针对大型邮船舱室模块运输过程中存在的移运路线长、路线混乱、舱室模块易与障碍物发生碰撞等问题,提出应用加入动态搜索模型的蚁群算法对邮船舱室模块进行路线规划,为运输舱室模块提供清晰、便捷的移运路线。对主竖区的障碍物进行分析,建立模拟实际工况的栅格地图,采用改进蚁群算法寻找移运路径。对不同位置所经过的栅格地图和蚁群数量进行动态调整。采用模拟退火算法寻找蚁群算法的参数。采用离散点分析确定移运路径的主、支通道。仿真试验结果表明,应用改进蚁群算法建立主、支通道进行舱室模块移运可有效提高舱室模块的运输效率。

多能源混合车队生鲜品配送车辆路径问题研究

针对同时考虑取送货和分时电价的电动车与燃油车混合车队车辆路径问题,以车辆固定成本、行驶成本、制冷成本、货损成本、时间窗成本、碳排放成本和充电成本之和最小为目标,构建生鲜品配送车辆路径优化模型,设计融合邻域搜索的遗传模拟退火混合算法并求解。结果表明:相比于取送分离,同时取送货模式能够显著提升配送效率,提高车辆装载率;通过技术升级适当增加电动车的电池容量,能够弱化车辆路径方案对充电设施的依赖程度,有效降低配送成本;通过与遗传算法、遗传变邻域混合算法运行结果对比,验证本文算法的有效性,为冷链物流企业在配送环节实现节能减排、降本增效提供借鉴和参考。

机组优化组合问题的随机tabu搜索算法

针对机组组合问题的特点,作者对tabu搜索策略和模拟退火算法(SA)的组合算法随机tabu搜索策略的编码方式、移动规则和tabu表的构造等作了适应性的改进,并对实际机组组合算例进行了求解。仿真结果表明,tabu-SA组合算法有效地结合了SA算法的大规模寻优特性和tabu搜索的局部搜索能力强的特点,能快速搜索到高质量的系统优化解。而且随机tabu搜索算法具有框架性算法不易陷入局部最优的特点,易于与其他算法结合来构造新的高效组合算法。

基于Levant微分器的磁浮球控制算法研究

针对永磁电磁混合悬浮系统控制中因信号突变和噪声干扰引起的控制效果不理想等问题,提出一种改进型Levant微分器和PID相结合的控制方法(improve Levant-PID,ILevant-PID)。融合PID控制适应性强和Levant微分器对输入噪声的鲁棒特性优势,解决系统输出抖振问题,利用模拟退火-粒子群优化解决ILevant-PID控制器参数多、关联性强等制约问题。仿真实验表明:与传统PID控制方法相比,ILevant-PID控制方法在阶跃输入下,启动更为平缓,调节时间减小了41.19%,超调量减小了40.36%。ILevant-PID控制器在阶跃输入时有无噪声条件下的稳态误差分别为±0.37 mm及±0.23 mm,相对于PID降低了87%以上。在跟踪方波输入时,ILevant-PID可实现PID无法对8 mm给定信号无超调跟踪,较好地改善PEMS(permanent magnet electro magnetic hybrid suspension)系统控制性能。

Tabu搜索法在森林采伐量优化问题中的应用

介绍了一种新颖高效的启迪式搜索方式———Tabu搜索法。以一个杉木人工林采伐量方案的优化为例,介绍了Tabu搜索法的基本原理和应用方法,并把Tabu搜索法与线性规划、模拟退火和遗传算法处理同一森林采伐量优化方案例子获得的结果进行了比较。结果表明,禁忌搜索法在解决一般森林采伐量优化问题时有快速高效的特点,尤其是在移动产生的相邻解数目有限且差异较大的情况下,可以很快获得模拟退火和遗传算法多次重复计算也较难达到的高目标方程值。禁忌周期对Tabu搜索法的影响比较小,寻找好的移动方式和排序方式是影响Tabu搜索法效率的关键。

两种高效局部搜索算法求解RB模型实例

RB(revised B)模型是一种在约束可满足问题中具备精确相变增长域的随机实例模型,提出两种高效的启发式局部搜索算法用于解决RB模型生成的大值域约束可满足问题。首先为基于权重指导搜索的W-MCH算法,该算法通过约束判断和违反约束数计分来进行搜索,并引入了基于约束违反概率的权重计算公式,根据其关联的约束权重进行修正,再对变量进行迭代调整。然后提出最小化值域的MDMCH算法,该算法通过记录违反约束和逐步消除已违反约束变量的启发式策略来减少搜索空间,并在最小化后的变量域内重新校准变量赋值,进而有效提高算法的收敛速度。此外,还提出了融入模拟退火策略的WSCH和MDSCH算法,这两种算法都能根据变量的表征特点对变量域进行针对性的搜索。实验结果表明,与多种启发式算法相比,这两种算法在精度与时间效率方面均呈现明显提升,在复杂难解的实例中能够提供高效的求解效率,验证了算法的有效性和优越性。

混合云环境面向安全科学工作流数据布局策略

为解决混合云环境下科学工作流数据布局问题,在考虑数据的安全需求的前提下,以优化跨数据中心传输时延为目标,提出了一种混合云环境下面向安全的科学工作流布局策略。分析数据集的安全需求以及数据中心所能提供的安全服务,提出安全等级分级规则;设计并提出基于遗传算法和模拟退火算法的自适应粒子群优化算法(adaptive particle swarm optimization algorithm based on SA and GA,SAGA-PSO),避免算法陷入局部极值,有效提高种群多样性;与其它经典布局算法对比,基于SAGA-PSO的数据布局策略在满足数据安全需求的同时能够大大降低传输时延。

求解最小支配集问题的禁忌遗传混合算法

将最小支配集问题转换为一系列判定问题k支配集问题,并提出一种禁忌遗传混合算法对k-DS问题进行求解。此算法将禁忌搜索算法和遗传算法两种启发式算法结合起来,互补不足。高效的邻域结构保证了算法的运行效率,禁忌策略防止算法过早陷入局部最优陷阱,遗传算法框架进一步增强了算法的疏散性。经过与现有求解最小支配集算法的结果进行分析比较,禁忌遗传混合算法的结果较其它算法更优。

考虑潮汐和泊位偏好的连续型泊位分配优化

由于潮汐因素对船舶进出港口航道有影响,以及船舶偏离偏好泊位也对船舶处理时间有影响,所以研究连续型泊位分配问题要综合考虑潮汐与偏好泊位两个因素的影响。以计划期内所有到港船舶的总时间最小为目标,将偏好泊靠点作为约束条件构建混合整数线性规划模型,并设计模拟退火遗传混合算法进行求解。该混合算法将遗传算法的全局搜索能力与模拟退火的局部搜索能力相结合,提升了算法的搜索效率。通过算例求解验证了算法和模型的有效性。

考虑混合工艺的自动化码头多设备资源协同调度优化模型和算法设计

Considering the uncertainty of the speed of horizontal transportation equipment,a cooperative scheduling model of multiple equipment resources in the automated container terminal was constructed to minimize the completion time,thus improving the loading and unloading efficiencies of automated container terminals.The proposed model integrated the two loading and unloading processes of“double-trolley quay crane+AGV+ARMG”and“single-trolley quay crane+container truck+ARMG”and then designed the simulated annealing particle swarm algorithm to solve the model.By comparing the results of the particle swarm algorithm and genetic algorithm,the algorithm designed in this paper could effectively improve the global and local space search capability of finding the optimal solution.Furthermore,the results showed that the proposed method of collaborative scheduling of multiple equipment resources in automated terminals considering hybrid processes effectively improved the loading and unloading efficiencies of automated container terminals.The findings of this study provide a reference for the improvement of loading and unloading processes as well as coordinated scheduling in automated terminals.