Variable Neighborhood Search for Solving the Balanced Location Problem

Jozef Kratica*, Markus Leitner, Ivana Ljubić

*Corresponding author for this work

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

In this paper we propose a general variable neighborhood search approach for the balanced location problem. Next to large shaking neighborhoods, the embedded variable neighborhood descent utilizes three neighborhood structures that focus on different solution aspects. By a computational study, we show that this VNS outperforms existing methods with respect to average solution quality and stability.

Original languageEnglish
Pages (from-to)21-28
Number of pages8
JournalElectronic Notes in Discrete Mathematics
Volume39
DOIs
Publication statusPublished - 1 Dec 2012
Externally publishedYes

Keywords

  • Balanced allocation of clients
  • Discrete location
  • Variable neighborhood search

Fingerprint

Dive into the research topics of 'Variable Neighborhood Search for Solving the Balanced Location Problem'. Together they form a unique fingerprint.

Cite this