An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
DOI10.1016/J.AMC.2009.10.027zbMATH Open1183.65071OpenAlexW2127469225MaRDI QIDQ846437FDOQ846437
Authors: 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
Recommendations
- Discrete/Binary approach
- Smallest position value approach
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
- A discrete state transition algorithm for generalized traveling salesman problem
- Differential evolution algorithm with ensemble of populations for global numerical optimization
combinatorial optimizationnumerical examplesevolutionary algorithmsmetaheuristicdiscrete differential evolution algorithmgeneralized traveling salesman problemdestruction and construction procedureensemble of optimization algorithms
Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Nonlinear programming (90C30)
Cites Work
- The symmetric generalized traveling salesman polytope
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
- The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
- Generalized traveling salesman problem reduction algorithms
- Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
- A random-key genetic algorithm for the generalized traveling salesman problem
- An efficient composite heuristic for the symmetric generalized traveling salesman problem
- Transformations of generalized ATSP into ATSP.
- A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
- Some Applications of the Generalized Travelling Salesman Problem
- Title not available (Why is that?)
- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
- The dynamic programming method in the generalized traveling salesman problem
- Title not available (Why is that?)
- A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Process planning for rotational parts using the generalized travelling salesman problem
Cited In (20)
- A comprehensive survey on the generalized traveling salesman problem
- Self-adaptive differential evolution incorporating a heuristic mixing of operators
- Finding the shortest path with vertex constraint over large graphs
- Generalized Differential Evolution for Numerical and Evolutionary Optimization
- Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs
- 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
- Solving the family traveling salesman problem
- Multi-candidate carpooling routing problem and its approximation algorithms
- 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
- A stochastic multi-item replenishment and delivery problem with lead-time reduction initiatives and the solving methodologies
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
- Backtracking search optimization algorithm for numerical optimization problems
- Smallest position value approach
- Discrete/Binary approach
- X-MODE: extended multi-operator differential evolution algorithm
- Multi-strategy ensemble artificial bee colony algorithm
Uses Software
This page was built for publication: An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q846437)
