期刊文献+

启发式遗传算法求解应急资源调度 被引量:6

Emergency resources distribution based on heuristic genetic algorithm
下载PDF
导出
摘要 提出了带有启发信息的初始种群生成以及染色体编码的过程,给出了对适应度函数进行动态调整的策略。在遗传算子部分给出了对交叉点的选择和对交叉算子、变异算子进行修正的方法。在种群进化过程中提出了回溯迭代控制的方法,通过模拟仿真将算法应用于求解应急资源调度问题,并将本文提出的算法和Dijkstra算法进行了比较。结果表明:用本文提出的算法能有效地求解应急资源调配问题,并且能为决策者提供有力的决策支持。 In this paper,it proposes the generation of initial population with heuristic information and the process of chromosome coding.It presents strategies of adjusting the fitness function dynamically.In the section of genetic operators,the selection of cross-points is given,as well as the method of amending the crossover operator and the mutation operator.In the population evolution,it refers to the iterative backward control algorithm,which is used to solve the problem of the emergency resource deployment by simulation.By comparison with Dijkstra algorithm,the algorithm proposed in the paper can efficiently solve the emergency resource scheduling and provide decision-makers with strong decision support.
出处 《吉林大学学报(工学版)》 EI CAS CSCD 北大核心 2010年第3期758-762,共5页 Journal of Jilin University:Engineering and Technology Edition
基金 '十一五'国家科技支撑计划重大项目(2006BAK01A33)
关键词 人工智能 最短路径 遗传算法 启发信息 DIJKSTRA artificial intelligence shortest path genetic algorithm heuristic information Dijkstra
  • 相关文献

参考文献16

  • 1T.菲利普斯,A.瑞温德伦,等.运筹学的理论与实践[M].北京:中国商业出版,1987.
  • 2Chen L J, Chung C H. Sequential modeling of the planning problems of flexible manufacturing systems [J]. Journal of the Operational Research Society,1996,47:1216-1228.
  • 3GershwinSB, Hildebrant R R,Suri R,et al. Acontrol perspective on recent trends in manufacturing systems[J]. IEEE Control Systems, 1986 : 35-47.
  • 4Law M. Simulation series:Part 1:Introducing simulation:a toot for analyzing complex systems[J]. Apr, 1986:3-15.
  • 5De Jong K A. An analysis of the behavior of a class of genetic adaptive systems[D]. Michigan :University of Michigan, 1975.
  • 6Glover F. Future paths for integer programming and links to artificial intelligence[J].Computer Operation REs, 1986, 13(5): 533-549.
  • 7Taillard E. Ome efficient heuristic methods for the flow shop sequencing problem[J]. Euro Operation Res, 1990, 47(1):65-74.
  • 8Holland J H. Adaptation in Natural and Artificial System[M]. Michigan: Michigan University Press, 1975.
  • 9Manuel L, Barnes J W, Glover F. Intelligent sched- uling with tabu search: an application to jobs with linear delay penalties and sequence-dependent setup costs and times[J].Applied Intelligence, 1993 (3) : 159-172.
  • 10Kirkpatriek S, Gelatt Jr C D, Veechi M P. Optimization by simulated annealing[J]. Science, 1983, 220:671-680.

二级参考文献3

  • 1胡永良.目的驱动最短路径树的快速算法[J].微计算机信息,2006,22(03X):285-287. 被引量:6
  • 2(美)Mark Allen Weiss著.冯舜玺译.数据结构与算法分析—C语言描述(第二版)[M].北京:机械工业出版社,2005.
  • 3Stasko J T, Vitter J S. Pairing heaps: experiments and analysis. Communications of the ACM [J], 1987,30(3):234-249.

共引文献42

同被引文献53

引证文献6

二级引证文献20

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部