A variable neighborhood search approach for the capacitated m-Ring-Star problem

Carlos Franco, Eduyn López-Santana, Germán Mendez-Giraldo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we proposed an algorithm based on variable neighborhood search (VNS) for the capacitated m-Ring-Star problem. This problem has several real applications in communications networks, rapid transit system planning and optical fiber networks. The problem consists in design m rings or cycles that begins of a central depot and visits a set of customers and transition or steiner nodes. While the nodes don’t belong to a ring these must be allocated or assign to a customer or steiner node that belongs to a ring. The number of customers allocated or visited in each ring must not exceed the maximum capacity. The goal is to minimize the visiting and allocation cost. For solving the problem, we propose a VNS approach based on random perturbation for escaping from the local optimal solutions. Our method reached the optimal solution in a reasonable amount of time in a set of instances from the literature.

Original languageEnglish (US)
Title of host publicationIntelligent Computing Theories and Application - 12th International Conference, ICIC 2016, Proceedings
EditorsPrashan Premaratne, De-Shuang Huang, Vitoantonio Bevilacqua
PublisherSpringer
Pages3-11
Number of pages9
ISBN (Print)9783319422909
DOIs
StatePublished - 2016
Externally publishedYes
Event12th International Conference on Intelligent Computing Theories and Application, ICIC 2016 - Lanzhou, China
Duration: Aug 2 2016Aug 5 2016

Publication series

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

Conference

Conference12th International Conference on Intelligent Computing Theories and Application, ICIC 2016
Country/TerritoryChina
CityLanzhou
Period8/2/168/5/16

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'A variable neighborhood search approach for the capacitated m-Ring-Star problem'. Together they form a unique fingerprint.

Cite this