Vehicle routing problem is one of the most challenging areas of research in the field of combinatorial research. This problem is designing optimal set of routes for fleet of vehicles in order to serve a given set of costumers. Our project is mainly concerned about finding the optimized path between source and destination having several intermediate stages. We consider the problem in 2 regards: (a) Transportation View and (b) Personalized view. When coming to transportation, the goal is to maximize the income of the journey that is facilitating maximum people. The key objectives considered there is route constraint that limits the length of all feasible routes. When coming to the personalized view, a travel of a single person is concerned with the objectives like minimum cost, maximum mileage and so on To implement this we are using GA which come under multi objective Optimization techniques (MOO) .We choose to implement this because general conventional methods like heuristic search does searching sequentially, where are these methods are faster, parallel and even work on multiple objectives at a time and draw a feasible solution.
SOLUTION TO VEHICLE ROUTING PROBLEM USING GENETIC ALGORITHMS
2014-11-30
IJITR; Vol 2, No 6 (2014): October - November 2014; 1611-1617
Article (Journal)
Electronic Resource
English
Vehicle Routing Problem Using Genetic Algorithms Based on Adjacency Relations
British Library Conference Proceedings | 1995
|Vehicle routing problem using genetic algorithms based on adjacency relations
Automotive engineering | 1995
|Genetic Algorithms for Vehicle Routing Problem in Deliver System
British Library Conference Proceedings | 1994
|