Heuristics for solving problem of evacuating non-ambulatory people in a short-notice disaster
12Dec_Pico_Tan_MBA.pdf (1.241Mb)Abstract
As Humanitarian Assistance and Disaster Relief (HADR) operations gain importance, a number of problems become evident. The time-sensitive problem of evacuating non-ambulatory people from a disaster area proves to be a challenging combinatorial optimization problem. The scope of the problem is defined by drawing analogies to similar vehicle routing problems that have been previously addressed. Based on the basic Max-Min Ant System (MMAS) algorithm modeled after the behavior of ants seeking food, potential solution approaches to this problem are enhanced to improve quality and efficiency by hybridizing features such as a best solution list, elite ants, ranked contribution system, and heuristic procedures during route construction. Using a Nearly-Orthogonal Latin Hypercubes (NOLH) experimental design, the algorithm parameters are tuned for best empirical performance for a range of test scenarios.
Description
Outstanding Thesis
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, is not copyrighted in the U.S.Related items
Showing items related by title, author, creator and subject.
-
Dynamic Characteristics of Liquid Motion in Partially Filled Tanks of a Spinning Spacecraft
(1993);This paper presents a boundary-layer model to predict dynamic characteristics of liquid motion in partially filled tanks of a spinning spacecraft. The solution is obtained by solving three boundary-value problems: an ... -
Realigning the U.S. Navy Recruiting Command
(Monterey, California. Naval Postgraduate School, 1993-03);This thesis addresses two problems in aligning the recruiting structure for Navy Recruiting Command. The first problem involves two decisions affecting recruiting stations within a single recruiting district: which stations ... -
On partitioning an arbitrarily given set of elements of a finite Boolean algebra into the minimum number of sets of compatible elements
(Monterey, California. Naval Postgraduate School, 1964);During the past several years at the United States Naval Postgraduate School there has been much interest in obtaining an efficient method for making a time schedule for classes. A mathematical model for a simplified ...
