A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
From MaRDI portal
(Redirected from Publication:975992)
Recommendations
- A memetic algorithm for the generalized traveling salesman problem
- The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
- An efficient hybrid ant colony system for the Generalized Traveling Salesman Problem
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 1015854 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 3278972 (Why is no real title available?)
- scientific article; zbMATH DE number 3298367 (Why is no real title available?)
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
- A Gentle Introduction to Memetic Algorithms
- A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- A random-key genetic algorithm for the generalized traveling salesman problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A survey of very large-scale neighborhood search techniques
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An Efficient Transformation Of The Generalized Traveling Salesman Problem
- An efficient composite heuristic for the symmetric generalized traveling salesman problem
- An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Ant colony optimization for the traveling purchaser problem
- Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem
- Computer Solutions of the Traveling Salesman Problem
- Evolution algorithms in combinatorial optimization
- Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
- Genetic algorithms. Concepts and designs
- Particle swarm optimization-based algorithms for TSP and generalized TSP
- Recent advances in memetic algorithms.
- Some issues of designing genetic algorithms for traveling salesman problems
- TSPLIB—A Traveling Salesman Problem Library
- The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
- Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem
- Transformations of generalized ATSP into ATSP.
Cited in
(21)- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
- An efficient hybrid ant colony system for the Generalized Traveling Salesman Problem
- Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks
- A comprehensive survey on the generalized traveling salesman problem
- A discrete state transition algorithm for generalized traveling salesman problem
- An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
- Discrete/Binary approach
- Hybridizations of evolutionary algorithms with large neighborhood search
- A two-level metaheuristic for the all colors shortest path problem
- A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem
- Approximation schemes for the generalized traveling salesman problem
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
- A memetic algorithm for the generalized traveling salesman problem
- The effect of the asymmetry of road transportation networks on the traveling salesman problem
- Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem
- Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size
- A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- Smallest position value approach
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
- A memetic random key algorithm for the balanced travelling salesman problem
This page was built for publication: A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975992)
