摘要
装箱问题在现实生活中具有广泛的应用,如作业调度、最优任务分配等,是一个NP完全问题。针对一维装箱问题,提出了基于首次适应(FF)近似算法和模拟退火算法相结合的一种模拟退火算法,给出了具体的算法描述。实验结果分析表明,该算法是高效可行的。
出处
《襄樊职业技术学院学报》
2007年第4期15-16,共2页
Journal of Xiangfan Vocational and Technical College
二级参考文献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
-
1孔亮,杜斌,朱俊.多约束的箱子大小可变的装箱问题[J].控制工程,2008,15(S1):176-178. 被引量:1
-
2孙春玲.染色的装箱问题及其近似算法[J].云南民族大学学报(自然科学版),2005,14(3):210-212. 被引量:1
-
3王波,高欣宝,刘保成,蔡军锋.基于提高运输能力的箱式包装设计[J].包装工程,2005,26(5):129-130.
-
4刘春霞,于洪霞.有色装箱问题的一种新的近似算法[J].佳木斯大学学报(自然科学版),2005,23(4):606-609.
-
5李荣.浅析解决装箱问题的三种启发式算法[J].福建电脑,2006,22(5):115-115. 被引量:2
-
6杨鼎强,王晨.受位置约束的有色装箱问题[J].计算机工程与设计,2006,27(20):3864-3866. 被引量:2
-
7刘辉.装箱问题的概率近似算法[J].科学技术与工程,2007,7(13):3279-3282. 被引量:4
-
8曹晶,郑巍,许旻鸿.有约束的一维装箱问题的新型算法设计[J].计算机应用与软件,2008,25(5):234-236. 被引量:2
-
9杨鼎强.基于LIB的有色箱覆盖问题[J].计算机工程与设计,2008,29(9):2269-2271.
-
10李杉林,唐国春.“装箱问题的一种新的近似算法”的一个注记[J].云南大学学报(自然科学版),2008,30(4):354-354.
同被引文献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王晨,杨曙.A型变尺寸装箱问题之模型及算法研究[J].计算技术与自动化,2010,29(3):62-65.
-
2王洪亚,尹伟,宋晖,徐立群,王梅.基于双曲线边界的多处理器实时任务可调度性判定[J].软件学报,2012,23(8):2223-2234. 被引量:1
-
3徐寅峰,叶继昌,迟学斌.多处理器系统最优任务分配问题的一个近似算法[J].西安交通大学学报,1999,33(4):98-101. 被引量:3
-
4张荣,李衷怡.分布式三维重建中任务分配算法研究[J].计算机与数字工程,2007,35(11):14-15.
-
5房丙午,黄志球.云计算中能耗和性能感知的虚拟机优化部署算法[J].计算机工程与科学,2016,38(12):2419-2424. 被引量:6
-
6吴令一,刘青峰,卢家广.基于二分图的改进装箱算法[J].硅谷,2009,2(17). 被引量:1
-
7陈雪飞.存贮管理模拟系统的设计与实现[J].电脑与信息技术,1998,6(3):47-48.
-
8邓曦辉.动态分区分配与回收算法的模拟[J].电脑开发与应用,2013,26(4):61-63. 被引量:1
-
9曹晶,郑巍,许旻鸿.有约束的一维装箱问题的新型算法设计[J].计算机应用与软件,2008,25(5):234-236. 被引量:2
-
10豆育升,崔晟圆,唐红,李鸿健.云数据中心高能效的虚拟机放置算法[J].小型微型计算机系统,2014,35(11):2543-2547. 被引量:8