Improved Genetic and Simulating Annealing Algorithms to Solve the Traveling Salesman Problem Using Constraint Programming

Improved Genetic and Simulating Annealing Algorithms to Solve the Traveling Salesman Problem Using Constraint Programming

Show other versions (1)

The Traveling Salesman Problem (TSP) is an integer programming problem that falls into the category of NP-Hard problems. As the problem become larger, there is no guarantee that optimal tours will be found within reasonable computation time. Heuristics techniques, like genetic algorithm and simulati...

Full description

Bibliographic Details
Main Authors: M. Abdul-Niby, M. Alameen, A. Salhieh, A. Radhi
Format: Article
Language:English
Published: D. G. Pylarinos 2016-04-01
Series:Engineering, Technology & Applied Science Research
Subjects:
Traveling Salesman Problem
Genetic Algorithm
Simulating Annealing
Domain Reduction
Online Access:http://etasr.com/index.php/ETASR/article/download/627/332

Internet

http://etasr.com/index.php/ETASR/article/download/627/332

Similar Items