摘要
在协同物流模式下,分析了基于物流需求特点的物流网络资源定制问题,考虑物流量在时间轴上的变化特点,建立了协同物流网络结构及其资源需求数学模型,分析其中所涉及的固定费用及变动费用,提出基于聚类算法构造初始解的禁忌搜索启发式算法,并在其中引入邻域结构的动态变化和突变机制,以避免陷入局部最优.数值实验结果表明,该算法具有良好的求解效果.
A tabu search algorithm combined with k-means algorithm to deal with collaborative logistics network resource demands problem was analyzed with the total cost as objective function.Dynamic change and mutation are added into neighbor structure in order to get overall optimum.The outcome of the new approach was compared with the cost of random clustering system and prime system.The results of the computational experiment indicate that the proposed algorithm is effective.
出处
《上海交通大学学报》
EI
CAS
CSCD
北大核心
2009年第9期1407-1411,1416,共6页
Journal of Shanghai Jiaotong University
基金
上海市浦江人才计划资助项目(07PJ14052)
关键词
协同物流网络
成本分析
聚类算法
禁忌搜索
动态邻域
collaborative logistic network
cost analysis
clustering algorithm
tabu search
dynamic neighbor
