检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]河北工业大学管理学院,天津300130 [2]天津大学管理学院,天津300072
出 处:《计算机工程与设计》2009年第11期2782-2784,共3页Computer Engineering and Design
摘 要:对自动化仓库固定货架拣选优化问题进行了描述,提出了求解该问题的小生境遗传算法。算法采用自然数编码,利用共享函数使种群呈现多样性,并且加入了局部扰动操作和改进的交叉、变异操作,提高了算法的全局寻优能力。介绍了算法的原理,对算例进行了计算,并与文献中优化结果进行了比较。对算例结果进行分析表明,该算法可以更有效地求得固定货架拣选问题的优化解,是解决该问题的有效方法。A fixed shelf order-picking optimization problem in automated warehouse is presented. A niched genetic algorithm is designed to solve this problem. The algorithm is based on natural number coding. To keep diversity, the sharing function is used to change the fitness of population. To extend the search space, some techniques such as inside perturbation, improved crossover and mutation are used in the algorithm. The principium of the algorithm is introduced. A representative result and the analysis are given. This proposed algorithm is also applied to illustrate its validity in comparison with the best result in other literature. The result and the analysis demonstrate the effectiveness of this algorithm to solve fixed shelf order-picking optimization problem.
关 键 词:自动化仓库 拣选优化 小生境遗传算法 交叉 变异
分 类 号:O221[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.219.194.82