摘要
模拟退火算法作为一种克服局部极小点的全避优化算法 ,是解决调度问题中出现的组合爆炸和非线性规划问题的有效算法。为解决模拟退火搜索空间过大 ,难以利用领域知识等问题 ,提出具有约束指导的模糊退火算法 ,给出抽样次数选择、新解的产生等一些新方法 ,以间歇过程生产调度为背景的算法仿真表明该算法的应用较大地提高了收敛速度。
Simulated annealing algorithm being a stochastic and globally optimal algorithm is an efficient algorithm to deal with combinatorial explosion and nonlinear programming. To overcome the difficulties of large searching space and usage of domain knowledge we propose a simulated annealing algorithm with guide of some constraints of process model. Some new methods correspondign to the simulated annealing,e.g. selection of sampling number and producing of new solutons,are presented. The simulation results based on production scheduling of batch processes demonstrate the efficiency of the algorithm.
出处
《系统工程》
CSCD
北大核心
2001年第3期49-55,共7页
Systems Engineering
基金
山东省优秀中青年科学家奖励基金资助项目!( 990 1 )
