The Discrete Carnivorous Plant Algorithm with Similarity Elimination Applied to the Traveling Salesman Problem

Pan-Li Zhang, Xiao-Bo Sun, Ji-Quan Wang (), Hao-Hao Song, Jin-Ling Bei and Hong-Yu Zhang
Additional contact information
Pan-Li Zhang: College of Engineering, Northeast Agricultural University, Harbin 150030, China
Xiao-Bo Sun: College of Engineering, Northeast Agricultural University, Harbin 150030, China
Ji-Quan Wang: College of Engineering, Northeast Agricultural University, Harbin 150030, China
Hao-Hao Song: College of Engineering, Northeast Agricultural University, Harbin 150030, China
Jin-Ling Bei: College of Engineering, Northeast Agricultural University, Harbin 150030, China
Hong-Yu Zhang: College of Engineering, Northeast Agricultural University, Harbin 150030, China

Mathematics, 2022, vol. 10, issue 18, 1-34

Abstract: The traveling salesman problem (TSP) widely exists in real-life practical applications; it is a topic that is under investigation and presents unsolved challenges. The existing solutions still have some challenges in convergence speed, iteration time, and avoiding local optimization. In this work, a new method is introduced, called the discrete carnivorous plant algorithm (DCPA) with similarity elimination to tackle the TSP. In this approach, we use a combination of six steps: first, the algorithm redefines subtraction, multiplication, and addition operations, which aims to ensure that it can switch from continuous space to discrete space without losing information; second, a simple sorting grouping method is proposed to reduce the chance of being trapped in a local optimum; third, the similarity-eliminating operation is added, which helps to maintain population diversity; fourth, an adaptive attraction probability is proposed to balance exploration and the exploitation ability; fifth, an iterative local search (ILS) strategy is employed, which is beneficial to increase the searching precision; finally, to evaluate its performance, DCPA is compared with nine algorithms. The results demonstrate that DCPA is significantly better in terms of accuracy, average optimal solution error, and iteration time.

Keywords: discrete carnivorous plant algorithm; traveling salesman problem; simple sorting grouping; similarity elimination; iterative local search (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/18/3249/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/18/3249/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:18:p:3249-:d:908993

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().