摘要
由于多分拣区产品存储优化决策是一类典型的NP难问题,求解较为困难,尤其当问题规模增大后,应用精确算法求解时间代价较高。考虑到微粒群技术在求解大规模组合优化问题的优势,本论文针对多分拣区产品存储优化设计了微粒群算法,并用算例验证了该算法的有效性。
Forward-reserve problem(FRP) in a multiple forward area can not easily be solved since it is a NP-hard problem. Especially, for a large sized problem it is very time-consuming to solve by using the exact algorithm. Since particle swarm optimization (PSO)shows great efficiency when solving a big scale optimization problem, the paper proposed PSO for FRP in multiple forward area and a numerical example showed the effectiveness of the proposed algorithm.
出处
《交通运输工程与信息学报》
2015年第3期16-21,共6页
Journal of Transportation Engineering and Information
基金
四川省科技支撑计划项目(2012GZ0063)
中央高校基本科研业务费专项资金资助(2682013CX074)
关键词
多分拣区
产品存储优化
微粒群
Multiple forward areas
forward-reserve problem
particle swarm optimization