Combining constraint propagation and meta-heuristics for searching a maximum weight hamiltonian chain

RAIRO - Operations Research

Volumn 40, Issue 2, 2006, Pages 77-95

  Caseau, Yves ^a  

^a Bouygues Telecom   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED ANALYSIS; CONSTRAINT THEORY; HEURISTIC METHODS; METADATA; OPTIMIZATION; PROBLEM SOLVING;

CONSTRAINT PROGRAMMING; HAMILTONIAN CHAIN CONSTRAINTS; LARGE NEIGHBORHOOD SEARCH (LNS); META-HEURISTICS;

HAMILTONIANS;

EID: 33749828841     PISSN: 03990559     EISSN: 28047303     Source Type: Journal    
DOI: 10.1051/ro:2006018     Document Type: Article

References (15)

1. F. Laburthe and Y. Caseau, SALSA: A Language for Search Algorithms, in Proc. of CP'98, edited by M. Maher, J.-F. Puget, Springer. Lect. Notes Comput. Sci. 1520 (1998) 310-324.
2. Y. Caseau, G. Silverstein and F. Laburthe, Learning Hybrid Algorithms for Vehicle Routing Problems. TPLP 1 (2001) 779-806.
3. S. Minton, Configurable Solvers: Tailoring General Methods to Specific Applications, in Proc. of CP'97, edited by G. Smolka, Springer. Lect. Notes Comput. Sci. 1330 (1997) 372-374.
4. Y. Caseau and F. Laburthe, Solving small TSPs with Constraints, in Proc. of the 14th International Conference on Logic Programming. The MIT Press (1997).
5. F. Focacci, M. Milano and A. Lodi, Solving TSP with Time Windows with Constraints. ICLP 515-529W (1999).
6. Y. Caseau, G. Silverstein and F. Laburthe, A Meta-Heuristic Factory for Vehicle Routing Problems, in Proc. of CP'99, Lect. Notes Comput. Sci. 1713 (1999).
7. Harvey and M. Ginsberg, Limited Discrepancy Search, in Proc. of the 14th IJCAI. Morgan Kaufmann (1995) 607-615.
8. P. Shaw, Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems, in Proc. of CP'98, Lect. Notes Comput. Sci. 1520 (1998).
9. T. Benoist and B. Rottembourg, Upper Bounds of the Maximal Revenue of an Earth Observation Satellite, in 4OR: Quart. J. Belgian, French and Italian Oper. Res. Soc., Vol. 2, Issue 3, Oct. 2004.
10. 2003 ROADEF Challenge: http://www.prism.uvsq.fr/~vdc/ROADEF/CHALLENGES/ 2003.
11. E. Taillard, P. Badeau, M. Gendreau, F. Guertin and J.-Y. Potvin, A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows, Transportation Science 31 (1997).
12. D. Martin and P. Shmoys, A time-based approach to the Jobshop problem, in Proc. of IPCO'5, edited by M. Queyranne, Lect. Comput. Notes Sci. 1084 (1996).
13. Y. Caseau and F. Laburthe, Improving Branch and Bound for Jobshop Scheduling with Constraint Propagation. Combin. Comput. Sci. 1995 (1995) 129-149.
14. D. Applegate and B. Cook. A Computational Study of the Job Shop Scheduling Problem. Oper. Res. Soci. Amer. 3 (1991).
15. Y. Caseau, F.X. Josset and F. Laburthe, CLAIRE: Combining sets, search and rules to better express algorithms. TPLP 2 (2002) 769-805.