1. Combination of Genetic and Random Restart Hill Climbing Algorithms for Vehicle Routing Problem
- Author
-
E. Beqa, Eliot Bytyçi, and Ermir Rogova
- Subjects
Divide and conquer algorithms ,Uniform distribution (continuous) ,Exponential distribution ,Fitness proportionate selection ,Computer science ,Vehicle routing problem ,Genetic algorithm ,Hill climbing ,Algorithm ,Selection (genetic algorithm) - Abstract
Vehicle routing problem falls into NP hard problems. Researchers have tried with many techniques to find the most suitable and fastest way for solving the problem. With the usage of divide and conquer approach, the problem is divided into several parts that ensures finding the most suitable algorithms. In this special case, the combination of the genetic algorithm with the random restart hill climbing algorithm is used. The cluster first – route second algorithm provides that the approach will be attributed the necessary speed, from the usage of hill climbing algorithm. Furthermore, usage of genetic algorithm provides for bigger space that can be searched. For the selection step of the genetic algorithms, three types of distributions: uniform, log-normal and exponential were compared with fitness proportionate selection to further speed up the algorithm. The results show that the uniform distribution is the reasonable substitution, while the log-normal and the exponential distribution converge faster with a higher cost penalty.
- Published
- 2021
- Full Text
- View/download PDF