| 针对模糊需求的VRP的两种2-OPT算法 |
| |
| 引用本文： | 祝崇隽,刘民,吴澄,吴晓冰.针对模糊需求的VRP的两种2-OPT算法[J].电子学报,2001,29(8):1035-1037. |
| |
| 作者姓名： | 祝崇隽 刘民 吴澄 吴晓冰 |
| |
| 作者单位： | 1. 清华大学自动化系,北京,100084;2. 中兴通讯有限公司上海二所,上海 200233 |
| |
| 基金项目： | 国家自然科学基金，国家高技术研究发展计划(863计划)，科技部中英科技合作基金，60004010，，，，， |
| |
| 摘 要： | 本文研究了一类客户需求不确定的VRP(车辆路径问题).在算法中,引入了伪出发点和新的聚类判定规则,将聚类和排序有机的结合起来,有效地处理了全局采样和局部搜索之间的矛盾.给出了基于可能性分布的2-OPT算法和基于需求上界的2-OPT算法,并用模糊模拟技术进行了实验.大量的实验结果表明,这两种方法明显优于这个领域现有的算法,可以大幅度减少总行程和所需要的车辆.
|
| 关 键 词： | VRP问题 可能性分布 伪出发点 需求上界 2-OPT |
| 文章编号： | 0372-2112(2001)08-1035-03 |
| 收稿时间： | 2000-06-10 |
Two Kinds of 2-OPT Algorithm for VRP with Fuzzy Demand |
| |
| ZHU Chong-jun,LIU Min,WU Cheng,WU Xiao-bing.Two Kinds of 2-OPT Algorithm for VRP with Fuzzy Demand[J].Acta Electronica Sinica,2001,29(8):1035-1037. |
| |
| Authors: | ZHU Chong-jun LIU Min WU Cheng WU Xiao-bing |
| |
| Affiliation: | 1. Department of Automation,Tsinghua University,Beijing 100084,China;2. Shanghai 2; Institute,ZhongXing Telecom Ltd.,Shanghai 200233,China |
| |
| Abstract: | 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. |
| |
| Keywords: | 2-OPT |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《电子学报》浏览原始摘要信息 |
|
点击此处可从《电子学报》下载全文 |
|
