%0 Journal Article
%T Research on two-phase chain store distribution vehicle routing problem with soft time windows<br>带软时间窗的两阶段连锁门店配送车辆路径问题研究
%A SHI Zhao
%A FU Zhuo
%A <br>石　兆
%A 符　卓
%J 计算机应用研究
%D 2012
%I 
%X According to chain enterprises distribution routing optmization decision making problem, this paper established a mathematic model of the problem by using the decomposition method for two phase analysis, and introduced a time window constraints. First, the method determined the optimal number and locations of suppliers and distribution centers by using minimum wrap-net method, then used TS to search the optimal routes from distribution centers to stores. The test example shows the validity this method of and practical value.
%K chain store
%K vehicle routing problem
%K logistics network
%K soft time windows
%K two phase
%K minimum wrap-net met-hod
%K tabu search algorithm（TS）<br>连锁门店
%K 车辆路径问题
%K 物流网络
%K 软时间窗
%K 两阶段
%K 最小包络法
%K 禁忌搜索算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=22653CDAF59BBDC1C7680030688B5EA0&yid=99E9153A83D4CB11&vid=771469D9D58C34FF&iid=9CF7A0430CBB2DFD&sid=51C1C06ED4147660&eid=56BB52BDC1A19B25&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=20