Combining local and global search in a constraint programming environment

Knowledge Engineering Review

Volumn 16, Issue 1, 2001, Pages 41-68

  Caseau, Yves ^a   Laburthe, François ^a   Le Pape, Claude ^a   Rottembourg, Benoît ^a  

^a Bouygues Telecom   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; CONSTRAINT THEORY; DECISION MAKING; HEURISTIC METHODS; OPTIMIZATION;

COMBINATORIAL OPTIMIZATION; LOCAL SEARCH TECHNIQUES;

LINEAR PROGRAMMING;

EID: 0347537508     PISSN: 02698889     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0269888901000078     Document Type: Article

References (52)

1. Adams, J, Balas, E and Zawack, D, 1988. "The shifting bottleneck procedure for job shop scheduling" Management Science 34 391-401.
2. Applegate, D and Cook, B, 1991. "A computational study of the job shop scheduling problem" ORSA Journal of Computing 3(2).
3. Balas, E and Vazacopoulos, A, 1998. "Guided local search with shifting bottleneck for job shop scheduling" Management Science 44(2).
4. Baptiste, P and Le Pape, C, 1996. "Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling" Proceedings of the 15th Workshop of the U.K. Planning Special Interest Group Liverpool, UK.
5. Baptiste, P, Le Pape, C and Nuijten, W, 1995. "Constraint-based optimization and approximation for job-shop scheduling" Proceedings of the AAAI-SIGMAN Workshop on Intelligent Manufacturing Systems, IJCAI Montréal, Québec.
6. Beck, JC, Davenport, AJ, Sitarski, EM and Fox, MS, 1997. "Texture-based heuristics for scheduling revisited" Proceedings of the 14th National Conference on Artificial Intelligence MIT Press.
7. Carlier, J and Pinson, E, 1989. "An algorithm for solving the job shop problem" Management Science 35(2).
8. Carlier, J and Pinson, E, 1990. "A practical use of Jackson's preemptive schedule for solving the job-shop problem" Annals of Operations Research 26 269-287.
9. Carlier, J and Pinson, E, 1994. "Adjustments of heads and tails for the job-shop problem" Euro Journal of Operations Research 78 146-161.
10. Caseau, Y and Laburthe, F, 1994. "Improved CLP scheduling with task intervals" Proceedings of the 11th International Conference on Logic Programming MIT Press, 369-383.
11. Caseau, Y and Laburthe, F, 1995. "Disjunctive scheduling with task interval" LIENS Technical Report 95-25 École Normale Supérieure, 45 rue d'Ulm, 75005 Paris, France.
12. Caseau, Y and Laburthe, F, 1996. "Introduction to the Claire programming language" LIENS Report 96-15, École Normale Supérieure.
13. Caseau, Y and Laburthe, F, 1997. "Solving small TSPs with constraints" Proceedings of the 14th International Conference on Logic Programming MIT Press.
14. Caseau, Y and Laburthe, F, 1998. "SALSA: A language for search algorithms" Proceedings of the 4th Conference on Principles and Practice of Constraint Programming Springer-Verlag, LNCS 1520, 310-324.
15. Caseau, Y and Laburthe, F, 1999. "Heuristics for large constrained vehicle routing problems" Journal of Heuristics 5(3) 281-303.
16. Cesta, A and Oddi, A, 1996. "Gaining efficiency and flexibility in the simple temporal problem" Proceedings of the 3rd International Workshop on Temporal Representation and Reasoning 45-50.
17. Dell'Amico, M and Trubian, M, 1993. "Applying tabu-search to the job-shop scheduling problem" Annals of Operations Research 41 231-252.
18. Dumas et al., 1995. "An optimal algorithm for the traveling salesman problem with time windows" Operations Research 43 367-371.
19. Garey, MR and Johnson, DS, 1979. Computers and Intractability. A Guide to the Theory of NP-Completeness WH Freeman.
20. Gendreau, M, Hertz, A and Laporte, G, 1994. "A tabu search heuristic for the vehicle routing problem" Management Science 40 1276-1290.
21. Gendreau, M, Laporte, G and Potvin, JY, 1997. "Vehicle routing: modern heuristics" in Local Search in Combinatorial Optimization E Aarts and JK Lenstra (eds.), Wiley.
22. Gondran, M and Minoux, M, 1984. Graphs and Algorithms Wiley, New York.
23. Harvey, W and Ginsberg, M, 1995. "Limited discrepancy search" Proceedings of the 14th International Joint Conference on Artificial Intelligence Morgan Kaufmann, 607-615.
24. Kontoravdis, G and Bard, J, 1995. "A GRASP for the vehicle routing problem with time windows" ORSA Journal of Computing 7(1).
25. Laporte, G, 1992. "The vehicle routing problem: an overview of exact and approximate algorithms" Euro. Journal of Operations Research 59 345-358.
26. Le Pape, C, 1988. "Des systèmes d'ordonnancement flexibles et opportunistes" PhD Thesis, University Paris XI, Orsay, France (in French).
27. Le Pape, C, 1994. "Implementation of Resource Constraints in ILOG SCHEDULE: A Library for the Development of Constraint-Based Scheduling Systems" Intelligent Systems Engineering 3 55-66.
28. Le Pape, C and Baptiste, P, 1996. "Constraint propagation techniques for disjunctive scheduling: The preemptive case" Proceedings of the 12th European Conference on Artificial Intelligence Wiley, 619-623.
29. Le Pape, C and Baptiste, P, 1998. "Resource constraints for preemptive job-shop scheduling" Constraints 3 263-287.
30. Le Pape, C and Baptiste, P, 1999. "Heuristic control of a constraint-based algorithm for the preemptive job-shop scheduling problem" Journal of Heuristics 5(3) 305-325.
31. Lin, S and Kernighan, BW, 1973. "An effective heuristic for the traveling salesman problem" Operations Research 21 498-516.
32. Mautor, T and Michelon, P, 1997. "MIMAUSA: A new hybrid method combining exact solution and local search" Proceedings of the 2nd International Conference on Meta-Heuristics.
33. Martin, P and Shmoys, D, 1996. "A time-based approach to the Jobshop problem" Proceedings of IPCO'5 Vancouver. M. Queyranne (ed.), Springer-Verlag, LNCS 1084, 389-403.
34. Minton, S, 1997. "Configurable solvers: Tailoring general methods to specific applications" Proceedings of the 3rd Conference on Principles and Practice of Constraint Programming G Smolka (ed.), Springer-Verlag, LNCS 1330, 372-374.
35. Nowicki, E and Smutnicki, C, 1996. "A fast tabu search algorithm for the job-shop problem" Management Science 42(6) 797-813.
36. Nuijten, W, 1994. "Time and Resource Constrainted Scheduling, a Constraint Satisfaction Approach" PhD Dissertation, University of Eindhoven.
37. Péridy, L, 1996. "Le problème de job-shop: arbitrages et ajustements" PhD Thesis, Université de Technologie de Compiègne, Compiègne, France (in French).
38. Pesant, G, Gendreau, M, Potvin, J-Y and Rousseau, J-M, 1998. "An exact constraint logic programming algorithm for the travelling salesman problem with time windows" Transportation Science 32(1) 12-29.
39. Pesant, G and Gendreau, M, 1996. "A view of local search in constraint programming" Proceedings of the 2nd Conference on Principles and Practice of Constraint Programming Springer-Verlag, LNCS, 353-366.
40. Rego, C and Roucairol, C, 1996. "A parallel tabu search algorithm using ejection chains for the vehicle routing problem" in Meta-Heuristics: Theory and Applications Kluwer.
41. Rochat, E and Taillard, E, 1995. "Probabilistic diversification and intensification in local search for vehicle routing" Journal of Heuristics 1 147-167.
42. Rousseau, LM, Gendreau, M and Pesant, G, 1999. "Using constraint-based operators with variable neighborhood search to solve the vehicle routing problem with time windows" CP-AI-OR'99 Workshop, Ferrara.
43. Russell, R, 1995. "Hybrid heuristics for the vehicle routing problem with time windows" Transportation Science 29(2).
44. Shaw, P, 1998. "Using constraint programming and local search methods to solve vehicle routing problems" Proceedings of the 4th Conference on Principles and Practice of Constraint Programming, M Maher and JF Puget (eds.), Springer-Verlag, LNCS 1520.
45. Silverstein, G and Pazzani, M, 1991. "Relational clichés: constraining constructive induction during relational learning" Machine Learning, Proceedings of the Eighth International Workshop (ML91) Morgan Kaufmann, 203-207.
46. Solomon, M, 1987. "Algorithms for the vehicle routing and scheduling problems with time window constraints" Operations Research 35(2).
47. Steele, GL, Jr., 1980. "The Definition and Implementation of a Computer Programming Language Based on Constraints" PhD Thesis, Massachusetts Institute of Technology.
48. Taillard, E, Badeau, P, Gendreau, M, Guertain, F and Rousseau, JY, 1995. "A New Neighborhood Structure for the Vehicle Routing Problem with Time Windows" Technical Report CRT-95-66, Université de Montréal.
49. Thompson, P and Psaraftis, H, 1993. "Cyclic transfer algorithms for multi-vehicle routing and scheduling problems" Operations Research 41(5).
50. Vaessens, RJM, Aarts, EHL and Lenstra, JK, 1996. "Job shop scheduling by local search" Informs Journal of Computing 8 302-317.
51. Van Laarhoven, P, Aarts, E and Lenstra, JK, 1992. "Job shop by simulated annealing" Operations Research 40(1).
52. Walsh, T, 1997. "Depth-bounded discrepancy search" Proceedings of the 15th International Joint Conference on Artificial Intelligence Morgan Kaufmann.