Abstract
A ring tree is a tree graph with an optional additional edge that closes a unique cycle. Such a cycle is called a ring and the nodes on it are called ring nodes. The capacitated ring tree problem (CRTP) asks for a network of minimal overall edge cost that connects given customers to a depot by ring trees. Ring trees are required to intersect in the depot which has to be either a ring node of degree two in a ring tree or a node of degree one if the ring tree does not contain a ring. Customers are predefined as of type 1 or type 2. The type 2 customers have to be ring nodes, whereas type 1 customers can be either ring nodes or nodes in tree sub-structures. Additionally, optional Steiner nodes are given which can be used as intermediate network nodes if advantageous. Capacity constraints bound both the number of the ring trees as well as the number of customers allowed in each ring tree. In this paper we present first advanced neighborhood structures for the CRTP. SomeĀ of them generalize existing concepts for the TSP and the Steiner tree problem, others are CRTP-specific. We also describe models to explore these multi-node and multi-edge exchange neighborhoods in one or more ring trees efficiently. Moreover, we embed these techniques in a heuristic multi-start framework and show that it produces high quality results for small and medium size literature instances.
This research was partially supported by the Interuniversity Attraction Poles (IAP) Programme initiated by the Belgian Science Policy Office (COMEX project).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The instances can be obtained from the author.
References
Ahuja, R.K., Orlin, J.B., Sharma, D.: Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. Math. Program. 91, 71ā97 (2000)
Amberg, A., Domschke, W., VoĆ, S.: Capacitated minimum spanning trees: Algorithms using intelligent search. Comb. Optim. Theory Pract. 1, 9ā39 (1996)
Golden, B., Raghavan, S., Wasil, E.A.: The Vehicle Routing Problem: Latest Advances and New Challenges. Operations research/Computer Science Interfaces Series. Springer, New York (2008). http://www.worldcat.org/oclc/254177374
Hill, A., VoĆ, S.: An equi-model matheuristic for the multi-depot ring star problem. Research paper, University of Antwerp, Faculty of Applied Economics (2014). http://EconPapers.repec.org/RePEc:ant:wpaper:2014015
Hill, A., VoĆ, S.: Optimal capacitated ring trees. Research paper, University of Antwerp, Faculty of Applied Economics (2014). http://EconPapers.repec.org/RePEc:ant:wpaper:2014012
Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498ā516 (1973). http://pubsonline.informs.org/doi/abs/10.1287/opre.21.2.498
VoĆ, S.: Steiner tree problems in telecommunications. In: Resende, M.G.C., Pardalos, P.M. (eds.) Handbook of Optimization in Telecommunications, pp. 459ā492. Springer, US (2006). http://dx.doi.org/10.1007/978-0-387-30165-5_18
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendix 1
Appendix 1
Rights and permissions
Copyright information
Ā© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Hill, A. (2015). Multi-exchange Neighborhoods for the Capacitated Ring Tree Problem. In: Dimov, I., Fidanova, S., Lirkov, I. (eds) Numerical Methods and Applications. NMA 2014. Lecture Notes in Computer Science(), vol 8962. Springer, Cham. https://doi.org/10.1007/978-3-319-15585-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-15585-2_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15584-5
Online ISBN: 978-3-319-15585-2
eBook Packages: Computer ScienceComputer Science (R0)