Model-based search for combinatorial optimization

Model-based search for combinatorial optimization (2001)

Cached

Download Links

by Mark Zlochin , Marco Dorigo

Citations:

BibTeX

@TECHREPORT{Zlochin01model-basedsearch,
    author = {Mark Zlochin and Marco Dorigo},
    title = {Model-based search for combinatorial optimization},
    institution = {},
    year = {2001}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Abstract In this paper we introduce model-based search as a unifying framework accommodating some recently proposed heuristics for combinatorial optimization such as ant colony optimization, stochastic gradient ascent, cross-entropy and estimation of distribution methods. We discuss similarities as well as distinctive features of each method, propose some extensions and present a comparative experimental study of these algorithms. 1

Citations

6071	Genetic Algorithms - Goldberg - 1989
2827	Reinforcement Learning: An Introduction - Sutton, Barto - 1998
872	Information theory and statistics - Kullback - 1959
710	A tutorial on learning with Bayesian networks - Heckerman - 1995
671	Adaptation in Natural and Artificial Systems. Ann Arbor - Holland - 1975
647	The Ant System: Optimization by a Colony of Cooperating Agents - Dorigo, Maniezzo, et al. - 1996
504	Nonlinear programming - Bertsekas - 1999
489	Ant Colony System: A Cooperative Learning Approach to the Travelling Salesman Problem - Dorigo, Gambardella
474	Uniform crossover in genetic algorithms - Syswerda - 1989
420	A stochastic approximation method - Robbins, Monro - 1951
396	Ant colony optimization - Dorigo, Stützle - 2004
257	Population-based incremental learning: a method for integrating genetic search based function optimization and competitive et al - Baluja - 1994
254	Ant algorithms for discrete optimization - Dorigo, Caro, et al.
252	The Ant Colony Optimization Meta-Heuristic - Dorigo, Caro - 1999
241	F: A survey of optimization by building and using probabilistic models - Pelikan, DE, et al.
219	BOA: The Bayesian Optimization Algorithm - Pelikan
205	From recombination of genes to the estimation of distributions: I. binary parameters - Muhlenbein, PaaB - 1996
205	AntNet: distributed stigmergetic control for communications networks - Caro, Dorigo - 1998
198	Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation - Larranaga, Lozano - 2002
190	A parameter-less genetic algorithm - Harik, Lobo - 1999
178	Linkage learning via probabilistic modeling in the ecga - Harik - 1999
150	Removing the genetics from the standard genetic algorithm - Baluja, Caruana - 1995
119	Optimization, learning and natural algorithms - Dorigo - 1992
118	MIMIC: Finding Optima by Estimating Probability Densities - Bonet, Isbell, et al. - 1997
111	Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space - Baluja, Davies - 1997
109	Combining instance-based and model-based learning - Quinlan - 1993
96	Finite Markov chain analysis of genetic algorithms - Goldberg, Segrest - 1987
83	The bivariate marginal distribution algorithm - Pelikan, Mühlenbein - 1999
82	Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem - Gambardella, Dorigo - 1995
79	Linkage problem, distribution estimation, and bayesian networks - Pelikan, Goldberg, et al. - 2000
72	MAX-MIN ant system and local search for the traveling salesman problem - Stützle, Hoos - 1997
67	Local Search in Combinatorial Optimization - Aarts, Lenstra - 1997
65	Optimization, Learning and Natural Algorithms (in Italian - Dorigo - 1992
58	Stützle , “The Ant Colony Optimization Meta-Heuristic: Algorithms, Applications and Advances - Dorigo, T - 2002
56	A.: The ant system: An autocatalytic optimizing process. technical report no. 91-016 revised - M, Maniezzo, et al. - 1991
45	ACO algorithms for the quadratic assignment problem - Stützle, Dorigo - 1999
42	M.: The hyper-cube framework for ant colony optimization - Blum, Dorigo - 2004
41	Exact and approximate non-deterministic tree-search procedures for the quadratic assignment problem - Maniezzo - 1998
28	The cross-entropy method for combinatorial and continuous optimization - Rubinstein - 1999
25	Global Optimization with Bayesian Networks - Etxeberria, Larrañaga - 1999
16	M.: Nonparametric and distribution-free methods for the social sciences - Marascuilo, McSweeney - 1977
16	Ant Colony Optimization and Stochastic Gradient Descent - Meuleau, Dorigo
14	Stützle T. 2004 Ant Colony Optimization - Dorigo
13	Ottimizzazione, apprendimento automatico, ed algoritmi basati su metafora naturale (Optimisation, learning and natural algorithms). Doctoral dissertation, Dipartimento di Elettronica e Informazione, Politecnico di - Dorigo - 1991
13	ACO for maximal constraint satisfaction problems - Roli, Blum, et al. - 2001
11	Combinatorial optimization, cross-entropy, ants and rare events - Rubinstein - 2000
10	Simulated Crossover in Genetic Algorithms’. In: Foundations of Genetic Algorithms 2 - Syswerda - 1993
8	Rare event simulation via cross-entropy and importance sampling - Rubinstein - 1999
7	editors (2001). Estimation of Distribution Algorithms: A New ToolforEvolutionaryComputation,volume 2 - Larrañaga, Lozano
6	The Cross-Entropy Method for Combinatorial and - Rubinstein - 1999