Dynamic Priority-Aging Based Multi-Objective Parking Slot Assignment (DPA-MOSA)

The problem with efficient parking allocation is that multiple users want to park at a limited number of parking positions, particularly when demand is high. A framework named Dynamic Priority-Aging Based Multi-Objective Parking Slot Assignment (DPA-MOSA) is proposed in this paper that considers the waiting time of the user as priority to mitigate starvation effect and enhance the fairness of the system. It dynamically updates priority based on initial priority and accumulated waiting time and takes the slot distance, utilization and fairness into consideration during assignment. The assignment problem is formulated under the constraints of one user to one slot and solved with Hungarian algorithm. The experimental evaluation compares the proposed framework with FCFS, nearest-slot, priority-only, and optimization-based allocation strategies using average waiting time, starvation rate, Jain's Fairness Index, and parking-slot utilization. Under the selected parameter configuration, DPA-MOSA achieves an average waiting time of 4.05 minutes, a starvation rate of 3.5%, a Jain's Fairness Index of 0.95, and slot utilization of 91.2%. The results indicate that integrating priority aging and allocation-history-based fairness into a multi-objective assignment formulation can improve parking allocation performance under varying demand conditions.

Authors

Institutions

Publication Details

Journal
Journal of Applied Science and Technology Trends
Published
2026-11-20
DOI
https://doi.org/10.38094/jastt721277
Primary Topic
Smart Parking Systems Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Dynamic Priority-Aging Based Multi-Objective Parking Slot Assignment (DPA-MOSA)

Padmini Debbarma, Rajesh Kumar Verma, Telukuntla Kavya, Manju D
1 links
Journal of Applied Science and Technology Trends
Smart Parking Systems Research
article

Dynamic Priority-Aging Based Multi-Objective Parking Slot Assignment (DPA-MOSA)

Padmini Debbarma, Rajesh Kumar Verma, Telukuntla Kavya, Manju D
article en

Abstract

The problem with efficient parking allocation is that multiple users want to park at a limited number of parking positions, particularly when demand is high. A framework named Dynamic Priority-Aging Based Multi-Objective Parking Slot Assignment (DPA-MOSA) is proposed in this paper that considers the waiting time of the user as priority to mitigate starvation effect and enhance the fairness of the system. It dynamically updates priority based on initial priority and accumulated waiting time and takes the slot distance, utilization and fairness into consideration during assignment. The assignment problem is formulated under the constraints of one user to one slot and solved with Hungarian algorithm. The experimental evaluation compares the proposed framework with FCFS, nearest-slot, priority-only, and optimization-based allocation strategies using average waiting time, starvation rate, Jain's Fairness Index, and parking-slot utilization. Under the selected parameter configuration, DPA-MOSA achieves an average waiting time of 4.05 minutes, a starvation rate of 3.5%, a Jain's Fairness Index of 0.95, and slot utilization of 91.2%. The results indicate that integrating priority aging and allocation-history-based fairness into a multi-objective assignment formulation can improve parking allocation performance under varying demand conditions.

Journal of Applied Science and Technology Trends
Vallurupalli Nageswara Rao Vignana Jyothi Institute of Engineering and Technology (IN), Institute of Chartered Financial Analysts of India (IN)
Sustainable cities and communities
Smart Parking Systems Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon