Fuzzy preference-based multi-objective optimization method

Multiobjective evolutionary computation is still quite young and there are many open research problems. This paper is an attempt to design a hybridized Multiobjective Evolutionary Optimization Algorithm with fuzzy logic called Fuzzy Preference-Based Multi–Objective Optimization Method (FPMOM). FPMOM as an integrated components of Multiobjective Optimization Technique, Evolutionary Algorithm and Fuzzy Inference System able to search and filter the pareto-optimal and provide a good trade-off solution for the multiobjective problem using fuzzy inference method to choose the user intuitive based specific trade-off requirement. This paper will provide a new insight into the behaviourism of interactive Multiobjective Evolutionary Algorithm optimization problems using fuzzy inference method.     

一种新的量子群进化算法研究

提出了一种基于量子进化的量子群进化算法，使用量子角表示量子比特的状态，并引入改进的粒子群优化策略，对量子群中各量子的量子角进行自适应动态调整．在对0-1背包问题的求解中，表现出很好的性能．     

基于越库配送车辆调度的混合量子遗传算法(QGA)研究

量子遗传算法(QGA)是将经典的量子理论应用到遗传算法当中,将量子态引入传统比特模型中,一种新型的求解最优问题的算法。越库配送车辆调度是一类经典的组合优化问题,基于量子遗传算法,针对提高物流配送过程中要求的快速和高效的问题,本文研究了一种混合量子遗传算法的框架,提出了解决传统物流调度中的配送优化方案的新思路,研究了新的量子更新和概率调整的策略,使该方法更加贴合物流配送的实际问题,实验结果显示,采用混合量子遗传算法后的性能明显优于传统的量子遗传算法,取得了更高的最佳适应度,具有良好的应用前景。     

混合量子算法及其在flow shop问题中的应用

量子进化算法（QEA）是目前较为独特的优化算法,它的理论基础是量子计算。算法充分借鉴了量子比特的干涉性、并行性,使得QEA求解组合优化问题具备了可行性。由于在求解排序问题中,算法本身存在收敛慢,没有利用其它未成熟个体等缺陷,将微粒群算法（PSO）及进化计算思想融入QEA中,构成了混合量子算法（HQA）。采用flow shop经典问题对算法进行了测试,结果证明混合算法克服了QEA的缺陷,对于求解排序问题具有一定的普适性。     

改进混合量子算法在Job Shop调度中的研究

自从科学的管理思想引进生产过程中,管理者开始注重计算机的辅助作用。Job Shop调度问题（JSP）是许多实际生产调度的简化模型,由于解空间的规模巨大,给求解带来了很大的挑战。在量子比特编码的基础上,设计了两种解码方式,结合微粒群算法（PSO）的更新式对量子角进行智能调整,形成了混合量子算法（HQA）。但HQA在求解JSP时,效果并不好。在HQA的框架下,增加了一些寻优机制,使得算法求解性能有显著的提高,并称其为改进混合量子算法（IHQA）。     

基于全面学习的量子分布估计算法

量子进化算法采用多个简单概率模型并行搜索的框架结构,从而可尝试引入有效的多模型学习机制以提高算法的探索能力。文中将全面学习的思想引入多量子概率模型的学习,提出基于全面学习的量子分布估计算法。在该算法中,模型的每个分量都可以向不同的目标学习,使得量子概率模型有可能较为全面地从已知较优解中提取知识,以尽可能全面地描述解空间中好的区域,有效提高算法求解复杂优化问题的能力。在典型0-1背包问题上的比较实验充分验证该算法的有效性和先进性。     

A novel scheduling model for computational grid using quantum genetic algorithm

The Computational Grid (CG) provides a wide distributed platform for high end computing intensive applications. Scheduling on Computational grid is known to be NP-Hard problem and requires an efficient solution. Recently, quantum inspired computing has been introduced in the literature to solve such a complex combinatorial optimization problem efficiently. Combination of Genetic Algorithm (GA) and quantum concept evolves a new meta-heuristic technique known as Quantum Genetic Algorithms (QGA). QGA is a search procedure based on evolutionary computation and Quantum Computing (QC). This paper proposes a novel technique of scheduling in computational grid using QGA. The work simulates the model to study its performance. It also makes a comparative study with a GA-based scheduling model. Simulation results reveal the effectiveness of the model.     

新颖的阻塞流水车间调度量子差分进化算法

