3 research outputs found

    Discrete particle swarm optimization algorithms for two variants of the static data segment location problem

    No full text
    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)

    The 2-allocation p-hub median problem and a modified Benders decomposition method for solving hub location problems

    Get PDF
    We study the uncapacitated 2-allocation p-hub median problem (U2ApHMP), which is a special case of the well-studied hub median problem. The hub median problem designs a hub network in which the location of p hubs needs to be decided (the hubs are fully interconnected). The other nodes (known as access nodes) in the hub median problem are then allocated to one or many hubs. In the U2ApHMP, each access node is allocated to exactly two hubs. We discuss how this problem provides an alternative network design option for well-known p-hub median problems. We show its relevance and usefulness in the context of survivable network design and show that it addresses network survivability, a feature that has often been largely overlooked in hub network design research to date. We show that U2ApHMP is NP-hard even for a fixed/known set of hubs. We propose a mathematical formulation and develop a modified Benders decomposition method for this problem. In this, we convert the corresponding subproblems to minimum cost network flow problems. This allows us to solve large instances efficiently. We believe that, while our resulting method solves the U2ApHMP efficiently, it is also generalisable and can potentially be employed for solving other classes and types of hub location problems too
    corecore