Skip to main content
SpringerLink
Log in

Two Generic Schemes for Efficient and Robust Cooperative Algorithms

  • Chapter
Constraint and Integer Programming

Part of the book series: Operations Research/Computer Science Interfaces Series ((ORCS,volume 27))

Abstract

Many examples of hybrid algorithms have been described in the recent optimization literature and shown to provide better results than pure algorithms based on only one technology. Yet, it is difficult to understand what makes a cooperative strategy work, hence it is difficult to design a good cooperative strategy. In this paper, we try to convey our understanding of the performance of hybrid algorithms with respect to two criteria: efficiency and robustness. We first present the strengths and weaknesses of each possible component of hybrid algorithms: polynomial operations research algorithms, constraint programming, mixed integer programming, and local search. We then give an overview of hybrid algorithms, looking at each of the six possible combinations of two of the techniques enumerated above. We try to abstract from hybrid examples the two following generic cooperative schemes. The decomposition scheme consists in applying one technique to a sub-problem in order to gain information that is then used by another technique to solve the overall problem. The multiple search scheme combines several techniques that solve in turn or in parallel the full problem and exchange information which allows for better diversification and intensification.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aboudi, R. and Jörnsten, K. (1994). Tabu search for general zero-one integer programs using the pivot and complement heuristic. ORSA Journal on Computing, 6(1):82–93.

    Article  MATH  Google Scholar 

  • Adams, J., Balas, E., and Zawack, D. (1988). The shifting bottleneck procedure for job-shop scheduling. Management Science, 34(3):391–401.

    Article  MathSciNet  MATH  Google Scholar 

  • Applegate, D. and Cook, W. (1991). A computational study of the job-shop scheduling problem. ORSA Journal on Computing, 3(2): 149–156.

    Article  MATH  Google Scholar 

  • Balas, E. and Martin, C. (1980). Pivot and complement — a heuristic for 0–1 programming. Management Science, 26(1):224–234.

    Article  MathSciNet  Google Scholar 

  • Baptiste, P. and Le Pape, C. (1995). A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence.

    Google Scholar 

  • Baptiste, P., Le Pape, C., and Nuijten, W. (1995). Incorporating efficient operations research algorithms in constraint-based scheduling. In Proceedings of the First International Joint Workshop on Artificial Intelligence and Operations Research.

    Google Scholar 

  • Baptiste, P., Le Pape, C, and Nuijten, W. (1999). Satisfiability tests and time-bound adjustments for cumulative scheduling problems. Annals of Operations Research, 92:305–333.

    Article  MathSciNet  MATH  Google Scholar 

  • Baptiste, P., Le Pape, C, and Péridy, L. (1998). Global constraints for partial CSPs: A case study of resource and due-date constraints. In Proceedings of the Fourth International Conference on Principles and Practice of Constraint Programming.

    Google Scholar 

  • Barnhart, C, Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W., and Vance, P. H. (1998). Branch-and-price: Column generation for solving huge integer programs. Operations Research, 46:316–329.

    Article  MathSciNet  MATH  Google Scholar 

  • Benders, J. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4:238–252.

    Article  MathSciNet  MATH  Google Scholar 

  • Benoist, T., Gaudin, E., and Rottembourg, B. (2002). Constraint programming contribution to Benders decomposition: A case study. In Proceedings of the Eigth International Conference on Principles and Practice of Constraint Programming (CP’2002), pages 603–617.

    Google Scholar 

  • Benoist, T., Laburthe, F., and Rottembourg, B. (2001). Lagrange relaxation and constraint programming collaborative schemes for traveling tournament problems. In Proceedings of the Third International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR’01), pages 15–26.

    Google Scholar 

  • Bixby, R. E., Fenelon, M., Gu, Z., Rothberg, E., and Wunderling, R. (2000). MIP: Theory and Practice — Closing the Gap, pages 19–49. Kluwer Academic Publishers.

    Google Scholar 

  • Carlier, J. (1982). The one-machine sequencing problem. European Journal of Operational Research, 11(1):42–47.

    Article  MathSciNet  MATH  Google Scholar 

  • Carlier, J. and Pinson, E. (1989). An algorithm for solving the job-shop problem. Management Science, 35(2): 164–176.

    Article  MathSciNet  MATH  Google Scholar 

  • 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.

    MathSciNet  MATH  Google Scholar 

  • Caseau, Y. and Laburthe, F. (1994). Improved CLP scheduling with task intervals. In Proceedings of the Eleventh International Conference on Logic Programming.

    Google Scholar 

  • Caseau, Y. and Laburthe, F. (1995). Disjunctive scheduling with task intervals. Technical report, École Normale Supérieure.

    Google Scholar 

  • Caseau, Y. and Laburthe, F. (1996). Cumulative scheduling with task intervals. In Proceedings of the Joint International Conference and Symposium on Logic Programming.

    Google Scholar 

  • Caseau, Y. and Laburthe, F. (2000). Solving various weighted matching problems with constraints. Constraints, 5(2): 141–160.

    Article  MathSciNet  MATH  Google Scholar 

  • Caseau, Y., Laburthe, F., Le Pape, C, and t Rottembourg, B. (2001). Combining local and global search in a constraint programming environment.Knowledge Engineering Review, 16(1):41–68.

    Article  MATH  Google Scholar 

  • Cavalcante, C., de Souza, C. C., Savelsbergh, ML, Wang, Y., and Wolsey, L. (2001). Scheduling projects with labor constraints. Discrete Applied Mathematics, 112:27–52.

    Article  MathSciNet  MATH  Google Scholar 

  • Chabrier, A., Danna, E., and Le Pape, C. (2002). Coopération entre génération de colonnes avec tournées sans cycle et recherche locale appliquée au routage de véhicules. In Huitièmes Journées Nationales sur la résolution de Problèmes NP-Complets (JNPC’2002).

    Google Scholar 

  • Colmerauer, A. (1990). An introduction to PROLOG III. Communications of the ACM, 33(7):69–90.

    Article  Google Scholar 

  • Danna, E., Rothberg, E., and Le Pape, C. (2003). Exploring relaxation induced neighborhoods to improve MIP solutions. Technical report, ILOG.

    Google Scholar 

  • Desrochers, M. (1988). An algorithm for the shortest path problem with resource constraints. Technical Report G-88-27, Les cahiers du GERAD.

    Google Scholar 

  • Eremin, A. and Wallace, M. (2001). Hybrid Benders decomposition algorithms in constraint logic programming. In Proceedings of the Seventh International Conference on Principles and Practice of Constraint Programming (CP’2001).

    Google Scholar 

  • Feillet, D., Dejax, P., Gendreau, M., and Gueguen, C. (2001). An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. submitted to Networks.

    Google Scholar 

  • Fischetti, M. and Lodi, A. (2002). Local branching. In Proceedings of the Integer Programming Conference in honor of Egon Balas.

    Google Scholar 

  • Focacci, F., Laborie, P., and Nuijten, W. (2000). Solving scheduling problems with setup times and alternative resources. In Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling.

    Google Scholar 

  • Focacci, F., Lodi, A., and Milano, M. (1999). Cost-based domain filtering. In Proceedings of the Fifth International Conference on Principles and Practice of Constraint Programming.

    Google Scholar 

  • Focacci, F. and Shaw, P. (2002). Pruning sub-optimal search branches using local search. In Proceedings of the Fourth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR’02),pages 181–189.

    Google Scholar 

  • Gendron, B. and Crainic, T. G. (1994). Relaxations for multicommodity capacitated network design problems. Technical Report CRT-965, Centre de recherche sur les transports, Université de Montréal.

    Google Scholar 

  • Harvey, W. D. and Ginsberg, M. L. (1995). Limited discrepancy search. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence.

    Google Scholar 

  • Hentenryck, P. V. (1989). Constraint Satisfaction in Logic Programming. MIT Press.

    Google Scholar 

  • Jaffar, J. and Lassez, J.-L. (1987). Constraint logic programming. In Proceedings of the Fourteenth Annual ACM Symposium on Principles of Programming Languages.

    Google Scholar 

  • Kilby, P., Prosser, P., and Shaw, P. (2000). A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints. Constraints, 5(4):389–414.

    Article  MathSciNet  MATH  Google Scholar 

  • Lokketangen, A. L. and Woodruff, D. L. (2001). Integrating pivot based search with branch and bound for binary MIP’s. Control and Cybernetics, Special issue on Tabu Search, 29(3):741–760.

    MathSciNet  Google Scholar 

  • 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.

    Article  MATH  Google Scholar 

  • Le Pape, C, Perron, L., Régin, J.-C, and Shaw, P. (2002). Robust and parallel solving of a network design problem. In Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming (CP’2002).

    Google Scholar 

  • Milano, M., Ottosson, G., Refalo, P., and Thorsteinsson, E. S. (2002). The role of integer programming techniques in constraint programming’s global constraints. INFORMS Journal on Computing, Special Issue on The Merging of Mathematical Programming and Constraint Programming, 14(4), 2002..

    MathSciNet  Google Scholar 

  • Milano, M. and van Hoeve, W. J. (2002). Reduced cost-based ranking for generating promising subproblems. In Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming (CP’2002), pages 1–16.

    Google Scholar 

  • Nuijten, W. and Le Pape, C. (1998). Constraint-based job-shop scheduling with ILOG Scheduler. Journal of Heuristics, 3(4):271–286.

    Article  MATH  Google Scholar 

  • Nuijten, W. P. M. (1994). Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach. PhD thesis, Eindhoven University of Technology.

    MATH  Google Scholar 

  • Nuijten, W. P. M. and Aarts, E. H. L. (1994). Constraint satisfaction for multiple capacitated job-shop scheduling. In Proceedings of the Eleventh European Conference on Artificial Intelligence.

    Google Scholar 

  • Pesant, G. and Gendreau, M. (1996). A view of local search in constraint programming. In Proceedings of the Second International Conference on Principles and Practice of Constraint Programming.

    Google Scholar 

  • Pinson, E. (1988). Leproblème de job-shop. PhD thesis, University Paris VI.

    Google Scholar 

  • Raghavan, P. and Thompson, C. (1987). Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica,7(4):365–374.

    Google Scholar 

  • Refalo, P. (1999). Tight cooperation and its application in piecewise linear optimization. In Proceedings of the Fifth International Conference on Principles and Practice of Constraint Programming.

    Google Scholar 

  • Refalo, P. (2000). Linear formulation of constraint programming models and hybrid solvers. In Proceedings of the Sixth International Conference on Principles and Practice of Constraint Programming, pages 369–383, Singapore. Springer-Verlag.

    Google Scholar 

  • Régin, J.-C. (1994). A filtering algorithm for constraints of difference in CSPs. InProceedings of the Twelfth National Conference on Artificial Intelligence.

    Google Scholar 

  • Rodosek, R. and Wallace, M. (1998). A generic model and hybrid algorithm for hoist scheduling problems. In Proceedings of the Fourth International Conference on Principles and Practice of Constraint Programming.

    Google Scholar 

  • Rodosek, R., Wallace, M., and Hajian, M. T. (1999). A new approach to integrating mixed integer programming and constraint logic programming. Annals of Operations Research, 86:63–87.

    Article  MathSciNet  MATH  Google Scholar 

  • Rousseau, L.-M., Gendreau, M., and Pesant, G. (2002). Solving small VRPTWs with constraint programming based column generation. In Proceedings of the Fourth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR’02),pages 333–344.

    Google Scholar 

  • Sakkout, H. E. and Wallace, M. (2000). Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints, 5(4):359–388.

    Google Scholar 

  • Sellmann, M. and Fahle, T. (2003). Constraint programming based lagrangian relaxation for the automatic recording problem. Annals of Operations Research, 118:17–33.

    Article  MathSciNet  MATH  Google Scholar 

  • Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In Proceedings of the Fourth International Conference on Principles and Practice of Constraint Programming (CP’98), pages 417–31.

    Google Scholar 

  • Thorsteinsson, E. S. (2001). Branch-and-check: A hybrid framework integrating mixed integer programming and constraint logic programming. In Proceedings of the Seventh International Conference on Principles and Practice of Constraint Programming (CP’2001).

    Google Scholar 

  • Vasquez, M. (2002). Arc-consistency and tabu search for the frequency assignment problem with polarization. In Proceedings of the Fourth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR’02), pages 359–372.

    Google Scholar 

  • Vasquez, M. and Hao, J.-K. (2001). A hybrid approach for the 0–1 multidimensional knapsack problem. In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI’2001), pages 328–333.

    Google Scholar 

  • Walser, J. P. (1998). Domain-Independent Local Search for Linear Integer Optimization. PhD thesis, Technischen Fakultät der Universität des Saarlandes.

    Google Scholar 

  • Xu, J. and Kelly, J. P. (1996). A network flow-based tabu search heuristic for the vehicle routing problem. Transportation Science, 30(4):379–393.

    Article  MATH  Google Scholar 

  • Yunes, T., Moura, A., and de Souza, C. (2000). A hybrid approach for solving large scale crew scheduling problems. In Practical Aspects of Declarative Languages, pages 293–307.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ILOG S.A. and LIA, Université d’Avignon, CNRS-FRE 2487

    Emilie Danna

  2. ILOG S.A., 9 rue de Verdun, Gentilly Cedex, F-94253

    Claude Le Pape

Authors
  1. Emilie Danna
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Claude Le Pape
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Bologna, Bologna, Italy

    Michela Milano

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer Science+Business Media New York

About this chapter

Cite this chapter

Danna, E., Pape, C.L. (2004). Two Generic Schemes for Efficient and Robust Cooperative Algorithms. In: Milano, M. (eds) Constraint and Integer Programming. Operations Research/Computer Science Interfaces Series, vol 27. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-8917-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4419-8917-8_2

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-4719-4

  • Online ISBN: 978-1-4419-8917-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation