A parametric form of tabu-search is proposed for solving mixed integer programming (MIP) problems that creates and solves a series of linear programming (LP) problems embodying branching inequalities as weighted terms in the objective function. The approach extends and modifies a parametric branch and bound procedure of Glover [Parametic branch and bound. OMEGA, The International Journal of Management Science 1978;6:1-9], replacing its tree search memory by the adaptive memory framework of tabu-search and introducing new associated strategies that are more flexible than the mechanisms of branch and bound.We also introduce new types of intensification and diversification procedures based on scatter search and frequency analysis, and also based on a variant of adaptive memory called model embedded memory. In one form this approach incorporates recency and frequency memory within the objective function structure of the parameterized LP formulations. In another form it generates valid inequalities from the optimized objective of the parameterized LP problem, and uses these as a supplement to traditional types of tabu memory. The integrated parametric approach affords a spectrum of variations that include useful simplifications for pure 0-1 MIP problems and problems with special structures, such as GUB constraints. The approach exploits both spatial and logical relationships, and is appropriate for discovering feasible solutions, as in the case of satisfiability problems. It is particularly designed to provide adaptive strategies for problems that are difficult for branch and bound and for branch and cut procedures, as opposed to problems these latter methods can handle effectively, and hence can be used to complement or supplement these more traditional types of methods.
[1]
F. Glover.
Parametric branch and bound
,
1978
.
[2]
P. Sánchez,et al.
PRACTICAL INTRODUCTION TO SIMULATION OPTIMIZATION
,
2003
.
[3]
F. Glover,et al.
Fundamentals of Scatter Search and Path Relinking
,
2000
.
[4]
Christian Blum,et al.
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
,
2003,
CSUR.
[5]
Fred Glover,et al.
Tabu Search - Part II
,
1989,
INFORMS J. Comput..
[6]
Fred W. Glover,et al.
A Template for Scatter Search and Path Relinking
,
1997,
Artificial Evolution.
[7]
Teodor Gabriel Crainic,et al.
Parallel Strategies for Meta-Heuristics
,
2003,
Handbook of Metaheuristics.
[8]
F. Glover.
HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS
,
1977
.
[9]
Fred W. Glover,et al.
Simulation-based optimization: practical introduction to simulation optimization
,
2003,
WSC '03.
[10]
João Pedro Pedroso,et al.
Tabu Search for Mixed Integer Programming
,
2005
.
[11]
D. M. Deighton,et al.
Computers in Operations Research
,
1977,
Aust. Comput. J..
[12]
Michel Gendreau,et al.
An Introduction to Tabu Search
,
2003,
Handbook of Metaheuristics.
[13]
F. Glover.
Scatter search and star-paths: beyond the genetic metaphor
,
1995
.