������ɢ����µĹ��������мƻ��Ż��о�

提出飓风等自然灾害条件下运用公交车进行居民紧急疏散的优化模型. 最优公交车疏散运行计划问题可转化为不确定性需求的选址—路径优化模型,目标函数是使总疏散时间最小. 选址—路径优化模型用于确定最有效的公交车集结点服务区域和将人员从受灾区域转移到指定避难所或安全地区的最优线路,并设计遗传算法、神经网络算法和爬山算法结合的混合启发式算法. 通过美国密西西比州格尔夫波特市的实际数据对所提出的模型进行验证. 实验结果表明,混合遗传算法在求解效果和效率上都优于传统的遗传算法.     

考虑碳排放的混合轴辐式多式联运网络枢纽扩增选址-路径问题

针对现有多式联运网络枢纽饱和度高、枢纽到城市直达运输成本高且效率低等不足,提出采用混合轴辐式多式联运网络研究扩增枢纽选址,同时优化运输线路;基于允许枢纽间转运和需求城市间巡回运输的运输网络,考虑低碳因素构建了最小化总运输成本、二级枢纽开放建设成本、枢纽处转运成本和总碳排放成本的数学模型,将问题分解为选址-分配与路径优化2个阶段,并针对两阶段特点分别采用0-1编码和数字编码设计了两阶段遗传算法;针对现有实际案例采用设计的算法进行求解,并将求得的最优运输方案与现实方案进行对比。研究结果表明:采用提出的算法进行10次运行获得的最优解与其平均值的差值百分比仅为4.7%,且平均求解时间仅为90.6 s;优化后网络扩增了2个枢纽,弃用了1个不合理枢纽,网络转运能力提高了11.3%,枢纽的平均饱和度降低了15.7%,不同枢纽的饱和度比原网络更均衡,不仅缓解了饱和枢纽的压力,还提高了空闲枢纽的周转率,从而提高了转运效率;优化后运输方案对应的总成本、运输成本、中转成本和碳排放成本分别降低了68.41%、68.14%、56.55%和86.76%,且碳排放减少最为突出。由此可见,提出的模型和算法对扩张轴辐式网络选址和混合轴辐式多式联运网络运输方案的组合优化具有较好的性能。      

求解TSP和MTSP的混合遗传算法

许多应用涉及多推销员问题（MTSP），已有许多启发式算法求解TSP的最优或近似最优路线，但研究MTSP的算法并不多，结合启发式算法和遗传算法，设计了求解TSP和MTSP的混合遗传算法，数字实例说明了该算法的有效性。     

IMPROVED GENETIC ALGORITHM TO OPTIMAL PORTFOLIO WITH RISK CONTROL

1IntroductionAlog-optimalinvestimentportfoliowithoutriskconstraintshasbeenintroducedandsystem-aticallystudiedinChapter15ofCoverandl'homas[11.Themodelcanbediscribedasfol-.lows:Astockmarketisrepresentedasavectorofstocksx=(X,,X,,..',X.)',X,>o,i=1,2,.-',m,wheremisthenumberofstocksandthepricerelativeXirepresentstheratiooftheclos-ingpriceofthecurrentbusinessdaytotheprevi-ousday.LetF(x),x=(x,,x2,..',x-)'eR"bethejointdistributionofvectorX.Aportfoliob=(b,,bs,..',b,)',b,>o,i=l,2,..',m,Zb,=1istheall…     

Research on a Task Planning Method for Multi-Ship Cooperative Driving

A new method for a cooperative multi-task allocation problem(CMTAP) is proposed in this paper,taking into account the multi-ship, multi-target, multi-task and multi-constraint characteristics in a multi-ship cooperative driving(MCD) system. On the basis of the general CMTAP model, an MCD task assignment model is established. Furthermore, a genetic ant colony hybrid algorithm(GACHA) is proposed for this model using constraints, including timing constraints, multi-ship collaboration constraints and ship capacity constraints. This algorithm uses a genetic algorithm(GA) based on a task sequence, while the crossover and mutation operators are based on similar tasks. In order to reduce the dependence of the GA on the initial population, an ant colony algorithm(ACA) is used to produce the initial population. In order to meet the environmental constraints of ship navigation, the results of the task allocation and path planning are combined to generate an MCD task planning scheme. The results of a simulated experiment using simulated data show that the proposed method can make the assignment more optimized on the basis of satisfying the task assignment constraints and the ship navigation environment constraints. Moreover, the experimental results using real data also indicate that the proposed method can find the optimal solution rapidly, and thus improve the task allocation efficiency.     

基于货物时间价值的空铁联运转运枢纽选址优化

高效合理的联运网络是空铁联运快递服务产品创新的重要支撑。本文在考虑货物时间价值的基础上,以空铁联运转运枢纽的位置以及运输方式选择为决策变量,构建以综合成本最低为目标的空铁联运转运枢纽选址模型,并设计变邻域遗传算法进行模型求解。以截至2019年开通高铁并设有机场的200个地级城市为例,采用复杂网络和优劣解距离法结合的方法选取空铁联运转运枢纽的备选城市,验证模型和算法的实用性及有效性。结果表明,运输时间限制和折扣系数是影响空铁联运网络综合成本的重要因素。随着运输时间限制的增加以及折扣系数的降低,空铁联运网络综合成本分别降低了15%和11%。空铁联运转运枢纽的空间布局主要受运输时间限制的影响。运输时间限制较低时,空铁联运转运枢纽布局以东北地区和西部地区为主,以提高快递运输的时效性。运输时间限制较高时,空铁联运转运枢纽布局向中东部地区转移,为经济服务趋势明显。空铁联运网络最优枢纽数量则受运输时间限制和折扣系数的综合影响,但运输时间限制对于最优枢纽数量的影响更为显著。合理布局空铁联运转运枢纽和提升空铁联运规模效益是提高空铁联运服务时效性和竞争力的重要途径。     

Research of order allocation model based on cloud and hybrid genetic algorithm under ecommerce environment

For massive order allocation problem of the third party logistics (TPL) in ecommerce, this paper proposes a general order allocation model based on cloud architecture and hybrid genetic algorithm (GA), implementing cloud deployable MapReduce (MR) code to parallelize allocation process, using heuristic rule to fix illegal chromosome during encoding process and adopting mixed integer programming (MIP) as fitness function to guarantee rationality of chromosome fitness. The simulation experiment shows that in mass processing of orders, the model performance in a multi-server cluster environment is remarkable superior to that in stand-alone environment. This model can be directly applied to cloud based logistics information platform (LIP) in near future, implementing fast auto-allocation for massive concurrent orders, with great application value.     

编组站静态配流的约束传播和启发式回溯算法

为了提高阶段计划的编制效率,针对编组站静态配流字典序多目标累积调度模型,设计了迭代、约束传播和启发式回溯的混合算法.该算法根据多目标的字典序将模型分为3层:第1层为配流成功的出发列车优先级总和最大化,第2层为出发列车车流来源总数最少化,第3层为车辆平均停留时间最短化.每层先通过约束传播算法化简模型、缩小解空间,再通过启发式回溯算法和约束传播技术联合快速求解.上一层的最优解作为下一层的初始解,并动态增加避免上一层目标退化的约束,迭代求解每层的最优解.通过某编组站实际数据验证表明,本算法耗时小于20 s,满足现场对阶段计划编制的实时性要求,且求得的配流方案优于其他算法.      

高速列车疫情风险评估与主动防护策略

考虑到列车密闭车厢内传染病的危害性, 研究了车厢内病毒的空间分布特性; 结合乘客间距离相关性分析结果, 构建了乘客感染预测模型, 对车厢内存在多感染者情况下每个乘客感染病毒的风险进行了评估; 为降低乘客乘车感染风险, 制定了列车乘客主动防护策略, 提出基于贪婪算法和变邻域局部搜索算法的混合启发式算法, 对车厢乘客布座问题进行优化求解; 通过基于距离的贪婪算法, 将列车固定坐标的乘客布座问题转换为最多乘客数最少病毒重叠区问题, 得到座位可行解, 并汇总各可行解得到可行域, 再基于变邻域的局部搜索算法改进座位可行解, 得到最优乘客布座方案。研究结果表明: 本文建立的感染概率评估模型可有效预测乘客感染病毒的风险, 结合基于混合启发式算法的主动防护措施可有效降低乘客乘车的感染风险; 针对短途旅客, 随着乘车人数和车厢内感染者的增加, 高风险感染者由1人增加至7人, 中风险感染者由0人增加至3人, 低风险感染者由47人增加至83人; 相较于无序就坐, 采用本文制定的布座策略可消除乘客感染风险。      

A multi-objective optimal approach to automated construction of sacrificial multi-piece molds

Sacrificial multi-piece molds can be used for producing complex parts. To obtain the optimal design of molds automatically, a multi-objective optimal approach is proposed. Mold pieces number, material utilization and partitioning area are taken as the objective functions, and the machinability of each mold piece is taken as constraint condition. Genetic algorithm (GA) is adopted to realize global optimization of partitioning process. Each mold piece in optimal scheme can be manufactured by milling and drilling operations, which reduce the tooling cost and shorten product cycle obviously. Using the proposed approach, mold design can be significantly automated for making complex parts.     

Optimization of CMOS repeater driven interconnect RC line using genetic algorithm

In this work, optimization of complementary metal oxide semiconductor (CMOS) repeater driven interconnect resistive-capacitive (RC) line is carried out using genetic algorithm (GA). This work is aimed at powerdelay- product (PDP) minimization of RC interconnect at 180 nm technology node. The algorithm simultaneously optimizes the values of supply voltage, number of repeaters and repeater width for delay and PDP minimization. The accuracy of results obtained is verified by simulations from Cadence virtuoso tool. For delay minimization, comparison of GA results with previous results of the literature shows an improvement of 44.4% in the value of the optimal number of repeaters required. This improvement is obtained by increasing the repeater size, which also increases power dissipation, so a tradeoff has also been achieved in terms of PDP minimization. The comparison of PDP results obtained in this work, with the results at 70, 100, and 130 nm technologies from literature shows improvement in optimal number of repeaters required. The results of algorithm and simulations are in good agreement and demonstrate the validity of proposed algorithm.     

An Improved Genetic Algorithm for Allocation Optimization of Distribution Centers

This paper introduced an integrated allocation model for distribution centers (DCs). The facility cost,inventory cost, transportation cost and service quality were considered in the model. An improved genetic algorithm (IGA) was proposed to solve the problem. The improvement of IGA is based on the idea of adjusting crossover probability and mutation probability. The IGA is supplied by heuristic rules too. The simulation results show that the IGA is better than the standard GA(SGA) in search efficiency and equality.     

Structural Optimization of Hatch Cover Based on Bi-directional Evolutionary Structure Optimization and Surrogate Model Method

Weight reduction has attracted much attention among ship designers and ship owners. In the present work, based on an improved bi-directional evolutionary structural optimization (BESO) method and surrogate model method, we propose a hybrid optimization method for the structural design optimization of beam-plate structures, which covers three optimization levels: dimension optimization, topology optimization and section optimization. The objective of the proposed optimization method is to minimize the weight of design object under a group of constraints. The kernel optimization procedure (KOP) uses BESO to obtain the optimal topology from a ground structure. To deal with beam-plate structures, the traditional BESO method is improved by using cubic box as the unit cell instead of solid unit to construct periodic lattice structure. In the first optimization level, a series of ground structures are generated based on different dimensional parameter combinations, the KOP is performed to all the ground structures, the response surface model of optimal objective values and dimension parameters is created, and then the optimal dimension parameters can be obtained. In the second optimization level, the optimal topology is obtained by using the KOP according to the optimal dimension parameters. In the third optimization level, response surface method (RSM) is used to determine the section parameters. The proposed method is applied to a hatch cover structure design. The locations and shapes of all the structural members are determined from an oversized ground structure. The results show that the proposed method leads to a greater weight saving, compared with the original design and genetic algorithm (GA) based optimization results.     

An Optimal Algorithm for a Class of Parallel Machines Scheduling Problem

This paper considers the parallel machines scheduling problem where jobs are subject to different releas etimes. A constructive heuristic is first proposed to solve the problem in a modest amount of computer time. In general, the quality of the solutions provided by heuristics degrades with the increase of the probiem‘s scale. Combined the global search ability of genetic algorithm, this paper proposed a hybrid heuristic to improve the quality of solutions further. The computational results show that the hybrid heuristic combines the advantages of heuristic and genetic algorithm effectively and can provide very good solutions to some large problems in a reasonable amount of computer time.     

物流网络选址与路径优化问题的模型与启发式解法

以商品从供应商,经过物流中心(或配送中心),配送到最终用户的整个过程中所产生的费用最小化为目标函数,提出了求解供应商的最佳位置与数量、配送中心的最佳位置与数量以及从配送中心到最终用户的最佳配送路径优化问题,建立了问题的数学模型,利用传统启发式算法与模拟退火法开发了问题求解的混合启发式解法,并利用人工生成数据和实例进行了计算验证。对于小规模问题,通过与数理规划软件所求得的最优解进行比较可以看出,所提出的数学模型可以准确地描述此类问题,所提出的混合启发式解法能够在短时间内求解问题,并得到非常接近于最优解的近似解;对于大规模问题,虽然无法求得最优解进行比较,但从实例计算结果来看,所求解也是较好的,因此可以认为所提出的解法是有效和良好的,具有较高的实用价值。     

基于双层规划的危险货物配送路径鲁棒优化

针对不确定环境下带时间窗的多配送中心危险货物配送路径优化问题, 提出一种含鲁棒控制参数的鲁棒优化方法; 综合考虑危险货物运输风险、运输费用和服务时间窗, 构建了危险货物配送路径多目标双层鲁棒优化模型, 上层模型追求运输风险和运输费用最小化, 下层模型采用用户均衡交通分配模型; 根据Bertsimas-Sim鲁棒优化理论, 对含有不确定参数的上层模型进行鲁棒对等转化; 联合增强型Pareto遗传算法和Frank-Wolfe算法构建了求解多目标双层鲁棒优化模型的混合算法, 采用3段式编码和解码方法、等位匹配交叉操作以及翻转变异等遗传操作方法求解上层模型, 采用Frank-Wolfe算法求解下层用户均衡模型; 以经典的Sioux-Falls交通网络为例, 对含有3个配送中心、7个需求点的危险货物配送路径优化问题进行案例分析, 以验证模型及其算法的合理性。研究结果表明: 当鲁棒控制参数分别为0、30和60时, 构建的混合算法能分别快速得到3、2和3组鲁棒最优解, 且所有解均为包含具体运输路段和发车时刻的配送方案, 而非配送顺序; 该混合算法与传统两阶段启发式算法相比, 运算时间能节省54.74%。可见, 该混合算法无论是在求解效率上, 还是在解的表达形式上均优于两阶段启发式算法, 能较好地完成不确定环境下危险货物配送路径多目标双层鲁棒优化任务。      

物体表面重建轮廓拼接的改进遗传算法

为解决物体表面重建中的轮廓拼接问题，将其转化为在有向图中寻求最优路径问题．提出了基于遗传算法的适用各种目标函数的轮廓拼接算法，其中对初始种群的产生、交叉算子和变异算子等做了改进，以确保产生的个体均能代表有效解．算例模拟结果表明，该算法简单可行，在优化性能、收敛速度及鲁棒性等方面优于模拟退火算法．     

车间作业调度中基于领域搜索的混合遗传算法

车间作业调度问题是一个NP完全问题，很难用一般的方法解决．遗传算法(GA)作为全局搜索算法广泛应用于各种寻优操作中，并己成为求解车间作业调度问题(JSP)的主要方法，本文针对遗传算法应用的局限性，把领域搜索的思想应用到变异操作中，提出了一种应用于车间调度中基于领域搜索的混合遗传算法，该算法不仅保证了算法的全局收敛性、而且提高了算法的收敛速度和稳定性。     

公铁联运规模效应和枢纽拥挤效应的联动分析

公铁联运最主要的优势就是采用轴辐式网络结构实现规模经济,降低货物的运输成本,货运量越大,规模效应越明显;另一方面,过多的货物在枢纽集结会造成枢纽拥挤,增加货物在枢纽的停留时间,从而降低了公铁联运的竞争力.本文分别采用与流量相关的分段成本函数和M/M/c的排队模型来描述公铁联运的规模效应和拥挤效应,建立了非线性的整数规划模型,用于综合分析规模效应和枢纽拥挤效应对公铁联运的影响.采用混合禁忌搜索算法求解本文的模型,该算法具有较好的收敛效果.最后,分析了铁路服务固定成本、公路运输成本、货物运到期限和枢纽能力对公铁联运竞争力的影响.     

Adaptive Identification of Logging Lithology Based on VPSO-ENN Hybrid Algorithm

Particle swarm optimization (PSO) was modified by variation method of particle velocity, and a variation PSO (VPSO) algorithm was proposed to overcome the shortcomings of PSO, such as premature convergence and local optimization. The VPSO algorithm is combined with Elman neural network (ENN) to form a VPSO-ENN hybrid algorithm. Compared with the hybrid algorithm of genetic algorithm (GA) and BP neural network (GA-BP), VPSO-ENN has less adjustable parameters, faster convergence speed and higher identification precision in the numerical experiment. A system for identifying logging parameters was established based on VPSO-ENN. The results of an engineering case indicate that the intelligent identification system is effective in the lithology identification.