摘要
结合全局搜索算法和局部搜索算法的互补特性,研究设计了串行和镶嵌两种混合模式,实现了基于邻域搜索和遗传算法的混合算法;在分析排样问题中图形碰靠的相关性特征的基础上,构建了排样问题的邻域假设和匹配邻域结构,基于混合算法获得了排样问题的优化解;实例结果标明,该算法在搜索到了更好的排样模式,验证了算法的有效性。
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 re- suits of parking.And results of example on packing show that lower utilization of materials is found and it shows the hybrid is effective.
出处
《计算机工程与应用》
CSCD
北大核心
2009年第34期17-20,共4页
Computer Engineering and Applications
基金
广东省自然科学基金No.06300261
广东工业大学青年基金No.052031~~
关键词
混合算法
邻域搜索
遗传算法
排样
hybrid algorithm
neighborhood search
genetic algorithm
packing
