Skip to main content
SpringerLink
Log in

Local Search and Constraint Programming

LS and CP illustrated on a transportation problem

  • Chapter
Constraint and Integer Programming

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

Abstract

Real-world combinatorial optimization problems have two main characteristics which make them difficult: they are usually large, and they are not pure, i.e., they involve a heterogeneous set of side constraints. Hence, in most cases, exact approaches cannot be applied to solve real-world problems, whereas incomplete algorithms, and among them Local Search and Metaheuristic methods, have proved to obtain very good results in practice. Moreover, real-world applications typically lead to frequent update/addition of constraints, thus the algorithmic ap-proach requires flexibility, and this flexibility can be guaranteed by Constraint Programming.

In this chapter we review hybrid algorithms combining Local Search and Con-straint Programming using a didactic transportation problem to illustrate the tech-niques.

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

  • Aarts, E. and Lenstra, J. K. (1997). Local Search in Combinatorial Optimization. J. Wiley & Sons, Chichester.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  • Caprara, A., Fischetti, M., Toth, P., Vigo, D., and Guida, P.-L. (1997). Algo-rithms for railway crew management. Mathematical Programming, 79:125–141.

    Google Scholar 

  • Caseau, Y. and Laburthe, F. (1996). Improving branch and bound for job-shop scheduling with constraint propagation. In Deza, M., Euler, R., and Manoussakis, Y., editors, Proceedings of Combinatorics and Computer Science - CCS’95, LNCS 1120. Springer-Verlag.

    Google Scholar 

  • Caseau, Y. and Laburthe, F. (1999). Heuristics for large constrained routing problems. Journal of Heuristics, 5:281–303.

    Article  MATH  Google Scholar 

  • Caseau, Y., Laburthe, F., and Silverstein, G. (1999). A metaheuristic factory for vehicle routing problems. In Jaffar, J., editor, Principle and Practice of Constraint Programming - CP’99, LNCS 1713, pages 144–158. Springer- Verlag.

    Google Scholar 

  • Cesta, A., Oddi, A., and Smith, S. (2002). A constraint-based method for project scheduling with time windows. Journal of Heuristics, 8:109–136.

    Article  MATH  Google Scholar 

  • De Backer, B., Furnon, V., Shaw, P., Kilby, P., and Prosser, P. (2000). Solving vehicle routing problems using constraint programming and metaheuristics. Journal of Heuristics, 6:481–500.

    Article  Google Scholar 

  • Feo, T. and Resende, M. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6:109–133.

    Article  MathSciNet  MATH  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 Systems - AIPS’00. AAAI Press.

    Google Scholar 

  • Focacci, F., Laburthe, F., and Lodi, A. (2002). Local search and constraint programming. In Kochenberger, G. and Glover, F., editors, Handbook of MetaHeuristics, pages 369–403. Kluwer Academic Publishers.

    Google Scholar 

  • Focacci, F., Lodi, A., and Milano, M. (1999a). Cost-based domain filtering. In Jaffar, J., editor, Principle and Practice of Constraint Programming - CP’99, LNCS 1713, pages 189–203. Springer-Verlag.

    Google Scholar 

  • Focacci, F., Lodi, A., and Milano, M. (1999b). Solving TSP with time windows with constraints. In De Schreye, D., editor, Proceedings of the 1999 International Conference on Logic Programming - ICLP’99, pages 515–529. The MIT-press.

    Google Scholar 

  • Glover, F. (1995). Tabu thresholding: Improved search by nonmonotonic trajectories. ORSA Journal on Computing, 7:426–442.

    Article  MATH  Google Scholar 

  • Golden, B. and Assad, A. (1988). Vehicle Routing: Methods and Studies. North- Holland, Amsterdam.

    Google Scholar 

  • Haralick, R. M. and Elliott, G. L. (1980). Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263–313.

    Article  Google Scholar 

  • Harvey, W. (1995). Nonsystematic Backtracking Search. PhD thesis, Stanford University.

    Google Scholar 

  • Harvey, W. and Ginsberg, M. (1995). Limited discrepancy search. In Proceedings of the Nth IJCAI, pages 607–615. Morgan Kaufmann.

    Google Scholar 

  • Kilby, P., Prosser, P., and Shaw, P. (1997). Guided local search for the vehicle routing problem. In Voss, S., Martello, S., Osman, I. H., and Roucairol, C, editors, Advances and Trends in Local Search Paradigms for Optimization, pages 473–486. Kluwer Academic Publishers.

    Google Scholar 

  • Lin, S. and Kernighan, B. W. (1973). An effective heuristic for the traveling salesman problem. Operations Research, 21:498–516.

    Article  MathSciNet  MATH  Google Scholar 

  • Mackworth, A. (1977). Consistency in networks of relations. Artificial Intelligence, 8:99–118.

    Article  MATH  Google Scholar 

  • Mladenović, N. and Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24:1097–1100.

    Article  MathSciNet  MATH  Google Scholar 

  • Nuijten, W. (1994). Time and Resource Constrainted Scheduling, a Constraint Satisfaction Approach. PhD thesis, University of Eindhoven, The Netherlands.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  • Pesant, G. and Gendreau, M. (1996). A view of local search in constraint programming. In Freuder, E. C, editor, Principle and Practice of Constraint Programming - CP’96, LNCS 1118, pages 353–366. Springer-Verlag.

    Google Scholar 

  • Pesant, G. and Gendreau, M. (1999). A constraint programming framework for local search methods. Journal of Heuristics, 5:255–279.

    Article  MATH  Google Scholar 

  • 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:12–29.

    Article  MATH  Google Scholar 

  • Pesant, G., Gendreau, M., and Rousseau, J.-M. (1997). GENIUS-CP: A generic single-vehicle routing algorithm. In Smolka, G., editor, Principle and Practice of Constraint Programming - CP’97, LNCS 1330, pages 420–433. Springer- Verlag.

    Google Scholar 

  • Régin, J.-C. (1994). A filtering algorithm for constraints of difference in CSPs. In Proceedings of the Twelfth National Conference on Artificial Intelligence -AAAI’94, pages 362–367.

    Google Scholar 

  • Reinelt, G. (1994). The traveling salesman: computational solutions for TSP applications. Springer-Verlag, Berlin Heidelberg.

    Google Scholar 

  • Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In Maher, M. and Puget, J.-F., editors, Principle and Practice of Constraint Programming - CP’98, LNCS 1520, pages 417–431. Springer-Verlag, Berlin Heidelberg.

    Chapter  Google Scholar 

  • Toth, P. and Vigo, D. (2002). The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications. SIAM.

    Google Scholar 

  • Voudouris, C. and Tsang, E. (1999). Guided local search and its application to the travelling salesman problem. European Journal of Operational Research, 113:469–499.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ILOG S.A., 9, rue de Verdun, BP 85, 94253, Gentilly, France

    Filippo Focacci

  2. BOUYGUES S.A., 1, avenue E. Freyssinet, 78061, St-Quentin-en-Yvelines Cedex, France

    Francois Laburthe

  3. D.E.I.S., University of Bologna, Viale Risorgimento 2, 40136, Bologna, Italy

    Andrea Lodi

Authors
  1. Filippo Focacci
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francois Laburthe
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrea Lodi
    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

Focacci, F., Laburthe, F., Lodi, A. (2004). Local Search and Constraint Programming. 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_9

Download citation

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

  • 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