A Lagrangean heuristic for the pk-median dynamic location problem

Article Abstract:

A Lagrangean heuristicfor the pk-median dynamic location problem is developed and presented with a modified version. Upper and lower bounds of good quality are obtained as well as optimal solutions with maximum possible errors of 10.3% and 5.2% for the original and modified versions, respectively. Moreover, computing time on a Burroughs A9P computer for 50-by-50-by-7 problems took only about 25 minutes for the original version and 18 minutes for the modified version. However, computing time is much longer than that required by an earlier proposed dynamicprogramming heuristic.

Usage, Integer programming

---

A Lagrangean heuristic for the maximal covering location problem

Article Abstract:

A Lagrangean relaxation heuristic for solving the maximal covering location problem is introduced. The heuristic, which improves the upper and lower bounds at every iteration, employs a vertex addition and substitution algorithm for deriving the upper bound and a subgradient optimization algorithm for deriving the lower bound. Its application to networks with up to 150 vertices on an IBM 3090-600J supercomputer revealed a computation time of less than three minutes for all cases.

Operations research, Management science, Cases, Heuristic programming, Relaxation methods (Mathematics)

---

The Queueing Maximal Availability Location Problem: a model for the siting of emergency vehicles

Article Abstract:

The Queueing Maximal Availability Location Problem (Q-MALP) is developed as a more realistic model which seeks to maximize the population covered by emergency vehicles with availability. A probabilistic formulation is structured where availability is computed using the queueing theory. In the formulation, the probabilities depend on each other, which is achieved by using the queueing theory.

Management, Optimization theory, Queuing theory, Mathematical programming, Emergency vehicles

Similar abstracts:

• Abstracts: A new algorithm for the minimal-area convex enclosure problem. Solution approaches to irregular nesting problems
• Abstracts: How to use structural constraints to compute an upper bound for the pallet loading problem
• Abstracts: Heuristic approaches for n/m/F/sigma Ci scheduling problems. Heuristic procedure for minimizing makespan and the number of required pallets
• Abstracts: Young Turks on the move. Indirect intervention
• Abstracts: An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem. Optimal procedures for the discrete time/cost trade-off problem in project networks

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