Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem

DOI10.1007/978-981-10-4642-1_10zbMath1446.90137OpenAlexW2606019716MaRDI QIDQ5114991

Manas Kumar Maiti, Indadul Khan, Manoranjan Maiti

Publication date: 29 June 2020

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-981-10-4642-1_10

zbMATH Keywords

ant colony optimizationparticle swarm optimizationswap operationtraveling salesmen problem\(K\)-Optswap sequence

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• TSPTW
• LKH

Cites Work

• Unnamed Item
• Inventory model of a deteriorating item with price and credit linked fuzzy demand: a fuzzy differential equation approach
• Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• An efficient genetic algorithm for the traveling salesman problem with precedence constraints
• A new hybrid heuristic approach for solving large traveling salesman problem
• Beam-ACO for the travelling salesman problem with time windows
• Particle swarm optimization-based algorithms for TSP and generalized TSP
• Ant colony optimization for the traveling purchaser problem
• A Hybrid Exact Algorithm for the TSPTW
• On the symmetric travelling salesman problem: A computational study
• Using cutting planes to solve the symmetric Travelling Salesman problem
• Hamiltonicity and the 3-Opt procedure for the traveling Salesman problem
• Solution of a Large-Scale Traveling-Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem