An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem

DOI10.1016/j.amc.2009.10.027zbMath1183.65071OpenAlexW2127469225MaRDI QIDQ846437

N. E. Zubov

Publication date: 9 February 2010

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

Full work available at URL: https://doi.org/10.1016/j.amc.2009.10.027

zbMATH Keywords

numerical examplescombinatorial optimizationmetaheuristicevolutionary algorithmsdiscrete differential evolution algorithmgeneralized traveling salesman problemdestruction and construction procedureensemble of optimization algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Combinatorial optimization (90C27)

Related Items (16)

Empirical evaluation of distributed differential evolution on standard benchmarks ⋮ A self-adaptive combined strategies algorithm for constrained optimization using differential evolution ⋮ Multithreaded parallel dual population genetic algorithm (MPDPGA) for unconstrained function optimizations on multi-core system ⋮ Self-adaptive differential evolution incorporating a heuristic mixing of operators ⋮ A self-adaptive differential evolution algorithm for parameters identification of stochastic genetic regulatory networks with random delays ⋮ An ensemble algorithm with self-adaptive learning techniques for high-dimensional numerical optimization ⋮ Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem ⋮ X-MODE: extended multi-operator differential evolution algorithm ⋮ Generalized Differential Evolution for Numerical and Evolutionary Optimization ⋮ Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem ⋮ Backtracking search optimization algorithm for numerical optimization problems ⋮ Multi-strategy ensemble artificial bee colony algorithm ⋮ Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs ⋮ Solving the family traveling salesman problem ⋮ A stochastic multi-item replenishment and delivery problem with lead-time reduction initiatives and the solving methodologies ⋮ Finding the shortest path with vertex constraint over large graphs

Uses Software

• TSPLIB
• GTSP Instances Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A random-key genetic algorithm for the generalized traveling salesman problem
• A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
• Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
• An efficient composite heuristic for the symmetric generalized traveling salesman problem
• The dynamic programming method in the generalized traveling salesman problem
• Transformations of generalized ATSP into ATSP.
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
• Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
• The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
• A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
• Some Applications of the Generalized Travelling Salesman Problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• Process planning for rotational parts using the generalized travelling salesman problem
• The symmetric generalized traveling salesman polytope
• A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem