摘要
针对物流配送中心选址问题中很少考虑时间因素的问题,提出将配送时间与需求量共同来决定权值的选址模型,使用免疫算法求解带权值的物流配送中心选址问题,并说明了所提出算法具有全局渐近收敛性。通过实例仿真,与不考虑配送时间因素相比,用所提出的模型得到的结果具有更少的最短距离之和(约少了12.68%)以及更少的运行时间,最佳迭代次数约为不考虑配送时间因素下的1/4,从而论证了所提出模型的合理性及有效性。
Aiming at fewer considered time factor in the logistics distribution center location, a new location model has been proposedwhich has synthesized distribution time and quantity demanded to decide weighted, via immune algorithm to solve weighted logisticsdistribution center location, what＇s more, the convergence of proposed algorithm has been described. By means of examples to getdistribution center location coordinates, compared with no considering distribution time, our way has shorter sum of distance （aboutless than 12.68%） and little running time in terms of algorithm, the best iteration times is a quarter of no considering distributiontime, then demonstrate that the proposed model is reasonable and efficacious.
出处
《重庆师范大学学报（自然科学版）》
CAS
CSCD
北大核心
2015年第5期107-113,共7页
Journal of Chongqing Normal University:Natural Science
基金
重庆师范大学博士基金(No.11XLB047)
关键词
免疫算法
权值
配送中心选址
配送时间
需求量
immune algorithm
weight
logistics distribution eenter location
distribution time
quantity demanded
