An Integer Linear Programming based heuristic for the Capacitated m-Ring-Star Problem

Zahra Naji-Azimi, Majid Salari and Paolo Toth

European Journal of Operational Research, 2012, vol. 217, issue 1, 17-25

Abstract: We address the Capacitated m-Ring-Star Problem in which the aim is to find m rings (simple cycles) visiting a central depot, a subset of customers and a subset of potential (Steiner) nodes, while customers not belonging to any ring must be “allocated” to a visited (customer or Steiner) node. Moreover, the rings must be node-disjoint and the number of customers allocated or visited in a ring cannot be greater than a given capacity Q. The objective is to minimize the total visiting and allocation costs. The Capacitated m-Ring-Star Problem is NP-hard, since it generalizes the Traveling Salesman Problem.

Keywords: Capacitated m-Ring-Star Problem; Heuristic algorithms; Local search; Integer Linear Programming; Variable Neighborhood Search (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221711007673
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:217:y:2012:i:1:p:17-25

DOI: 10.1016/j.ejor.2011.08.026

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().