Model-Based Search for Combinatorial Optimization: A Critical Survey

13 years 4 months ago

Download code.ulb.ac.be

In this paper we introduce model-based search as a unifying framework accommodating some recently proposed metaheuristics 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 and we propose some extensions.

Mark Zlochin, Mauro Birattari, Nicolas Meuleau, Ma

Real-time Traffic

ANOR 2004 | Ant Colony Optimization | Stochastic Gradient Ascent | Unifying Framework |

claim paper

» A Deterministic Metaheuristic Approach Using Logistic Ants for Combinatorial Optimization

» Stochastic local search in continuous domains questions to be answered when designing a no...

» Tabu Search Based Circuit Optimization

» Scalable parallel algorithms for difficult combinatorial problems A case study in optimiza...

» Finding critical backbone structures with genetic algorithms

» Scatter Search Particle Filter for 2D RealTime Hands and Face Tracking

» Cycle time and slack optimization for VLSIchips

» A Monte Carlo Study of Randomised Restarted Search in ILP

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2004
Where	ANOR
Authors	Mark Zlochin, Mauro Birattari, Nicolas Meuleau, Marco Dorigo

Comments (0)

Sciweavers

Model-Based Search for Combinatorial Optimization: A Critical Survey

ANOR 2004 | Ant Colony Optimization | Stochastic Gradient Ascent | Unifying Framework |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers