Modeling and Algorithm of Location-routing Problems
Chen An · Beijing Hangkong Hangtian Daxue xuebao · 2002
A mathematical model to solve location-routing problem is worked out and the heuristic algorithm proposed with the latter based on TSP and Modified Clarke-Wright saving algorithm. In the case of bill delivery, the optimised heuristic algorithm, compared with the traditional method, can acquire satisfactory solutions more quickly with the lowering of the operating cost and saving of the delivery time.