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.

[1]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[2]  G. Dueck,et al.  Record Breaking Optimization Results Using the Ruin and Recreate Principle , 2000 .

[3]  Temel Öncan,et al.  VLSN search algorithms for partitioning problems using matching neighbourhoods , 2008, J. Oper. Res. Soc..

[4]  Fred W. Glover,et al.  An Ejection Chain Approach for the Generalized Assignment Problem , 2004, INFORMS J. Comput..

[5]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[6]  Snežana Mitrović-Minić,et al.  Very large-scale variable neighborhood search for the generalized assignment problem , 2008 .

[7]  Hasan Pirkul,et al.  An integer programming model for the allocation of databases in a distributed computer system , 1986 .

[8]  Fred W. Glover,et al.  A path relinking approach with ejection chains for the generalized assignment problem , 2006, Eur. J. Oper. Res..

[9]  Russell Bent,et al.  A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows , 2006, Comput. Oper. Res..

[10]  Claude Le Pape,et al.  Exploring relaxation induced neighborhoods to improve MIP solutions , 2005, Math. Program..

[11]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[12]  Hasan Pirkul,et al.  Computer and Database Location in Distributed Computer Systems , 1986, IEEE Transactions on Computers.

[13]  Hasan Pirkul,et al.  Algorithms for the multi-resource generalized assignment problem , 1991 .

[14]  L. V. Wassenhove,et al.  A survey of algorithms for the generalized assignment problem , 1992 .

[15]  Fred W. Glover,et al.  A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem , 2004, Discret. Optim..

[16]  Fred Glover.  New Ejection Chain and Alternating Path Methods for Traveling Salesman Problems , 1992, Computer Science and Operations Research.

[17]  Martin Davies,et al.  Computer Science and Operations Research: New Developments in Their Interfaces , 1992 .

[18]  Ibrahim H. Osman,et al.  Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches , 1995 .

[19]  Abraham P. Punnen,et al.  Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem , 2009, Discret. Optim..

[20]  H. R. Lourenço,et al.  Adaptive Approach Heuristics for The Generalized Assignment Problem , 1998 .

[21]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..

[22]  Abraham P. Punnen,et al.  A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..