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 条
  • [21] Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search
    Geng, Xiutang
    Chen, Zhihua
    Yang, Wei
    Shi, Deqian
    Zhao, Kai
    APPLIED SOFT COMPUTING, 2011, 11 (04) : 3680 - 3689
  • [22] Genetic Algorithms with Oracle for the Traveling Salesman Problem
    Gremlich, Robin
    Hamfelt, Andreas
    de Pereda, Hector
    Valkovsky, Vladislav
    PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 7, 2005, 7 : 27 - 32
  • [23] Unsupervised Fuzzy Clustering-based Genetic Algorithms to Traveling Salesman Problem
    Jebari, Khalid
    El Moujahid, Abdelaziz
    Bouroumi, Abdelaziz
    Ettouhami, Aziz
    2012 INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS), 2012, : 1013 - 1018
  • [24] Traveling Salesman Problem Optimization with Parallel Genetic Algorithm
    Cakir, Murat
    Yilmaz, Guray
    2015 23RD SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS CONFERENCE (SIU), 2015, : 2557 - 2560
  • [25] Optimization of Fuzzy Inference System Field Classifiers Using Genetic Algorithms and Simulated Annealing
    Patel, Pretesh B.
    Marwala, Tshilidzi
    ENGINEERING APPLICATIONS OF NEURAL NETWORKS, 2012, 311 : 21 - 30
  • [26] A simulated annealing heuristic for the online symmetric traveling salesman problem
    Shirdel, G. H.
    Abdolhosseinzadeh, M.
    JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2018, 39 (06) : 1283 - 1296
  • [27] A synergetic approach to genetic algorithms for solving traveling salesman problem
    Qu, LS
    Sun, RX
    INFORMATION SCIENCES, 1999, 117 (3-4) : 267 - 283
  • [28] A novel hybrid simulated annealing algorithm for colored bottleneck traveling salesman problem
    Dong, Xueshi
    Lin, Qing
    Shen, Fanfan
    Guo, Qingteng
    Li, Qingshun
    SWARM AND EVOLUTIONARY COMPUTATION, 2023, 83
  • [29] Refined descriptive sampling simulated annealing algorithm for solving the traveling salesman problem
    Cherabli, Meriem
    Ourbih-Tari, Megdouda
    Boubalou, Meriem
    MONTE CARLO METHODS AND APPLICATIONS, 2022, 28 (02): : 175 - 188
  • [30] Simulated Annealing with Probabilistic Analysis for Solving Traveling Salesman Problems
    Hong, Pei-Yee
    Lim, Yai-Fung
    Ramli, Razamin
    Khalid, Ruzelan
    INTERNATIONAL CONFERENCE ON MATHEMATICAL SCIENCES AND STATISTICS 2013 (ICMSS2013), 2013, 1557 : 515 - 519