Abstract
We consider the static data segment location problem in information networks. This problem was introduced by Sen et al. (Comput Oper Res, 62:282–295 2015). We consider the problem of optimally locating large volumes of digital content that is accessed via a distributed network. A database is pre-partitioned into multiple segments and the problem is one of placing these segments at servers located in different regions. We need to jointly consider four specific subproblems: (1) the problem of locating servers in the network, (2) the problem of allocating specific data segments to each of the servers, (3) the problem of assigning users to the servers based on their query patterns, and, (4) routing queries through the network. We consider two variants of this problem depending on the topology of the network through which the servers are connected: a mesh topology and a tree topology. In this paper, we develop a solution approach based on a discrete particle swarm optimization approach. We demonstrate the superiority of our approach by comparing its performance against solutions to benchmark instances obtained previously using a simulated annealing approach (Networks, 68(1):4–22 2016b).
Similar content being viewed by others
References
Ahuja RK, Murty VVS (1987) Exact and heuristic algorithms for the optimum communication spanning tree problem. Transp Sci 21(3):163–170. http://www.jstor.org/stable/25768270
Ai TJ, Kachitvichyanukul V (2009) A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Comput Oper Res 36(5):1693–1702. Selected papers presented at the Tenth International Symposium on Locational Decisions (ISOLDE X). http://www.sciencedirect.com/science/article/pii/S0305054808000774
Alumur S, Kara BY (2008) Network hub location problems: The state of the art. Eur J Oper Res 190 (1):1–21
Alumur SA, Kara BY, Karasan OE (2012) Multimodal hub location and hub network design. Omega 40(6):927–939. Special Issue on Forecasting in Management Science
Applegate D, Archer A, Gopalakrishnan V, Lee S, Ramakrishnan KK (2010) Optimal content placement for a large-scale vod system. In: Proceedings of the 6th International Conference. Co-NEXT ’10. ACM, New York, NY, USA, pp 4:1–4:12
Azimdoost B, Farhadi G, Abani N, Ito A (2015) Optimal in-network cache allocation and content placement. In: 2015 IEEE conference on computer communications workshops (INFOCOM WKSHPS), pp 263–268
Azizi N, Chauhan S, Salhi S, Vidyarthi N (2016) The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques. Comput Oper Res 65:174–188. http://www.sciencedirect.com/science/article/pii/S0305054814001415
Bailey A, Ornbuki-Berrnan B, Asobiela S (2013) Discrete pso for the uncapacitated single allocation hub location problem. In: 2013 IEEE workshop on computational intelligence in production and logistics systems (CIPLS), pp 92–98
Campbell J, Ernst A, Krishnamoorthy M (2002) Hub location problems. In: Hamacher H, Drezner Z (eds) Facility location: Applications and theory. Springer, Berlin, pp 373–408
Campbell JF, O’Kelly ME (2012) Twenty-five years of hub location research. Transp Sci 46(2):153–169
Clerc M (2004) Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem. Springer Berlin Heidelberg, Berlin, Heidelberg, pp 219–239. doi:10.1007/978-3-540-39930-8_8
Contreras I, Fernndez E, Marn A (2010) The tree of hubs location problem. Eur J Oper Res 202 (2):390–400. http://www.sciencedirect.com/science/article/pii/S0377221709004214
Damgacioglu H, Dinler D, Ozdemirel NE, Iyigun C (2015) A genetic algorithm for the uncapacitated single allocation planar hub location problem. Comput Oper Res 62:224–236. http://www.sciencedirect.com/science/article/pii/S0305054814002500
de Camargo R, Miranda G (2012) Single allocation hub location problem under congestion: network owner and user perspectives. Expert Systems with Applications 39(3):3385–3391. http://www.sciencedirect.com/science/article/pii/S0957417411013352
de Camargo RS, de Miranda G, Lokketangen A (2013) A new formulation and an exact approach for the many-to-many hub location-routing problem. Appl Math Model 37(12–13):7465–7480. http://www.sciencedirect.com/science/article/pii/S0307904X1300142X
de Sa EM, Contreras I, Cordeau J-F (2015a) Exact and heuristic algorithms for the design of hub networks with multiple lines. Eur J Oper Res 246(1):186–198. http://www.sciencedirect.com/science/article/pii/S0377221715003100
de Sa EM, Contreras I, Cordeau J-F, de Camargo RS, de Miranda G (2015b) The hub line location problem. Transp Sci 49(3):500–518. doi:10.1287/trsc.2014.0576
de Sa EM, de Camargo RS, de Miranda G (2013) An improved benders decomposition algorithm for the tree of hubs location problem. Eur J Oper Res 226(2):185–202. http://www.sciencedirect.com/science/article/pii/S0377221712008211
Dernbach S, Taft N, Kurose J, Weinsberg U, Diot C, Ashkan A (2016) Cache content-selection policies for streaming video services. In: IEEE INFOCOM 2016 - The 35th annual IEEE international conference on computer communications, pp 1–9
Ernst AT, Krishnamoorthy M (1996) Efficient algorithms for the uncapacitated single allocation p-hub median problem. Locat Sci 4(3):139–154
Farahani RZ, Hekmatfar M, Arabani AB, Nikbakhsh E (2013) Hub location problems: a review of models, classification, solution techniques, and applications. Comput Ind Eng 64(4):1096–1109. http://www.sciencedirect.com/science/article/pii/S0360835213000326
Gavish B, Pirkul H (1986) Computer and database location in distributed computer systems. IEEE Trans Comput 35(7):583–590
Habibzadeh Boukani F, Farhang Moghaddam B, Pishvaee MS (2016) Robust optimization approach to capacitated single and multiple allocation hub location problems. Comput Appl Math 35(1):45–60. doi:10.1007/s40314-014-0179-y
Harper FM, Konstan JA (2015) The movielens datasets: History and context. ACM Trans Interact Intell Syst 5(4):19:1–19:19. doi:10.1145/2827872
He Y, Wu T, Zhang C, Liang Z (2015) An improved {MIP} heuristic for the intermodal hub location problem. Omega 57, Part B, 203 – 211. http://www.sciencedirect.com/science/article/pii/S0305048315000900
Johnson D, Lenstra J, A RK (1987) The complexity of the network design problem. Networks 8:279–285
Kennedy J (2010) Particle Swarm Optimization. Springer US, Boston, MA, pp 760–766. doi:10.1007/978-0-387-30164-8_630
Kian R, Kargar K (2016) Comparison of the formulations for a hub-and-spoke network design problem under congestion. Comput Ind Eng 101:504–512. http://www.sciencedirect.com/science/article/pii/S036083521630359X
Krause J, Cordeiro J, Parpinelli RS, Lopes HS (2013) 7 - a survey of swarm algorithms applied to discrete optimization problems. In: Karamanoglu X.-S.Y.C.X.H.G. (ed) Swarm Intelligence and Bio-Inspired Computation. Elsevier, Oxford. http://www.sciencedirect.com/science/article/pii/B9780124051638000077, pp 169–191
Mahmutogullari AI, Kara BY (2016) Hub location under competition. Eur J Oper Res 250(1):214–225. http://www.sciencedirect.com/science/article/pii/S0377221715008322
Marić M, Stanimirović Z, Stanojević P (2013) An efficient memetic algorithm for the uncapacitated single allocation hub location problem. Soft Comput 17(3):445–466. doi:10.1007/s00500-012-0919-0 10.1007/s00500-012-0919-0
Pan Q-K, Tasgetiren MF, Liang Y-C (2008) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput Oper Res 35(9):2807–2839. part Special Issue: Bio-inspired Methods in Combinatorial Optimization. http://www.sciencedirect.com/science/article/pii/S0305054806003170
Poli R, Kennedy J, Blackwell T (2007) Particle swarm optimization. Swarm Intell 1(1):33–57. doi:10.1007/s11721-007-0002-0
Rieck J, Ehrenberg C, Zimmermann J (2014) Many-to-many location-routing with inter-hub transport andmulti-commodity pickup-and-delivery. Eur J Oper Res 236(3):863–878. Vehicle Routing and Distribution Logistics. http://www.sciencedirect.com/science/article/pii/S0377221713010059
Rodrguez-Martn I, Salazar-Gonzlez J-J, Yaman H (2014) A branch-and-cut algorithm for the hub location and routing problem. Comput Oper Res 50:161–174. http://www.sciencedirect.com/science/article/pii/S0305054814001051
Salman A, Ahmad I, Al-Madani S (2002) Particle swarm optimization for task assignment problem. Microprocess Microsyst 26(8):363–371. http://www.sciencedirect.com/science/article/pii/S0141933102000534
Sasaki M, Campbell J, Krishnamoorthy M, Ernst A (2014) A stackelberg hub arc location model for a competitive environment. Comput Oper Res 47:27–41
Sen G, Krishnamoorthy M, Narayanan V, Rangaraj N (2017) A Benders Decomposition Approach for Static Data Segment Location to Servers Connected by a Tree Backbone. Springer International Publishing, Cham, pp 109–116. doi:10.1007/978-3-319-42902-1_15
Sen G, Krishnamoorthy M, Rangaraj N, Narayanan V (2015) Exact approaches for static data segment allocation problem in an information network. Comput Oper Res 62:282–295. http://www.sciencedirect.com/science/article/pii/S0305054814001592
Sen G, Krishnamoorthy M, Rangaraj N, Narayanan V (2016a) Facility location models to locate data in information networks: a literature review. Ann Oper Res 246(1):313–348. doi:10.1007/s10479-015-1840-6
Sen G, Krishnamoorthy M, Rangaraj N, Narayanan V (2016b) Mathematical models and empirical analysis of a simulated annealing approach for two variants of the static data segment allocation problem. Networks 68(1):4–22. doi:10.1002/net.21675 10.1002/net.21675
Tanash M, Contreras I, Vidyarthi N (2017) An exact algorithm for the modular hub location problem with single assignments. Comput Oper Res 85:32–44. http://www.sciencedirect.com/science/article/pii/S0305054817300710
Tasgetiren MF, Liang Y-C, Sevkli M, Gencyilmaz G (2007) A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. Eur J Oper Res 177 (3):1930–1947. http://www.sciencedirect.com/science/article/pii/S0377221705008453
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sen, G., Krishnamoorthy, M. Discrete particle swarm optimization algorithms for two variants of the static data segment location problem. Appl Intell 48, 771–790 (2018). https://doi.org/10.1007/s10489-017-0995-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10489-017-0995-z