最小化车辆数的供应商直接配送策略  

Strategy for supplier's direct delivery to minimize the number of vehicles

作　　者：余海燕[1,2,3] 徐寅峰[1,2,3] 

机构地区：[1]西安交通大学管理学院,西安710049 [2]机械制造系统工程国家重点实验室,西安710049 [3]智能网络与网络安全教育部重点实验室,西安710049

出　　处：《系统工程理论与实践》2012年第12期2672-2676,共5页Systems Engineering-Theory & Practice

基　　金：国家自然科学基金(60736027;71071 123);国家创新研究群体科学基金(60921003)

摘　　要：研究零售商具有周期性需求,供应商采用直接配送策略情形下以最小化车辆数为目标的供应商配送问题.给出并证明了一辆车存在可行日程安排时零售商最大配送周期满足的充分条件,在此基础上,运用将零售商集合划分成尽量少的子集合的思想,保证每个子集合中零售商都可用一辆车配送货物,设计了子集划分策略.证明在任何情况下,子集划分策略给出的车辆数都不会超过最少需要的车辆数的2.29倍.We present a replenishment scheduling problem to minimize the number of vehicles, when the retailers face a periodic demand and the supplier adopts direct delivery strategy. First, we prove a sufficient condition of one vehicle to replenish several retailers. Based on this sufficient condition, we design a subsets dividing strategy, which divides the set of all the retailers into several subsets and ensures one vehicle can replenish the entire retailers in any one subset. Further, we prove the number of vehicles which is given by our strategy would not exceed 2.29 times of the minimal number of vehicles.

关 键 词：库存路径问题 直接配送 日程安排 

分 类 号：F252[经济管理—国民经济]