Hybrid Genetic Algorithms and Simulated Annealing for Multi-trip Vehicle Routing Problem with Time Windows

Abstrak

Vehicle routing problem with time windows (VRPTW) is one of NP-hard problem. Multi-trip is approach to solve the VRPTW that looking trip scheduling for gets best result. Even though there are various algorithms for the problem, there is opportunity to improve the existing algorithms in order gaining a better result. In this research, genetic algoritm is hybridized with simulated annealing algoritm to solve the problem. Genetic algoritm is employed to explore global search area and simulated annealing is employed to exploit local search area. Four combination types of genetic algorithm and simulated annealing (GA-SA) are tested to get the best solution. The computational experiment shows that GA-SA1 and GA-SA4 can produced the most optimal fitness average values with each value was 1.0888 and 1.0887. However GA-SA4 can found the best fitness chromosome faster than GA-SA1.