| dc.description.abstract | VRP stands for "Vehicle Routing Problem." It is a well-known combinatorial
optimization problem in the field of operations research and logistics. Throughout the
history of studying transportation problems, there exists multiple ways to solve the VRP
problem. This study will focus on Genetic algorithm (GA) to solve the problem. GA is an
optimization metaheuristic that mimics the evolution of nature – the strong survive while
the weak are eliminated. GA involves a population, then among the population there are
individuals who are selected, crossover and mutated to become a better individual, or better
solution. This method will be applied to this case study to solve dynamic demand problems
that DKSH have. The main objective is to minimize travel distance while delivering all the
dynamic demand to the customers. The model will have some small limitations; however
the finding of this paper can provide valuable insights for researchers to address and solve
VRP problems effectively in the future. | en_US |
