Skip to main content
SpringerLink
Log in

Combinations of Local Search and Exact Algorithms

  • Conference paper
  • First Online:
Applications of Evolutionary Computing (EvoWorkshops 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2611))

Included in the following conference series:

Abstract

In this paper we describe the advantadges and disadvantages of local search and exact methods of solving NP-hard problems and see why combining the two approaches is highly desirable.We review some of the papers existent in the literature that create new algorithms from such combinations. In this paper we focus on local search approaches that are strengthened by the use of exact algorithms.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

  1. E. H. L. Aarts and J. K. Lenstra, editors. Local Search in Combinatorial Optimization. John Wiley & Sons, Chichester, 1997.

    MATH  Google Scholar 

  2. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Inc. Englewood Cliffs, NJ, 1993.

    Google Scholar 

  3. D. Applegate, R. Bixby, V. Chvátal, and W. Cook. On the solution of traveling salesman problem. Documenta Mathematica, Extra Volume ICM III:645–656, 1998.

    Google Scholar 

  4. D. Applegate, R. Bixby, V. Chvátal, and W. Cook. Finding Tours in the TSP. Technical Report 99885, Forschungsinstitut für Diskrete Mathematik, University of Bonn, Germany, 1999.

    Google Scholar 

  5. E.K. Burke, P. Cowling, and R. Keuthen. Embedded local search and variable neighbourhood search heuristics applied to the travelling salesman problem. Technical report, University of Nottingham, 2000.

    Google Scholar 

  6. E.K. Burke, P.I. Cowling, and R. Keuthen. Effective local and guided variable neighbourhood search methods for the asymmetric travelling salesman problem. EvoWorkshop 2001, LNCS, 2037:203–212, 2001.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  8. R. K. Congram. Polynomially Searchable Exponential Neighbourhoods for Sequencing Problems in Combinatorial Optimisation. PhD thesis, University of Southampton, Faculty of Mathematical Studies, UK, 2000.

    Google Scholar 

  9. R. K. Congram, C. N. Potts, and S. van de Velde. An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing, 14(1):52–67, 2002.

    Article  MathSciNet  Google Scholar 

  10. M. Dorigo and G. Di Caro. The Ant Colony Optimization meta-heuristic. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 11–32. McGraw Hill, London, UK, 1999.

    Google Scholar 

  11. M. Dorigo and T. Stützle. The ant colony optimization metaheuristic:Algorithms, applications and advances. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics. Kluwer Academic Publishers, To appear in 2002.

    Google Scholar 

  12. I. Dumitrescu. Constrained Shortest Path and Cycle Problems. PhD thesis, The University of Melbourne, 2002. http://www.intellektik.informatik.tu-darmstadt.de/~irina.

  13. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.

    Google Scholar 

  14. P. C. Gilmore. Optimal and suboptimal algorithms for the quadratic assignment problem. Journal of the SIAM, 10:305–313, 1962.

    MATH  MathSciNet  Google Scholar 

  15. F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, Boston, MA, 1997.

    MATH  Google Scholar 

  16. P. Hansen and N. Mladenovic. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, chapterAn Introduction to Variable Neighborhood Search, pages 433–458. Kluwer Academic Publishers, Boston, MA, 1999.

    Google Scholar 

  17. K. Helsgaun. An effective implementation of the lin-kernighan traveling salesman heuristic. European Journal of Operational Research, 126:106–130, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  18. D. S. Johnson, G. Gutin, L. A. McGeoch, A. Yeo, W. Zhang, and A. Zverovitch. Experimental analysis of heuristics for the ATSP. In G. Gutin and A. Punnen, editors, The Traveling Salesman Problem and its Variations, pages 445–487. Kluwer Academic Publishers, 2002.

    Google Scholar 

  19. E. L Lawler. The quadratic assignment problem. Management Science, 9:586–599, 1963.

    MATH  MathSciNet  Google Scholar 

  20. H. R. LourenÇo, O. Martin, and T. Stützle. Iterated local search. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, volume 57 of International Series in Operations Research & Management Science, pages 321–353. Kluwer Academic Publishers, Norwell, MA, 2002.

    Google Scholar 

  21. H.R. LourenÇo.A Computational Study of the Job-Shop and the Flow-Shop Scheduling Problems. PhD thesis, School of Or & IE, Cornell University, Ithaca, NY, 1993.

    Google Scholar 

  22. H.R. LourenÇo. Job-shop scheduling: Computational study of local search and large-step optimization methods. European Journal of Operational Research, 83:347–367, 1995.

    Article  MATH  Google Scholar 

  23. V. Maniezzo. Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS Journal on Computing, 11(4):358–369, 1999.

    MATH  MathSciNet  Google Scholar 

  24. O. Martin, S.W. Otto, and E.W. Felten. Combining simulated annealing with local search heuristics. Annals of Operations Research, 63:57–75, 1996.

    Article  MATH  Google Scholar 

  25. G. Nemhauser and L. Wolsey. Integer and Combinatorial Optimization. JohnWiley & Sons, 1988.

    Google Scholar 

  26. N. Robertson and P.D. Seymour. Graph minors. X. Obstructions to tree-decomposition. Journal of Combinatorial Theory, 52:153–190, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  27. K.E. Rosing and C.S. ReVelle. Heuristic concentration: Two stage solution construction. European Journal of Operational Research, pages 955–961, 1997.

    Google Scholar 

  28. K.E. Rosing and C.S. ReVelle. Heuristic concentration and tabu search: A head to head comparison. European Journal of Operational Research, 117(3):522–532, 1998.

    Article  Google Scholar 

  29. K.E. Rossing. Heuristic concentration: a study of stage one. ENVIRON PLANN B 27(1):137–150, 2000.

    Article  Google Scholar 

  30. B. Roy and B. Sussmann. Les problemes d’ordonnancement avec constraintes disjonctives. Notes DS no. 9 bis, SEMA.

    Google Scholar 

  31. P.M. Thompson and J.B. Orlin. The theory of cycle transfers. Working Paper No. OR 200-89, 1989.

    Google Scholar 

  32. P.M. Thompson and H.N. Psaraftis. Cyclic transfer algorithm for multivehicle routing and scheduling problems. Operations Research, 41:935–946, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  33. M. Vasquez and J-K. Hao. A hybrid approach for the 0-1 multidimensional knapsack problem. In Proceedings of the IJCAI-01, pages 328–333, 2001.

    Google Scholar 

  34. C. Voudouris. Guided Local Search for Combinatorial Optimization Problems. PhD thesis, Department of Computer Science, University of Essex, Colchester, UK, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CS Department, Intellectics Group, Darmstadt University of Technology, Alexanderstr. 10, 64283, Darmstadt, Germany

    Irina Dumitrescu & Thomas Stützle

