A Tabu Search Algorithm for application placement in computer clustering

Jelmer P. Van Der Gaast, Cornelius A. Rietveld, Adriana F. Gabor, Yingqian Zhang

Research output: Contribution to journalArticlepeer-review

10 Scopus citations


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 languageBritish English
Pages (from-to)38-46
Number of pages9
JournalComputers and Operations Research
StatePublished - Oct 2014


  • Facility location
  • Generalized binpacking
  • Integer programming
  • Placement problem
  • Tabu search


Dive into the research topics of 'A Tabu Search Algorithm for application placement in computer clustering'. Together they form a unique fingerprint.

Cite this