he 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.
%0 Journal Article
%1 IJACSA.2011.020719
%A Abdul Kadar Muhammad Masum Mohammad Shahjalal, Md. Faisal Faruque Md. Iqbal Hasan Sarker
%D 2011
%J International Journal of Advanced Computer Science and Applications(IJACSA)
%K (VRP); Algorithm; Genetic Heuristic. NP-complete; Problem Routing Vehicle
%N 7
%T Solving the Vehicle Routing Problem using Genetic Algorithm
%U http://ijacsa.thesai.org/
%V 2
%X he 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.
@article{IJACSA.2011.020719,
abstract = {he 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.},
added-at = {2014-02-21T08:00:08.000+0100},
author = {{Abdul Kadar Muhammad Masum Mohammad Shahjalal}, Md. Faisal Faruque Md. Iqbal Hasan Sarker},
biburl = {https://www.bibsonomy.org/bibtex/24e71094ea8f07b11a98865b06192b383/thesaiorg},
interhash = {af099faffa7c04debadc5673229db858},
intrahash = {4e71094ea8f07b11a98865b06192b383},
journal = {International Journal of Advanced Computer Science and Applications(IJACSA)},
keywords = {(VRP); Algorithm; Genetic Heuristic. NP-complete; Problem Routing Vehicle},
number = 7,
timestamp = {2014-02-21T08:00:08.000+0100},
title = {{Solving the Vehicle Routing Problem using Genetic Algorithm}},
url = {http://ijacsa.thesai.org/},
volume = 2,
year = 2011
}