Water flow-like algorithm with simulated annealing for travelling salesman problems

Zulaiha Ali Othman, Nasser Hamed Al-Dhwai, Ayman Srour, Wu Diyi

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Water Flow-like Algorithm (WFA) has been proved its ability obtaining a fast and quality solution for solving Travelling Salesman Problem (TSP). The WFA uses the insertion move with 2-neighbourhood search to get better flow splitting and moving decision. However, the algorithms can be improved by making a good balance between its solution search exploitation and exploration. Such improvement can be achieved by hybridizing good search algorithm with WFA. This paper presents a hybrid of WFA with various three neighbourhood search in Simulated Annealing (SA) for TSP problem. The performance of the proposed method is evaluated using 18 large TSP benchmark datasets. The experimental result shows that the hybrid method has improved the solution quality compare with the basic WFA and state of art algorithm for TSP.

Original languageEnglish
Pages (from-to)669-675
Number of pages7
JournalInternational Journal on Advanced Science, Engineering and Information Technology
Volume7
Issue number2
DOIs
Publication statusPublished - 2017

Fingerprint

Traveling salesman problem
annealing
Simulated annealing
water flow
Water
Benchmarking
Flow of water
methodology

Keywords

  • Combinatorial optimization
  • Meta-heuristics
  • Simulated Annealing
  • Travelling Salesman problem
  • Water flow-like algorithm

ASJC Scopus subject areas

  • Agricultural and Biological Sciences(all)
  • Computer Science(all)
  • Engineering(all)

Cite this

Water flow-like algorithm with simulated annealing for travelling salesman problems. / Ali Othman, Zulaiha; Al-Dhwai, Nasser Hamed; Srour, Ayman; Diyi, Wu.

In: International Journal on Advanced Science, Engineering and Information Technology, Vol. 7, No. 2, 2017, p. 669-675.

Research output: Contribution to journalArticle

@article{be65b93013044bfe89468062c841ff83,
title = "Water flow-like algorithm with simulated annealing for travelling salesman problems",
abstract = "Water Flow-like Algorithm (WFA) has been proved its ability obtaining a fast and quality solution for solving Travelling Salesman Problem (TSP). The WFA uses the insertion move with 2-neighbourhood search to get better flow splitting and moving decision. However, the algorithms can be improved by making a good balance between its solution search exploitation and exploration. Such improvement can be achieved by hybridizing good search algorithm with WFA. This paper presents a hybrid of WFA with various three neighbourhood search in Simulated Annealing (SA) for TSP problem. The performance of the proposed method is evaluated using 18 large TSP benchmark datasets. The experimental result shows that the hybrid method has improved the solution quality compare with the basic WFA and state of art algorithm for TSP.",
keywords = "Combinatorial optimization, Meta-heuristics, Simulated Annealing, Travelling Salesman problem, Water flow-like algorithm",
author = "{Ali Othman}, Zulaiha and Al-Dhwai, {Nasser Hamed} and Ayman Srour and Wu Diyi",
year = "2017",
doi = "10.18517/ijaseit.7.2.1837",
language = "English",
volume = "7",
pages = "669--675",
journal = "International Journal on Advanced Science, Engineering and Information Technology",
issn = "2088-5334",
publisher = "INSIGHT - Indonesian Society for Knowledge and Human Development",
number = "2",

}

TY - JOUR

T1 - Water flow-like algorithm with simulated annealing for travelling salesman problems

AU - Ali Othman, Zulaiha

AU - Al-Dhwai, Nasser Hamed

AU - Srour, Ayman

AU - Diyi, Wu

PY - 2017

Y1 - 2017

N2 - Water Flow-like Algorithm (WFA) has been proved its ability obtaining a fast and quality solution for solving Travelling Salesman Problem (TSP). The WFA uses the insertion move with 2-neighbourhood search to get better flow splitting and moving decision. However, the algorithms can be improved by making a good balance between its solution search exploitation and exploration. Such improvement can be achieved by hybridizing good search algorithm with WFA. This paper presents a hybrid of WFA with various three neighbourhood search in Simulated Annealing (SA) for TSP problem. The performance of the proposed method is evaluated using 18 large TSP benchmark datasets. The experimental result shows that the hybrid method has improved the solution quality compare with the basic WFA and state of art algorithm for TSP.

AB - Water Flow-like Algorithm (WFA) has been proved its ability obtaining a fast and quality solution for solving Travelling Salesman Problem (TSP). The WFA uses the insertion move with 2-neighbourhood search to get better flow splitting and moving decision. However, the algorithms can be improved by making a good balance between its solution search exploitation and exploration. Such improvement can be achieved by hybridizing good search algorithm with WFA. This paper presents a hybrid of WFA with various three neighbourhood search in Simulated Annealing (SA) for TSP problem. The performance of the proposed method is evaluated using 18 large TSP benchmark datasets. The experimental result shows that the hybrid method has improved the solution quality compare with the basic WFA and state of art algorithm for TSP.

KW - Combinatorial optimization

KW - Meta-heuristics

KW - Simulated Annealing

KW - Travelling Salesman problem

KW - Water flow-like algorithm

UR - http://www.scopus.com/inward/record.url?scp=85018495080&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85018495080&partnerID=8YFLogxK

U2 - 10.18517/ijaseit.7.2.1837

DO - 10.18517/ijaseit.7.2.1837

M3 - Article

VL - 7

SP - 669

EP - 675

JO - International Journal on Advanced Science, Engineering and Information Technology

JF - International Journal on Advanced Science, Engineering and Information Technology

SN - 2088-5334

IS - 2

ER -