The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach

DOI10.1007/978-0-387-48793-9_11MaRDI QIDQ3439978zbMATH OpenOpenAlexFDO

Authors John Silberholz, Bruce Golden

Publication date 21 May 2007

Published in Operations Research/Computer Science Interfaces Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-0-387-48793-9_11

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• A new genetic algorithm applied to the traveling salesman problem
• Genetic algorithms for the traveling salesman problem
• An efficient hybrid ant colony system for the Generalized Traveling Salesman Problem
• A random-key genetic algorithm for the generalized traveling salesman problem
• A new approach to solving the multiple traveling salesperson problem using genetic algorithms

Cited in

(45)

• Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study
• A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem
• GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
• Some issues of designing genetic algorithms for traveling salesman problems
• An efficient genetic algorithm for the traveling salesman problem with precedence constraints
• A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
• Genetic algorithms for the traveling salesman problem
• A new approach to solving the multiple traveling salesperson problem using genetic algorithms
• A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem
• A population learning algorithm for solving the generalized segregated storage problem
• The generalized covering salesman problem
• An efficient hybrid ant colony system for the Generalized Traveling Salesman Problem
• A discrete state transition algorithm for generalized traveling salesman problem
• A branch-and-bound algorithm for the close-enough traveling salesman problem
• scientific article; zbMATH DE number 2089814 (Why is no real title available?)
• A novel approach to solve multiple traveling salesmen problem by genetic algorithm
• Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
• Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
• A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM
• A random keys based genetic algorithm for the target visitation problem
• Using a genetic algorithm to solve the generalized orienteering problem
• A new genetic algorithm applied to the traveling salesman problem
• Discrete/Binary approach
• Expert systems approach for generalized traveling salesman problem
• Some Applications of the Generalized Travelling Salesman Problem
• scientific article; zbMATH DE number 1054959 (Why is no real title available?)
• scientific article; zbMATH DE number 1114466 (Why is no real title available?)
• A genetic algorithm for sequencing type problems in engineering design
• Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
• Randomized heuristics for the family traveling salesperson problem
• An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem
• Genetic algorithm for combinatorial path planning: the subtour problem
• An applied research on a genetic algorithm based on simulated annealing of constrained traveling salesman problem
• A fishing route optimization decision support system: the case of the tuna purse seiner
• New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
• Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
• A comprehensive survey on the generalized traveling salesman problem
• Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem
• An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
• A random-key genetic algorithm for the generalized traveling salesman problem
• Path planning on a cuboid using genetic algorithms
• Quality inspection scheduling for multi-unit service enterprises
• Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem
• A memetic algorithm for the generalized traveling salesman problem
• A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem

This page was built for publication: The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439978)