Academic Journals Database
Disseminating quality controlled scientific knowledge

Solving the Vehicle Routing Problem using Genetic Algorithm

ADD TO MY LIST
 
Author(s): Abdul Kadar Muhammad Masum | Mohammad Shahjalal | Md. Faisal Faruque | Md. Iqbal Hasan Sarker

Journal: International Journal of Advanced Computer Sciences and Applications
ISSN 2156-5570

Volume: 2;
Issue: 7;
Start page: 126;
Date: 2011;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: Vehicle Routing Problem (VRP) | Genetic Algorithm | NP-complete | Heuristic

ABSTRACT
The main goal of this research is to find a solution of Vehicle Routing Problem using genetic algorithms. The Vehicle Routing Problem (VRP) is a complex combinatorial optimization problem that belongs to the NP-complete class. Due to the nature of the problem it is not possible to use exact methods for large instances of the VRP. Genetic algorithms provide a search technique used in computing to find true or approximate solution to optimization and search problems. However we used some heuristic in addition during crossover or mutation for tuning the system to obtain better result.
Affiliate Program      Why do you need a reservation system?