期刊文献+

求解装箱问题的一种模拟退火算法 被引量:1

下载PDF
导出
摘要 装箱问题在现实生活中具有广泛的应用,如作业调度、最优任务分配等,是一个NP完全问题。针对一维装箱问题,提出了基于首次适应(FF)近似算法和模拟退火算法相结合的一种模拟退火算法,给出了具体的算法描述。实验结果分析表明,该算法是高效可行的。
作者 李素萍
出处 《襄樊职业技术学院学报》 2007年第4期15-16,共2页 Journal of Xiangfan Vocational and Technical College
  • 相关文献

参考文献2

二级参考文献19

  • 1[1]C L Liu, J Layland. Scheduling algorithms for multi programming in a hard real-time environment. Journal of ACM, 1973, 10(1): 174~189
  • 2[2]A Khemka, R K Shyamasundar. An optimal multiprocessor real-time scheduling algorithm. Journal of Parallel and Distributed Computing, 1997, 43(1): 37~45
  • 3[3]Y Oh. The design and analysis of scheduling algorithms for real-time and fault-tolerant computer systems[Ph D dissertation]. Department of Computer Science, University of Virginia, Vinginia, 1994
  • 4[4]M R Garey, D S Johnson. Computers and Intractability: A Guild to the Theory of NP-Completeness. New York: W H Freeman and Company, 1978
  • 5[5]E G Coffman, M R Garey, D S Johnson. Approximation Algorithms for BinPacking: A Survey. In: D Hochbaum ed. Approximation Algorithms for NP-Hard Problems. Boston: PWS Publishing, 1996. 46~93
  • 6[6]A van Vliet. Lower and upper bounds for on-line bin packing and scheduling heuristic[Ph D dissertation]. Erasmus University, Rotterdam, Netherlands, 1995
  • 7[7]A van Vliet. On the asymptotic worst-case behavior of harmonic fit. Journal of Algorithms, 1996, 20(1): 113~136
  • 8[8]E G Coffman, K So, M Hofri et al. A stochastic model of bin-packing. Inf and Cont, 1980, 44(2): 105~115
  • 9[9]E G Coffman, C Courcoubetis, M R Garey et al. Fundamental discrepancies between average-case analysis under discrete and continuous distributions. In: Proc of the 23rd Annual ACM Symp on Theory of Computing. New York: ACM Press, 1991. 230~240
  • 10[10]D S Johnson. Near optimal bin packing algorithms[Ph D dissertation]. MIT, Massachusetts, 1973

共引文献32

同被引文献15

  • 1胡瑞,丁香乾,张峰,魏旭.基于混合遗传算法的多约束集装箱装载问题研究[J].电子技术应用,2006,32(2):24-26. 被引量:9
  • 2CHRISTOFIDES N, WHITILOCK C. An algorithm for two-dimensional cutting problems[J]. Operations Res, 1997, 25 (1) : 30-44.
  • 3CHEN C S, LEE S M. An analytical model for the container loading problem [ J ]. Eur J Operational Res, 1996 (88) :78-84.
  • 4KIM C. A large scale,multiple constraint network system for testability for printed wiring boards[ J ]. Artificial Intelligence in Des, 1992: 119- 137.
  • 5MANNCHEN K. Solution methods for two and three-dimensional packing problems[D]. Kar Lsruhe, Germany: Kar Lsruhe Univ, 1999.
  • 6KIRKPATRICK S. Optimization by simulated annealing[ J ]. Science, 1983, 220 (4598) : 671-680.
  • 7FAINA L. Application of simulated annealing to the cutting stock problem[J]. Eur J Operational Res, 1999, 114 (3) : 542-556.
  • 8ABANO A. A method to improve two-dimensional layout[J]. Comput Aided Des, 1977, 9(1 ) : 48-52.
  • 9VLIET A V. On the asymptotic worst-case behavior of harmonic fit[J]. J Algorithms, 1996, 20( 1 ) : 113-136.
  • 10PISINGER D. Heuristics for the container loading problem[J]. Eur J Operational Res, 2002, 141 (2) : 382-392.

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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