Integrating pivot based search with branch and bound for binary MIPs

• Autorzy: Lokketangen A. , Woodruff D.
• Języki publikacji: EN

Abstrakty

EN

This paper examines integration of a sophisticated, pivot-based tabu search into branch and bound for 0-1 MIPS and global diversification tests using chunking. Issues related to behavior of a tabu search within a branch and bound algorithm are analyzed using computational experiments. Results are presented showing that the inclusion of the local search sometimes results in fewer and nodes and lower CPU times even when used in a callback mode. The main benefit in incorporating a pivot based heuristic is that an integer feasible solution can be found earlier in the branching process. Computational experiments are presented showing that for some instances the overall search time is improved, while for some others the tabu search can find good solutions quickly.

Słowa kluczowe

EN

branch and bound; chunking; heuristics; tabu search

• Wydawca: Systems Research Institute, Polish Academy of Sciences
• Czasopismo: Control and Cybernetics
• Rocznik: 2000
• Tom: Vol. 29, no 3
• Strony: 741--759
• Opis fizyczny: Bibliogr. 15 poz.,

Twórcy

autor

Lokketangen A.

autor

Woodruff D.