Samadhi Nallaperuma
ABSTRACT
Randomized Search heuristics are frequently applied to NP-hard combinatorial optimization problems. The runtime analysis of randomized search heuristics has contributed tremendously to their theoretical understanding. Recently, randomized search heuristics have been examined regarding their achievable progress within a fixed time budget. We follow this approach and present a first fixed budget runtime analysis for a NP-hard combinatorial optimization problem. We consider the well-known Traveling Salesperson problem (TSP) and analyze the fitness increase that randomized search heuristics are able to achieve within a given fixed budget.
- A. Auger and B. Doerr. Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific Publishing Co., Inc., 2011. Google Scholar
Digital Library
- B. Chandra, H. Karloff, and C. Tovey. New results on the old k-Opt algorithm for the TSP. In Proc. of SODA'94, pages 150--159, 1994. Google ScholarDigital Library
- B. Doerr, T. Jansen, C. Witt, and C. Zarges. A method to derive fixed budget results from expected optimisation times. In Proc. of GECCO'13, pages 1581--1588. ACM, 2013. Google ScholarDigital Library
- S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276(1--2):51--81, 2002. Google ScholarDigital Library
- 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
- T. Jansen. Analyzing Evolutionary Algorithms - The Computer Science Perspective. Natural Computing Series. Springer, 2013. Google ScholarDigital Library
- T. Jansen and C. Zarges. Analysis of evolutionary algorithms: From computational complexity analysis to algorithm engineering. In Proc. of FOGA '11, pages 1--14. ACM, 2011. Google ScholarDigital Library
- T. Jansen and C. Zarges. Fixed budget computations: a different perspective on run time analysis. In Proc. of GECCO'12, pages 1325--1332, 2012. Google ScholarDigital Library
- W. Kern. A probabilistic analysis of the switching algorithm for the euclidean TSP. Mathematical programming: Series A, 44(1--3):213--219, 1989. Google ScholarDigital Library
- J. Lassig and D. Sudholt. Analysis of speedups in parallel evolutionary algorithms for combinatorial optimization. In Proc. of ISAAC'11, pages 405--414. Springer, 2011. Google ScholarDigital Library
- R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995. Google ScholarDigital Library
- F. Neumann and I. Wegener. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. In Proc. of GECCO'04, pages 713--724, 2004.Google ScholarCross Ref
- F. Neumann and C. Witt. Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity. Springer, 2010. Google ScholarDigital Library
- P. S. Oliveto, J. He, and X. Yao. Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results. International Journal of Automation and Computing, 4(3):281--293, 2007.Google ScholarCross Ref
- P. Sanders and D. Wagner. Algorithm engineering. Informatik-Spektrum, 36(2):187--190, 2013.Google ScholarCross Ref
- D. A. Spielman and S.-H. Teng. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. J. ACM, 51(3):385--463, May 2004. Google ScholarDigital Library
- B. M. R. Veenstra. Smoothed analysis of the 2-Opt heuristic for the TSP: Polynomial bounds for gaussian noise. In Proc. of ISAAC'13, 2013.Google Scholar
- D. Zhou, D. Luo, R. Lu, and Z. Han. The use of tail inequalities on the probable computational time of randomized search heuristics. Theoretical Computer Science, 436(0):106 -- 117, 2012. Google ScholarDigital Library
Index Terms
- A fixed budget analysis of randomized search heuristics for the traveling salesperson problem
Recommendations
Expected fitness gains of randomized search heuristics for the traveling salesperson problem
Randomized search heuristics are frequently applied to NP-hard combinatorial optimization problems. The runtime analysis of randomized search heuristics has contributed tremendously to our theoretical understanding. Recently, randomized search ...
Heuristics for K-Independent Average Traveling Salesperson Problem
Multi-disciplinary Trends in Artificial IntelligenceAbstractThis paper deals with heuristic solution of K-independent average traveling salesperson (KIATSP) problem which is a recent extension of the well-known traveling salesperson problem (TSP). This problem seeks finding of K mutually independent ...
Traveling Salesperson Problem with Hotel Selection: A systematic review of the literature
SBSI '19: Proceedings of the XV Brazilian Symposium on Information SystemsThe Traveling Salesperson Problem with Hotel Selection (TSPHS) is a novel variant of the classical Traveling Salesperson Problem. In this variant, the main objective is to minimize the number of trips and total traveled time. This problem is found in ...
Comments