带时效性约束的物流中心选址研究

Study of Logistics Center Location Problems with Time Restrains

论述设施选址的时效性约束问题,构造带时效性约束的物流中心选址模型,分析求解重心选址模型传统迭代算法的局限性,提出一种新的基于Matlab优化函数的精确算法,并给出算例,验证模型和新算法的可行性。模拟分析表明,基于Matlab函数的新算法,编程简单,功能强大,能够求解传统迭代算法无法求解的带时效性约束选址问题。

This article described the time restrictions on logistics center location selection,constructed a logistics location model with the time restrains,analyzed the limitations of traditional alternate algorithms that solves the gravity model,put forward a new exact algorithm to solve the model with the time restrains based on a Matlab optimal function,and used an example to demonstrate the model and the new algorithm.The results indicate that comparing with the traditional algorithm,the new algorithm based on the Matlab function is characteristic of simplicity with powerful capability,and can effectively solve the logistics center location problems with time restrictions.