Resource allocation in state-dependent emergency evacuation networks

Article Abstract:

The application of queueing theory to the problem of resource allocation in emergency evacuation networks is considered. Specifically, a new procedure for varying the circulation spaces of passageways in state-dependent queueing network models is introduced to enhance throughput and lower total egress time. It is based on Powell's unconstrained derivative free algorithm and mean value analysis.

Operations research, Management science, Case studies, Resource allocation, Queuing theory

---

An algorithm for quadratic assignment problems

Article Abstract:

A new heuristic algorithm is proposed as a solution for complex quadratic assignment problems. The algorithm uses a straightforward approach and is both fast and efficient. It is shown that the algorithm is capable of addressing large-scale quadratic assignment problems. It does not always generate the optimal solution but it produces very acceptable sub-optimal solutions.

Algorithms, Heuristic programming

---

Multi-objective routing within large scale facilities using open finite queueing networks

Article Abstract:

Optimization problems related to routing of various products in a manufacturing facility are discussed. Additional information on use of finite queueing networks in solving the above mentioned problems is also included.

Models, Analysis, Mathematical models, Manufacturing processes, Manufacturing

Similar abstracts:

• Abstracts: Continental's sales soared to $2.3 billion in quarter. Tiremaker Continental reports 29% increase in 1998 net profit
• Abstracts: German retailer pays $104 million in Spiegel case. Cendant reaches early accord in suit. Warburg Pincus offers to buy final 40% of Knoll for $375 million
• Abstracts: Interrelationships among the elements of national innovation systems: a statistical evaluation. On the interaction between indirect cost allocations and the firm's objectives
• Abstracts: The capacitated multiple allocation hub location problem: formulations and algorithms. Solving large single allocation p-hub problems with two or three hubs
• Abstracts: An E-sensitivity analysis in the primal-dual interior point method. Shortest paths in a network with time-dependent flow speeds

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