Research on improved ant colony optimization for traveling salesman problem

DOI10.3934/MBE.2022381MaRDI QIDQ2688415zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 3 March 2023

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

3-opt algorithmant colony optimizationdynamic pheromone volatility factorgraph convolutional networktraveling salesman problem

Mathematics Subject Classification ID

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

Cites work

• 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
• A comprehensive survey on the multiple traveling salesman problem: applications, approaches and taxonomy
• Deep policy dynamic programming for vehicle routing problems
• Diagnosis of breast cancer based on modern mammography using hybrid transfer learning
• Learning heuristics for the TSP by policy gradient
• On the approximation ratio of the 3-opt algorithm for the \((1,2)\)-TSP
• 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
• The traveling salesman problem. A computational study.
• The traveling salesman problem: An overview of exact and approximate algorithms
• The truck dispatching problem

Describes a project that uses

Uses Software

• Adam

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2688415)