EconPapers    
Economics at your fingertips  
 

Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms

Roberto Baldacci, Alessandro Hill, Edna A. Hoshino and Andrew Lim

European Journal of Operational Research, 2017, vol. 262, issue 3, 879-893

Abstract: The Capacitated m-Ring-Star Problem (crsp) is the problem of designing a set of rings that pass through a central depot and through some transition points and/or customers, and then assigning each nonvisited customer to a visited point or customer. The number of customers visited and connected to a ring is bounded by an upper limit: the capacity of the ring. The objective is to minimize the total routing cost plus assignment costs. The problem has several applications in telecommunication network design and transportation planning. In addition, closely related versions to the crsp involving different graph topologies and objective functions have been recently studied by several authors. The recent literature shows that effective methods for solving these class of difficult optimization problems are based on the combination of column-and-cut generation techniques. In particular, the effectiveness of these methods strongly depend on the qualities and complexities of the associated pricing problems.

Keywords: Dynamic programming; Multi-depot ring star problem; Lower bounds (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221717303582
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:262:y:2017:i:3:p:879-893

DOI: 10.1016/j.ejor.2017.04.025

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 ().

 
Page updated 2025-03-19
Handle: RePEc:eee:ejores:v:262:y:2017:i:3:p:879-893