针对阻塞流水车间调度问题(BFSP),提出了一种新颖的量子差分进化(NQDE)算法,用于最小化最大完工时间。该算法将量子进化算法(QEA)与差分进化(DE)相结合,设计一种新颖的量子旋转机制控制种群进化方向,增强种群多样性;采用高效的基于变邻域搜索的量子进化算法(QEA-VNS)协同进化策略增强算法的全局搜索能力,进一步提高解的质量。基于Taillard's benchmark实例仿真,结果表明,所提算法在最优解数量上明显高于目前较好的启发式算法--INEH,改进了110个实例中64个实例的当前最优解;在性能上也优于目前有效的元启发式算法--新型蛙跳算法(NMSFLA)和混合量子差分进化(HQDE),产生最优解的平均百分比偏差(ARPD)均下降约6%。NQDE算法适合大规模阻塞流水车间调度问题。     

A combined heuristic optimization technique

Realistic problems of structural optimization are characterized by non-linearity, non-convexity and by continuous and/or discrete design variables. There are non-linear dependencies between the optimised parameters. Real-world problems are rarely decomposable or separable. In this contribution a combined heuristic algorithm is described which is well suited for problems, for which the application-requirements of gradient-based algorithms are not fulfilled. The present contribution describes a combination of the Threshold Accepting Algorithm with Differential Evolution with particular emphasis on structural optimization, it can be classified as a Hybrid Evolutionary Algorithm. The Threshold Accepting Algorithm is similar to Simulated Annealing. Differential Evolution is based on Genetic Algorithms.     

An evolutionary approach to select a pull system among Kanban, Conwip and Hybrid

This paper describes a methodology for the choice of a pull production-control strategy. The methodology is based on optimization, using an Evolutionary Algorithm and discrete-event simulation, of a generic system that can model Kanban, Conwip, and Hybrid. This approach is illustrated through the examples of production lines with six, eight, and ten stages. The optimization procedure leads to a simplified Hybrid system.     

Quantum computation based bundling optimization for combinatorial auction in freight service procurements

Combinatorial auction is a useful trade manner for transportation service procurements in e-marketplaces. To enhance the competition of combinatorial auction, a novel auction mechanism of two-round bidding with bundling optimization is proposed. As the recommended the auction mechanism, the shipper/auctioneer integrates the objects into several bundles based on the bidding results of first round auction. Then, carriers/bidders bid for the object bundles in second round. The bundling optimization is described as a multi-objective model with two criteria on price complementation and combination consistency. A Quantum Evolutionary Algorithm (QEA) with β-based rotation gate and the encoding scheme based on non-zero elements in complementary coefficient matrix is developed for the model solution. Comparing with a Contrast Genetic Algorithm, QEA can achieve better computational performances for small and middle size problems.     

一种基于量子进化算法的概率进化算法

针对量子进化算法(QEA)求解二进制编码问题比较有效,而求解多进制编码问题则比较困难,提出一种概率进化算法(PEA)。该算法汲取了量子复合位、叠加态等思想,采用由观测概率构成的概率复合位进行编码,观测和更新操作直接针对观测概率进行。PEA保持了QEA的性能,运算速度远优于QEA,并可以采用任意进制编码。函数优化和背包问题实验验证了PEA的有效性。     

基于量子遗传算法的非线性无约束优化方法

量子遗传算法(QGA)是量子计算和遗传算法相结合的产物,量子遗传算法将量子比特和量子旋转门表示引入到遗传算法中,具有比遗传算法更好的搜索效率和收敛性。非线性无约束优化是典型的工程应用问题,而复杂非线性函数的优化结果往往不能令人满意,如陷入局部最优等。利用量子遗传算法强大的搜索能力,可以很好的解决复杂非线性函数的无约束优化问题,实验表明量子遗传算法在该类问题中的有效性和可行性。     

基于状态空间模型进化算法的全局收敛性分析

基于状态空间模型进化算法(SEA)是一种新颖的实数编码进化算法,在工程优化问题中具有广阔的应用前景。为了完善SEA的理论体系,促进SEA在工程优化问题中的应用研究,利用齐次有限Markov链对SEA的全局收敛性进行分析, 证明了SEA不是全局收敛的。通过限定SEA状态进化矩阵内元素的取值范围,同时引入弹力搜索得到改进型弹力状态空间模型进化算法（MESEA）。分析结果表明,弹力搜索能提高SEA的搜索效率。最后得到了MESEA全局收敛的结论,为算法在工程优化问题中的应用提供了理论依据。     

