| Title: | A new variant of the p-hub location problem with a ring backbone network for content placement in VoD services |
|---|
| Authors: | ID Atta, Soumen, Indian Institute of Information Technology (IIIT) Vadodara, Gandhinagar Campus, Sector–28, Gandhinagar, Gujarat 382028, India, and Faculty of Informatics, Masaryk University, Botanick ́a 68a, Brno 602 00, Czech Republic (Author)
ID Sen, Goutam, Industrial and Systems Engineering, Indian Institute of Technology (IIT) Kharagpur, Kharagpur 721302, West Bengal, India (Author) |
|---|
| Files: |
This document has no files that are freely available to the public. This document may have a physical copy in the library of the organization, check the status via COBISS.  |
|---|
| Language: | English |
|---|
| Work type: | Not categorized |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | UNG - University of Nova Gorica
|
|---|
| Abstract: | In this article, the single allocation p-hub location problem (SApHLP) with a ring backbone network for content placement in VoD services is proposed. In VoD services, a large volume of digital data is kept as data segments in spatially distributed hubs. In SApHLP, each user is restricted to be allocated only to a single hub, and here hubs form a ring backbone network. SApHLP jointly addresses (i) the locations of hubs, (ii) the placement of segments to hubs, (iii) the allocation of users to hubs as per their demands, and (iv) the optimal paths to route the demands from users to hubs. We have introduced network flow-based 3-subscripted and path-based 4-subscripted MILP formulations of SApHLP. This article presents a novel discrete particle swarm optimization (PSO)-based approach where factoradic numbers are used to encode solution. It also incorporates three problem-specific solution refinement methods for faster convergence. In this article, SApHLP instances are generated from a real-world database of video files obtained from a movie recommender system. The benchmark solutions are generated using IBM’s CPLEX optimizer with default settings and Benders decomposition strategy. The performance of the proposed PSO is compared with the benchmark results produced by CPLEX. |
|---|
| Keywords: | Single allocation p-hub location problem, Ring backbone network, VoD services, Particle Swarm Optimization (PSO), Factoradics, CPLEX |
|---|
| Year of publishing: | 2021 |
|---|
| Number of pages: | 107432 |
|---|
| Numbering: | September, 159 |
|---|
| PID: | 20.500.12556/RUNG-8138 |
|---|
| COBISS.SI-ID: | 149320707 |
|---|
| DOI: | https://doi.org/10.1016/j.cie.2021.107432 |
|---|
| NUK URN: | URN:SI:UNG:REP:HCP1GHXB |
|---|
| Publication date in RUNG: | 17.04.2023 |
|---|
| Views: | 1581 |
|---|
| Downloads: | 0 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
