Abstract

This paper describes a network-based decision support system for a general form of assigning parking spaces. It is an integrated optimization system that generates the model, optimizes it, and produces reports. The problem is modeled as a pure assignment network, which minimizes the preference values. The preference values are penalty costs, which are a function of walking distance, cost and priority. The methodology presented here can be applied to a variety of assignment situations where there are competing objectives. Since the approach is based on a network algorithm, it is capable of solving very large systems in an efficient way. A description of how the model was used to assign parking spaces for Dunhill Apartments in Bloomington, Indiana is provided. The proposed system can be used for any multi-building and multi-lot situation.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call