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

Analysis of D2D Communication System Over κ-μ Shadowed Fading Channel

Outage performance of a device-to-device (D2D) communication system in the presence of co-channel interference (CCI) is analyzed in this paper. Channels for the D2D and CCI signals are assumed to be κ-μ shadowed faded. M...

The Effect of Displacement Mode of Rigid Retaining Walls on Shearing Bands by Active Earth Pressure

This work treats the physical modeling of failure mechanisms by active earth pressure. This last is developed by retaining wall movement. A lot of research showed that wall displacement has a significant effect on active...

Generation of a New Three Dimension Autonomous Chaotic Attractor and its Four Wing Type

In this paper, a new three-dimension (3D) autonomous chaotic system with a nonlinear term in the form of a hyperbolic sine (or cosine) function is reported. Some interesting and complex attractors are obtained. Basic dyn...

A Study of K- Factor Power Transformer Characteristics by Modeling Simulation

Harmonic currents generated by nonlinear loads can cause overheating and premature failure in power transformers. K-factor transformers are specially designed to accommodate harmonic currents and offer protection against...

Perspectives of a Farmer Digital Expert Assistant System

Global positioning system (GPS) based farmer digital expert assistant systems (FDEAS) are capable of analyzing the agricultural field and environmental factors associated with the field. The agricultural yield to be harv...

Download PDF file
  • EP ID EP109267
  • DOI -
  • Views 278
  • 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