A Hybrid water flow-like algorithm and variable neighbourhood search for traveling salesman problem

Mohamed Rafique Othman, Zulaiha Ali Othman, Ayman Ibraheem Srour, Nor Samsiah Sani

Research output: Contribution to journalArticle

Abstract

Various metaheuristic methods have been proposed earlier and applied for solving the Travelling Salesman Problem (TSP). Water Flow Algorithm (WFA) is one of the recent population-based metaheuristic optimization techniques used for solving this problem. Past research has shown that improving WFA local search strategy has a significant impact on the algorithm performance. Therefore, this paper aims to solve TSP by enhancing WFA searching strategy based on a Variable Neighbourhood Search (VNS) known as hybrid WFA-VNS. It is a mixture of the exploration of WFA and the exploitation capability of VNS. This study is conducted in two stages: Pre-experiment and initial experiment. The objective of doing pre-experiment is to select four neighborhood structures to be used for the initial experiment. At the first stage, three instances are used, and there are five neighborhood structures involved. Those neighborhood structures are two opt, three opt, four opt, swapping, and insertion move. Because of pre-experiment, it discovers four best neighborhood structures, which are two opt, three opt, exchanging and insertion move. These neighborhood structures will be used in the initial experiment, which an improvement approach is employed. In an initial experiment, the performance of the proposed hybrid WFA-VNS is further studied and tested on 26 established benchmarked symmetric TSP datasets using four neighborhood structures selected in pre-experiment earlier. The TSP datasets involved are categorized into three types: small datasets, medium datasets, and large datasets. Selected neighborhood structures obtained in pre-experiment are applied and generated randomly to intensify the initial solution achieved at an earlier stage of hybrid WFA-VNS. The results of the comparison show that this hybrid approach represents an improvement and able to produce competitive results.

Original languageEnglish
Pages (from-to)1505-1511
Number of pages7
JournalInternational Journal on Advanced Science, Engineering and Information Technology
Volume9
Issue number5
DOIs
Publication statusPublished - 1 Jan 2019

Fingerprint

Traveling salesman problem
water flow
Water
Experiments
Flow of water
methodology
Datasets

Keywords

  • Hybrid algorithm
  • Metaheuristic
  • Travelling salesman problem
  • Variable neighbourhood search
  • Water flow

ASJC Scopus subject areas

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

Cite this

A Hybrid water flow-like algorithm and variable neighbourhood search for traveling salesman problem. / Othman, Mohamed Rafique; Othman, Zulaiha Ali; Srour, Ayman Ibraheem; Sani, Nor Samsiah.

In: International Journal on Advanced Science, Engineering and Information Technology, Vol. 9, No. 5, 01.01.2019, p. 1505-1511.

Research output: Contribution to journalArticle

@article{4ab6fb6b06de4330a4ec35a57dbf4d40,
title = "A Hybrid water flow-like algorithm and variable neighbourhood search for traveling salesman problem",
abstract = "Various metaheuristic methods have been proposed earlier and applied for solving the Travelling Salesman Problem (TSP). Water Flow Algorithm (WFA) is one of the recent population-based metaheuristic optimization techniques used for solving this problem. Past research has shown that improving WFA local search strategy has a significant impact on the algorithm performance. Therefore, this paper aims to solve TSP by enhancing WFA searching strategy based on a Variable Neighbourhood Search (VNS) known as hybrid WFA-VNS. It is a mixture of the exploration of WFA and the exploitation capability of VNS. This study is conducted in two stages: Pre-experiment and initial experiment. The objective of doing pre-experiment is to select four neighborhood structures to be used for the initial experiment. At the first stage, three instances are used, and there are five neighborhood structures involved. Those neighborhood structures are two opt, three opt, four opt, swapping, and insertion move. Because of pre-experiment, it discovers four best neighborhood structures, which are two opt, three opt, exchanging and insertion move. These neighborhood structures will be used in the initial experiment, which an improvement approach is employed. In an initial experiment, the performance of the proposed hybrid WFA-VNS is further studied and tested on 26 established benchmarked symmetric TSP datasets using four neighborhood structures selected in pre-experiment earlier. The TSP datasets involved are categorized into three types: small datasets, medium datasets, and large datasets. Selected neighborhood structures obtained in pre-experiment are applied and generated randomly to intensify the initial solution achieved at an earlier stage of hybrid WFA-VNS. The results of the comparison show that this hybrid approach represents an improvement and able to produce competitive results.",
keywords = "Hybrid algorithm, Metaheuristic, Travelling salesman problem, Variable neighbourhood search, Water flow",
author = "Othman, {Mohamed Rafique} and Othman, {Zulaiha Ali} and Srour, {Ayman Ibraheem} and Sani, {Nor Samsiah}",
year = "2019",
month = "1",
day = "1",
doi = "10.18517/ijaseit.9.5.7957",
language = "English",
volume = "9",
pages = "1505--1511",
journal = "International Journal on Advanced Science, Engineering and Information Technology",
issn = "2088-5334",
publisher = "INSIGHT - Indonesian Society for Knowledge and Human Development",
number = "5",

}

