### Abstract

Original language | English (US) |
---|---|

Pages (from-to) | 3-11 |

Number of pages | 9 |

Journal | Lecture Notes in Computer Science |

Volume | 9771 |

State | Published - Jul 12 2016 |

### Fingerprint

### Cite this

*Lecture Notes in Computer Science*,

*9771*, 3-11.

}

*Lecture Notes in Computer Science*, vol. 9771, pp. 3-11.

**A Variable Neighborhood Search Approach for the Capacitated m-Ring-Star Problem.** / Franco Franco, Carlos Alberto; Lopéz-Santana, eduyn ramiro; Mendez Giraldo, Germán Andrés .

Research output: Contribution to journal › Article

TY - JOUR

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

AU - Franco Franco, Carlos Alberto

AU - Lopéz-Santana, eduyn ramiro

AU - Mendez Giraldo, Germán Andrés

PY - 2016/7/12

Y1 - 2016/7/12

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

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

M3 - Article

VL - 9771

SP - 3

EP - 11

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -