摘要：DNA sequence design has a crucial role in successful DNA computation,which has been proved to be an NP-hard(non-deterministic polynomial-time hard) *** this paper,a membrane evolutionary algorithm is proposed for the DNA sequence design *** results of computer experiments are reported,in which the new algorithm is validated and out-performs certain known evolutionary algorithms for the DNA sequence design problem.

摘要：This paper describes a bi-level programming model that seeks to simultaneously optimize location and design decisions of facilities in a distribution system in order to realize company's maximal total profit subject to the constraints on the facility capacity and the investment *** the upper-level problem,twoechelon integrated competitive/uncompetitive capacitated facility location model,which involves facility location and design,is *** the lower-level problem,customer is assumed to patronize store based on facility utility which is expressed by service time cost in the store and its travel cost to ***'s facility choice behavior is presented by a stochastic user equilibrium assignment model with elastic *** such a distribution system design problem belongs to a class of NP-hard problem,a genetic algorithm(GA)-based heuristic procedure is ***,a numerical example is used to illustrate the application of the proposed model and some parameter sensitivity analyses are presented.

摘要：借助于遗传算法的求解功能和特点,将客运专线旅客列车开行方案优化问题描述为对列车运行网络客流分配的寻优。最优的列车开行方案对应于最优的客流分配方案。首先,针对任意的列车开行方案,构建费用—容量运行网络,并通过该网络的最小费用流描述最优客流分配方案,用运行网络中客流分配的最小费用作为个体适应值函数;而后,考虑到网络中列车保本定员限制所产生大量不可行个体的优良遗传信息,设计出求解直线型客运专线单方向旅客列车开行方案优化问题的协同对称群体交叉遗传算法,并进一步将其推广到网状客运专线上。研究发现:可以将开行方案编码的个体描述为含有阶跃容量限制的费用—容量网络,个体的适应值对应于该网络的最小费用流;在非能力过剩网络中,不会出现违反阶跃容量限制的可行流,并且可以通过控制网络容量,避免产生固定费用和负费用。