An Evolutionary Approach for Shortest Path Problem - Courier Delivery System

This paper presents an evolutionary approach (genetic algorithm) to solve shortest path problem. This paper consider the problem for selecting a shortest route to deliver couriers to their destination address. The shortest route is defined as a route starts from the courier office to visit a number of destinations and at last returns to its source address. We have explored the use of genetic algorithm where possible solutions are improved generation by generation and then there is more probability to find the exact solution. Fitness function is the backbone of the concept of genetic algorithm which directly affects the performance; since this is NP problem and traditional heuristics have had only limited success in solving small to mid size problems. In this paper we have tried to show that genetic algorithm is an alternative solution for this NP problem where conventional deterministic methods are not able to provide the optimal solution.