Research on improved ant colony optimization for traveling salesman problem

DOI10.3934/mbe.2022381OpenAlexW4284977760MaRDI QIDQ2688415

Yanyan Li

Publication date: 3 March 2023

Published in: Mathematical Biosciences and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/mbe.2022381

zbMATH Keywords

traveling salesman problemant colony optimizationgraph convolutional network3-opt algorithmdynamic pheromone volatility factor

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Operations research and management science (90Bxx)

Uses Software

• Adam

Cites Work

• Unnamed Item
• A comprehensive survey on the multiple traveling salesman problem: applications, approaches and taxonomy
• The traveling salesman problem: An overview of exact and approximate algorithms
• Learning heuristics for the TSP by policy gradient
• Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem
• The optimal combination between selling mode and logistics service strategy in an e-commerce market
• On the approximation ratio of the 3-opt algorithm for the \((1,2)\)-TSP
• Deep policy dynamic programming for vehicle routing problems
• A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
• A combinatorial model to optimize air traffic flow management problems
• Diagnosis of breast cancer based on modern mammography using hybrid transfer learning
• The Truck Dispatching Problem

This page was built for publication: Research on improved ant colony optimization for traveling salesman problem