A Tabu Search Algorithm for application placement in computer clustering

Jelmer van der Gaast, Cornelieus A. Rietveld, Adriana Gabor, Yingqian Zhang

Research output: Contribution to journalArticleAcademicpeer-review

7 Citations (Scopus)

Abstract

This paper presents and analyzes a model for the problem of placing applications on computer clusters (APP). In this problem, organizations requesting a set of software applications have to be assigned to computer clusters such that the costs of opening clusters and installing the necessary applications are minimized. This problem is related to known OR problems such as the multiproduct facility location problem and the generalized bin packing problem. We show that APP is NP-hard, and then propose a simple Tabu Search heuristic to solve it. The performance of the Tabu Search heuristic is assessed via extensive computational experiments, which indicate the promise of the proposed Tabu Search.
Original languageEnglish
Pages (from-to)38-46
JournalComputers & Operations Research
Volume50
DOIs
Publication statusPublished - 2014

Fingerprint

Tabu Search Algorithm
Tabu search
Placement
Tabu Search
Clustering
Bins
Heuristics
Application programs
Bin Packing Problem
Facility Location Problem
Computational Experiments
NP-complete problem
Software
Necessary
Costs
Experiments

Cite this

van der Gaast, Jelmer ; Rietveld, Cornelieus A. ; Gabor, Adriana ; Zhang, Yingqian. / A Tabu Search Algorithm for application placement in computer clustering. In: Computers & Operations Research. 2014 ; Vol. 50. pp. 38-46.
@article{3ffd2b01aff84a089f6f4a366e44bd27,
title = "A Tabu Search Algorithm for application placement in computer clustering",
abstract = "This paper presents and analyzes a model for the problem of placing applications on computer clusters (APP). In this problem, organizations requesting a set of software applications have to be assigned to computer clusters such that the costs of opening clusters and installing the necessary applications are minimized. This problem is related to known OR problems such as the multiproduct facility location problem and the generalized bin packing problem. We show that APP is NP-hard, and then propose a simple Tabu Search heuristic to solve it. The performance of the Tabu Search heuristic is assessed via extensive computational experiments, which indicate the promise of the proposed Tabu Search.",
author = "{van der Gaast}, Jelmer and Rietveld, {Cornelieus A.} and Adriana Gabor and Yingqian Zhang",
year = "2014",
doi = "10.1016/j.cor.2014.03.025",
language = "English",
volume = "50",
pages = "38--46",
journal = "Computers & Operations Research",
issn = "0305-0548",
publisher = "Elsevier",

}

A Tabu Search Algorithm for application placement in computer clustering. / van der Gaast, Jelmer; Rietveld, Cornelieus A.; Gabor, Adriana; Zhang, Yingqian.

In: Computers & Operations Research, Vol. 50, 2014, p. 38-46.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - A Tabu Search Algorithm for application placement in computer clustering

AU - van der Gaast, Jelmer

AU - Rietveld, Cornelieus A.

AU - Gabor, Adriana

AU - Zhang, Yingqian

PY - 2014

Y1 - 2014

N2 - This paper presents and analyzes a model for the problem of placing applications on computer clusters (APP). In this problem, organizations requesting a set of software applications have to be assigned to computer clusters such that the costs of opening clusters and installing the necessary applications are minimized. This problem is related to known OR problems such as the multiproduct facility location problem and the generalized bin packing problem. We show that APP is NP-hard, and then propose a simple Tabu Search heuristic to solve it. The performance of the Tabu Search heuristic is assessed via extensive computational experiments, which indicate the promise of the proposed Tabu Search.

AB - This paper presents and analyzes a model for the problem of placing applications on computer clusters (APP). In this problem, organizations requesting a set of software applications have to be assigned to computer clusters such that the costs of opening clusters and installing the necessary applications are minimized. This problem is related to known OR problems such as the multiproduct facility location problem and the generalized bin packing problem. We show that APP is NP-hard, and then propose a simple Tabu Search heuristic to solve it. The performance of the Tabu Search heuristic is assessed via extensive computational experiments, which indicate the promise of the proposed Tabu Search.

U2 - 10.1016/j.cor.2014.03.025

DO - 10.1016/j.cor.2014.03.025

M3 - Article

VL - 50

SP - 38

EP - 46

JO - Computers & Operations Research

JF - Computers & Operations Research

SN - 0305-0548

ER -