Advertisement

Matheuristics pp 245-252 | Cite as

Variable Intensity Local Search

  • Snežana Mitrović-Minić
  • Abraham P. Punnen
Chapter
Part of the Annals of Information Systems book series (AOIS, volume 10)

Abstract

This chapter considers a local search based heuristic framework for solving the mixed-integer programming problem (MIP) where a general purpose MIP solver is employed to search the associated neighborhoods. The associated neighborhood search problems are MIPs of smaller sizes. The neighborhoods are explored in varying the intensity by changing time and size parameters. This local search can be viewed as a combination of very large scale neighborhood (VLSN) search and variable neighborhood search (VNS). The approach has been implemented to solve two integer programming problems: the generalized assignment problem, and the multi-resource generalized assignment problem. Encouraging computational results have been achieved.

Keywords

Local Search Tabu Search Variable Neighborhood Search Local Search Algorithm Generalize Assignment Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

Acknowledgements

This work is partially supported by an NSERC discovery grant awarded to Abraham P. Punnen.

References

  1. 1.
    R.K. Ahuja, O. Ergun, and A. Punnen. A survey of very large scale neighborhood search techniques. Discrete Applied Mathematics, 23:75–102, 2002.CrossRefGoogle Scholar
  2. 2.
    R.K. Ahuja, O. Ergun, and A. Punnen. Very large scale neighborhood search: Theory, algorithms, and applications. In T. Gonzalez, editor, Handbook of Approximation Algorithms and Metaheuristics, volume 10 of Computer and Information Science Series. Chapmann and Hall, CRC Press, 2007.Google Scholar
  3. 3.
    R. Bent and P. V. Hentenryck. A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Computers & Operations Research, 33:875–893, 2006.CrossRefGoogle Scholar
  4. 4.
    D. Cattrysse and L.N. Van Wassenhove. A survey of algorithms for the generalized assignment problem. European Journal of Operational Research, 60:260–272, 1992.CrossRefGoogle Scholar
  5. 5.
    E. Danna, E. Rothberg, and C. Le Pape. Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming, 102:71–90, 2005.CrossRefGoogle Scholar
  6. 6.
    M. Fischetti and A. Lodi. Local branching. Mathematical Programming, 98:23–47, 2003.CrossRefGoogle Scholar
  7. 7.
    B. Gavish and H. Pirkul. Allocation of databases and processors in a distributed computing system. In J. Akoka, editor, Management of Distributed Data Processing. North-Holland Publishing Company, Amsterdam, 1982.Google Scholar
  8. 8.
    B. Gavish and H. Pirkul. Computer and database location in distributed computer systems. IEEE Transactions in Computing, 35:583–590, 1986.CrossRefGoogle Scholar
  9. 9.
    B. Gavish and H. Pirkul. Algorithms for the multi-resource generalized assignment problem. Management Science, 37:695–713, 1991.CrossRefGoogle Scholar
  10. 10.
    F. Glover. New ejection chain and alternating path methods for traveling salesman problem. In O. Balci, R. Sharda, and S. Zenios, editors, Computer Science and Operations Research: New Development in Their Interfaces, pages 491–507. Pergamon, Oxford, 1992.Google Scholar
  11. 11.
    S. Lin and B.W. Kernighan. An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21:498–516, 1973.CrossRefGoogle Scholar
  12. 12.
    H.R. Lourenço and D. Serra. Adaptive approach heuristic for the generalized assignment problem. Technical report, Department of Economics and Management, Universitat Pompeu Fabra, R. Trias Fargas 25-27, 08005 Barcelona, Spain, 1998.Google Scholar
  13. 13.
    S. Martello and P. Toth. An algorithm for the generalized assignment problem. In J.P. Brans, editor, Operational Research’81, pages 589–603. North-Holland, 1981.Google Scholar
  14. 14.
    S. Mitrovic-Minic and A.P. Punnen. Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem. Submitted for publication.Google Scholar
  15. 15.
    S. Mitrovic-Minic and A.P. Punnen. Very large-scale variable neighborhood search for the generalized assignment problem. Journal of Interdisciplinary Mathematics, 11(5):653–670, 2008.Google Scholar
  16. 16.
    N. Mladenović and P. Hansen. Variable neighborhood search. Computers & Operations Research, 24:1097–1100, 1997.CrossRefGoogle Scholar
  17. 17.
    R.A. Murphy. A private fleet model with multi-stop backhaul. Working paper 103, Optimal Decision Systems, Green Bay, WI54306, 1986.Google Scholar
  18. 18.
    T. Oncan, S.N. Kabadi, K.P.N. Nair, and A.P. Punnen. VLSN search algorithms for partitioning problems using matching neighbourhoods. The Journal of the Operational Research Society, 59:388–398, 2008.CrossRefGoogle Scholar
  19. 19.
    I.H. Osman. Heuristics for the generalized assignment problem: simulated annealing and tabu search approaches. OR Spektrum, 17:211–225, 1995.CrossRefGoogle Scholar
  20. 20.
    H. Pirkul. An integer programming model for allocation of databases in a distributed computer system. European Journal of Operational Research, 26:401–411, 1986.CrossRefGoogle Scholar
  21. 21.
    D. Pisinger and S. Ropke. A general heuristic for vehicle routing problems. Computers & Operations Research, 34:2403–2435, 2007.CrossRefGoogle Scholar
  22. 22.
    S. Ropke and D. Pisinger. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40(4):455–472, 2006.CrossRefGoogle Scholar
  23. 23.
    G. Schrimpf, J. Schneider, H. Stamm-Wilbrandt, and G. Dueck. Record breaking optimization results using the ruin and recreate principle. Journal of Computational Physics, 159(2):139–171, 2000.CrossRefGoogle Scholar
  24. 24.
    M. Yagiura, T. Ibaraki, and F. Glover. An ejection chain approach for the generalized assignment problem. INFORMS Journal on Computing, 16:133–151, 2004.CrossRefGoogle Scholar
  25. 25.
    M. Yagiura, T. Ibaraki, and F. Glover. A path relinking approach with ejection chains for the generalized assignment problem. European Journal of Operational Research, 169:548–569, 2006.CrossRefGoogle Scholar
  26. 26.
    M. Yagiura, S. Iwasaki, T. Ibaraki, and F. Glover. A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem. Discrete Optimization, 1(1):87–98, 2004.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.Department of MathematicsSimon Fraser UniversitySurreyCanada

Personalised recommendations