摘要
针对仓储物流中常常遇到的倒垛问题进行了分析,建立了0-1非线性整数规划模型,根据模型特点将其归结为具有问题特征的可扩展广义指派问题,该问题具有NP-难的性质,因此获得较大规模最优解是不可能的或是非常困难的。为了求解此问题,本文设计了一种特殊序号编码方式的单亲遗传算法,同时为了保持群体多样性,嵌入了启发式规则进行扰动。仿真算例表明改进后的算法较传统的遗传算法更具有效性。
According to the turned-out slab stack problem in warehouse logistics system, a deep analysis was made. A 0-1 non-linear integer programming model was build up based on the characteristics of the problem, which is not only similar to but also different from the model of generalized assignment problem. Due to its NP-hardness, the problem was impossible or hard to obtain optimal solution. The partheno-genetic algorithm with special ordinal encoding mode was designed to solve the problem, and a heuristics was embedded for the purpose of maintain the diversity of solutions so as to improve the final results. Simulative example illustrated the effectiveness of the proposed method compared with traditional genetic algorithm.
出处
《工业工程与管理》
北大核心
2009年第4期67-71,共5页
Industrial Engineering and Management
基金
国家自然科学基金(70771008
70371057)
关键词
倒垛问题
广义指派
单亲遗传
启发式突变
turned-out slab stack
generalized assignment problem
partheno-genetic algorithm
heuristics mutation