Evolutionary Algorithms for Quantum Computers

In this article, we formulate and study quantum analogues of randomized search heuristics, which make use of Grover search (in Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 212–219. ACM, New York, 1996) to accelerate the search for improved offsprings. We then specialize the above formulation to two specific search heuristics: Random Local Search and the (1+1) Evolutionary Algorithm. We call the resulting quantum versions of these search heuristics Quantum Local Search and the (1+1) Quantum Evolutionary Algorithm. We conduct a rigorous runtime analysis of these quantum search heuristics in the computation model of quantum algorithms, which, besides classical computation steps, also permits those unique to quantum computing devices. To this end, we study the six elementary pseudo-Boolean optimization problems OneMax, LeadingOnes, Discrepancy, Needle, Jump, and TinyTrap. It turns out that the advantage of the respective quantum search heuristic over its classical counterpart varies with the problem structure and ranges from no speedup at all for the problem Discrepancy to exponential speedup for the problem TinyTrap. We show that these runtime behaviors are closely linked to the probabilities of performing successful mutations in the classical algorithms.     

基于混沌量子进化算法的单交叉口信号控制

城市道路各交叉口交通信号的配时优化和协同控制直接影响整个城市的交通状况.本文以单交叉口模型的交通信号控制问题为背景,构造了以单交叉口滞留的车辆数最少为目标的优化模型.用混沌量子进化算法进行仿真数据求解,得到实时控制的配时方案,并与其它算法的仿真结果进行比较,结果表明该算法对单交叉口的信号配时优化是非常有效的.     

基于免疫量子进化算法的负载均衡策略

在集群系统任务调度和分配中，提出一种基于免疫量子进化算法的负载均衡策略。该策略采用量子化编码和量子进化操作优化任务分配，在量子陷入局部极值下，引入免疫操作进行接种疫苗和免疫选择，从而增加种群多样性。仿真结果表明，与SGALB策略相比，该策略具有更高的搜索效率，其集群系统的整体性能更优。     

RQEA-SVR在交通流预测中的应用

建立在统计学习理论和结构风险最小化准则基础上的支持向量回归（SVR）是处理小样本数据回归问题的有利工具,SVR的参数选取直接影响其学习性能和泛化能力。文中将SVR参数选取看作是参数的组合优化问题,确定组合优化问题的目标函数,采用实数量子进化算法（RQEA）求解组合优化问题进而优选SVR参数,形成RQEA-SVR,并应用RQEA-SVR求解交通流预测问题。仿真试验表明RQEA是优选SVR参数的有效方法,解决交通流预测问题具有优良的性能。     

Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan

The multistage hybrid flow shop (HFS) scheduling problems are considered in this paper. Hybrid flowshop scheduling problems were proved to be NP-hard. A recently developed cuckoo search (CS) metaheuristic algorithm is presented in this paper to minimize the makespan for the HFS scheduling problems. A constructive heuristic called NEH heuristic is incorporated with the initial solutions to obtain the optimal or near optimal solutions rapidly in the improved cuckoo search (ICS) algorithm. The proposed algorithm is validated with the data from a leading furniture manufacturing company. Computational results show that the ICS algorithm outperforms many other metaheuristics.     

基于多策略融合的混合多目标蝗虫优化算法

为提高蝗虫优化算法（GOA）求解多目标问题的性能,提出一种基于多策略融合的混合多目标蝗虫优化算法（HMOGOA）。首先,利用Halton序列建立初始种群,保证种群在初始阶段具有均匀分布和较高多样性;然后,通过差分变异算子引导种群变异,促进种群向优势个体移动同时进行更大范围寻优;最后,利用自适应权重因子根据种群优化情况动态调整算法全局搜索和局部寻优能力,提高优化效率及解集质量。选取7个典型函数进行实验测试,并将HMOGOA与多目标蝗虫优化、多目标粒子群（MOPSO）、基于分解的多目标进化（MOEA/D）及非支配排序遗传算法（NSGA Ⅱ）对比分析。实验结果表明,该算法避免了其他四种算法的局部最优问题,明显提高了解集分布均匀性和分布广度,具有更好的收敛精度和稳定性。