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

Effect of Time, Solvent-Solid Ratio, Ethanol Concentration and Temperature on Extraction Yield of Phenolic Compounds From Olive Leaves

This study aims to determine the factors affecting the process of extraction of phenolic compounds from olive leaves. Two methods of extraction were used in this work and different tests were implemented with the aim of...

Homogeneous and Stratified Liquid-Liquid Flow Effect of a Viscosity Reducer: I. Comparison in parallel plates for heavy crude

Production of heavy crude oil in Mexico, and worldwide, is increasing which has led to the application of different methods to reduce viscosity or to enhance transport through stratified flow to continue using the existi...

Determining the Critical Success Factors for Highway Construction Projects in Pakistan

The success of construction projects is not only crucial to stakeholders but also for the country’s economic and social development. Critical success factors (CSFs) are considered as key to project management practices w...

Information System for the Governance of University Cooperation

Recognizing the impact of international cooperation in science and technology, all higher education institutions prioritize strategic partnerships. If setting up a partnership is important, its management, monitoring and...

Sensitivity Analysis of Workspace Conflicts According to Changing Geometric Conditions

Workspace conflicts and building components can happen in different forms and both permanently and temporarily. These spatial clashes affect the work process and deplete the project process. Geometric clash detection sys...

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