Hybridizing simulated annealing and genetic algorithms with Pythagorean fuzzy uncertainty for traveling salesman problem optimization

被引:9
作者
Akram, Muhammad [1 ]
Habib, Amna [1 ]
机构
[1] Univ Punjab, Dept Math, New Campus, Lahore, Pakistan
关键词
Traveling salesman problem; Optimization; Hybrid algorithms; Simulated annealing; Genetic algorithm; Pythagorean fuzzy uncertainty; MEMBERSHIP GRADES; TSP; SEARCH;
D O I
10.1007/s12190-023-01935-y
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The traveling salesman problem is a classic combinatorial optimization challenge with profound implications for various industries. While significant progress has been made in solving traveling salesman problem instances, real-world applications often involve uncertainties that challenge the accuracy and robustness of traditional approaches. Pythagorean fuzzy uncertain variables combine the strengths of fuzzy logic with the principles of uncertainty theory, allowing for a more balanced and comprehensive representation of uncertainty. This paper defines the theoretical foundations of normal, lognormal, and empirical Pythagorean fuzzy uncertainty distributions, including their mathematical formulation and operational laws. Moreover, it presents a novel hybrid optimization approach that leverages the strengths of simulated annealing and genetic algorithms while incorporating Pythagorean fuzzy uncertain variables to address the traveling salesman problem under uncertain conditions. The synergy of these two techniques enables effective exploration and exploitation of solution candidates, leading to improved traveling salesman problem solutions. The detailed steps of the algorithm are demonstrated through a numerical example. A case study of a decision support system for optimizing a beverage logistics vehicle routing problem is discussed to find out the best possible route in the distribution zones. The incorporation of Pythagorean fuzzy uncertain variables enhances the algorithm's robustness in uncertain environments, resulting in higher-quality solutions and improved adaptability to different levels of uncertainty.
引用
收藏
页码:4451 / 4497
页数:47
相关论文
共 50 条
[41]   Performance Analysis of Local Optimization Algorithms in Traveling Salesman Problem [J].
Qu, Dapeng ;
Tu, Hui ;
Fan, Tiesheng .
ADVANCES IN MECHATRONICS, AUTOMATION AND APPLIED INFORMATION TECHNOLOGIES, PTS 1 AND 2, 2014, 846-847 :1364-+
[42]   Solving Traveling Salesman Problem by Genetic Ant Colony Optimization Algorithm [J].
Gao, Shang .
DCABES 2008 PROCEEDINGS, VOLS I AND II, 2008, :597-602
[43]   A combination of genetic algorithm and particle swarm optimization method for solving traveling salesman problem [J].
Borna, Keivan ;
Khezri, Razieh .
COGENT MATHEMATICS, 2015, 2
[44]   Research on Solving Traveling Salesman Problem Based on Virtual Instrument Technology and Genetic-Annealing Algorithms [J].
Chen, Muhao ;
Gong, Chen ;
Li, Xiaolong ;
Yu, Zongxin .
2015 CHINESE AUTOMATION CONGRESS (CAC), 2015, :1825-1827
[45]   A new approach to the traveling salesman problem using genetic algorithms with priority encoding [J].
Wei, JD ;
Lee, DT .
CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2004, :1457-1464
[46]   A thorough study of the performance of simulated annealing in the traveling salesman problem under correlated and long tailed spatial scenarios [J].
da Silva, Roberto ;
Venites Filho, Eliseu ;
Alves, Alexandre .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2021, 577 (577)
[47]   A new genetic algorithm for the asymmetric traveling salesman problem [J].
Nagata, Yuichi ;
Soler, David .
EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (10) :8947-8953
[48]   The Complete Subtour Order Crossover in Genetic Algorithms for Traveling Salesman Problem Solving [J].
Toathom, Thanan ;
Champrasert, Paskorn .
2022 37TH INTERNATIONAL TECHNICAL CONFERENCE ON CIRCUITS/SYSTEMS, COMPUTERS AND COMMUNICATIONS (ITC-CSCC 2022), 2022, :904-907
[49]   Hybridizing Different Local Search Algorithms with Each Other and Evolutionary Computation: Better Performance on the Traveling Salesman Problem [J].
Wu, Yuezhong ;
Weise, Thomas ;
Liu, Weichen .
PROCEEDINGS OF THE 2016 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'16 COMPANION), 2016, :57-58
[50]   A simulated annealing approach to solve a multi traveling salesman problem in a FMCG company [J].
Rao, T. Srinivas .
MATERIALS TODAY-PROCEEDINGS, 2021, 46 :4971-4974