用csharp给车辆路径问题写的节约算法，用arraylist实现路径的存储，很适合初接触车辆路径问题或csharp编程的朋友。另外考虑了对于循环取货所需要的1比1空箱返回。-A C# Code for CVRP with empty containers exchange. The Algorithms is the classical Clarke-Wright Saving Algorithms. Also realized with arraylist, which could be h

C-W节约算法是最经典的求解车辆路径问题的启发式算法。-The Clarke and Wright(1964) savings algorithm is perhaps the most widely known heuristic for the VRP.

Clarke And Wright Algorithm Descr iption