Mojgan Pourhassan
ABSTRACT
The generalized travelling salesperson problem is an important NP-hard combinatorial optimization problem where local search approaches have been very successful. We investigate the two hierarchical approaches of Hu and Raidl (2008) for solving this problem from a theoretical perspective. We examine the complementary abilities of the two approaches caused by their neighbourhood structures and the advantage of combining them into variable neighbourhood search. We first point out complementary abilities of the two approaches by presenting instances where they mutually outperform each other. Afterwards, we introduce an instance which is hard for both approaches, but where a variable neighbourhood search combining them finds the optimal solution in polynomial time.
- A. Auger and B. Doerr. Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific Publishing Co., Inc., 2011. Google Scholar
Cross Ref
- D. Corus, P. K. Lehre, and F. Neumann. The generalized minimum spanning tree problem: a parameterized complexity analysis of bi-level optimisation. In C. Blum and E. Alba, editors, Genetic and Evolutionary Computation Conference, GECCO '13, Amsterdam, The Netherlands, July 6--10, 2013, pages 519--526. ACM, 2013. Google ScholarDigital Library
- D. Corus, P. K. Lehre, F. Neumann, and M. Pourhassan. A parameterized complexity analysis of bi-level optimisation with evolutionary algorithms. CoRR, abs/1401.1905, 2014.Google Scholar
- M. Englert, H. Röglin, and B. Vöcking. Worst case and probabilistic analysis of the 2-opt algorithm for the TSP. Algorithmica, 68(1):190--264, 2014.Google ScholarCross Ref
- M. Fischetti, J. J. Salazar González, and P. Toth. A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Operations Research, 45(3):378--394, 1997. Google ScholarDigital Library
- M. Gendreau and J.-Y. Potvin. Handbook of Metaheuristics. Springer Publishing Company, Incorporated, 2nd edition, 2010. Google ScholarCross Ref
- G. Gutin and D. Karapetyan. A memetic algorithm for the generalized traveling salesman problem. Natural Computing, 9(1):47--60, 2010. Google ScholarDigital Library
- M. Held and R. M. Karp. A dynamic programming approach to sequencing problems. In Proceedings of the 1961 16th ACM National Meeting, ACM '61, pages 71.201--71.204, New York, NY, USA, 1961. ACM. Google ScholarDigital Library
- B. Hu and G. R. Raidl. Effective neighborhood structures for the generalized traveling salesman problem. In J. I. van Hemert and C. Cotta, editors, EvoCOP, volume 4972 of Lecture Notes in Computer Science, pages 36--47. Springer, 2008. Google ScholarDigital Library
- T. Jansen. Analyzing Evolutionary Algorithms - The Computer Science Perspective. Natural Computing Series. Springer, 2013. Google ScholarCross Ref
- D. Karapetyan and G. Gutin. Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem. European Journal of Operational Research, 219(2):234--251, 2012.Google ScholarCross Ref
- T. Kötzing, F. Neumann, H. Röglin, and C. Witt. Theoretical analysis of two ACO approaches for the traveling salesman problem. Swarm Intelligence, 6(1):1--21, 2012.Google ScholarCross Ref
- F. Neumann and C. Witt. Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity. Springer-Verlag New York, Inc., New York, NY, USA, 1st edition, 2010. Google ScholarCross Ref
- P. C. Pop and S. Iordache. A hybrid heuristic approach for solving the generalized traveling salesman problem. In N. Krasnogor and P. L. Lanzi, editors, GECCO, pages 481--488. ACM, 2011. Google ScholarDigital Library
- D. Sudholt. Hybridizing evolutionary algorithms with variable-depth search to overcome local optima. Algorithmica, 59(3):343--368, 2011. Google ScholarDigital Library
- D. Sudholt. Parametrization and balancing local and global search. In F. Neri, C. Cotta, and P. Moscato, editors, Handbook of Memetic Algorithms, volume 379 of Studies in Computational Intelligence, pages 55--72. Springer, 2012.Google ScholarCross Ref
- A. M. Sutton, F. Neumann, and S. Nallaperuma. Parameterized runtime analyses of evolutionary algorithms for the planar Euclidean traveling salesperson problem. Evolutionary Computation, 22(4):595--628, 2014. Google ScholarDigital Library
Index Terms
- On the Impact of Local Search Operators and Variable Neighbourhood Search for the Generalized Travelling Salesperson Problem
Recommendations
A hybrid algorithm based on variable neighbourhood for the strip packing problem
This paper addresses the strip packing problem, which has a wide range of real-world applications. Our proposed algorithm is a hybrid metaheuristic that combines an improved heuristic algorithm with a variable neighbourhood search. Different ...
Embedded local search approaches for routing optimization
This paper presents a new class of heuristics which embed an exact algorithm within the framework of a local search heuristic. This approach was inspired by related heuristics which we developed for a practical problem arising in electronics ...
Local search versus Path Relinking in metaheuristics
Display Omitted Meta-RaPS is a recent metaheuristic for optimization problems that is simple and effective.The time consuming local search phase of Meta-RaPS is replaced by Path Relinking as a learning module.The results show that the newly designed ...
Comments