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

DOI10.1007/s12190-023-01935-yMaRDI QIDQ6578207

Amna Habib, Muhammad Akram

Publication date: 25 July 2024

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

zbMATH Keywords

optimizationsimulated annealingtraveling salesman problemgenetic algorithmhybrid algorithmsPythagorean fuzzy uncertainty

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Hybrid evolutionary fuzzy learning scheme in the applications of traveling salesman problems
• The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
• The mean value of a fuzzy number
• The traveling salesman problem: An overview of exact and approximate algorithms
• The concept of a linguistic variable and its application to approximate reasoning. I
• Future paths for integer programming and links to artificial intelligence
• \(q\)-rung picture fuzzy graphs: a creative view on regularity with applications
• Hybrid search with neighborhood reduction for the multiple traveling salesman problem
• Particle swarm optimization-based algorithms for TSP and generalized TSP
• Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems
• Fuzzy sets
• A new maximal flow algorithm for solving optimization problems with linguistic capacities and flows

Related Items (1)

Chromatic polynomial of a picture fuzzy graph with application in traffic light control

This page was built for publication: Hybridizing simulated annealing and genetic algorithms with Pythagorean fuzzy uncertainty for traveling salesman problem optimization