Tabu search for 0/1 mixed integer programming problems
Conference
·
OSTI ID:36233
We describe a tabu search approach for solving general zero-one mixed integer programming problems that exploits the extreme point property of zero-one solutions. Specialized choice rules and aspiration criteria are identified for the problems, expressed as functions of integer infeasibility measures and objective function values. Computational results are reported on a portfolio of multiconstraint knapsack problems. Our approach is designed with the ability to solve general zero-one mixed IP problems, yet it obtains solutions for the multiconstraint knapsack problem whose quality rivals, and in some cases surpasses, the best solutions obtained by special purpose methods that have been created to exploit the special structure of these problems.
- OSTI ID:
- 36233
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Tabu search applied to a capacitated location problem
Tabu search methods for multicommodity capcitated fixed charge network design problem
Sequential knapsack problem
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35878
Tabu search methods for multicommodity capcitated fixed charge network design problem
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35923
Sequential knapsack problem
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36114