TY - JOUR

T1 - A Hybrid water flow-like algorithm and variable neighbourhood search for traveling salesman problem

AU - Othman, Mohamed Rafique

AU - Othman, Zulaiha Ali

AU - Srour, Ayman Ibraheem

AU - Sani, Nor Samsiah

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Various metaheuristic methods have been proposed earlier and applied for solving the Travelling Salesman Problem (TSP). Water Flow Algorithm (WFA) is one of the recent population-based metaheuristic optimization techniques used for solving this problem. Past research has shown that improving WFA local search strategy has a significant impact on the algorithm performance. Therefore, this paper aims to solve TSP by enhancing WFA searching strategy based on a Variable Neighbourhood Search (VNS) known as hybrid WFA-VNS. It is a mixture of the exploration of WFA and the exploitation capability of VNS. This study is conducted in two stages: Pre-experiment and initial experiment. The objective of doing pre-experiment is to select four neighborhood structures to be used for the initial experiment. At the first stage, three instances are used, and there are five neighborhood structures involved. Those neighborhood structures are two opt, three opt, four opt, swapping, and insertion move. Because of pre-experiment, it discovers four best neighborhood structures, which are two opt, three opt, exchanging and insertion move. These neighborhood structures will be used in the initial experiment, which an improvement approach is employed. In an initial experiment, the performance of the proposed hybrid WFA-VNS is further studied and tested on 26 established benchmarked symmetric TSP datasets using four neighborhood structures selected in pre-experiment earlier. The TSP datasets involved are categorized into three types: small datasets, medium datasets, and large datasets. Selected neighborhood structures obtained in pre-experiment are applied and generated randomly to intensify the initial solution achieved at an earlier stage of hybrid WFA-VNS. The results of the comparison show that this hybrid approach represents an improvement and able to produce competitive results.

AB - Various metaheuristic methods have been proposed earlier and applied for solving the Travelling Salesman Problem (TSP). Water Flow Algorithm (WFA) is one of the recent population-based metaheuristic optimization techniques used for solving this problem. Past research has shown that improving WFA local search strategy has a significant impact on the algorithm performance. Therefore, this paper aims to solve TSP by enhancing WFA searching strategy based on a Variable Neighbourhood Search (VNS) known as hybrid WFA-VNS. It is a mixture of the exploration of WFA and the exploitation capability of VNS. This study is conducted in two stages: Pre-experiment and initial experiment. The objective of doing pre-experiment is to select four neighborhood structures to be used for the initial experiment. At the first stage, three instances are used, and there are five neighborhood structures involved. Those neighborhood structures are two opt, three opt, four opt, swapping, and insertion move. Because of pre-experiment, it discovers four best neighborhood structures, which are two opt, three opt, exchanging and insertion move. These neighborhood structures will be used in the initial experiment, which an improvement approach is employed. In an initial experiment, the performance of the proposed hybrid WFA-VNS is further studied and tested on 26 established benchmarked symmetric TSP datasets using four neighborhood structures selected in pre-experiment earlier. The TSP datasets involved are categorized into three types: small datasets, medium datasets, and large datasets. Selected neighborhood structures obtained in pre-experiment are applied and generated randomly to intensify the initial solution achieved at an earlier stage of hybrid WFA-VNS. The results of the comparison show that this hybrid approach represents an improvement and able to produce competitive results.

KW - Hybrid algorithm

KW - Metaheuristic

KW - Travelling salesman problem

KW - Variable neighbourhood search

KW - Water flow

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

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

U2 - 10.18517/ijaseit.9.5.7957

DO - 10.18517/ijaseit.9.5.7957

M3 - Article

AN - SCOPUS:85075399413

VL - 9

SP - 1505

EP - 1511

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

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

SN - 2088-5334

IS - 5

ER -