This paper proposes a novel facility location model for health service network design by considering different key elements including the reliability aspects, service capacity, congestion, service quality, surrounding public infrastructures, geographical accessibility and several types of cost such as investment, transportation and operational costs. We formulate the problem as a robust scenari...

This study considers a reliable location – inventory problem for a supply chain system comprising one supplier, multiple distribution centers (DCs), and multiple retailers in which we determine DCs location, inventory replenishment decisions and assignment retailers to DCs, simultaneously. Each DC is managed through a continuous review (S, Q) inventory policy. For tackling real world conditions...

The k-center problem is a classic facility location problem, where given an edge-weighted graph G = (V,E) one is to find a subset of k vertices S, such that each vertex in V is “close” to some vertex in S. The approximation status of this basic problem is well understood, as a simple 2-approximation algorithm is known to be tight. Consequently different extensions were studied. In the capacitat...

Location Routing is a fundamental planning problem in logistics, which strategic location decisions on the placement of facilities (depots, distribution centers, warehouses etc.) are taken based accurate estimates operational routing costs. We present an approximation algorithm, i.e., algorithm with proven worst-case guarantees both terms running time and solution quality, for general capacitat...

Entitled: Metaheuristics for multiobjective capacitated location allocation on logistics networks and submitted in partial fulfillment of the requirements for the degree of complies with the regulations of the University and meets the accepted standards with respect to originality and quality. ABSTRACT Metaheuristics for multiobjective capacitated location allocation on logistics networks Yongl...

Assignment problem in content distribution networks (CDN) is unsplittable hard-capacitated facility location problem (UHCFLP) because of underlying anycast routing protocol. We extend assignment problem in CDN to multidimensional facility location problem (MFLP). With our devised algorithm, assignment cost considers CPU utilization parameter along with request size and distance between client a...

This study presents a well-known capacitated dynamic facility location problem (DFLP) that satisfies the customer demand at a minimum cost by determining the time period for opening, closing, or retaining an existing facility in a given location. To solve this challenging NP-hard problem, this paper develops a unique hybrid solution algorithm that combines a rolling horizon algorithm with an ac...

The facility location problem is known as one of the important problem faced in industry. There are many variations of this problem for different applications, however, they can be classified as a capacitated or uncapacitated problem according to its capacity constraint. In this paper, we consider an uncapacitated facility location problem which is known to be an NP-hard problem. A parallel gen...

We present a parallel interior point algorithm to solve block structured linear programs. This algorithm can solve block diagonal linear programs with both side constraints (common rows) and side variables (common columns). The performance of the algorithm is investigated on uncapacitated, capacitated and stochastic facility location problems. The facility location problems are formulated as mi...

A stochastic multiproduct capacitated facility location problem involving a single supplier and multiple customers is investigated. Due to the stochastic demands, a reasonable amount of safety stock must be kept in the facilities to achieve suitable service levels, which results in increased inventory cost. Based on the assumption of normal distributed for all the stochastic demands, a nonlinea...