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

Journal Title: Engineering, Technology & Applied Science Research - Year 2016, Vol 6, Issue 2

Abstract

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 simulating annealing, can solve TSP instances with different levels of accuracy. Choosing which algorithm to use in order to get a best solution is still considered as a hard choice. This paper suggests domain reduction as a tool to be combined with any meta-heuristic so that the obtained results will be almost the same. The hybrid approach of combining domain reduction with any meta-heuristic encountered the challenge of choosing an algorithm that matches the TSP instance in order to get the best results.

Authors and Affiliations

M. Abdul-Niby, M. Alameen, A. Salhieh, A. Radhi

Keywords

Related Articles

Effects of Greenshipping to the Maritime Industry

In order to keep focus on the important agenda of sustainability which has lately become an issue of priority, the maritime industry must implement technologies on existing vessels and on those under construction so as t...

Numerical Study of the Thermal Behavior of a Composite Phase Change Material (PCM) Room

In this study, thermal performance of building walls integrated with phase change materials (PCM) was evaluated in terms of indoor temperature reduction and heat transfer time delay. PCM was incorporated as thin layer pl...

A Frequency Multiplier Based on Time Recursive Processing

This paper describes a digital frequency multiplier for a pulse rate. The multiplier is based on the recursive processing of the input and output periods and their time differences. Special emphasis is devoted to the tec...

A Cloud Associated Smart Grid Admin Dashboard

Intelligent smart grid system undertakes electricity demand in a sustainable, reliable, economical and environmentally friendly manner. As smart grid involves, it has the liability of meeting the changing consumer needs...

Design and Performance Analysis of Multi-tier Heterogeneous Network through Coverage, Throughput and Energy Efficiency

The unprecedented acceleration in wireless industry strongly compels wireless operators to increase their data network throughput, capacity and coverage on emergent basis. In upcoming 5G heterogeneous networks inclusion...

Download PDF file
  • EP ID EP109267
  • DOI -
  • Views 301
  • Downloads 0

How To Cite

M. Abdul-Niby, M. Alameen, A. Salhieh, A. Radhi (2016). Improved Genetic and Simulating Annealing Algorithms to Solve the Traveling Salesman Problem Using Constraint Programming. Engineering, Technology & Applied Science Research, 6(2), -. https://europub.co.uk/articles/-A-109267