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

Modeling a PV-FC-Hydrogen Hybrid Power Generation System

Electrical grid expansion onto remote areas is often not cost-effective and/or technologically feasible. Thus, isolated electrical systems are preferred in such cases. This paper focuses on a hybrid photovoltaic (PV)-hyd...

Crude Oil Importation and Exportation in Nigeria: An Exploratory and Comparative Study

Nigeria is an oil producing country and crude oil is an important asset to its economy. This research focuses on the analysis of importation and exportation of crude oil products (measured in million barrels). Comparison...

Achieving Optimal Degrees of Freedom for an Interference Network with General Message Demand

The concept of degrees of freedom (DoF) has been adopted to resolve the difficulty of studying the multi-user wireless network capacity regions. Interference alignment (IA) is an important technique developed recently fo...

A Single Sided Edge Marking Method for Detecting Pectoral Muscle in Digital Mammograms

In the computer-assisted diagnosis of breast cancer, the removal of pectoral muscle from mammograms is very important. In this study, a new method, called Single-Sided Edge Marking (SSEM) technique, is proposed for the i...

Modeling and Analysis of a Cascaded Battery-Boost Multilevel Inverter Using Different Switching Angle Arrangement Techniques

Multilevel inverters have the capability to produce an AC staircase output waveform without using a bulky passive filter. Therefore, the multilevel inverters are gaining more and more popularity, among the different type...

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