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

We consider the queueing maximal covering location-allocation problem QM-CLAP with an M/G/1 queueing system. We first formulate the problem as a binary quadratic programming problem and then propose a new solution procedure based on decomposition of the problem into smaller binary quadratic sub-problems. The heuristic procedure GRASP is used to solve the subproblems, as well as the entire model...

Planar Maximum Covering Location by Ellipses is an optimization problem where one wants to choose the location of ellipses given their major and minor axes cover demand points, maximizing a function depending on value covered points. We propose new exact algorithms for two versions this problem, have be parallel coordinate axes, another they can freely rotated. Besides finding optimal solutions...

In this paper, we propose models and solution approaches for determining the facility locations of medical supplies in response to large-scale emergencies. We address the demand uncertainty and medical supply insufficiency by providing each demand point with services from a multiple quantity of facilities that are located at different quality levels (distances). The problem is formulated as a m...

The emergency service facilities location is one of the most important issues in the emergency management. This study focused on the location set covering problem (LSCP) for emergency service facilities under fuzzy environment. On the basis of defining the signed distance of trapezoidal fuzzy number, the ranking rules of trapezoidal fuzzy number are defined, the model of emergency service facil...

some servers are to be located at nodes of a network. demand for services of these servers is located at each node and a subset of the nodes is to be chosen to locate one server in each. each customer selects a server with a probability dependent on distance and a certain amount of benefit is achieved after giving service to the customer. customers may waive receiving service with a known proba...

A 2-level hierarchical extension of the maximal covering location problem is considered and an e0ective method for its solution developed. A combined Lagrangean–surrogate (L–S) relaxation is de6ned which reduces to a 0–1 knapsack problem. Tests were carried out using a subgradient-based heuristic incorporating the L–S relaxation, with the resulting knapsack problems being solved both with and w...

Hubs are centers for collection, rearrangement, and redistribution of commodities in transportation networks. In this paper, non-linear multi-objective formulations for single and multiple allocation hub maximal covering problems as well as the linearized versions are proposed. The formulations substantially mitigate complexity of the existing models due to the fewer number of constraints and v...