Propagation guided large neighborhood search

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

Volumn 3258, Issue , 2004, Pages 468-481

  Perron, Laurent ^a   Shaw, Paul ^a   Furnon, Vincent ^a  

^a IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

AUTOMATIC METHOD; CAR SEQUENCING PROBLEM; CONSTRAINT PROGRAMMING; GENERIC CODES; LARGE NEIGHBORHOOD SEARCH; NON-TRIVIAL;

OPTIMIZATION;

EID: 33748554309     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30201-8_35     Document Type: Article

References (16)

1. Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In Maher, M., Puget, J.F., eds.: Proceeding of CP '98, Springer-Verlag (1998) 417-431
2. Bent, R., Hentenryck, P.V.: A two-stage hybrid local search for the vehicle routing problem with time windows. Technical Report CS-01-06, Brown University (2001)
3. Applegate, D., Cook, W.: A computational study of the job-shop scheduling problem. ORSA Journal on Computing 3 (1991) 149-156
4. J. Adams, E.B., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Management Science 34 (1988) 391-401
5. Caseau, Y., Laburthe, F.: Effective forget-and-extend heuristics for scheduling problems. In: Proceedings of the First International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR'99). (1999)
6. Palpant, M., Artigues, C., Michelon, P.: Solving the resource-constrained project scheduling problem by integrating exact resolution and local search. In: 8th International Workshop on Project Management and Scheduling PMS 2002. (2002) 289-292
7. Le Pape, C., Perron, L., Régin, J.C., Shaw, P.: Robust and parallel solving of a network design problem. In Hentenryck, P.V., ed.: Proceedings of CP 2002, Ithaca, NY, USA (2002) 633-648
8. Palpant, M., Artigues, C., Michelon, P.: A heuristic for solving the frequency assignment problem. In: XI Latin-Iberian American Congress of Operations Research (CLAIO). (2002)
9. CPLEX: ILOG CPLEX 9.0 User's Manual and Reference Manual. ILOG, S.A. (2003)
10. Refalo, P.: Impact based strategies for constraint programming. Submitted to CP 2004 (2004)
11. Perron, L.: Combining forces to solve the car sequencing problem. In: Proceeding of CP-AI-OR 2004, Springer Verlag (2004)
12. Chabrier, A., Danna, E., Le Pape, C., Perron, L.: Solving a network design problem. To appear in Annals of Operations Research, Special Issue following CP-AI-OR'2002 (2003)
13. Perron, L.: Fast restart policies and large neighborhood search. In: Proceedings of CPAIOR 2003. (2003)
14. Danna, E., Perron, L.: Structured vs. unstructured large neighborhood search: A case study on job-shop scheduling problems with earliness and tardiness costs. In: Proceeding of CP 2003, Springer Verlag (2003)
15. Michel, L., Hentenryck, P.V.: A constraint-based architecture for local search. In: Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, ACM Press (2002) 83-100
16. Gottlieb, J., Puchta, M., Solnon, C.: A study of greedy, local search and ant colony optimization approaches for car sequencing problems. In: Applications of evolutionary computing (EvoCOP 2003), Springer Verlag (2003) 246-257 LNCS 2611.