Variable Neighborhood Search for Solving the Balanced Location Problem

Jozef Kratica; Markus Leitner; Ivana Ljubić

doi:10.1016/j.endm.2012.10.004

Variable Neighborhood Search for Solving the Balanced Location Problem

Jozef Kratica^*, Markus Leitner, Ivana Ljubić

^*Corresponding author for this work

Research output: Contribution to Journal › Article › Academic › peer-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 language	English
Pages (from-to)	21-28
Number of pages	8
Journal	Electronic Notes in Discrete Mathematics
Volume	39
DOIs	https://doi.org/10.1016/j.endm.2012.10.004
Publication status	Published - 1 Dec 2012
Externally published	Yes

Funding

1 Email: [email protected] This research was partially supported by Serbian Ministry of Science under grant 174010 2 Email: [email protected] 3 Email: [email protected]

Keywords

Balanced allocation of clients
Discrete location
Variable neighborhood search

Access to Document

10.1016/j.endm.2012.10.004

Persistent URL (handle)

Persistent link

Cite this

@article{b5e773de842945f1bc4fde34bf7bbb86,

title = "Variable Neighborhood Search for Solving the Balanced Location Problem",

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.",

keywords = "Balanced allocation of clients, Discrete location, Variable neighborhood search",

author = "Jozef Kratica and Markus Leitner and Ivana Ljubi{\'c}",

year = "2012",

month = dec,

day = "1",

doi = "10.1016/j.endm.2012.10.004",

language = "English",

volume = "39",

pages = "21--28",

journal = "Electronic Notes in Discrete Mathematics",

publisher = "Elsevier",

}

TY - JOUR

T1 - Variable Neighborhood Search for Solving the Balanced Location Problem

AU - Kratica, Jozef

AU - Leitner, Markus

AU - Ljubić, Ivana

PY - 2012/12/1

Y1 - 2012/12/1

N2 - 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.

AB - 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.

KW - Balanced allocation of clients

KW - Discrete location

KW - Variable neighborhood search

UR - https://www.scopus.com/pages/publications/84870276063

UR - https://www.scopus.com/inward/citedby.url?scp=84870276063&partnerID=8YFLogxK

U2 - 10.1016/j.endm.2012.10.004

DO - 10.1016/j.endm.2012.10.004

M3 - Article

AN - SCOPUS:84870276063

VL - 39

SP - 21

EP - 28

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

ER -

Variable Neighborhood Search for Solving the Balanced Location Problem

Abstract

Funding

Keywords

Access to Document

Persistent URL (handle)

Other files and links

Fingerprint

Cite this