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

被引:6
作者
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 条
[31]   ABOUT OF THE ANNEALING METHOD USING FOR THE TRAVELING SALESMAN PROBLEM SOLUTION WITH THE FUZZY TIME [J].
Ivohin, E. V. ;
Adzhubey, L. T. ;
Makhno, M. F. ;
Rets, V. O. .
RADIO ELECTRONICS COMPUTER SCIENCE CONTROL, 2024, (04) :56-63
[32]   Optimization with extremal dynamics for the traveling salesman problem [J].
Chen, Yu-Wang ;
Lu, Yong-Zai ;
Chen, Peng .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2007, 385 (01) :115-123
[33]   Development a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic Algorithms [J].
Albayrak, Murat ;
Allahverdi, Novruz .
EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (03) :1313-1320
[34]   Integrating Relative Coordinates with Simulated Annealing to Solve a Traveling Salesman Problem [J].
Liu, Xiaojun ;
Zhang, Bin ;
Du, Fangying .
2014 SEVENTH INTERNATIONAL JOINT CONFERENCE ON COMPUTATIONAL SCIENCES AND OPTIMIZATION (CSO), 2014, :177-180
[35]   Enhanced List-Based Simulated Annealing Algorithm for Large-Scale Traveling Salesman Problem [J].
Wang, Lijin ;
Cai, Rongying ;
Lin, Min ;
Zhong, Yiwen .
IEEE ACCESS, 2019, 7 :144366-144380
[36]   A Discrete JAYA Algorithm Based on Reinforcement Learning and Simulated Annealing for the Traveling Salesman Problem [J].
Xu, Jun ;
Hu, Wei ;
Gu, Wenjuan ;
Yu, Yongguang .
MATHEMATICS, 2023, 11 (14)
[37]   Hysteretic optimization for the traveling salesman problem [J].
Pál, KF .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2003, 329 (1-2) :287-297
[38]   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-+
[39]   Solving Traveling Salesman Problem by Genetic Ant Colony Optimization Algorithm [J].
Gao, Shang .
DCABES 2008 PROCEEDINGS, VOLS I AND II, 2008, :597-602
[40]   A combination of genetic algorithm and particle swarm optimization method for solving traveling salesman problem [J].
Borna, Keivan ;
Khezri, Razieh .
COGENT MATHEMATICS, 2015, 2