Ítem
Solo Metadatos

A Variable Neighborhood Search Approach for the Capacitated m-Ring-Star Problem

Mostrar el registro sencillo de la publicación
dc.creatorFranco Franco, Carlos Albertospa
dc.creatorLópez-Santana, Eduynspa
dc.creatorMendez-Giraldo, Germánspa
dc.date.accessioned2020-08-19T14:32:33Z
dc.date.available2020-08-19T14:32:33Z
dc.date.created2016-07-12spa
dc.description.abstractIn 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.eng
dc.format.mimetypeapplication/pdf
dc.identifier.doihttps://doi.org/10.1007/978-3-319-42291-6_1
dc.identifier.issnISBN: 978-3-319-42290-9
dc.identifier.issnEISBN: 978-3-319-42291-6
dc.identifier.urihttps://repository.urosario.edu.co/handle/10336/26615
dc.language.isoengspa
dc.publisherSpringer Naturespa
dc.relation.citationEndPage11
dc.relation.citationStartPage3
dc.relation.citationTitleIntelligent Computing Theories and Application. ICIC 2016. Lecture Notes in Computer Science
dc.relation.citationVolumeVol. 9771
dc.relation.ispartofIntelligent Computing Theories and Application. ICIC 2016. Lecture Notes in Computer Science, ISBN: 978-3-319-42290-9; EISBN: 978-3-319-42291-6, Vol.9771 (August, 2016); pp. 3-11spa
dc.relation.urihttps://link.springer.com/chapter/10.1007/978-3-319-42291-6_1spa
dc.rights.accesRightsinfo:eu-repo/semantics/restrictedAccess
dc.rights.accesoRestringido (Acceso a grupos específicos)spa
dc.sourceIntelligent Computing Theories and Application. ICIC 2016. Lecture Notes in Computer Sciencespa
dc.source.instnameinstname:Universidad del Rosario
dc.source.reponamereponame:Repositorio Institucional EdocUR
dc.subject.keywordM-Ring-Star problemspa
dc.subject.keywordVariable neighborhood searchspa
dc.subject.keywordNetwork design Combinatorial optimizationspa
dc.titleA Variable Neighborhood Search Approach for the Capacitated m-Ring-Star Problemspa
dc.title.TranslatedTitleUn enfoque de búsqueda de vecindario variable para el problema de m-Ring-Star capacitadospa
dc.typebookParteng
dc.type.hasVersioninfo:eu-repo/semantics/publishedVersion
dc.type.spaParte de librospa
Archivos
Colecciones
Libros