Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem
From MaRDI portal
Publication:5888090
DOI10.1080/03155986.1999.11732374OpenAlexW2405668439MaRDI QIDQ5888090
Gilbert Laporte, Frédéric Semet
Publication date: 21 April 2023
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03155986.1999.11732374
Related Items (10)
A random-key genetic algorithm for the generalized traveling salesman problem ⋮ A transformation technique for the clustered generalized traveling salesman problem with applications to logistics ⋮ A branch-and-cut algorithm for the generalized traveling salesman problem with time windows ⋮ Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem ⋮ New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem ⋮ Transformations of generalized ATSP into ATSP. ⋮ Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem ⋮ Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm ⋮ A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem ⋮ Generalized network design problems.
This page was built for publication: Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem