带时效性约束的配送中心多源选址问题研究

应用启发式算法求解带时效性约束的多源选址问题.分析物流配送的时效性问题,建立带时效性约束的配送中心多源选址模型.构造两步启发式算法:1)借助传统迭代算法,求解物流服务分配矩阵,把多源选址问题转化为单源选址问题;2)基于M ATLAB函数,设计优化程序,计算带时效性约束的单源选址模型.并给出算例,验证模型和算法的可行性.研究表明两步启发式算法是求解带时效性约束的物流配送中心多源连续选址问题的有效算法.

Study on the Location Problems of Multiple Distribution Centers with Time Restrains

This paper is aimed to solve the multiple-center location problems with time restrains by heuristics.After analyzing time restrictions,it put forward a location model and designed a bi-step heuristics.First,it overlooked time restrains and determined service allocation matrix of multiple centers by the conventional algorithms of the gravity location model,which changed a multiple-center location problem into several single-center location problems.And then,it designed a new program based on MATLAB optimization function to solve the single-center location problem with time restrains,by which all center positions were determined respectively.An example was used to demonstrate the model and the heuristics.The study indicates that the bi-step heuristics is an efficient algorithm to deal with the location problems with time restrains for multiple distribution centers.