The "fair acceptance and optimized allocation" algorithm for parking space arrangement

Hossein Bayat Pour, Hamen Ramezani Ghomi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper "The Fair Acceptance & Optimized Allocation" algorithm will be explained which can be applied to the cases with quantitative categories of data and the optimized allocation of a predefined scope to those categories of data. This algorithm can be widely applied in situations which involve making decisions for the optimized and most fair case of allocating resources to the consumers. Optimized and fair allocation of a virtual space to its users or optimized and fair allocation of a physical and real space to its owners, are among cases which can be solved by this algorithm. Allocating a parking lot area to a number of vehicles with different sizes and specified numbers for each size would be an applicable example of such algorithm.

Original languageEnglish
Title of host publicationProceedings of the 2008 International Conference on Information and Knowledge Engineering, IKE 2008
Pages211-216
Number of pages6
Publication statusPublished - 2008
Event2008 International Conference on Information and Knowledge Engineering - Las Vegas, NV, United States
Duration: 14 Jul 200817 Jul 2008

Conference

Conference2008 International Conference on Information and Knowledge Engineering
Abbreviated titleIKE 2008
CountryUnited States
CityLas Vegas, NV
Period14/07/0817/07/08

Keywords

  • Fair acceptance
  • Optimized allocation
  • Optimized path
  • Path sharing
  • Remained areas

Fingerprint Dive into the research topics of 'The "fair acceptance and optimized allocation" algorithm for parking space arrangement'. Together they form a unique fingerprint.

  • Cite this

    Pour, H. B., & Ghomi, H. R. (2008). The "fair acceptance and optimized allocation" algorithm for parking space arrangement. In Proceedings of the 2008 International Conference on Information and Knowledge Engineering, IKE 2008 (pp. 211-216)