This study extends a mathematical model that integrates the location, allocation, inventory replenishment and routing decisions simultaneously. To cope with inherent uncertainty of parameters, we implement a continuous-time Markov process and derive the performance measures of the system. Using the obtained results, the problem is formulated as a mixed integer nonlinear programing model (MINLP)...

The hierarchical hub covering facility location problems are applied to distribution systems, transportation, waste disposal, treatment services, emergency services and remote communication. The problems attempt to determine the location of service providers' facilities at different levels and specify their linking directions in order to reduce costs and to establish an appropriate condition in...

in this paper, a facility location problem of distribution systems, as one of the important and strategic issues in supply chain management, has been studied in a three-level supply chain under a stochastic condition. for this purpose, a two-stage mathematic model has been proposed for the location-allocation problem of distribution systems with regard to backup facilities for disrupting wareho...

Location-allocation models may be used to focus upon a multiplicity of factors potentially underlying settlement pattern development. We describe several such maximal covering models and their applicability in understanding the degree of political centralization in the Nile Valley during the Ramessid period (ca. 1317-1070 B.C.). The results of the covering models support the contention that the...

This paper presents a novel reliable hierarchical location-allocation model where facilities are subject to the risk of disruptions. Based on the relationship between various levels of system, a multi-level multi-flow hierarchy is considered. The heterogeneous probabilistic disruptions are investigated in which the constructed facilities have different site-dependent and independent failure rat...

In this chapter, we present a procedure that seeks the global minimum for the capacitated Euclidean location-allocation problem which is defined as follows. Given the fixed location of m existing facilities or customers on a continuous plane and their associated demands, we wish to determine the location of n new facilities or sources with known capacities, and the allocation of its supply, in ...

the existing works considering the flow-based discount factor in the hub and spoke problems, assume that increasing the amount of flow passing through each edge of network continuously decreases the unit flow transportation cost. although a higher volume of flow allows for using wider links and consequently cheaper transportation, but the unit of flow enjoys more discounts, quite like replacing...

This paper studies multiple cross-dockings where the loads are transferred from origins (suppliers) to destinations (customers) through cross-docking facilities. Products are no longer stored in intermediate depots and incoming shipments are consolidated based on customer demands and immediately delivered to them to their destinations. In this paper, each cross-docking has a covering radius tha...

DISCLAIMER This document describes work undertaken as part of a programme of study at the Faculty of Geo-Information Science and Earth Observation of the University of Twente. All views and opinions expressed therein remain the sole responsibility of the author, and do not necessarily represent those of the Faculty. i ABSTRACT Location allocation is a combinatorial optimization problem. Traditi...

The facility location problem described in this paper comes from an industrial application in the slaughterhouse industry of Norway. Investigations show that the slaughterhouse industry experiences economies of scale in the production facilities. We examine a location-allocation problem focusing on the location of slaughterhouses, their size and the allocation of animals in the different farmin...