Christine Solnon  Home/Search
Context Related
| www710.univlyon1.fr/%7Ecsol...TEC02.ps 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: www710.univlyon1.f...pub_english (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to use artificial ants to keep track of promising areas of the search space by laying trails of pheromone. This pheromone information is used to guide the search, as a heuristic for choosing values to be assigned to variables. (Update)
Cited by: More
The DynCOAA Algorithm for Dynamic Constraint Optimization.. - Mertens, Holvoet, Berbers (2006) (Correct)
Shift design in a Client Contact Center - Cyril Canon Nicolas (Correct)
A Study into Ant Colony Optimisation, Evolutionary.. - van Hemert, Solnon (2004) (Correct)
Similar documents (at the sentence level):
16.8%: Ants can solve Constraint Satisfaction Problems - Solnon (2001) (Correct)
Active bibliography (related documents): More All
0.6: A Study of Greedy, Local Search and Ant Colony.. - Gottlieb, Puchta, Solnon (Correct)
0.5: A Two-Pronged Attack on the Dragon of Intractability - Gilmour, Dras (2005) (Correct)
0.4: Investigating ACO capabilities for solving the Maximum Clique.. - Solnon, Fenet (2004) (Correct)
Similar documents based on text: More All
1.4: Boosting ACO with a Preprocessing Step - Solnon (2002) (Correct)
1.2: Solving Permutation Constraint Satisfaction Problems with.. - Solnon (2000) (Correct)
0.9: MAX-MIN Ant System - Stützle, Hoos (1999) (Correct)
Related documents from co-citation: More All
4: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Pro.. - Dorigo, Gambardella - 1997
4: The Ant Colony Optimization Meta-Heuristic - Dorigo, Di Caro - 1999
4: Ant Algorithms for Discrete Optimization - Dorigo, Di Caro et al. - 1998
BibTeX entry: (Update)
C. Solnon. Ants can solve constraint satisfaction problems. Technical report, LISI, 2001. http://citeseer.ist.psu.edu/solnon01ants.html More
@techreport{ solnon01ants,
author = "C. Solnon",
title = "Ants can solve constraint satisfaction problems",
institution = "{LISI}",
year = "2001",
url = "citeseer.ist.psu.edu/solnon01ants.html" }
Citations (may not include all citations):473 Foundations of Constraint Satisfaction (context) - Tsang - 1993
329 Where the really hard problems are - Cheeseman, Kanelfy et al. - 1991
311 Partial constraint satisfaction - Freuder, Wallace - 1992
272 Tabu search - Glover, Laguna - 1993
251 The Ant System: Optimization by a colony of cooperating agen.. - Dorigo, Maniezzo et al. - 1996
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
129 Valued constraint satisfaction problems: Hard and easy probl.. - Shiex, Fargier et al. - 1995
112 The Ant Colony Optimization metaheuristic - Dorigo, Di Caro - 1999
87 Fitness distance correlation as a measure of problem diculty.. - Jones, Forrest - 1995
80 Ant algorithms for discrete optimization - Dorigo, Di Caro et al. - 1999
72 The Ant System applied to the quadratic assignment problem - Maniezzo, Colorni - 1999
59 The constrainedness of search - Gent, MacIntyre et al. - 1996
53 Ants can colour graphs (context) - Costa, Hertz - 1997
42 Local search and the number of solutions - Clark, Frank et al. - 1996
39 A new method for solving hard satis ability problems (context) - Selman, Levesque et al. - 1992
30 Ant colonies for the quadratic assignment problem (context) - Gambardella, Taillard et al. - 1999
30 An improved ant system algorithm for the vehicle routing pro.. - Bullnheimer, Hartl et al. - 1999
30 Localizer: a modeling language for local search - Michel, Van Hentenryck - 1997
27 Minimizing con icts: a heuristic repair method for constrain.. (context) - Minton, Johnston et al. - 1992
27 Fitness landscapes and memetic algorithm design - Merz, Freisleben - 1999
20 Dipartimento di Elettronica (context) - Dorigo, Learning et al. - 1992
17 Random constraints satisfaction: theory meets practice - MacIntyre, Prosser et al. - 1998
16 Why adding more constraints makes a problem easier for hill-.. - Yokoo - 1997
15 Heuristic methods for overconstrained constraint satisfactio.. - Wallace, Freuder - 1995
14 Iterated local search (context) - Louren, Martin et al. - 2002
10 Empirical studies of heuristic local search for constraint s.. - Hao, Dorne - 1996
8 A comparison of complete and incomplete algorithms in the ea.. - Davenport - 1995
5 MAX MIN Ant System - St, Hoos - 2000
5 Dual models of permutation problems - Smith - 2001
5 Solving permutation constraint satisfaction problems with ar.. - Solnon - 2000
4 Succeed- rst or fail- rst: A case study in variable and valu.. (context) - Smith - 1997
2 MACSVRPTW: A multiple ant colony system for vehicle routing .. (context) - Gambardella, Taillard et al. - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www710.univ-lyon1.fr/~csolnon/pub_english.html): More
Boosting ACO with a Preprocessing Step - Solnon (2002) (Correct)
Concurrent Cooperating Solvers over Reals - Rueher, Solnon (1997) (Correct)
Cooperation of LP Solvers for Solving MILPs - Solnon (1997) (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