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

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

Resultado de la investigación: Capítulo en Libro/Reporte/ConferenciaContribución a la conferencia

Resumen

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.

Idioma originalInglés estadounidense
Título de la publicación alojadaIntelligent Computing Theories and Application - 12th International Conference, ICIC 2016, Proceedings
EditoresPrashan Premaratne, De-Shuang Huang, Vitoantonio Bevilacqua
EditorialSpringer
Páginas3-11
Número de páginas9
ISBN (versión impresa)9783319422909
DOI
EstadoPublicada - 2016
Publicado de forma externa
Evento12th International Conference on Intelligent Computing Theories and Application, ICIC 2016 - Lanzhou, China
Duración: ago 2 2016ago 5 2016

Serie de la publicación

NombreLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumen9771
ISSN (versión impresa)0302-9743
ISSN (versión digital)1611-3349

Conferencia

Conferencia12th International Conference on Intelligent Computing Theories and Application, ICIC 2016
País/TerritorioChina
CiudadLanzhou
Período8/2/168/5/16

All Science Journal Classification (ASJC) codes

  • Ciencia computacional teórica
  • Informática (todo)

Huella

Profundice en los temas de investigación de 'A variable neighborhood search approach for the capacitated m-Ring-Star problem'. En conjunto forman una huella única.

Citar esto