A Clarke and Wright Improved Algorithm to Solve the Vehicle Routing and Traveling Salesman Problem

Abstract

Vehicle Routing Problem (VRP) and Traveling Salesman Problem (TSP) are well known transportation problems. The problems can be seen in all the industries that involves goods distribution and transportation scheduling. Finding the shortest distance with respect to the given constraint contribute highly to save money and energy  consumption. This paper investigates the possibility of creating a cellular application that can provide an instant routing plan through a simple heuristic (Clarke and Wright) in order to avoid the usage of more complicated approaches as metaheuristics and exact methods that normally taking very long CPU time.