The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
From MaRDI portal
Publication:3439978
DOI10.1007/978-0-387-48793-9_11zbMath1278.90346OpenAlexW201105387MaRDI QIDQ3439978
John Silberholz, Bruce L. 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
Related Items (15)
A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem ⋮ An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem ⋮ Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems ⋮ GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem ⋮ Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem ⋮ Lin-Kernighan heuristic adaptations for the generalized 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 ⋮ A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem ⋮ Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem ⋮ An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough 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 ⋮ The Generalized Covering Salesman Problem ⋮ Discrete/Binary Approach
This page was built for publication: The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
