GENETIC ALGORITHM FOR OPTIMIZING DISTRIBUTION WITH ROUTE RESTRICTION CONSTRAINT DUE TO TRAFFIC JAMS

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 prob...

Full description

Saved in:
Bibliographic Details
Published in:International archives of the photogrammetry, remote sensing and spatial information sciences. remote sensing and spatial information sciences., 2020-11, Vol.XLIV-4/W3-2020, p.295-301
Main Authors: Mouttaki, N., Benhra, J., Rguiga, G.
Format: Article
Language:English
Subjects:
Algorithms
Combinatorial analysis
Genetic algorithms
Optimization
Traffic congestion
Traffic jams
Traveling salesman problem
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2194-9034
1682-1750
2194-9034
DOI:10.5194/isprs-archives-XLIV-4-W3-2020-295-2020