Particle swarm optimization-based algorithms for TSP and generalized TSP

DOI10.1016/j.ipl.2007.03.010zbMath1187.90238OpenAlexW2081231516MaRDI QIDQ2379966

Yanyan Li

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.03.010

zbMATH Keywords

swap operator

Mathematics Subject Classification ID

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

Related Items

A new heuristic algorithm for laser antimissile strategy optimization ⋮ A two-level metaheuristic for the all colors shortest path problem ⋮ Solving large batches of traveling salesman problems with parallel and distributed computing ⋮ Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems ⋮ A hybrid particle swarm optimization approach for the sequential ordering problem ⋮ Multi-objective particle swarm optimization applied to water distribution systems design: an approach with human interaction ⋮ Household-Level Economies of Scale in Transportation ⋮ Optimization of order-picking problems by intelligent optimization algorithm ⋮ Shrinking hypersphere based trajectory of particles in PSO ⋮ Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem ⋮ Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem ⋮ Application of imperialist competitive algorithm on solving the traveling salesman problem ⋮ Distributed Particle Swarm Intelligence for Optimization in the Water Industry ⋮ Biogeography migration algorithm for traveling salesman problem ⋮ A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem ⋮ Heuristic solution approaches for the cumulative capacitated vehicle routing problem ⋮ Particle swarm optimization applied to the design of water supply systems ⋮ Design optimization of wastewater collection networks by PSO ⋮ The convergent results about approximating fuzzy random minimum risk problems ⋮ Probability mechanism based particle swarm optimization algorithm and its application in resource-constrained project scheduling problems ⋮ A combination of genetic algorithm and particle swarm optimization method for solving traveling salesman problem ⋮ A new approach for solving set covering problem using jumping particle swarm optimization method ⋮ An improved dynamic deployment method for wireless sensor network based on multi-swarm particle swarm optimization ⋮ The influence of problem specific neighborhood structures in metaheuristics performance

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for the on-line quota traveling salesman problem
• The particle swarm optimization algorithm: Convergence analysis and parameter selection
• Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem
• Hybrid ant colony algorithm for traveling salesman problem
• Approximation algorithms for time-dependent orienteering.
• Dynamic Programming Treatment of the Travelling Salesman Problem
• TSPLIB—A Traveling Salesman Problem Library
• Some Applications of the Generalized Travelling Salesman Problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• The Traveling Salesman Problem: A Survey