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

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

Full description

Autores:

Tipo de recurso:

Fecha de publicación:

2016

Institución:

Universidad del Rosario

Repositorio:

Repositorio EdocUR - U. Rosario

Idioma:

eng

OAI Identifier:

oai:repository.urosario.edu.co:10336/26615

Acceso en línea:

https://doi.org/10.1007/978-3-319-42291-6_1
https://repository.urosario.edu.co/handle/10336/26615

Palabra clave:

M-Ring-Star problem
Variable neighborhood search
Network design Combinatorial optimization

Rights

License

Restringido (Acceso a grupos específicos)