1. 清华大学自动化系,北京,100084
2. 中兴通讯有限公司上海二所,上海,200233
3. 清华大学自动化系北京,100084
4. 中兴通讯有限公司上海二所上海,200233
纸质出版:2001
移动端阅览
祝崇隽, 刘 民, 吴 澄, 等. 针对模糊需求的VRP的两种2-OPT算法[J]. 电子学报, 2001,29(8):1035-1037.
ZHU Chong-jun, LIU Min, WU Cheng, et al. Two Kinds of 2-OPT Algorithm for VRP with Fuzzy Demand[J]. Acta Electronica Sinica, 2001, 29(8): 1035-1037.
本文研究了一类客户需求不确定的VRP(车辆路径问题).在算法中
引入了伪出发点和新的聚类判定规则
将聚类和排序有机的结合起来
有效地处理了全局采样和局部搜索之间的矛盾.给出了基于可能性分布的2-OPT算法和基于需求上界的2-OPT算法
并用模糊模拟技术进行了实验.大量的实验结果表明
这两种方法明显优于这个领域现有的算法
可以大幅度减少总行程和所需要的车辆.
A kind of vehicle routing problem with uncertain client demand is discussed.False depot and new clustering determinat rules are introduced
clustering and taxis are syncretized completely
and the conflict of global sampling and local search is effectively solved.2-OPT algorithm based on possibility and 2-OPT algorithm based on demand upper bound are presented
and simulated with fuzzy simulation methods.It is proved by large numbers of experimental(4000 experiments)results show that the two algorithms are much better than existing algorithms in this field
and that the total distance and vehicle required are sharply reduced.
0
浏览量
1367
下载量
6
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621