A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
From MaRDI portal
Publication:975992
DOI10.1016/J.COR.2009.05.004zbMATH Open1188.90263OpenAlexW2150367356MaRDI QIDQ975992FDOQ975992
Dominique Feillet, Christian Artigues, Boris Bontoux
Publication date: 11 June 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.05.004
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- TSPLIB—A Traveling Salesman Problem Library
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- A Gentle Introduction to Memetic Algorithms
- A survey of very large-scale neighborhood search techniques
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Genetic algorithms. Concepts and designs
- Recent advances in memetic algorithms.
- The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
- Computer Solutions of the Traveling Salesman Problem
- Ant colony optimization for the traveling purchaser problem
- Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
- A random-key genetic algorithm for the generalized traveling salesman problem
- Particle swarm optimization-based algorithms for TSP and generalized TSP
- 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
- An Efficient Transformation Of The Generalized Traveling Salesman Problem
- Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem
- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
- An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
- A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
- Evolution algorithms in combinatorial optimization
- Some issues of designing genetic algorithms for traveling salesman problems
- Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem
Cited In (17)
- A comprehensive survey on the generalized traveling salesman problem
- A two-level metaheuristic for the all colors shortest path problem
- Hybridizations of evolutionary algorithms with large neighborhood search
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
- The effect of the asymmetry of road transportation networks on the traveling salesman problem
- A Discrete State Transition Algorithm for Generalized Traveling Salesman Problem
- A Memetic Random Key Algorithm for the Balanced Travelling Salesman Problem
- Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size
- A memetic algorithm for the generalized traveling salesman problem
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
- Efficient local search algorithms for known and new neighborhoods 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 transformation technique for the clustered generalized traveling salesman problem with applications to logistics
- Approximation schemes for the generalized traveling salesman problem
- Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem
- A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
Uses Software
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)
