摘要
根据系统布置设计思想,以物流成本和非物流关系密切度作为双目标,提出带有固定的纵、横走道的矩形平面布局模型.由于该布局问题属于NP-完全问题,构造一个带局部搜索的多目标遗传算法求解该问题的Pareto非劣解集.文中将两个不同量纲的目标函数量纲标准化,并以随机权重式评价目标函数.数值分析表明混合遗传算法对于中等规模该布局问题是十分有效的.
According to the idea of Systematic Layout Planning, this paper proposes a bi-criteria mathematic model concerning the material handling costs and nonmaterial relation requirements for a layout problem with fixed lengthways and transverse passageways between sections. Since this problem is NP-hard, we develop a new multi-objective genetic algorithm approach hybridized with local search to obtain the set of its Pareto solutions. In this paper, we adapt a random weight approach to combine the normalized value of two objectives. The numerical experiments show the great effectiveness of the proposed method in dealing with layout problems in moderate scales.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2005年第10期101-107,共7页
Systems Engineering-Theory & Practice
基金
浙江省自然科学基金(No.Y104171)
关键词
布局问题
双目标
遗传算法
局部搜索
layout problem
bi-cfitefia objectives
genetic algorithm
local search
