• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

A case study of the traffic situation in Tallahassee

Unknown Date (has links)
This paper analyzes and enumerates the major problems concerning traffic congestion and parking in Tallahassee, and considers the changes to be put into effect that would eliminate these problems. / Typescript. / "July 17, 1951." / "Submitted to the Graduate Council of Florida State University in partial fulfillment of the requirements for the degree of Master of Science." / Advisor: James A. Norton, Professor Directing Paper. / Includes bibliographical references (leaf 32).
2

A location-allocation model and algorithm for optimally locating shelters to minimize evacuation times

Carter, Todd B. 08 September 2012 (has links)
Location â allocation models are designed to seek the concurrent location of a set of service facilities and an allocation scheme to satisfy the demands of a set of customers or users of a given system. If the location-allocation model is based on a graph-theoretic formulation, then the demand-fulfilling items will move from a designated origin or origins, through arcs and transshipment nodes, to a set of destinations selected by the model. It is suggested in this research effort that such a modeling structure may be employed to simulate transportation evacuation conditions that may arise in the case of a natural disaster, namely a hurricane. A nonlinear mixed integer mathematical program is formulated to route passengers in automobiles on paths in the transportation network, such that the endangered area is evacuated in the minimum amount of time. One heuristic and two exact, convergent, implicit enumeration algorithms based on the generalized Benders' decomposition method are presented. The algorithms are designed to exploit the inherent problem structure. Computational experience is provided against a set of realistic test problems formulated on the Virginia Beach network. Potential avenues for further research are also explored. / Master of Science

Page generated in 0.0811 seconds