Tabu Search within a Pivot and Complement Framework | Zendy

Løkketangen Arne | Zendy; Jörnsten Kurt | Zendy; Storøy Sverre | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Tabu Search within a Pivot and Complement Framework

Author(s) -

Løkketangen Arne,

Jörnsten Kurt,

Storøy Sverre

Publication year - 1994

Publication title -

international transactions in operational research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.032

H-Index - 52

eISSN - 1475-3995

pISSN - 0969-6016

DOI - 10.1111/1475-3995.d01-42

Subject(s) - tabu search , complement (music) , guided local search , mathematical optimization , heuristic , computer science , incremental heuristic search , local search (optimization) , integer programming , integer (computer science) , hill climbing , beam search , mathematics , search algorithm , biochemistry , chemistry , complementation , programming language , gene , phenotype

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.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research