Filters








351 Hits in 12.2 sec

Large-step markov chains for the TSP incorporating local search heuristics

Olivier Martin, Steve W Otto, Edward W Felten
1992 Operations Research Letters  
We consider a new class of optimization heuristics which combine local searches with stochastic sampling methods, allowing one to iterate local optimization heuristics.  ...  I Introduction Given N cities labeled by i = 1, N , separated by distances d i j , the Traveling Salesman Problem (TSP) consists in finding the shortest tour, i.e., the shortest  ...  Acknowledgements We thank David Johnson and Bill Cook for sharing their results with us and for discussions.  ... 
doi:10.1016/0167-6377(92)90028-2 fatcat:3gqgdwjkqvhlnir7zgpfbzpm2e

Combining simulated annealing with local search heuristics

Olivier C. Martin, Steve W. Otto
1996 Annals of Operations Research  
This new class of Markov chains leads to signi cantly more powerful optimization methods than either simulated annealing or local search.  ...  We introduce a meta-heuristic to combine simulated annealing with local search methods for CO problems.  ...  Finally, we acknowledge signi cant help from the PVM group at OGI for the implementation of the parallelization.  ... 
doi:10.1007/bf02601639 fatcat:mtlpomzmfrehppka5ghzwho5hm

Guided local search and its application to the traveling salesman problem

Christos Voudouris, Edward Tsang
1999 European Journal of Operational Research  
The combination of GLS and FLS with TSP local search heuristics of different efficiency and effectiveness is studied in an effort to determine the dependence of GLS on the underlying local search heuristic  ...  Comparisons are made with some of the best TSP heuristic algorithms and general optimization techniques which demonstrate the advantages of GLS over alternative heuristic approaches suggested for the problem  ...  As far as we know, optimal solutions to such large problems can be consistently found only by heuristic methods that are using LK (e.g. Iterated LK or its variant Large-Step Markov Chains method).  ... 
doi:10.1016/s0377-2217(98)00099-x fatcat:gepmcneg5bfxtmohh5inukwpim

New parallel randomized algorithms for the traveling salesman problem

Leyuan Shi, Sigurdur Ólafsson, Ning Sun
1999 Computers & Operations Research  
This new method combines global search and local search (heuristic) procedures in a nature way and it is highly matched to emerging massively parallel processing capabilities.  ...  This approach uses partitioning, random sampling, promising index, and backtracking to create a Markov chain that has global optima as its absorbing states.  ...  In our numerical experiments, we incorporated the 2-opt exchange local search heuristic into the promising index with good results.  ... 
doi:10.1016/s0305-0548(98)00068-9 fatcat:4ayso4xo5jdynpweqjidbexbym

Iterated Local Search [article]

H.R. Lourenco, O.C. Martin, T. Stutzle
2001 arXiv   pre-print
This is a survey of "Iterated Local Search", a general purpose metaheuristic for finding good solutions of combinatorial optimization problems.  ...  After giving a general framework, we cover the uses of Iterated Local Search on a number of well studied problems.  ...  The information provided is the sole responsibility of the authors and does not reflect the Community's opinion. The Community is not responsible for any use that might be made of data  ... 
arXiv:math/0102188v1 fatcat:lryp3vneq5beznno2uii6vt2cu

Toward minimal restriction of genetic encoding and crossovers for the two-dimensional Euclidean TSP

Soonchul Jung, Byung-Ro Moon
2002 IEEE Transactions on Evolutionary Computation  
We also tested its performance on a mixed framework that incorporates a large-step Markov chain technique into the framework of a traditional EA.  ...  We suggest a new chromosomal encoding scheme that pursues minimal information loss and a crossover scheme with minimal restriction for the two-dimensional (2-D) Euclidean TSP.  ...  ACKNOWLEDGMENT The authors thank the Institute of Computer Technology, Seoul National University, for providing the research facilities for this study and Y.-H. Kim and D.-I.  ... 
doi:10.1109/tevc.2002.804321 fatcat:4ay43crguvhqbaceb3b5gavnwu

An Improved Clonal Selection Algorithm and Its Application to Traveling Salesman Problems

S. GAO, Z. TANG, H. DAI, J. ZHANG
2007 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
In this paper, we propose a Simulated Annealing PolyClonal Selection Algorithm (SAPCSA) for Traveling Salesman Problems (TSP).  ...  By introducing a simulated annealing (SA) strategy to the PolyClonal Selection Algorithm (PCSA), the SAPCSA integrate the characteristics of both SA and PCSA.  ...  To improve the performance of CLONALG, several heuristic strategies are incorporated into the original algorithm. Du et al.  ... 
doi:10.1093/ietfec/e90-a.12.2930 fatcat:rq6iavduajcxfnd43ozyu5n6vi

Approaches to macro decompositions of large Markov decision process planning problems

Terran Lane, Leslie Pack Kaelbling, Douglas W. Gage, Howie M. Choset
2002 Mobile Robots XVI  
Mobile robot navigation tasks are subject to motion stochasticity arising from the robot's local controllers, which casts the navigational task into a Markov decision process framework.  ...  by addressing the TSP sub-problem separately.  ...  ACKNOWLEDGMENTS We would like to thank David Karger and Maria Minkoff for their insights into the prize-collecting minimum latency case and for their ongoing assistance in developing algorithms for that  ... 
doi:10.1117/12.457435 dblp:conf/mr/LaneK01 fatcat:3sset7xnkjb4zoxrxk6gsjlmiy

