2017
DOI: 10.14738/tmlai.54.3211
|View full text |Cite
|
Sign up to set email alerts
|

Comparative analysis of Three Metaheuristics for Solving the Travelling Salesman Problem

Abstract: This research paper aims to do a comparative study of three recent optimization metaheuristic approaches that had been applied to solve the NPhard optimization problem called the travelling salesman problem. The three recent metaheuristics in study are cuckoo search algorithm, cat swarm optimization algorithm and batinspired algorithm. To compare the performances of these methods, the three metaheuristics are applied to solve some benchmark instances of TSPLIB. The obtained results are collected and the error … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 17 publications
0
6
0
Order By: Relevance
“…The lognormal and power law distributionsand, indeed, the Pareto distribution found by Szary, Kello, and Dale (2015) are heavy-tailed and may promote search efficiency (e.g., Aks, Zelinsky, & Sprott, 2002;Bouzidi, Riffi, & Bouzidi, 2017;Humphries, et al, 2016;Humphries & Sims, 2014;Lin, Chou, Yang, & Tsai, 2012;Raichlen, et al, 2013;Ratcliff, Gomez, & McKoon, 2004;Reynolds, 2011;Reynolds, Smith, Reynolds, Carreck, & Osborne, 2007;Rhodes & Turvey, 2007;Spivey & Dale, 2004;Stephen & Mirman, 2010;Stephen, Mirman, Magnuson, & Dixon, 2009;Viswanathan, et al, 1999). Taken together, the measures of skew and goodness of fit mathematically denote what can be seen in a single participant's data in Fig.…”
Section: Resultsmentioning
confidence: 68%
See 1 more Smart Citation
“…The lognormal and power law distributionsand, indeed, the Pareto distribution found by Szary, Kello, and Dale (2015) are heavy-tailed and may promote search efficiency (e.g., Aks, Zelinsky, & Sprott, 2002;Bouzidi, Riffi, & Bouzidi, 2017;Humphries, et al, 2016;Humphries & Sims, 2014;Lin, Chou, Yang, & Tsai, 2012;Raichlen, et al, 2013;Ratcliff, Gomez, & McKoon, 2004;Reynolds, 2011;Reynolds, Smith, Reynolds, Carreck, & Osborne, 2007;Rhodes & Turvey, 2007;Spivey & Dale, 2004;Stephen & Mirman, 2010;Stephen, Mirman, Magnuson, & Dixon, 2009;Viswanathan, et al, 1999). Taken together, the measures of skew and goodness of fit mathematically denote what can be seen in a single participant's data in Fig.…”
Section: Resultsmentioning
confidence: 68%
“…Heavy-tailed distributions also promote efficiency in reaching the maximum number of targets in the shortest total distance (Humphries & Sims, 2014). Several possible solutions for a common mathematical issue that involves optimization of travel distance between several locationsthe traveling salesman problemhave relied on Lévy flights (Bouzidi, Riffi, & Bouzidi, 2017;Yang, 2010). The traveling salesman problem poses the situation of a salesman who needs to stop in numerous cities while minimizing travel distance, as travel time is time spent not making sales.…”
Section: Heavy-tailed Distributionsmentioning
confidence: 99%
“…[77] Comparison between CSO, cuckoo search, and batinspired algorithm to solve TSP problem e benchmark instances are taken from STPLIB. e results show that CSO falls behind the other algorithms [78] Applied CSO and MCSO on workflow scheduling in cloud systems CSO performs better than PSO [79] Applied BCSO on workflow scheduling in cloud systems BCSO performs better than PSO and BPSO [80] Applied BCSO on SCP BCSO performs better than ABC [81] Applied BCSO on SCP BCSO performs better than binary teaching-learningbased optimization (BTLBO) [82,83] Used a CSO as a clustering mechanism in web services. CSO performs better than K-means [84] Applied hybrid CSO-GA-SA to find the overlapping community structures.…”
Section: Purpose Resultsmentioning
confidence: 99%
“…Bouzidi and Riffi applied CSO algorithm on the traveling salesman problem (TSP) and the quadratic assignment problem (QAP), which are two combinatorial optimization problems [77]. Bouzidi et al also made a comparative study between CSO algorithm, cuckoo search algorithm, and batinspired algorithm for addressing TSP [78]. In cloud computing, minimizing the total execution cost while allocating tasks to processing resources is a key problem.…”
Section: System Management and Combinatorial Optimizationmentioning
confidence: 99%
“…Riffi applied CSO Algorithm on the Traveling Salesman Problem (TSP) and the Quadratic Assignment Problem (QAP), which are two combinatorial optimization problems [78]. Bouzidi et al also made a comparative study between CSO algorithm, cuckoo search algorithm, and bat-inspired algorithm for addressing TSP [79]. In cloud computing, minimizing the total execution cost while allocating tasks to processing resources is a key problem.…”
Section: Computer Vision: Facial Emotionmentioning
confidence: 99%