节约法简便算法研究  

Research on Simplified Saving Algorithm

作　　者：宋杨[1] 

机构地区：[1]哈尔滨商业大学管理学院,黑龙江哈尔滨150028

出　　处：《物流技术》2011年第7期109-112,共4页Logistics Technology

摘　　要：随着用户数量的增加,节约法中节约值的计算次数明显提高,应用难度随之上升。由于在一条配送线路中,任何一个用户点只能与另外两个点(两个用户或一个配送中心与一个用户)相连,提出了只需找出与该用户点有关的最大节约值和次大节约值即可求解的算法简化思路。再结合节约法基本原理,分析节约法求解关键步骤的基础上,提出了节约法的简便算法,使节约值的计算量降至最低,明显减少了节约法的计算量,提高了节约法的应用效率,并结合实际算例证明了该简便算法的有效性。On account of its convenience and simpleness, saving algorithm is the commonly used to solve the optimization problem of single distribution center to muhiple customers distribution. Yet, with the increase of the number of the customer, the number of invo- cation of the saving value increases significantly, and the algorithm becomes difficult and complicated. Seeing that a customer point can only connect with two points （either two customer points or one distribution center point and one customer point）, the paper points out that it is only necessary to find out the largest and the second largest saving values to settle the above question. Then a convenient algo- rithm is presented based on the theory as well as an analysis of the key processes of the saving method, which can effectively reduce the calculation load. Finally, an example is carried out to illustrate the validity of the algorithm.

关 键 词：节约法 节约值 配送路线 配载 

分 类 号：U116.2[交通运输工程]