Strategies for Minimum Distance in Simulated Evacuation of Transport Airplanes

The present paper describes the preliminary stages of the development of a new, comprehensive model conceived to simulate the evacuation of transport airplanes in certification studies. Two previous steps were devoted to implementing an efficient procedure to define the whole geometry of the cabin, and setting up an algorithm for assigning seats to available exits. Now, to clarify the role of the cabin arrangement in the evacuation process, the paper addresses the influence of several restrictions on the seat-to-exit assignment algorithm, maintaining a purely geometrical approach for consistency. Four situations are considered: first, an assignment method without limitations to search the minimum for the total distance run by all passengers along their escaping paths; second, a protocol that restricts the number of evacuees through each exit according to updated FAR 25 capacity; third, a procedure which tends to the best proportional sharing among exits but obliges to each passenger to egress through the nearest fore or rear exits; and fourth, a scenario which includes both restrictions. The four assignment strategies are applied to turboprops, and narrow body and wide body jets. Seat to exit distance and number of evacuees per exit are the main output variables. The results show the influence of airplane size and the impact of non-symmetries and inappropriate matching between size and longitudinal location of exits.

Evolutionary computation of forests with Degree- and Role-Constrained Minimum Spanning Trees

Finding the degree-constrained minimum spanning tree (DCMST) of a graph is a widely studied NP-hard problem. One of its most important applications is network design. Here we deal with a new variant of the DCMST problem, which consists of finding not only the degree- but also the role-constrained minimum spanning tree (DRCMST), i.e., we add constraints to restrict the role of the nodes in the tree to root, intermediate or leaf node. Furthermore, we do not limit the number of root nodes to one, thereby, generally, building a forest of DRCMSTs. The modeling of network design problems can benefit from the possibility of generating more than one tree and determining the role of the nodes in the network. We propose a novel permutation-based representation to encode these forests. In this new representation, one permutation simultaneously encodes all the trees to be built. We simulate a wide variety of DRCMST problems which we optimize using eight different evolutionary computation algorithms encoding individuals of the population using the proposed representation. The algorithms we use are: estimation of distribution algorithm, generational genetic algorithm, steady-state genetic algorithm, covariance matrix adaptation evolution strategy, differential evolution, elitist evolution strategy, non-elitist evolution strategy and particle swarm optimization. The best results are for the estimation of distribution algorithms and both types of genetic algorithms, although the genetic algorithms are significantly faster.

Minimum volume stability limits for axisymmetric liquid bridges subject to steady axial acceleration

In this paper the influence of an axial microgravity on the minimum volume stability limit of axisymmetric liquid bridges between unequal disks is analyzed both theoretically and experimentally. The results here presented extend the knowledge of the static behaviour of liquid bridges to fluid configurations different from those studied up to now (almost equal disks). Experimental results, obtained by simulating microgravity conditions by the neutral buoyancy technique, are also presented and are shown to be in complete agreement with theoretical ones.

Stability limits of minimum volume and breaking axisymmetric liquid bridges between unequal disks

This paper deals with the stability limits of minimum volume and the breaking of axisymmetric liquid columns held by capillary forces between two concentric,circular solid disk of different radii. The problem has been analyzed both theoreti-cally and experimentally. A theoretical analysis concerning the breaking of liquid bridges has been performed by using a one-dimensional slice model already used in liquid bridge problems. Experiments have been carried out by using milli-metric liquid bridges, and minimum volume stability limits as well as the volumes of the drops resulting after breaking have been measured for a large number of liquid bridge configurations. Experimental results being in agreement with theoretical prediction.

An experimental study of the breakage of liquid bridges at stability limit of minimum volume

An experimental apparatus to study the breaking process of axisymmetric liquid bridges has been developed, and the breaking sequences of a large number of liquid bridge configurations at minimum-volume stability limit have been analyzed. Experimental results show that very close to the breaking moment the neck radius of the liquid bridge varies as t1/3, where t is the time to breakage, irrespective of the value of the distance between the solid disks that support the liquid column.

Minimum volume for a liquid bridge between equal disks

The lower stability limit for axisymmetric floating zones at rest between equal coaxial disks has been experimentally verified for several disk-separation/disk-diameter ratios by using the neutral buoyancy technique. Results show a close agre ment with theory in the case of bridge disruption and a wide scatter in the case of bridge etachment.

Minimum volume of long liquid bridges between noncoaxial, nonequal diameter circular disks under lateral acceleration

The stability limit of minimum volume and the breaking dynamics of liquid bridges between nonequal, noncoaxial, circular supporting disks subject to a lateral acceleration were experimentally analyzed by working with liquid bridges of very small dimensions. Experimental results are compared with asymptotic theoretical predictions, with the agreement between experimental results and asymptotic ones being satisfactory