Vol 3 Issue 1 January 2016-April 2016
Dr. Mohammed Hassan Hassan, Dr. Laina Makdyssiian, Waseem Habib Bila
Abstract: 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 at the present time 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 Vehicle Routing Problem With Time Windows is growing steadily with the increase in the number of nodes. All the used algorithms have given solutions that are close to the optimal one. We'll show in our search Improved Ant Colony System algorithm (IACS) that is capable of searching multiple search areas simultaneously in the solution space is good in diversification, and Simulated Annealing algorithm (SA) is a local search technique that has been successfully applied to many NP-hard problems. In this research, we will present the In this research Hybrid algorithm (HA) Hybrid Algorithm provided (IACS-SA) that integrate between improved ant algorithm and Simulated Annealing algorithm . We will then compare the quality of the solution resulted from this hybrid approach with the results of well-known standard tests to determine the effectiveness of the presented approach.
Keywords: Vehicle Routing Problem With Time Windows, Simulated Annealing Algorithm, Improved Ant Colony System Algorithm, Hybrid Algorithm, 2-Opt Local Search, Nearest Neighbor Algorithm, Meta-Heuristics.
Title: An Integration between the Improved Ant Algorithm and the Simulated Annealing Algorithm to Contribute To Solve the Vehicle Routing Problem with Time Windows
Author: Dr. Mohammed Hassan Hassan, Dr. Laina Makdyssiian, Waseem Habib Bila
ISSN 2394-9651
International Journal of Novel Research in Physics Chemistry & Mathematics
Novelty Journals