Probabilistic, maximal covering location-allocation models for congested systems

Article Abstract:

A commercial integer programming package was used as a basis for a heuristic that optimizes the service time of each service center in a service network. The heuristic is based on the probabilistic maximal covering location-allocation model, wherein constraints are developed for queue length and waiting time. Testing the model on a 30-node network showed that the model can effectively reduce waiting time, especially when random selection steps or random restarts are employed.

SOCIAL SERVICES, Social Assistance, Public Social Services, Models, Civil service, Customer service, Logistics

---

Obnoxious facility location in the interior of a planar network

Article Abstract:

The feasibility of using a graphical solution and a computational algorithm in locating a point situated in the interior of a planar network is evaluated. The problem is analyzed in the unweighted and weighted versions to evaluate the reliability of the proposed solutions. Results indicate that both solutions are very useful for locating an obnoxious facility which is situated as far as possible from a set of points and arcs.

Methods, Network analysis (Planning), Usage, Algorithms, Graph theory

---

Similar abstracts:

• Abstracts: The Planar Maximal Covering Location Problem. Asymmetric entrant location with a discrete consumer distribution: spatial price discrimination versus mill pricing
• Abstracts: Perspectives on Information Overload. A propositional inventory for new diffusion research. A value-added approach to household production: the special case of meal preparation

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.