GENETIC ALGORITHM FOR OPTIMIZING DISTRIBUTION WITH ROUTE RESTRICTION CONSTRAINT DUE TO TRAFFIC JAMS
- OSIL Team, Lab LRI, ENSEM, UH2C, Casablanca, Morocco
Keywords: Genetic algorithm, Crossover, Mutation, Initialization, Traveling salesman problems, constraints, traffic jams
Abstract. The Travelling Salesman Problem (TSP) is a classical problem in combinatorial optimization that consists of finding the shortest tour through all cities such that the salesman visits each city only one time and returns to the starting city. Genetic algorithm is one of the powerful ways to solve problems of traveling salesman problem TSP. The current genetic algorithm aims to take in consideration the constraints happening during the execution of genetic algorithm, such as traffic jams when solving TSP. This program has two important contributions. First one is proposing simple method into taking in consideration an inconvenient route linked to traffic jams. The second one is the use of closeness strategy during the initialization step, which can accelerate the execution time of the algorithm.
The results of the experiments show that the improved algorithm works better than some other algorithms. The conclusion ends the analysis with recommendations and future works.