Mutsunori Yagiura, Toshihide Ibaraki  Home/Search
Context Related
| or.amp.i.kyotou.a...y99e300dpi.ps.gz Cached: 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.
PS.gz PS Image Update HelpFrom: or.amp.i.kyoto...survey99e_abst (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Metaheuristic algorithms are widely recognized as one of the most practical approaches for combinatorial optimization problems. Among representative metaheuristics are genetic algorithm, simulated annealing, tabu search and so on. In this paper, we explain essential ideas used in such metaheuristic algorithms within a generalized framework of local search. We then conduct numerical experiment of metaheuristic algorithms using rather simple implementations, to observe general tendencies of their ... (Update)
Similar documents based on text: More All
0.8: MAGMA: A Multiagent Architecture for Metaheuristics - Roli, Milano (2002) (Correct)
0.7: A Very Large-Scale Neighborhood Search Algorithm for the .. - Yagiura, Iwasaki.. (2004) (Correct)
0.6: Classification of Metaheuristics and Design of.. - Birattari.. (2001) (Correct)
BibTeX entry: (Update)
M. Yagiura and T. Ibaraki. On metaheuristic algorithms for combinatorial optimization problems. The Transactions of the Institute of Electronics, Information and Communication Engineers, J83-D-1(1):3-25, 200. http://citeseer.ist.psu.edu/412345.html More
@article{ yagiura-metaheuristic,
author = "M. Yagiura and T. Ibaraki",
title = "On metaheuristic algorithms for combinatorial optimization problems",
journal = "Transactions of the Institute of Electronics, Information and Communication Engineers",
volume = "J83-D-1",
number = "1",
pages = "3--25",
url = "citeseer.ist.psu.edu/412345.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
1527 Optimization by simulated annealing - Kirkpatrick, Gelatt et al. - 1983
1051 Optimization and Machine Learning (context) - Goldberg, in - 1989
588 Handbook of Genetic Algorithms (context) - Davis - 1991
548 Genetic Algorithms + Data Structures = Evolution Programs (context) - Michalewicz - 1992
417 Local Search in Combinatorial Optimization (context) - Aarts, Korst et al. - 1997
417 Local Search in Combinatorial Optimization (context) - Aarts, Lenstra - 1997
415 Improved approximation algorithms for maximum cut and satisa.. - Goemans, Williamson - 1995
293 Approximation algorithms for combinatorial problems (context) - Johnson - 1974
251 Ant system: optimization by a colony of cooperating agents - Dorigo, Maniezzo et al. - 1996
228 Simulated Annealing and Boltzmann Machines (context) - Aarts, Korst - 1989
197 Noise strategies for improving local search - Selman, Kautz et al. - 1994
157 Ant colony system: a cooperative learning approach to the tr.. - Dorigo, Gambardella - 1997
147 Kluwer Academic Publishers (context) - Glover, Laguna et al. - 1997
146 Domain-independent extensions to GSAT: solving large structu.. - Selman, Kautz - 1993
[Article contains additional citations not shown here]
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