聚类分析的竞争决策算法

聚类分析是数据挖掘的重要技术,是一种无监督的学习方式,可根据数据间的相似程度,将数据进行分类.竞争决策算法是一种基于竞争造就优化和决策左右结果的新型优化算法,针对聚类分析的特点,设计了一种竞争决策算法进行求解,经实验测试和验证,并与其它算法的结果进行比较,获得了较好的结果.     

多属性群决策算法及一致性分析研究

在多属性群决策中 ,集结群体意见之前必须先对群体的决策数据进行一致性分析 ,以确保群体作出的决策符合客观实际 .提出了群决策的三种三维层次模型 ;用欧几里得距离 ( Euclidean Distance)表示个人决策中方案的评价值 ;然后设置一致性指标值α,作为群体数据一致性的判断依据 ;提出了满足一致性基础上的一种群决策方法 ;最后用实例说明了算法的使用步骤 .     

基于深度和广度的博弈学习模型

信息和理性在博弈学习中具有重要作用.博弈历史反映了博弈参与者的策略选择倾向,在一定程度上预示了博弈主体的行动规律.从主题、事件类型以及事件概率三个方面来描述历史的概念.由于博弈主体是有限理性人,他不能掌握全部的历史,也不能掌握全部博弈主体的博弈信息.深度就是指在时间轴上的纵向研究尺度.广度是指在每一期的博弈中,博弈者所能学习的对象的范围.由于博弈学习者的理性差异,他们在学习中往往采用不同的学习深度和广度.同样,也正是由于学习差异性的存在,才使得整个群体社会得以多样发展、共同繁荣.     

多阶段群体满意决策最优算法

针对多阶段群体满意决策问题,应用图论知识提出一种求解多阶段群体满意策略问题的最优算法.定义权ω为决策者对决策的总评价值,给出距离d和群体满意策略等概念.考虑实际情况中决策者的能力和认知的不同,赋予决策者变化的决策权重.将多阶段群体满意策略问题转换成在一个带有权向量的多部有向图中找权最大的路的问题.最后给出计算实例.     

任意量子位Grover量子搜索算法的NMR脉冲序列的理论设计及NMR实验验证

Grover量子搜索算法是目前量子计算理论和实验中研究最广泛, 而且已被核磁共振(NMR)实验所验证的一种量子算法. 提出了多量子算符代数理论(Miao X. Mol. Phys. 2000, 98: 625), 设计了任意量子比特的Grover算法的NMR实验脉冲序列, 即NMR量子计算程序, 并用NMR实验验证了其中2个量子比特的Grover算法计算程序, 初步表明了多量子算符代数理论的正确性.     

求群体多目标决策问题的一种可行方向交互算法

对于群体多目标决策问题,决策者可以各自的关于目标之间的权衡比表达其偏爱信息并进行决策.当个体权衡比具有加性性质时可得群体权衡比.本文以此构造一种求解群体非线性规划问题的交互算法.迭代中基于求解决非线性规划的Topkis-Veinott方法构造可行方向.在一定的条件下,算法收敛于所讨论问题的群体满意解.     

求解图着色问题的量子蚁群算法

针对经典的图着色问题,在蚁群算法的基础上结合量子计算提出一种求解图着色问题的量子蚁群算法. 将量子比特和量子逻辑门引入到蚁群算法中,较好地避免了蚁群算法搜索易陷入局部极小的缺陷,并显著加快了算法的运算速度. 通过图着色实例的大量仿真实验,表明算法对图着色问题的求解是可行的、有效的,且具有通用性.     

量子计算与量子通信浅说(下)

本文介绍量子计算基本原理和量子线路.通过3种最基本的量子算法,即Deutsch算法、Grover算法和量子Fourier变换对量子计算的原理做简单的说明,并介绍量子计算给RSA密码系统带来的挑战.     

考虑非合作行为的社会网络大群体共识决策模型

