Integrating ACO and constraint propagation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3172 LNCS, Issue , 2004, Pages 166-177

  Meyer, Bernd ^a,b   Ernst, Andreas ^b  

^a MONASH UNIVERSITY   (Australia)

^b CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY; SCHEDULING; SWARM INTELLIGENCE; ALGORITHMS; ARTIFICIAL INTELLIGENCE; OPTIMIZATION; PROBLEM SOLVING;

COMPLEMENTARY TECHNIQUES; CONSTRAINT PROGRAMMING; CONSTRAINT PROPAGATION; HARD CONSTRAINTS; JOB SCHEDULING PROBLEM; META HEURISTICS; OPTIMISATION METHOD; OPTIMISATION PROBLEMS;

ANT COLONY OPTIMIZATION;

EID: 28944444795     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28646-2_15     Document Type: Conference Paper

References (17)

1. N. Ascheuer, M. Fischetti, and M. Grötschel. Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Mathematical Programming, 90(3):475-506, 2001.
2. N. Barnier and P. Brisset. Combine & conquer: Genetic algorithm and CP for optimization. In Principles and Practice of Constraint Programming, Pisa, October 1998.
3. A. Bauer, B. Bullnheimer, R.F. Hartl, and C. Strauss. An ant colony optimization approach for the single machine total tardiness problem. In Proceedings of the Congress on Evolutionary Computation, Washington/DC, July 1999.
4. C. Blum and A. Roli. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys, 35(3):268-308, 2003.
5. C. Blum and M. Sampels. When model bias is stronger than selection pressure. In Parallel Problem Solving From Nature (PPSN-VII), Granada, September 2002.
6. M. Carlsson, G. Ottosson, and B. Carlson. An open-ended finite domain constraint solver. In Proc. PLILP'97 Programming Languages: Implementations, Logics, and Programs, Southampton, September 1997.
7. C.A. Coello. Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Computer Methods in Applied Mechanics and Engineering, 191(11-12):1245-1287, 2002.
8. O. Cordon, F. Herrera, and T. Stützle. A review on the ant colony optimization metaheuristic: Basis, models and new trends. Mathware and Soft Computing, 9(2-3):141-175, 2002.
9. M. den Besten, T. Sẗutzle, and M. Dorigo. Ant colony optimization for the total weighted tardiness problem. In Parallel Problem Solving from Nature - PPSN VI, Paris, France, September 2000.
10. M. Dorigo, G. Di Caro, and L.M. Gambardella. Ant algorithms for discrete optimization. Artificial Life, 5:137-172, 1999.
11. M. Dorigo and L.M. Gambardella. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1):53-66, 1997.
12. F. Focacci, F. Laburthe, and A. Lodi. Local search and constraint programming. In F. Glover and G. Kochenberger, editors, Handbook of metaheuristics. Kluwer, Boston/MA, 2003.
13. E.L. Lawler, J.K. Lenstra, A.H.G Rinnooy Kan, and D.B. Shmoys. Sequencing and scheduling: algorithms and complexity. In S.C. Graves, A.H.G. Rinnooy Kan, and P.H. Zipkin, editors, Logistics of Production and Inventory, pages 445-522. North Holland, Amsterdam, Netherlands, 1993.
14. K. Marriott and P. Stuckey. Programming With Constraints. MIT Press, Cambridge/ MA, 1998.
15. G. Pesant and M. Gendreau. A constraint programming framework for local search methods. Journal of Heuristics, 5(3):255-279, 1999.
16. G. Pesant, M. Gendreau, J.-Y. Potvinand, and J.-M. Rousseau. An exact constraint logic programming algorithm for the traveling salesman problem with time windows. Transportation Science, 32(1):12-29, 1998.
17. K. Socha. MAX-MIN ant system for international timetabling competition. Technical report, Universite Libre de Bruxelles, September 2003. TR/IRIDIA/2003-30.