Authors
  1. Irina Dumitrescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Stützle
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Engineering, University of Parma, Parco Area delle Scienze 181/a, 43100, Parma, Italy

    Stefano Cagnoni

  2. Computing Laboratory, University of Kent, Canterbury, Kent, CT2 7NF, UK

    Colin G. Johnson

  3. Dept. of Information and Communications Technologies Faculty of Computer Science, University of A Coruña, A Coruña, CP 15071, Spain

    Juan J. Romero Cardalda

  4. Dept. of Mathematics and Computer Science, Free University of Amsterdam, de Boelelaan 1081a, 1081 HV, Amsterdam, The Netherlands

    Elena Marchiori

  5. Schol of Systems Engineering, University of Reading, PO Box 225, Whiteknights, Reading, RG6 6AY, UK

    David W. Corne

  6. AnimatLab, 8 rue du capitaine Scott, 75015, Paris, France

    Jean-Arcady Meyer  & Agnès Guillot  & 

  7. SAP AG, Neurottstrasse 16, 69190, Walldorf, Germany

    Jens Gottlieb

  8. Parallel Computing and Complex Systems Group, University of Leipzig, Augustusplatz 10/11, 04109, Leipzig, Germany

    Martin Middendorf

  9. Algorithms and Data Structures Group Institute of Computer Graphics, Vienna University of Technology, Favoritenstrasse 9-11/186, 1040, Vienna, Austria

    Günther R. Raidl

  10. School of Computing, Napier University, 219 Colinton Road, Edinburgh, EH14 1DJ, UK

    Emma Hart

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dumitrescu, I., Stützle, T. (2003). Combinations of Local Search and Exact Algorithms. In: Cagnoni, S., et al. Applications of Evolutionary Computing. EvoWorkshops 2003. Lecture Notes in Computer Science, vol 2611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36605-9_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-36605-9_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00976-4

  • Online ISBN: 978-3-540-36605-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation