分销网络中库存调拨优化的算法研究  

Arithmetic on optimizing of distributing strategy for distribution network

作　　者：边雪芬 战德臣[1] 吴华洋[2] 杨国燕[2] 

机构地区：[1]哈尔滨工业大学计算机科学与技术学院,哈尔滨150001 [2]黑龙江大学信息科学与技术学院,哈尔滨150080

出　　处：《黑龙江大学自然科学学报》2008年第1期131-135,共5页Journal of Natural Science of Heilongjiang University

基　　金：国家863高技术研究发展计划资助项目(2001AA414010)

摘　　要：企业分销网络中的仓库或分销点之间会频繁发生货物调拨申请[1],它们之间调拨的成本和效率各不相同。就企业总部而言,这些申请形成了一个调拨申请队列。考虑到申请时间的长短及紧急程度,可以采用先来先处理或优先权的策略来响应调拨申请。探讨了一个调拨优化算法[6],并给出了相关的数据结构和实验数据,验证了使用该算法可以找到用时较短、费用较低的调度方案,并给出了实验验证及性能分析。Of the warehouse or the retail store in the distribution network of business enterprise would be multifarious occurrence the goods allocating of application , the cost and efficiency among them for allocating is each not same. In regard to the business enterprise headquarters, these applications became to allocate the application brigade row. In consideration of apply for the length of time and urgent degree, one can adopt to come first to handle first or the strategy of the priority to respond to allocate an application. And this text give a concretely allocate the processing calculate way and related data structure and the experiment data, verifying that calculate way can find out to use the more short, the expenses adjusts one degree project lower, and give the experiment verification and function analyze.

关 键 词：分销网络 调拨申请 时间复杂性 

分 类 号：F253.4[经济管理—国民经济]