在社会网络环境下的大群体决策问题当中,决策专家之间的社会网络关系对决策过程和结果的影响至关重要.文章创新地提出一种考虑决策专家社会网络关系和非合作行为的大群体共识决策模型,有效促进大群体共识的达成.首先,根据决策专家的偏好信息和社会网络关系,改进经典Louvain社区发现算法,对大决策群体进行社区划分.其次,运用社会网络分析方法确定决策专家个体和社区的权重.随后,根据决策专家的偏离程度对决策专家非合作行为进行识别,并考虑社会网络关系的影响对非合作行为进行管理,以此构建共识决策模型.最后,通过案例分析来验证所建立共识决策模型的可行性和有效性.文章构建的共识决策模型,不仅在大群体社区划分过程中,创新性地同时考虑决策专家的偏好信息和社会网络关系的影响,并且在非合作行为管理过程中,也考虑到了社会网络关系对非合作行为决策专家偏好调整的影响,使其更适应社会网络决策环境.     

分车收发车辆路径问题的三个启发式算法之比较

车辆路径问题已经出现了很多的变种.在这些扩展的VRP问题当中,分车收发车辆路径问题就是其中之一.本文针对这一问题在已有的模型上加以改进,并且提出了摆脱车辆数限制的最远点拼车算法和竞争决策算法。最后结合最远点完全拼车算法通过数值实验对三者进行了比较.结果显示竞争决策算法得到的结果好于其他两者,其次是最远点拼车算法。     

A quantum-behaved evolutionary algorithm based on the Bloch spherical search

In order to enhance the optimization ability of the quantum evolutionary algorithms, a new quantum-behaved evolutionary algorithm is proposed. In this algorithm, the search mechanism is established based on the Bloch sphere. First, the individuals are expressed by qubits described on the Bloch sphere, then the rotation axis is established by Pauli matrixes, and the evolution search is realized by rotating qubits on the Bloch sphere about the rotating axis. In order to avoid premature convergence, the mutation of individuals is achieved by the Hadamard gates. Such rotation can make the current qubit approximate the target qubit along with the great circle on the Bloch sphere, which can accelerate optimization process. Taking the function extreme value optimization as an example, the experimental results show that the proposed algorithm is obviously superior to other similar algorithms.     

Robust strategic bidding in auction-based markets

In this paper, we propose an alternative methodology for devising revenue-maximizing strategic bids under uncertainty in the competitors’ bidding strategy. We focus on markets endowed with a sealed-bid uniform-price auction with multiple divisible products. On recognizing that the bids of competitors may deviate from equilibrium and are of difficult statistical characterization, we proposed a two-stage robust optimization model with equilibrium constraints aiming to devise risk-averse strategic bids. The proposed model is a trilevel optimization problem that can be recast as a particular instance of a bilevel program with equilibrium constraints. Reformulation procedures are proposed to find a single-level equivalent formulation suitable for column-and-constraint generation (CCG) algorithm. Results show that even for the case in which an imprecision of 1% is observed on the rivals’ bids in the equilibrium point, the robust solution provides a significant risk reduction (of 79.9%) in out-of-sample tests. They also indicate that the best strategy against high levels of uncertainty on competitors’ bid approaches to a price-taker offer, i.e., bid maximum capacity at marginal cost.     

供应商不确定情景下药品物流多中心选址优化研究

根据国家4+7药品带量集中采购评审标准,基于药品生产企业生产质量、供应能力、相关资质和同类药品参标结果等数据进行梳理和分析,针对药品供应商不确定情景下药品物流多中心选址问题,构建药品物流整体费用最优的多中心选址模型,设计多阶段改进禁忌搜索算法,最后通过4+7带量集中采购具体算例对模型和算法进行验证,结果显示该模型和算法是可行和有效的。     

A quantum-behaved simulated annealing algorithm-based moth-flame optimization method

