This paper investigates a capacitated planar location-allocation problem with facility fixed cost. A zonebased fixed cost which consists of production and installation costs is considered. A nonlinear and mixed integer formulation is first presented. A powerful three stage Cross Entropy meta-heuristic with novel density functions is proposed. In the first stage a covering location problem provi...

  We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...

This paper proposes a discrete capacitated covering location-allocation model for pharmaceutical centers. In the presented model, two objectives are considered; the first one is minimization of costs and the second one try to maximize customer satisfaction by definition of social justice. Social justice in the model means that we consider customers satisfaction by using distance. the introduced...

With emergencies being, unfortunately, part of our lives, it is crucial to efficiently plan and allocate emergency response facilities that deliver effective and timely relief to people most in need. Emergency Medical Services (EMS) allocation problems deal with locating EMS facilities among potential sites to provide efficient and effective services over a wide area with spatially distributed ...

Amitrole is a biologically toxic nonselective herbicide which contaminates surface and ground waters at unprecedented rates. All reported modified electrodes that detect amitrole within sub-micromolar to nanomolar levels were based on the electro-oxidation of amitrole. Herein, we developed a new conceptual idea to detect picomolar concentrations of amitrole based on calcium cross linked pectin ...

We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...

Planning and defining places for the installation of police facilities are fundamental to improving public security service in urban space. Geographic Information Systems connecting spatial distribution occurrences, budgetary restrictions, maximum distance covered state-of-the-art innovations addressing need preventive responsive management. The present work proposes a management information sy...

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)...