Two Kinds of 2-OPT Algorithm for VRP with Fuzzy Demand
Zhu Chong-jun · Dianzi xuebao · 2001
A kind of vehicle routing problem with uncertain client demand is discussed.Fals e 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 m ethods.It is proved by large numbers of experimental(4000 experiments)results sh ow that the two algorithms are much better than existing algorithms in this fiel d,and that the total distance and vehicle required are sharply reduced.