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 条
  • [1] Hybridizing simulated annealing and genetic algorithms with Pythagorean fuzzy uncertainty for traveling salesman problem optimization
    Muhammad Akram
    Amna Habib
    Journal of Applied Mathematics and Computing, 2023, 69 : 4451 - 4497
  • [2] Traveling Salesman Problem of Optimization based on Genetic Algorithms
    Ellili, Walid
    Samet, Mounir
    Kachouri, Abdennaceur
    2017 INTERNATIONAL CONFERENCE ON SMART, MONITORED AND CONTROLLED CITIES (SM2C), 2017, : 123 - 127
  • [3] A New Hybrid Genetic and Simulated Annealing Algorithm to Solve the Traveling Salesman Problem
    Elhaddad, Younis
    Sallabi, Omar
    WORLD CONGRESS ON ENGINEERING, WCE 2010, VOL I, 2010, : 11 - 14
  • [4] Optimization Models and Heuristic Method Based on Simulated Annealing Strategy for Traveling Salesman Problem
    Hao, Xu
    MECHANICAL ENGINEERING AND GREEN MANUFACTURING, PTS 1 AND 2, 2010, : 1180 - 1184
  • [5] Solving the Flying Sidekick Traveling Salesman Problem by a Simulated Annealing Heuristic
    Yu, Vincent F.
    Lin, Shih-Wei
    Jodiawan, Panca
    Lai, Yu-Chi
    MATHEMATICS, 2023, 11 (20)
  • [6] Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem
    Ezugwu, Absalom El-Shamir
    Adewumi, Aderemi Oluyinka
    Frincu, Marc Eduard
    EXPERT SYSTEMS WITH APPLICATIONS, 2017, 77 : 189 - 210
  • [7] Optimization and Improvement of Genetic Algorithms Solving Traveling Salesman Problem
    Zhang, Liping
    Yao, Min
    Zheng, Nenggan
    PROCEEDINGS OF 2009 INTERNATIONAL CONFERENCE ON IMAGE ANALYSIS AND SIGNAL PROCESSING, 2009, : 327 - 332
  • [8] Hybrid Algorithm Based on Ant Colony Optimization and Simulated Annealing Applied to the Dynamic Traveling Salesman Problem
    Stodola, Petr
    Michenka, Karel
    Nohel, Jan
    Rybansky, Marian
    ENTROPY, 2020, 22 (08)
  • [9] Genetic algorithms for the traveling salesman problem
    Potvin, JY
    ANNALS OF OPERATIONS RESEARCH, 1996, 63 : 339 - 370
  • [10] A Simulated Annealing-Based Algorithm for Traveling Salesman Problem
    郭茂祖
    陈彬
    洪家荣
    Journal of Harbin Institute of Technology(New series), 1997, (04) : 35 - 38