Hybrid Algorithms in Constraint Programming

This paper surveys hybrid algorithms from a constraint programming perspective. It introduces techniques used within a constructive search framework, such as propagation and linear relaxation, as well as techniques used in combination with search by repair.

[1]  Hani El Sakkout,et al.  Local Probing Applied to Scheduling , 2002, CP.

[2]  H. P. Williams,et al.  Model Building in Mathematical Programming , 1979 .

[3]  Mark Wallace,et al.  Constraint Logic Programming , 1992, Handbook of Constraint Programming.

[4]  Carlos Ansótegui,et al.  Modeling Choices in Quasigroup Completion: SAT vs. CSP , 2004, AAAI.

[5]  François Laburthe,et al.  Heuristics for Large Constrained Vehicle Routing Problems , 1999, J. Heuristics.

[6]  Jörg Homberger,et al.  A two-phase hybrid metaheuristic for the vehicle routing problem with time windows , 2005, Eur. J. Oper. Res..

[7]  J. Hooker,et al.  Logic-based Benders decomposition , 2003 .

[8]  Mark Wallace,et al.  A new approach to integrating mixed integer programming and constraint logicprogramming , 1999, Ann. Oper. Res..

[9]  Sharad Malik,et al.  Efficient conflict driven learning in a Boolean satisfiability solver , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[10]  Steven David Prestwich,et al.  Combining the Scalability of Local Search with the Pruning Techniques of Systematic Search , 2002, Ann. Oper. Res..

[11]  Makoto Yokoo,et al.  Weak-Commitment Search for Solving Constraint Satisfaction Problems , 1994, AAAI.

[12]  A. Lodi,et al.  Exploiting Relaxations in CP , 2004 .

[13]  Narendra Jussien,et al.  Local search with constraint propagation and conflict-based heuristics , 2000, Artif. Intell..

[14]  Benjamin W. Wah,et al.  A Discrete Lagrangian-Based Global-Search Method for Solving Satisfiability Problems , 1996, J. Glob. Optim..

[15]  Cédric Pralet,et al.  Travelling in the World of Local Searches in the Space of Partial Assignments , 2004, CPAIOR.

[16]  Mark Wallace,et al.  Hybrid Benders Decomposition Algorithms in Constraint Logic Programming , 2001, CP.

[17]  Pascal Van Hentenryck.  A Gentle Introduction to NUMERICA , 1998, Artif. Intell..

[18]  Sally C. Brailsford,et al.  The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared , 1995, CP.

[19]  Peter J. Stuckey,et al.  A Lagrangian reconstruction of GENET , 2000, Artif. Intell..

[20]  Mark Wallace,et al.  Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling , 2000, Constraints.

[21]  Panagiotis Stamatopoulos,et al.  Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search , 2002, Ann. Oper. Res..

[22]  J. Christopher Beck,et al.  A Hybrid Approach to Scheduling with Earliness and Tardiness Costs , 2003, Ann. Oper. Res..

[23]  Mark Wallace,et al.  Towards a closer integration of finite domainpropagation and simplex-based algorithms , 1998, Ann. Oper. Res..

[24]  Martin Henz,et al.  Scheduling a Major College Basketball Conference - Revisited , 2001, Oper. Res..

[25]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[26]  Reha Uzsoy,et al.  A Computational Study of Shifting Bottleneck Procedures for Shop Scheduling Problems , 1997, J. Heuristics.

[27]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.

[28]  Carmen Gervet,et al.  Large scale combinatorial optimization: A methodological viewpoint , 1998, Constraint Programming and Large Scale Discrete Optimization.

[29]  Pascal Van Hentenryck,et al.  Generality versus Specificity: An Experience with AI and OR Techniques , 1988, AAAI.

[30]  John N. Hooker,et al.  A Hybrid Method for the Planning and Scheduling , 2005, Constraints.

[31]  Pascal Van Hentenryck,et al.  Localizer: A Modeling Language for Local Search , 1997, CP.

[32]  Vipul Jain,et al.  Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems , 2001, INFORMS J. Comput..

[33]  Neil Yorke-Smith,et al.  An Improved Hybrid Model for the Generic Hoist Scheduling Problem , 2002, Ann. Oper. Res..

[34]  María Auxilio Osorio Lama,et al.  Mixed Logical-linear Programming , 1999, Discret. Appl. Math..

[35]  Richard E. Korf,et al.  Frontier search , 2005, JACM.

[36]  N. Azarmi,et al.  Workforce scheduling with constraint logic programming , 1995 .

[37]  François Laburthe,et al.  Combining local and global search in a constraint programming environment , 2001, The Knowledge Engineering Review.

[38]  George L. Nemhauser,et al.  Solving the Travelling Tournament Problem: A Combined Integer Programming and Constraint Programming Approach , 2002, PATAT.

[39]  Edward P. K. Tsang,et al.  Guided local search and its application to the traveling salesman problem , 1999, Eur. J. Oper. Res..

[40]  Barry Richards,et al.  A hybrid multicommodity routing algorithm for traffic engineering , 2004, Networks.

[41]  Mark Wallace,et al.  A Generic Model and Hybrid Algorithm for Hoist Scheduling Problems , 1998, CP.

[42]  John D. C. Little,et al.  On model building , 1993 .

[43]  Krzysztof R. Apt,et al.  Constraint logic programming using Eclipse , 2007 .

[44]  Gautam Mitra,et al.  Constraint Logic Programming and Integer Programming approaches and their collaboration in solving an assignment scheduling problem , 1997, Constraints.

[45]  Michel Gendreau,et al.  A Constraint Programming Framework for Local Search Methods , 1999, J. Heuristics.

[46]  Mark Wallace,et al.  Finding the Right Hybrid Algorithm – A Combinatorial Meta-Problem , 2002, Annals of Mathematics and Artificial Intelligence.

[47]  Thomas Schiex,et al.  Solution Reuse in Dynamic Constraint Satisfaction Problems , 1994, AAAI.

[48]  John N. Hooker,et al.  A Hybrid Method for Planning and Scheduling , 2004, CP.

[49]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[50]  Jimmy Ho-Man Lee,et al.  Speeding Up Constraint Propagation By Redundant Modeling , 1996, CP.

[51]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[52]  Meinolf Sellmann,et al.  Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem , 2003, Ann. Oper. Res..

[53]  Pascal Brisset,et al.  Combine and Conquer: Genetic Algorithm and CP for Optimization , 1998, CP.

[54]  Cid C. de Souza,et al.  Hybrid Column Generation Approaches for Urban Transit Crew Management Problems , 2005, Transp. Sci..