(Guided Local Search- Tabu Search) Hybrid Algorithm Integrated With Simulated Annealing Algorithm To Solve The Vehicle Routing Problem With Time Windows

In this research, we are studying the possibility of contribution in solving the Vehicle Routing Problem With Time Windows(VRPWTW), that is one of the optimization problems of the NP-hard type. This problem has attracted a lot of attention now because of its real life applications. However, there is still no algorithm that provides us with the perfect solution to this problem because of the complexity of polynomial time. This means that the time of the solution to the VRPWTW is growing steadily with the increase in the number of nodes .All the used algorithms have just given solutions that are close to the optimal one.