震后伤员救援车辆两阶段规划模型及算法研究

不确定情景下的应急物资配送和车辆路径优化问题是目前国内研究的一大热点,其中 震后伤员运送车辆调度及路径优化问题随着近几年地震等自然灾害的频繁发生也逐渐引起人 们的重视． 本文采用聚合优化算法对灾区进行应急救援区域划分,建立了以总救援时间最短和 相对综合救援权重值最大为目标的救援车辆两阶段数学规划模型,设计了带三角函数变异的 离散型萤火虫优化算法进行求解,并与常规算法求解结果做了对比分析． 通过算例进行模拟实 验表明,所提出的模型和算法可以有效解决地震情景下的伤员救援车辆调度问题,且改进算法 的全局搜索性能更优．     

限制性卖空的均值-半绝对偏差投资组合模型及其旋转算法研究

本文提出了限制性卖空的均值-半绝对偏差投资组合模型,通过变量替换将该模型转变为一般线性规划问题,从而运用线性规划的旋转算法进行求解。最后,文章以一个具体的算例验证了该算法的有效性,并证明将限制性卖空引入到投资组合中,有助于增强市场效率,降低市场风险。     

一种基于PIM与核方法的模糊聚类新算法

本文针对模糊C均值聚类在大数据量时收敛较慢以及不能对多种数据结构有效聚类的缺点,结合PIM算法与核方法提出了一种新的高效聚类算法———KPIM算法,并从理论上证明了该算法的收敛性.最后利用标准实验数据IRIS数据集测试,结果表明KPIM算法在保证收敛速度的同时,聚类效果更有效.     

信息不完全确定的区域产品模糊区间聚类方法

区域产品分类与选择是区域经济发展中最重要和最基础的工作.在产品选择与分类时,需要确定指标权系数和分类阈值等参数,这在实际应用中是比较困难的.针对这种情况,提出了一种信息不完全确定的区域产品模糊区间聚类方法.该方法构建了指标权系数信息不完全确定的最优模糊区间聚类模型,利用遗传算法和改进的FCM算法联合求解所得优化模型,得到指标权系数、最优聚类中心和最优划分,进而确定各产品所属类别.最后将该方法应用于某区域的产品分类和主导产品的确定中,实例计算说明该方法的可行性和有效性.     

动态联盟中伙伴选择问题的区间规划模型及其求解

伙伴选择和风险管理是动态联盟中的重要决策问题,当考虑失败风险时,失败概率无法给出精确值,因此,考虑采用不确定性规划描述此类问题.提出动态联盟中伙伴选择问题的区间规划模型,模型中用区间数表示联盟伙伴的失败概率.为了求解该模型,引入序关系,并利用Nakahara和Ishibuchi的定理,将区间规划模型转化为等价的清晰双目标模型.设计带自适应适值函数的遗传算法,求出问题的全部非劣解.经过对多个问题的仿真,证明了算法的有效性.     

Hard‐to‐Solve Bimatrix Games

The Lemke–Howson algorithm is the classical method for finding one Nash equilibrium of a bimatrix game. This paper presents a class of square bimatrix games for which this algorithm takes, even in the best case, an exponential number of steps in the dimension d of the game. Using polytope theory, the games are constructed using pairs of dual cyclic polytopes with 2d suitably labeled facets in d‐space. The construction is extended to nonsquare games where, in addition to exponentially long Lemke–Howson computations, finding an equilibrium by support enumeration takes on average exponential time.     

Penalty guided genetic search for redundancy optimization in multi-state series-parallel power system

This paper presents a genetic algorithm (GA) for parallel redundancy optimization in series-parallel power systems exhibiting multi-state behavior, optimizing the reliability subject to constraints. The components are binary and chosen from a list of products available in the market, and are being characterized by their feeding capacity, reliability, cost and weight. System reliability is defined as the ability to satisfy consumer demand and is presented as a piecewise cumulative load curve. In GA, to handle infeasible solutions penalty strategies are used. Penalty technique keep a certain amount of infeasible solutions in each generation so as to enforce genetic search towards an optimal solution from sides of, both, feasible and infeasible regions. We here present a dynamic adaptive penalty function which helps the algorithm to search efficiently for optimal/near optimal solution. To evaluate system reliability, a fast procedure, based on universal generating function, is used. An example considering a multi-state series-parallel power system is solved considering both homogeneous and heterogeneous types of redundancy. Also an example considering price discounts is solved. The effectiveness of the penalty function and the proposed algorithm is studied and shown graphically.     

Optimal algorithms for uncovering synteny problem

The syntenic distance between two genomes is the minimum number of fusions, fissions, and translocations that can transform one genome to the other, ignoring the gene order within chromosomes. As the problem is NP-hard in general, some particular classes of synteny instances, such as linear synteny, exact synteny and nested synteny, are examined in the literature. In this paper, we propose a new special class of synteny instances, called uncovering synteny. We first present a polynomial time algorithm to solve the connected case of uncovering synteny optimally. By performing only intra-component moves, we then solve the unconnected case of uncovering synteny. We will further calculate the diameters of connected and unconnected uncovering synteny, respectively.     

基于混合智能算法的电子市场供应链期权合同协调

在电子市场环境下,考虑了需求、市场价格和市场准入程度的随机性,基于Stack-erlberg主从对策,建立了供应链期权合同协调的随机期望值模型。在这一主从对策模型中,主方供应商的目标函数是预期利润,决策变量是期权合同预订费用和执行费用;从方分销商的目标函数是预期利润,决策变量是订货量。应用包括随机模拟、人工神经元网络和遗传算法组成的混合智能算法求解该主从对策问题。最后,结合上海宝钢集团益昌公司电子商务的运作实例,运用混合智能算法进行了仿真计算与分析。     

一种求解双目标flow shop排序问题的进化算法

提出一种求解双目标flow shop排序的递进多目标进化算法.算法采用改进的精英复制策略,在实现精英保留的前提下降低了计算复杂性;通过递进进化模式增加群体多样性,改善了算法收敛性;通过群体进化过程中对非劣解集进行竞争型可变邻域启发式搜索,增强了算法局部搜索性能.采用新算法和参照算法NSGA-II对31个标准双目标flow shop算例进行优化.研究结果表明,新算法在所有算例的求解中均获得了优于NSGA-II的非劣解集,验证了算法的有效性.