Fourth International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems
========================================================================= CP-AI-OR 2002: Fourth International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems Le Croisic, march 25th -27th 2002 http://cpaior.emn.fr:8000/ First call for participation description, registration information, accepted papers ========================================================================= == Description The integration of techniques from AI and OR has shown in the past years how it improves algorithm quality for tackling complex and large scale combinatorial problems, especially in terms of efficiency, scaleability and optimality. The value of this integration has been shown in applications such as hoist scheduling, rostering, dynamic scheduling and vehicle routing. At the programming/modelling level, most constraint languages embed OR techniques to reason about collections of constraints, so-called global constraints. A few also provide support for hybridization allowing the programmer to build new integrated algorithms. The resulting multi-paradigm programming framework combines the flexibility and modelling facilities of constraint programming with the special purpose and efficient methods from Operations Research. The CP-AI-OR workshop is becoming a major forum for exchanging ideas and methodologies from both fields, as demonstrated by its success in Ferrara in 1999, in Paderborn in 2000, and in Ashford in 2001. Its aim is to bring together interested researchers from AI and OR, and to give them the opportunity to show how the integration of techniques from AI and OR can lead to interesting results on large scale and complex problems. We explicitly welcome new ideas and methods for integrating OR and AI techniques that have arisen from real-world applications. The workshop is organized by the Ecole des Mines de Nantes and will take place in Le Croisic, a typical village of Brittany the western part of France, close to Nantes. In addition to the workshop, a school is being organized immediately before the workshop with lectures on the basics of combination of hybrid CP-AI-OR techniques for combinatorial optimization. See: http://cpaior.emn.fr:8000/School . Workshop Organizers Narendra Jussien, École des Mines de Nantes, Narendra.Jussien@emn.fr François Laburthe, Bouygues e-lab, France flaburthe@bouygues.com The conference will be hosted by Port aux rocs, a convention center in a preserved environement, right by the sea, http://www.portauxrocs.com/hten/. == Registration information Registration is now open. The registration fee (from 250 to 550 EUR) includes all conference material, access to conference rooms, accomodation from March 24 to March 27 (room, breaks, breakfeasts, lunches and dinners), the conference banquet and a to be determined social event. . Important dates * 15 Feb 2002 -- End of early registration * 25-27 March 2002 -- CP-AI-OR'02. == Accepted papers (all abstracts are available on the web site http://cpaior.emn.fr:8000) A Non-Return Search Algorithm By: Mikhail Yu. Loenko Yet Another Local Search Method for Constraint Solving By: Philippe Codognet and Daniel Diaz Mosel: An Extensible Environment for Modeling and Programming Solutions By: Yves Colombani & Susanne Heipcke Randomised Backtracking for Weightless Linear Pseudo-Boolean Constraint Problems By: Steven Prestwich Heuristic Constraint Propagation (Using Local Search for Incomplete Pruning and Domain Filtering of Redundant Constraints for the Social Golfer Problem) By: Meinolf Sellmann Warwick Harvey Personnel Scheduling Using Hybrid CLP and Meta-Heuristic Approaches By: Bowie Owens, Andreas Ernst, Maria Garcia de la Banda, Kim Marriott Approaches to Find a Near-minimal Change Solution for Dynamic CSPs By: Yongping Ran, Nico Roos, Jaap van den Herik Solving Small VRPTW`s with Constraint Programming Based Column Generation By: Louis-Martin Rousseau, Michel Gendreau, Gilles Pesant Graph Coloring for Air Traffic Flow Management By: Nicolas Barnier and Pascal Brisset Modelling a Balanced Academic Curriculum Problem By: Brahim Hnich, Zeynep Kiziltan, Toby Walsh Practical Parallelism in Constraint Programming By: Laurent Perron Order-constraint-based Preference Programming and Multi-criteria Optimization By: Ulrich Junker Local Search Techniques for Solving Planning Graphs with Action Costs By: Alfonso Gerevini Ivan Serina R2D2: A random backtracking search By: Olivier Lhomme Cost based Filtering vs. Upper Bounds for maximum Clique By: Torsten Fahle An implementation of Pareto Optimality in CLP(FD) By: Marco Gavanelli A hybrid constraint propagation-cutting plane algorithm for the RCPSP By: Sophie Demassey Christian Artigues Philippe Michelon On the relation between complete and incomplete search: an informal discussion By: Michela Milano and Andrea Roli Constraint Programming and Hybrid Formulations for Three Life Designs By: Robert Bosch Michael Trick Phase Transitions, Backbones, Measurement Accuracy, and Phase-Aware Problem Solving: The ATSP as a Case Study By: Weixiong Zhang Limit-Crossing: A reduction method for graph problems By: Sharlee Climer and Weixiong Zhang A practical approach to multi criteria optimization problems in constraint programming By: Filippo Focacci, Daniel Godard Pruning sub-optimal search branches using local search By: Filippo Focacci, Paul Shaw Cost propagation: a generalization of constraint propagation for optimization problems By: Dag Wedelin Combining Local Search and Linear Programming to Solve Earliness/Tardiness Scheduling Problems By: Chris Beck, Philippe Refalo Arc-Consistency and Tabu Search for the Frequency Assignment Problem with Polarization By: Michel Vasquez The promise of LP to Boost CSP techniques for Combinatorial Problems By: Carla P. Gomes and David Shmoys