计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (34): 17-20.DOI: 10.3778/j.issn.1002-8331.2009.34.006

• 博士论坛 • 上一篇    下一篇

混合算法在排样问题上的应用研究

宋亚男1,徐荣华1,杨宜民1,叶家玮2   

  1. 1.广东工业大学 自动化学院,广州 510006
    2.华南理工大学 土木与交通学院,广州 510640
  • 收稿日期:2009-09-11 修回日期:2009-10-13 出版日期:2009-12-01 发布日期:2009-12-01
  • 通讯作者: 宋亚男

Study on application of hybrid algorithm on parking

SONG Ya-nan1,XU Rong-hua1,YANG Yi-min1,YE Jia-wei2   

  1. 1.College of Automation,Guangdong University of Technology,Guangzhou 510006,China
    2.School of Civil Engineering and Transportation,South China University of Technology,Guangzhou 510640,China
  • Received:2009-09-11 Revised:2009-10-13 Online:2009-12-01 Published:2009-12-01
  • Contact: SONG Ya-nan

摘要: 结合全局搜索算法和局部搜索算法的互补特性,研究设计了串行和镶嵌两种混合模式,实现了基于邻域搜索和遗传算法的混合算法;在分析排样问题中图形碰靠的相关性特征的基础上,构建了排样问题的邻域假设和匹配邻域结构,基于混合算法获得了排样问题的优化解;实例结果标明,该算法在搜索到了更好的排样模式,验证了算法的有效性。

关键词: 混合算法, 邻域搜索, 遗传算法, 排样

Abstract: Based on complementary characteristics on global search and local search algorithms,sequence and embedded patterns are designed to implement hybrid algorithm of genetic algorithm and neighborhood search.Based on analysis on relative characteristic of graph contacting in parking,neighborhood assumption and matching-neighborhood are built to obtain the optimization results of parking.And results of example on packing show that lower utilization of materials is found and it shows the hybrid is effective.

Key words: hybrid algorithm, neighborhood search, genetic algorithm, packing

中图分类号: