<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>Travelling salesman problem (TSP) is a well known combinatorial optimization problem which has drawn colossal attention due to its eclectic range of applications. In this article, we have proposed two modified versions of intelligent water drops (IWD) algorithm. The first one is the enhanced IWD (e-IWD) algorithm to solve single objective TSP. In the second modification, e-IWD algorithm has been extended to enhanced multi-objective IWD(e-MIWD) algorithm for solving multi-objective TSP. In order to achieve a better exploration capability in both of the proposed algorithms, the soil and velocity parameters of a randomly selected water drop are updated after every iteration of the algorithm when it traverses all the intermediate vertices for a tour. The proposed algorithms have been compared with some other existing similar algorithms on different benchmark instances of TSPs. Furthermore, we have addressed the TSP for both single and multiple objectives under uncertain environment.</p>
</abstract>

Travelling salesman problem (TSP) is a well known combinatorial optimization problem which has drawn colossal attention due to its eclectic range of applications. In this article, we have proposed two modified versions of intelligent water drops (IWD) algorithm. The first one is the enhanced IWD (e-IWD) algorithm to solve single objective TSP. In the second modification, e-IWD algorithm has been extended to enhanced multi-objective IWD(e-MIWD) algorithm for solving multi-objective TSP. In order to achieve a better exploration capability in both of the proposed algorithms, the soil and velocity parameters of a randomly selected water drop are updated after every iteration of the algorithm when it traverses all the intermediate vertices for a tour. The proposed algorithms have been compared with some other existing similar algorithms on different benchmark instances of TSPs. Furthermore, we have addressed the TSP for both single and multiple objectives under uncertain environment.

On Enhanced Intelligent Water Drops Algorithm for Travelling Salesman Problem under Uncertain Paradigm

Department of Computer Science and Engineering, Greater Kolkata College of Engineering and Management

Kazi Nazrul University (Public University)

Department of Mathematics, Faculty of Science

Department of Mobile Machinery and Railway Transport, Faculty of Transport Engineering

Transport and Telecommunication Journal

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Travelling salesman problem (TSP) is a well known combinatorial optimization problem which has drawn colossal attention due to its eclectic range of...

On Enhanced Intelligent Water Drops Algorithm for Travelling Salesman Problem under Uncertain Paradigm

Published Online: Jun 17, 2023

Page range: 228 - 255

DOI: https://doi.org/10.2478/ttj-2023-0019

Keywords
Travelling salesman problem, Intelligent water drops algorithm, Uncertain variable

© 2023 Swapna Halder et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

On Enhanced Intelligent Water Drops Algorithm for Travelling Salesman Problem under Uncertain Paradigm

Published Online: Jun 17, 2023

Page range: 228 - 255

DOI: https://doi.org/10.2478/ttj-2023-0019

KeywordsTravelling salesman problem, Intelligent water drops algorithm, Uncertain variable

© 2023 Swapna Halder et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Keywords
Travelling salesman problem, Intelligent water drops algorithm, Uncertain variable