Variable neighborhood and greedy randomized adaptive search for capacitated connected facility location

Markus Leitner*, Günther R. Raidl

*Corresponding author for this work

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

The Connected Facility Location problem combining facility location and Steiner trees has recently gained stronger scientific interest as it can be used to model the extension of last mile communication networks in so-called fiber-to-the-curb scenarios. We consider a generalization of this problem which considers capacity constraints on potential facilities and aims at maximizing the resulting profit by potentially supplying only a subset of all customers. In this work, we discuss two metaheuristic approaches for this problem based on variable neighborhood search and greedy randomized adaptive search. Computational results show that both approaches allow for computing high quality solutions in relatively short time.

Original languageEnglish
Title of host publicationComputer Aided Systems Theory, EUROCAST 2011 - 13th International Conference, Revised Selected Papers
Pages295-302
Number of pages8
EditionPART 1
DOIs
Publication statusPublished - 20 Feb 2012
Externally publishedYes
Event13th International Conference on Computer Aided Systems Theory, EUROCAST 2011 - Las Palmas de Gran Canaria, Spain
Duration: 6 Feb 201111 Feb 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume6927 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th International Conference on Computer Aided Systems Theory, EUROCAST 2011
CountrySpain
CityLas Palmas de Gran Canaria
Period6/02/1111/02/11

Keywords

  • connected facility location
  • greedy randomized adaptive search procedure
  • network design
  • variable neighborhood search

Fingerprint

Dive into the research topics of 'Variable neighborhood and greedy randomized adaptive search for capacitated connected facility location'. Together they form a unique fingerprint.

Cite this