Tabu search within a pivot and complement framework

Abstract

The Pivot and Complement heuristic is a procedure that frequently finds feasible solutions for general 0-1 integer programs. We present a refinement of the heuristic based on Tabu Search techniques. Local search strategies for the search phase, as well as the improvement phase of the heuristic are presented. Value 60 55 50 45 40 0 10

Untitled

“…(i) 0-1SA gave a better average solution than the GENEsYs algorithm from Khuri, Bäch and Heitkötter (1994) for all but one (PET6) of the test problems; (ii) the "best solution" given by 0-1SA is better than (or equal to) the "best solution" provided by Drexl (1988) or Aboudi and Jörnsten (1994) or Lokketangen, Jörnsten, and Storoy (1994), respectively, for all, for all but one (PET6) and for all but one (PET7) of the test problems.…”

“…The SCP is called SCPCYC6 and is from Grossman and Wool (1997). Despite their small size, these MCKP were chosen because they have been tested by other metaheuristic approaches, namely those from Khuri, Bäch, and Heitkötter (1994), Aboudi and Jörnsten (1994), Lokketangen, Jörnsten, and Storoy (1994) and Drexl (1988). The SCP was chosen due to its difficulty.…”

“…Until now, few generic versions of metaheuristic methods have been reported. Examples of such approaches are the developments of Aboudi and Jörnsten (1994) and Lokketangen, Jörnsten, and Storoy (1994) for Tabu Search and the Simulated Annealing codes of Connolly (1992) and Abramson, Dang, and Krishnamoorthy (1996).…”

Process Optimisation via Firefly and Ant Colony Optimisation Elements on the Path of Steepest Ascent for a CSTR

“…Moreover, there are some with the socially-based inspiration, e.g. tabu search or TS [11] and the physically-based inspiration such as simulated annealing or SA [12].…”