Variable Intensity Local Search
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.
KeywordsLocal Search Tabu Search Variable Neighborhood Search Local Search Algorithm Generalize Assignment Problem
Unable to display preview. Download preview PDF.
This work is partially supported by an NSERC discovery grant awarded to Abraham P. Punnen.
- 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
- 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
- 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
- 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.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.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.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
- 17.R.A. Murphy. A private fleet model with multi-stop backhaul. Working paper 103, Optimal Decision Systems, Green Bay, WI54306, 1986.Google Scholar