摘要
从理论角度对具有时效性服装最优路径的配送进行研究。首先确定服装具有时效性等特点,建立了服装时效性的模糊数学模型,通过对服装配送问题的变量研究,结合服装时效性的模糊数学模型,研究了具有时效性的服装车辆路径问题(vehicle routing problem,VRP)模型;在此基础上,通过对传统的蚁群算法(ant colony algorithm)分析,研究了与服装VRP模型相匹配的改进型蚁群算法(modified ant colony algorithm,MACA);MACA具有的最优属性是以服装时效性变量为权重的更新函数作为各配送点信息素更新函数。结果表明,改进的蚁群算法,对具有时效性服装的VRP模型的最优路径的求解更优,证明了MACA对具有时效性服装VRP模型求解的合理性与有效性。
This paper theoretically completed the research on the optimal route distribution of clothing timeliness.First,according to the features of clothing distribution timeliness,the clothing timelines fuzzy math model is built.With the model,the model of vehicle routing problem（VRP） with the clothing timeliness is discussed.And then,on the basis the conventional ant colony algorithm is analyzed,and a modified ant colony algorithm（MACA） which is fit for clothing VRP model is studied.The optimal attributes of the MACA,utilizing the variables of clothing timeliness as the updating function of the weighting,updates the function of information element at all clothing distribution points.The results indicate that compared with the existing ant colony algorithm,the MACA proposed by the paper can enhance the ability to find the solution of the clothing VRP with timeliness.The feasibility and rationality of the models and the algorithm are verified by practical examples.
出处
《纺织学报》
EI
CAS
CSCD
北大核心
2012年第3期139-144,共6页
Journal of Textile Research
基金
浙江省教育厅科研资助项目(Y201120095)
宁波市自然科学基金资助项目(201001A6001043)
关键词
时效性
模糊数学
服装配送
车辆路径问题
模型
timeliness
fuzzy math
clothing distribution
vehicle routing problem
model
