期刊文献+

钢铁企业产成品发货装船调度的模型与算法 被引量:3

Modeling and Algorithm for Shipment Scheduling in Steel Plants Product Delivery System
下载PDF
导出
摘要 以某钢铁企业产成品发货系统中装船调度问题为背景 ,建立了产成品装船调度问题多目标资源受限工程调度的数学模型 ,结合遗传算法和模拟退火的特点 ,设计了求解该问题的多目标智能优化算法 ,对算法输出的近似非劣解集提出了评价方法 ,将此模型和算法应用于某钢铁企业的实际装船调度中 ,结果表明 ,实际调度计划或者是非劣解集中的一个解 ,或者在非劣解集中存在某一计划优于实际调度计划· Based on study of the shipment scheduling problem in product delivery system in a steel plant, a multiobjective resource constrained project scheduling model for this problem was built. Combining characteristics of genetic algorithm and simulated annealing, a multiobjective intelligent optimization algorithm for solving it was designed. An evaluating function for evaluating the approximated nondominated set was presented. Applying this model and algorithm to some practical shipment problems,the results show that either the practical scheduling plan is one of nondominated solution in the approximated nondominated set or there was a solution in the approximated nondominated set dominated the practical plan.
出处 《东北大学学报(自然科学版)》 EI CAS CSCD 北大核心 2002年第1期8-11,共4页 Journal of Northeastern University(Natural Science)
基金 国家自然科学基金资助项目 (7970 0 0 6)
关键词 项目调度 资源受限 多目标智能优化算法 钢铁企业 产成品发货系统 运筹学 产成品装船调度 project scheduling resource constrained multiobjective intelligent optimization algorithms
  • 相关文献

参考文献1

二级参考文献1

  • 1王梦光,控制与决策,1996年,11卷,2期,105页

共引文献1

同被引文献20

  • 1Yu Liu,Hui Wang,Junhua Chen,Xiaoyun Zhang,Xiao Yue,Jian Ke,Binghua Wang,Chaohua Peng.Emergency management of nursing human resources and supplies to respond to coronavirus disease 2019 epidemic[J].International Journal of Nursing Sciences,2020,7(2):135-138. 被引量:6
  • 2朱海华.计算机系统在钢卷库库区管理上的应用[J].冶金自动化,2006,30(2):15-18. 被引量:2
  • 3黄士柱,郭建庆,梁碧青,王玉君,赵峰.自动发货的研究与应用[J].工业控制计算机,2007,20(6):60-61. 被引量:1
  • 4Lourenco H R, Martin O, Stutzle T. Iterated local search[M] //Glover F, Kochenberger G. Handbook of Metaheuristics. Boston: Kluwer Academic Publishers, 2003.
  • 5Voudouris C, Tsang E. Guided local, search and its application to the travelling salesman problem[Jl. European Journal of Operational Research, 1999,113(2) :469 - 499.
  • 6Codenotti B, Manzini G, Margara L, et al. Perturbation: an efficient technique for the solution of very large instances of the Euclidean TSP [ J ]. INFORMS Journal on Computing, 1996,8(2) : 125 - 133.
  • 7Hu T C, Kahng A B, Tsao C. Old bachelor acceptance: a new class of non-monotone threshold aecepting method~ [ J ]. ORSA Journal on Computing , 1995,7(4) :417 - 425.
  • 8Lin S. Computer solutions of the travelling salesman problem [J]. Bell System Technical Journal, 1965,44 ( 12 ) : 2245 - 2269.
  • 9Ibaraki T, Imahori S, Nonobe K, et al. An iterated local search algorithm for the vehicle routing problem with convex time penalty functions[C]//The 35th Conference of the Italian Association of Operations Rcsearch. Lecca: IEEE, 2004 : 212 - 225.
  • 10Potvin J Y, Kervahut T, Garcia B L, et al. The vehicle routing problem with time windows, Part 1 : Tabu searchIJ]. INFORMS Journal on Computing, 1996,8 (2) : 158 - 164.

引证文献3

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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