Combination of Genetic Algorithm with Dynamic Programming for Solving TSP

Simple item page
dc.contributor.authorHemmak, Allaoua
dc.date.accessioned2018-03-22T09:12:41Z
dc.date.available2018-03-22T09:12:41Z
dc.date.issued2017-07-02
dc.description.abstractThis paper presents a combination of Genetic Algorithm (GA) with Dynamic Programming (DP) to solve the well-known Travelling Salesman Problem (TSP). In this work, DP is integrated as a GA operator with a certain probability. In specific, at a given GA generation, the individuals are subdivided into a number of equal segments of genes, and the shortest path on each segment is obtained by applying a DP algorithm. Since the computational complexity of the DP is O (k22k), it becomes of O(1) when k is small. Experimental analyses are conducted to investigate the impact and trade-offs among DP probability, segment size and time processing on the solution quality and computational effort. In addition, we will implement a basic GA approach to compare results and show the contribution of combination of combination approach. Experimental results on benchmark instances showed that the combined GA-DP algorithm reduces significantly the computational effort, produces a clearly improved solution quality and avoids early premature convergence of GA.en_US
dc.identifier.urihttps://dspace.univ-msila.dz/handle/123456789/3798
dc.language.isoenen_US
dc.publisherUniversité de M'silaen_US
dc.subjectCombinatorial Optimization, Dynamic Programming, Evolutionary Computing, Genetic Algorithm, Traveling Salesman Problem.en_US
dc.titleCombination of Genetic Algorithm with Dynamic Programming for Solving TSPen_US
dc.typeArticleen_US

Files

License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Journal Articles