Routing-aware scan chain ordering

Puneet Gupta, Andrew B. Kahng, Stefanus Mantik
2003 Proceedings of the 2003 conference on Asia South Pacific design automation - ASPDAC  
Scan chain insertion can have a large impact on routability, wirelength and timing of the design. We present a routing-driven methodology for scan chain ordering with minimum wirelength objective.  ...  We show substantial wirelength reductions for the routing-based flow, versus the traditional placement-based flow: in a number of our test cases, over 86% of scan routing overhead is saved.  ...  The "large-step Markov chain" (LSMC) heuristic of [20] and the "iterated LK" heuristic of [11] are believed to be the best-performing iterated descent variants (and, indeed, the best-performing of  ... 
doi:10.1145/1119772.1119961 dblp:conf/aspdac/GuptaKM03 fatcat:mwhmex7tevfffmkleeoh25nvae

Routing-aware scan chain ordering

Puneet Gupta, Andrew B. Kahng, Stefanus Mantik
2005 ACM Transactions on Design Automation of Electronic Systems  
Scan chain insertion can have a large impact on routability, wirelength and timing of the design. We present a routing-driven methodology for scan chain ordering with minimum wirelength objective.  ...  We show substantial wirelength reductions for the routing-based flow, versus the traditional placement-based flow: in a number of our test cases, over 86% of scan routing overhead is saved.  ...  The "large-step Markov chain" (LSMC) heuristic of [20] and the "iterated LK" heuristic of [11] are believed to be the best-performing iterated descent variants (and, indeed, the best-performing of  ... 
doi:10.1145/1080334.1080339 fatcat:k3hahwcekjahnmlm43snuurbly

A Sequence-based Selection Hyper-heuristic Utilising a Hidden Markov Model

Ahmed Kheiri, Ed Keedwell
2015 Proceedings of the 2015 on Genetic and Evolutionary Computation Conference - GECCO '15  
The proposed method is tested on the well known hyper-heuristic benchmark problems within the CHeSC 2011 competition and compared with a large number of algorithms in this domain.  ...  In this work, we propose a hidden Markov model based method to analyse the performance of, and construct, longer sequences of low level heuristics to solve difficult problems.  ...  Most of the low level heuristics in BP use acceptance strategy 2 meaning that the search is largely exploratory for this problem.  ... 
doi:10.1145/2739480.2754766 dblp:conf/gecco/KheiriK15 fatcat:h4ya4g2vazbfdo3mvja7t2xp44

Iterated Local Search: Framework and Applications [chapter]

Helena R. Lourenço, Olivier C. Martin, Thomas Stützle
2010 International Series in Operations Research and Management Science  
This work was supported by the META-X project, an Action de Recherche Concertée funded by the Scientific Research Directorate of the French Community of Belgium.  ...  , and Thomas Stützle acknowledges support from the F.R.S.  ...  This simple idea [9] has a long history, and its rediscovery by many authors has led to many different names for iterated local search like iterated descent [7, 8] , large-step Markov chains [62] ,  ... 
doi:10.1007/978-1-4419-1665-5_12 fatcat:utf2cljfz5akhkkbao3v4xf7wy

Learning to Solve Vehicle Routing Problems: A Survey [article]

Aigerim Bogyrbayeva, Meraryslan Meraliyev, Taukekhan Mustakhov, Bissenbay Dauletbayev
2022 arXiv   pre-print
heuristics.  ...  We present the taxonomy of the studies for learning paradigms, solution structures, underlying models, and algorithms.  ...  For instance, [91] solves TSP with the MHA-based encoder and the Pointer Network decoder along with a 2-opt local search.  ... 
arXiv:2205.02453v1 fatcat:oe56znjda5heldqkbjpr5im2de

Iterated Local Search

Helena Ramalhinho Dias Lourenço, Olivier C. Martin, Thomas Stutzle
2001 Social Science Research Network  
The essential idea of Iterated Local Search lies in focusing the search not on the full space of solutions but on a smaller subspace defined by the solutions that are locally optimal for a given optimization  ...  The success of Iterated Local Search lies in the biased sampling of this set of local optima.  ...  This simple idea has a long history, and its rediscovery by many authors has lead to many different names for iterated local search like iterated descent [9, 8] , large-step Markov chains [48] , iterated  ... 
doi:10.2139/ssrn.273397 fatcat:uq6bdresf5exxdkdbjj56liaze

A fast method for generalized starting temperature determination in homogeneous two-stage simulated annealing systems

James M. Varanelli, James P. Cohoon
1999 Computers & Operations Research  
Although the efficacy and robustness of the simulated annealing heuristic has been thoroughly demonstrated in the literature, the main drawback to the algorithm is its sometimes prohibitive run times.  ...  The main drawback to the two-stage simulated annealing technique is its problem-and formulation-dependent nature. include VLSI design automation algorithms, computational geometry, probabilistic search  ...  Acknowledgements The authors wish to thank Joe Ganley for the use of his iterative 1-Steiner RSMT implementation, as well as his insights regarding the RSMT problem in general.  ... 
doi:10.1016/s0305-0548(98)00062-8 fatcat:xwqrna2btnegrnkin7mitqfgsq
« Previous Showing results 1 — 15 out of 351 results