共查询到20条相似文献，搜索用时 375 毫秒
1.
介绍了设计变量的许用离散集不同的离散变量结构优化设计问题的定界组合算法及其软件系统。根据静定化假设，给出了离散变量结构优化问题的数学模型，该模型实际上是一个组合优化问题，定界组合算法被用来求解该模型。给出了此算法的通用软件，利用Microsoft Visual C 6．0在Microsoft Window 2000 Professional下进行程序设计，实现了既可求解一般离散变量的线性规划问题，又能进行杆系结构优化的工具软件。软件也实现了用遗传算法求解离散变量结构优化设计，用户可以选择计算所用的算法。 相似文献
2.
针对RV减速器对结构优化结果精度不高且需要手工圆整的问题,提出一种基于离散混合蛙跳算法的单目标优化求解方法.首先,以体积最小为目标建立了RV减速器整机的非线性约束优化的数学模型;其次,介绍了离散混合蛙跳算法基本原理;通过罚函数法将上述数学模型转化为无约束优化的数学模型后,应用离散混合蛙跳算法对RV减速器整机实例进行优化求解;最后与传统算法、粒子群算法及遗传算法进行对比,结果表明,离散混合蛙跳算法的求解结果有着求解精度更高,收敛速度更快、避免对结果进行手工圆整等优点. 相似文献
3.
矩形布局问题属于NP-Hard问题,是一种复杂的组合优化问题.模拟退火算法(SA)和遗传算法(GA),经常被用于求解组合优化问题.但是当问题规模较大时,存在一些难以解决的问题,如早熟现象.针对二维矩形布局问题,以动态吸引子为依据,根据各优化算法的特点,提出了一种将模拟退火算法和遗传算法思想融合的SAGA混合算法.最后通过实例证明该算法的合理性和高效性. 相似文献
4.
文章提出了一种改进的离散型粒子群优化算法,该算法重新定义粒子群优化算法的速度和位置公式,使其适用于离散问题.将该算法应用到典型的组合优化问题(0-1背包问题)的求解中,仿真实验表明了该算法的有效性. 相似文献
5.
6.
7.
根据工程实际建立结构优化设计模型,为了改善以往优化设计中的一些缺点,提出了一种离散变量结构优化设计的三等分割算法(TEPA)与遗传算法(GA)相结合的方法,即改进混合遗传算法(HGA),结果表明这种改进的混合遗传算法的收敛特性得到了非常好的体现. 相似文献
8.
首先构建了一个再制造物流网络.在该网络中,正向物流和逆向物流都是双层结构,所有的设施均有能力限制,再制造产品和新产品都可以用来满足顾客的需求,且假设同类设施可以共同设计成集成设施.在此基础上建立了一个包含6种设施的再制造物流网络设施选址的混合整数非线性规划(MINLP)模型.然后给出了基于枚举的求解算法.用该算法搜索整型变量的可行组合,用线性规划软件解决剩下的子问题.最后,通过一个算例说明了模型和算法的有效性.参数灵敏度分析的结果表明,同类设施的集成可能在一定程度上影响问题的最优解. 相似文献
9.
城市配水管网优化调度研究 总被引：1，自引：0，他引：1
系统研究了城市配水管网优化调度所涉及的主要问题——用时间序列三角函数分析法建立了城市用水量短期预测数学模型 ;用管网构造法建立了基于管网供水量的管网性能宏观模型 ;从安全经济的角度提出了管网优化调度模型 ,并运用混合离散变量组合型算法进行了求解 .经实例考核 ,均获得满意结果 相似文献
10.
针对大型项目网络计划的不确定性,研究了工期、资源不确定的网络计划在费用限制情况下的费用均衡优化问题.利用蒙特卡罗分布,对不确定型网络计划进行蒙特卡罗仿真,进而获得n次仿真结果的代表性样本,从而得到该样本对应的确定性网络,用遗传算法进行求解.克服了传统启发式资源均衡优化算法在大型网络计划中不能保证最优解的缺点,得到一个费用分布均衡的网络计划.且以实例验证了该算法对大型项目的工期资源优化具有实际的应用价值. 相似文献
11.
Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem 总被引：11，自引：0，他引：11
CHEN Ai-ling YANG Gen-ke WU Zhi-ming 《浙江大学学报(A卷英文版)》2006,7(4):607-614
INTRODUCTION The vehicle routing problem (VRP), which was first introduced by Dantzig and Ramser (1959), is a well-known combinatorial optimization problem in the field of service operations management and logis- tics. The capacitated vehicle routing problem (CVRP) is an NP-hard problem for simultaneously determining the routes for several vehicles from a central depot to a set of customers, and then return to the depot without exceeding the capacity constraints of each vehicle. In pr… 相似文献
12.
INTRODUCTION Most nonlinear optimization methods assumethat objective function variables are continuous.However, many practical engineering designproblems frequently encounter discrete variables aswell as continuous variables. Discrete variables areused in many ways such as the representation of theset of standard sized components, the decision onthe number of identical parts or the choice betweendifferent design options. For example, the numberof the teeth of a gear must be chosen … 相似文献
13.
Many engineering optimization problems frequently encounter continuous variables and discrete variables which adds considerably to the solution complexity.Very few of the existing methods can yield a globally optimal solution when the objective functions are non-convex and non-differentiable.This paper presents a hybrid swarm intelligence approach(HSIA)for solving these nonlinear optimization problems which contain integer,discrete,zero-one and continuous variables.HSIA provides an improvement in global search reliability in a mixed-variable space and converges steadily to a good solution.An approach to handle various kinds of variables and constraints is discussed.Comparison testing of several examples of mixed-variable optimization problems in the literature showed that the proposed approach is superior to current methods for finding the best solution,in terms of both solution quality and algorithm robustness. 相似文献
14.
指出造林规划设计问题实质是一个离散约束优化问题。应用离散粒子群优化算法求解目标函数,以保证解的合理性法和惩罚函数法相结合处理约束条件。分析实例表明,离散粒子群优化算法可用来优化造林规划设计方案,与模拟退火算法比较,效果更好。此研究结果可为科学造林和最优化经营管理提供新思路,丰富粒子群应用领域。 相似文献
15.
An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem 总被引：2，自引：0，他引：2
Hassan Rezazadeh Mehdi Ghazanfari Mohammad Saidi-Mehrabad Seyed Jafar Sadjadi 《浙江大学学报(A卷英文版)》2009,10(4):520-529
We extended an improved version of the discrete particle swarm optimization （DPSO） algorithm proposed by Liao et al.（2007） to solve the dynamic facility layout problem （DFLP）. A computational study was performed with the existing heuristic algorithms, including the dynamic programming （DP）, genetic algorithm （GA）, simulated annealing （SA）, hybrid ant system （HAS）, hybrid simulated annealing （SA-EG）, hybrid genetic algorithms （NLGA and CONGA）. The proposed DPSO algorithm, SA, HAS, GA, DP, SA-EG, NLGA, and CONGA obtained the best solutions for 33, 24, 20, 10, 12, 20, 5, and 2 of the 48 problems from （Balakrishnan and Cheng, 2000）, respectively. These results show that the DPSO is very effective in dealing with the DFLP. The extended DPSO also has very good computational efficiency when the problem size increases. 相似文献
16.
供电网络优化的逐次改善算法 总被引：1，自引：0，他引：1
对供电网络优化设计提出了一种新算法。把供电网络优化设计问题抽象成图论问题，应用图论最优化方法解决该问题。同时提出了多边形变换的方法，对供电网络逐次优化，阳终得到一个费用最小化网络。 相似文献
17.
An immune-tabu hybrid algorithm for thermal unit commitment of electric power systems 总被引：1，自引：0，他引：1
This paper presents a new method based on an immune-tabu hybrid algorithm to solve the thermal unit commitment （TUC） problem in power plant optimization. The mathematical model of the TUC problem is established by analyzing the generating units in modem power plants. A novel immune-tabu hybrid algorithm is proposed to solve this complex problem. In the algorithm, the objective function of the TUC problem is considered as an antigen and the solutions are considered as antibodies, which are determined by the affinity computation. The code length of an antibody is shortened by encoding the continuous operating time, and the optimum searching speed is improved. Each feasible individual in the immune algorithm （IA） is used as the initial solution of the tabu search （TS） algorithm after certain generations of IA iteration. As examples, the proposed method has been applied to several thermal unit systems for a period of 24 h. The computation results demonstrate the good global optimum searching performance of the proposed immune-tabu hybrid algorithm. The presented algorithm can also be used to solve other optimization problems in fields such as the chemical industry and the power industry. 相似文献
18.
文章针对采用二层规划模型描述的固定需求条件下的连续平衡网络设计问题，给出了一种基于间隙函数的求解算法，并通过一个算例来说明算法的可行性、 相似文献
19.
针对现有网络安全技术不能准确地对网络未来安全态势进行预测的问题,提出一种基于回声状态网络(ESN)进行态势预测的方法。对数据量庞大的安全态势值,利用回声状态网络可有效处理非线性系统辨识以及混沌时间序列预测问题。实验表明,由于训练简单,可根据不同网络环境自动优化网络参数,且算法本身在混沌时间序列预测方面的先天优势,使得 ESN 算法比传统神经网络方法在网络态势预测准确率方面有明显改善。 相似文献
20.
Optimal distributed resource allocation in a wireless sensor network for control systems 总被引：1，自引：0，他引：1
MAO Jian-lin WU Zhi-ming 《浙江大学学报(A卷英文版)》2007,8(1):106-112
INTRODUCTION With the rapid development of wireless com-munication technology, the combination of wireless communication and control systems becomes a new trend of networked control systems. Among the kinds of wireless technologies, wireless sensor network (WSN) has attracted a lot of interest and visibility due to its huge application space. WSN is a kind of wire-less ad-hoc network which connects embedded sen-sors, actuators, and processors and in which each node consists of a wireles… 相似文献