运筹与管理Issue(5)：111-116,165,7.
基于多候选储位的存取路径优化问题研究
Optimization for Storage or Retrieval Routing Problem Based on Mutil-candidates Storages Location
摘要
Abstract
With respect to the fact that every type of goods has only one storage location in warehouse will lead to crowded aisles and poor operational efficiency , this paper proposes an optimization approach for store and retriev-al routing problem when multi-candidate storages locations are assigned to each type of goods .First,the storage locations are allocated to goods .Then, a model is built for the vehicle routing problem with multi-candidate stor-age locations for each type of goods .A genetic algorithm based on priority-based decoding scheme is developed to solve the model .Finally , a case is given to illustrate the effectiveness of the proposed method and the efficiency of the algorithm.The solution that two-candidate and three candidate storage locations are allocated to each type of goods could at least save 18.4% and 21.8% distance for retrievals respectively .The algorithm iterated for 10000 times costs 434 seconds .关键词
运筹学/路径优化/混合整数规划/遗传算法/多候选储位Key words
operational research/routing optimization/mixed integer linear programming/genetic algorithm/multi-candidate storages locations分类
管理科学引用本文复制引用
胡少龙,胡志华,曹杨..基于多候选储位的存取路径优化问题研究[J].运筹与管理,2013,(5):111-116,165,7.基金项目
国家自然科学基金青年项目（71101088）；国家社科基金重点基金资助项目（11＆ZD169）；中国博士后科学基金资助项目（2011M500077；2012T50442）；教育部博士点基金资助项目（20113121120002）；教育部人文社科基金资助项目（10YJC630087）上海市自然科学基金资助项目 （）