This study develops an improved moth-flame optimization algorithm, which is a recently proposed optimizer based on moth behavior in nature. It has achieved favorable results in medical science, educational evaluation, and other fields. However, the convergence rate of the original moth-flame optimization algorithm is too fast in the running process, and it is prone to fall into local optimum, which leads to the failure to produce the high-quality optimal result. Accordingly, this paper proposes a reinforced technique for the moth-flame optimization algorithm. Firstly, the simulated annealing strategy is introduced into the moth-flame optimization algorithm to boost the advantage of the algorithm in the local exploitation process. Then, the idea of the quantum rotation gate is integrated to enhance the global exploration ability of the algorithm and ameliorate the diversity of the moth. These two steps maintain the relationship between exploitation and exploration as well as strengthen the performance of the algorithm in both phases. After that, the method is compared with ten well-regarded and ten alternative algorithms on benchmark functions to verify the effectiveness of the approach. Also, the Wilcoxon signed rank and Friedman assessment were performed to verify the significance of the proposed method against other counterparts. The simulation results reveal that the two introduced strategies significantly improve the exploration and exploitation capacity of moth-flame optimization algorithm. Finally, the algorithm is utilized to feature selection and two engineering problems, including pressure vessel design and multiple disk clutch brake problems. In these practical applications, the novel algorithm also achieves particularly notable results, which also illustrates that the algorithm is qualified is an effective auxiliary appliance in solving complex optimization problems.     

Quantum-inspired space search algorithm (QSSA) for global numerical optimization

This work presents the evolutionary quantum-inspired space search algorithm (QSSA) for solving numerical optimization problems. In the proposed algorithm, the feasible solution space is decomposed into regions in terms of quantum representation. As the search progresses from one generation to the next, the quantum bits evolve gradually to increase the probability of selecting the regions that render good fitness values. Through the inherent probabilistic mechanism, the QSSA initially behaves as a global search algorithm and gradually evolves into a local search algorithm, yielding a good balance between exploration and exploitation. To prevent a premature convergence and to speed up the overall search speed, an overlapping strategy is also proposed. The QSSA is applied to a series of numerical optimization problems. The experiments show that the results obtained by the QSSA are quite competitive compared to those obtained using state-of-the-art IPOP-CMA-ES and QEA.     

TSP的量子蚂蚁算法求解

在分析量子算法的基本概念的基础上,提出了一种新的算法——量子蚂蚁算法。量子蚂蚁算法结合了量子计算中量子旋转门的量子信息和蚂蚁寻优的特点,为解决实际问题提供的一种新的优化方法。本文将量子蚂蚁算法应用于TSP问题的研究,通过选取国际通用的TSP实例库中多个实例进行测试,表明了新算法具有很好的精确度和鲁棒性,即使对于大规模问题,也能以很小的种群和不长的时间求得相对误差较小的满意解。     

A new hybrid classical-quantum algorithm for continuous global optimization problems

Grover’s algorithm can be employed in global optimization methods providing, in some cases, a quadratic speedup over classical algorithms. This paper describes a new method for continuous global optimization problems that uses a classical algorithm for finding a local minimum and Grover’s algorithm to escape from this local minimum. Such algorithms will be useful when quantum computers of reasonable size are available. Simulations with testbed functions and comparisons with algorithms from the literature are presented.     

基于KKT和量子遗传算法的风火电联合上网最优决策

研究了同时考虑节能减排效益和经济效益时,风火电联合上网的决策模型,并采用提出的KKT框架下的量子遗传算法进行模型的求解。综合考虑风电和火电的特点,建立经济效益函数和节能减排效益函数以及相关的约束条件,最终确立多目标决策模型。在KKT框架下将多目标函数转化为单目标,并利用量子遗传算法进行模型的求解。算例分析显示本文提出的KKT框架下的量子遗传算法在决策模型的求解时能够利用更少的CPU运行时间获得更优的决策结果,与其他常用的优化模型相比具有较高的优越性。     

基于混沌量子算法和MAGTD的多目标FJSP求解策略

针对多目标环境下柔性作业车间的调度问题,以最小化最大完工时间和惩罚值为目标,建立调度问题的数学模型,提出了基于混沌理论的量子粒子群算法。针对实际生产交货期不确定的特点,在量子粒子群算法基础上,提出引入混沌机制建立初始群的方法;利用混沌机制的遍历性,提出混沌局部优化策略;为获取最优调度方案提出了引入多指标加权灰靶选择策略。通过典型基准算例和对比测试,验证了所提出的算法获得最满意调度方案的可行性和求解多目标柔性作业车间调度问题的有效性。