Inki Hong, Andrew B. Kahng and Byung-Ro Moon UCLA Computer Science Department ...  Home/Search
Context Related
| ucla.edu/techreport/1995...950035.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucla.edu/csd/pubs/allreports (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The large-step Markov chain (LSMC) approach is the most effective known heuristic for large symmetric TSP instances; cf. recent results of Martin et al. [17] and Johnson [12]. In this report, we examine relationships among (i) the underlying local optimization engine within the LSMC approach, (ii) the "kick move" perturbation that is applied between successive local search descents, and (iii) the resulting LSMC solution quality. We find that the traditional "double-bridge" kick move is not ... (Update)
Context of citations to this paper: More
...components. 3.2. 2 Adaptive perturbations The behavior of ILS for the QAP and also for other combinatorial optimization problems [35, 60] shows that there is no a priori single best size for the perturbation. This motivates the possibility of modifying the perturbation...
...leads to improved performance. Yet, the improvement due to these optimizations is not as spectacular as observed for other problems [6, 19, 21], possibly due to the powerful local search. 4. The SMTWTP instances from ORLIB do not pose a challenge for state of the art...
Cited by: More
Design of Iterated Local Search Algorithms: An Example.. - den Besten, Stützle.. (2001) (Correct)
Stochastic Local Search for Multiprocessor Scheduling for.. - Pavlin, Hoos, Stützle (Correct)
Experimental Analysis Of Heuristics For The STSP - Johnson (2001) (Correct)
Active bibliography (related documents): More All
0.3: Combining Simulated Annealing with Local Search Heuristics - Martin, Otto (1993) (Correct)
0.2: Solving the p-Center Problem with Tabu Search and.. - Mladenovic.. (2000) (Correct)
0.2: J-Means: A New Local Search Heuristic for Minimum.. - Hansen, Mladenovic (Correct)
Similar documents based on text: More All
2.2: Large-Step Markov Chain Variants For VLSI Netlist Partitioning - Fukunaga, Huang, Kahng (1996) (Correct)
0.6: Cost Versus Distance In the Traveling Salesman Problem - Boese (1995) (Correct)
0.4: Scan Chain Optimization: Heuristic and Optimal Solutions - Boese, Kahng, Tsay (1994) (Correct)
Related documents from co-citation: More All
6: Large-step markov chains for the traveling salesman problem - Martin, Otto et al. - 1991
5: Combining Simulated Annealing with Local Search Heuristics - Martin, Otto - 1996
4: An iterated dynasearch algorithm for the single{machine total weighted tardiness.. (context) - Congram, Potts et al. - 1998
BibTeX entry: (Update)
I. Hong, A. B. Kahng and B.-R. Moon, "Improved LargeStep Markov Chain Variants for the Symmetric TSP", UCLA Computer Science Dept. Tech. Report UCLA-CSD950035, 1995. http://citeseer.ist.psu.edu/hong95improved.html More
@techreport{ inki95improved,
author = "Hong Inki and Kahng Andrew B. and Moon Byung-Ro",
title = "Improved Large-Step Markov Chain Variants for the Symmetric {TSP}",
number = "950035",
month = "15,",
pages = "19",
year = "1995",
url = "citeseer.ist.psu.edu/hong95improved.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
1051 Optimization and Machine Learning (context) - Goldberg, in - 1989
245 Artificial Intelligence Through Simulated Evolution (context) - Fogel, Owens et al. - 1966
141 An effective heuristics algorithm for the traveling-salesman.. (context) - Lin, Kernighan - 1973
106 The Traveling Salesman Problem: A Guided Tour of Combinatori.. (context) - Lawler, Lenstra et al. - 1985
98 Local optimization and the traveling salesman problem (context) - Johnson - 1990
79 A new adaptive multi-start technique for combinatorial globa.. (context) - Boese, Kahng et al. - 1994
78 Fast algorithms for geometric traveling salesman problems (context) - Bentley - 1992
62 Large-step markov chains for the traveling salesman problem - Martin, Otto et al. - 1991
56 The traveling salesman problem: A case study in local optimi.. (context) - Johnson, McGeoch - 1996
54 Combining simulated annealing with local search heuristics - Martin, Otto - 1995
52 Large-step markov chains for the TSP incorporating local sea.. - Martin, Otto et al. - 1992
33 trees for semidynamic point sets (context) - Bentley - 1990
19 Cost versus distance in the traveling salesman problem - Boese - 1995
14 personal communication (context) - Applegate - 1995
12 Iterated descent: A better algorithm for local search in com.. (context) - Baum - 1986
4 neural' computation for combinatorial optimization problems (context) - Baum - 1986
1 Center for Discrete Mathematics and Theoretical Computer Sci.. (context) - Applegate, Bixby et al. - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.ucla.edu/csd/pubs/all-reports.html): More
Applications of the Matroid Parity Problem to.. - Berman, Fürer.. (1998) (Correct)
Efficient Gate Delay Modeling for Large Interconnect Loads - Andrew Kahng (1996) (Correct)
System-level Synthesis of Hard Real-Time Application.. - Lee, Potkonjak, Wolf (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC