期刊文献+

一种基于评价函数的三维矩形布局遗传算法 被引量:1

A new 3D rectangular packing genetic algorithm based on evaluation function
下载PDF
导出
摘要 针对三维矩形布局问题,提出一种基于评价函数的布局遗传算法。该算法根据布局已知条件建立定序和定位评价函数,然后通过对评价函数值的比较确定布局的定序和定位规则;最后采用遗传算法优化定序和定位规则的参数。算例测试结果表明,该算法具有良好的计算效果。 This paper presents a new packing genetic algorithm based on evaluation function to solve 3D rectangu- lar layout problem. Firstly, the algorithm establishes sequencing and positioning evaluation functions according to the current packing conditions. Then, by comparing the values of evaluation functions it confirms the sequencing and positioning rules of layout. Finally, the algorithm uses genetic algorithm to optimize the parameters of the se- quencing and positioning rules. The result of test to different benchmarks shows that the algorithm do improve the packing result and do have the validity in calculation.
出处 《天津职业技术师范大学学报》 2014年第1期9-12,共4页 Journal of Tianjin University of Technology and Education
基金 国家自然科学基金资助项目(60975046)
关键词 三维矩形布局问题 评价函数 遗传算法 3D rectangular packing problem evaluation function genetic algorithm
  • 相关文献

参考文献13

  • 1SWEENEY P E,PATEMOSTER E R. Cutting and packing problems : A categorized, application-oriented research bibli- ography[J]. The Journal of Operational Research Socitey, 1992, 43(7 ) : 691-706.
  • 2张德富,彭煜,朱文兴,陈火旺.求解三维装箱问题的混合模拟退火算法[J].计算机学报,2009,32(11):2147-2156. 被引量:65
  • 3BORTFELD T A,GEHRING H,MACK D. A parallel tabu search algorithm for solving the container loading problem [ J 1. Parallel Computing, 2003,29( 5 ) : 641-662.
  • 4GEHRING H, BORTFELD T A. A parallel genetic algorithm for solving the container loading problem [J ]. International Trasactions in Operational Research, 2002,9(4) : 497-511.
  • 5PARRENO F, ALVAREZ-VALDES R, OLIVEIRA J F, et al. A maximal-space algorithm for the container loading problem [ J ]. INFORMS Journal on Computing, 2007,20(3 ) : 412-422.
  • 6HE K, HUANG W. An efficient placement heuristic for three- dimensional rectangular packing[ J ]. Computers & Operations Research, 2011,38( 1 ) : 227-233.
  • 7王金敏,杨维嘉.动态吸引子在布局求解中的应用[J].计算机辅助设计与图形学学报,2005,17(8):1725-1730. 被引量:16
  • 8孟伟,韩学东,洪炳镕.蜜蜂进化型遗传算法[J].电子学报,2006,34(7):1294-1300. 被引量:78
  • 9BISCHOFF E E, RATCLIFFB S W. Issues in the development of approaches to container loading [ J ]. Omega, 1995,23 (3) : 377-390.
  • 10GEHRING H, BORTFELDTA. A genetic algorithm for solving the container loading problem [ J ]. International Transac- tions in Operational Research, 1997,4 (6) : 401-418.

二级参考文献35

  • 1王爱虎,查建中,王金敏.一种基于二叉树结构表达的矩形物体布局的启发式方法[J].软件学报,1996,7(4):252-257. 被引量:23
  • 2彭宏,王兴华.具有Elitist选择的遗传算法的收敛速度估计[J].科学通报,1997,42(2):144-147. 被引量:18
  • 3张德富,魏丽军,陈青山,陈火旺.三维装箱问题的组合启发式算法[J].软件学报,2007,18(9):2083-2089. 被引量:50
  • 4Holland J H.Adaptation in Natural and Artificial System[M].USA:University of Michigan Press,1975.
  • 5Goldberg D E.Genetic Algorithms in Search,Optimization and Machine Learning[M].New York:Addison-Wesley,1989.
  • 6Kitano H.Empirical studies on the speed of convergence of the neural network training by genetical algorithm[A].Proc of AAAI 90[C].Menlo Park,USA:The AAAI Press,1990.881 -890.
  • 7Kubota N,Shimojima K,Fukuda T.The role of virus infection in virus-evolutionary genetic algorithm envolutonary computation[A].1996 Proceeding of IEEE International Conference[C].Nagoya,Japan:IEEE,1996.182-187.
  • 8Eiben A E,Aarts E H,Van Hee K M.Global convergence of genetic algorithm:an infinite markov chain analysis[A].In:Schwefel H P,Manner R.Eds.Parallel problem Solving from Nature[C].Heidelberg,Berlin:Springerverlag,1991.4-12.
  • 9Rudolph G.Convergence analysis of canonical genetic algorithms[J].IEEE Transaction Neural Networks,1994,5(1):96-101.
  • 10Dinabandhu B,Murthy C A.Genetic algorithm with elitist model and its convergence[J].Int J of Pattern Recognition and Artificial Intelligence,1996,10(6):990 -995.

共引文献155

同被引文献11

引证文献1

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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