作　　者： ; ;

机构地区： 佛山职业技术学院工商管理系

出　　处： 《顺德职业技术学院学报》 2011年第1期14-17,共4页

摘　　要： 通过将连锁企业的实际物流配送网络描述为由配送中心和门店两类节点构成的完全无向图,建立0—1整数规划的物流配送路径优化模型。该模型属于一类改进的多车型车辆路径优化模型,是NP难问题,模型充分考虑到不同类型车辆启动费用的不同和所配送商品的多样性、车辆数限制等特性,与实际相吻合,具有很强的实际应用价值。为求解上述模型,设计禁忌搜索算法对模型进行求解,通过仿真实例计算取得了满意的结果。 The logistics distribution networks of Chain enterprises are described in a way of a complete un-digraph,which consists of two kinds of nodes：the distribution center nodes and the store nodes.A model with 0-1 integer is built to optimize the logistics distribution muting.The model belongs to a type of improved Unique depot multi-vehicle routing problem and has NP-hard complexity.The model takes into account the characteristic properties that different vehicles have different start costs and varieties of commodities are distributed.Hence,it has good practical value.Taboo search algorithm is designed to solve the mode.Computation on simulation examples show that the results are satisfactory.

关 键 词： 连锁企业 物流配送 禁忌搜索算法

领　　域： [经济管理]