A branch and bound algorithm applied to field office location Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/7h149s520

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • This thesis develops a model for locating field offices for the Motor Vehicles Division of Oregon. The locations are determined by minimizing the total cost to the Public. This is reasonable because the Public finances the operation and the opening of the offices through tax dollars, and it bears the expense of traveling to the offices to register vehicles and obtain licenses. A branch and bound algorithm for warehouse location developed by Basheer Khumawala is applied to the field office location problem to determine the optimal locations. It was found that the algorithm runs quite efficiently, but the storage capacities needed to determine optimality are prohibitive for large problems. The storage problem was avoided by dividing the State into four areas and running each area separately. A modification in the computer code is suggested so that the algorithm works like a heuristic procedure. The solutions obtained are not guaranteed to be optimal, but much less storage is used to find the solution. Several different costs for opening offices and for traveling were used to investigate the sensitivity of the locations. The results from the study are encouraging and are presently being used by the Motor Vehicles Division to assist in determination of new office locations.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome) using Capture Perfect 3.0.82 on a Canon DR-9080C in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2013-11-21T15:51:16Z (GMT) No. of bitstreams: 1 LovroDaryl1975.pdf: 1379103 bytes, checksum: 7577577b81017df1314c0e8fa3a433ff (MD5)
  • description.provenance : Submitted by Georgeann Booth (gbscannerosu@gmail.com) on 2013-11-21T00:56:56Z No. of bitstreams: 1 LovroDaryl1975.pdf: 1379103 bytes, checksum: 7577577b81017df1314c0e8fa3a433ff (MD5)
  • description.provenance : Made available in DSpace on 2013-11-26T20:50:42Z (GMT). No. of bitstreams: 1 LovroDaryl1975.pdf: 1379103 bytes, checksum: 7577577b81017df1314c0e8fa3a433ff (MD5) Previous issue date: 1974-09-04
  • description.provenance : Approved for entry into archive by Kirsten Clark(kcscannerosu@gmail.com) on 2013-11-26T20:50:42Z (GMT) No. of bitstreams: 1 LovroDaryl1975.pdf: 1379103 bytes, checksum: 7577577b81017df1314c0e8fa3a433ff (MD5)

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items