Abstract
This paper addresses the biobjective capacitated m-ring star problem. The problem consists of finding a set of m simple cycles (rings) through a subset of nodes of a network. The network consists of a distinguished node called the depot and two different kinds of nodes, the customers and the transition points. Each ring contains the depot, a number of customers and some transition points. The customers not in any ring are directly connected to nodes in the rings. The rings must be node-disjoint and the total number of customers in a ring or connected to a ring is limited by the capacity of the ring. The aim is to minimize two objective functions, one referring to the cost due to the links of the rings and the other referring to the cost of allocating customers to nodes in the ring. An evolutionary algorithm is developed to approximate the Pareto front. The algorithm combines standard characteristics of evolutionary algorithms with the use of a heuristic to construct feasible solutions to the problem. A computational experiment is carried out using benchmark instances to show the performance of the algorithm.
This research work has been funded by the Gobierno de Aragón under grant E58 (FSE) and by UZ-Santander under grant UZ2012-CIE-07.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baldacci, R., Dell’Amico, M., Salazar González, J.J.: The capacitated m-ring-star problem. Operations Research 55(6), 1147–1162 (2007)
Deb, K., Pratap, A., Agrawal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2), 182–197 (2002)
Ehrgott, M.: Multicriteria Optimization, 2nd edn. Springer, Berlin (2005)
Hoshino, E.A., de Souza, C.C.: A branch-and-cut-and-price approach for the capacitated m-ring-star problem. Discrete Applied Mathematics 160(18), 2728–2741 (2012)
Liefooghe, A., Jourdan, L., Talbi, E.-G.: Metaheuristics and cooperative approaches for the bi-objective ring star problem. Computers and Operations Research 37(6), 1033–1044 (2010)
Mauttone, A., Nesmachnow, S., Olivera, A., Robledo, F.: A hybrid metaheuristic algorithm to solve the capacitated m-ring star problem. In: International Network Optimization Conference (2007)
Naji-Azimi, Z., Salari, M., Toth, P.: A heuristic procedure for the capacitated m-ring-star problem. European Journal of Operational Research 207(3), 1227–1234 (2010)
Naji-Azimi, Z., Salari, M., Toth, P.: An integer linear programming based heuristic for the capacitated m-ring-star problem. European Journal of Operational Research 217(1), 17–25 (2012)
Reinelt, G.: TSPLIB–a traveling salesman problem library. Journal of Computing 3(4), 376–384 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Calvete, H.I., Galé, C., Iranzo, J.A. (2013). An Evolutionary Algorithm for the Biobjective Capacitated m-Ring Star Problem. In: Perny, P., Pirlot, M., Tsoukiàs, A. (eds) Algorithmic Decision Theory. ADT 2013. Lecture Notes in Computer Science(), vol 8176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41575-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-41575-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41574-6
Online ISBN: 978-3-642-41575-3
eBook Packages: Computer ScienceComputer Science (R0)