A reverse Vickrey auction for physical internet (PI) enabled parking management systems

Bing Qing Tan, Su Xiu Xu, Kai Kang, Gangyan Xu, Wei Qin

Research output: Journal article publicationJournal articleAcademic researchpeer-review

11 Citations (Scopus)

Abstract

In this paper, two types of parking spaces, namely public and private parking spaces, are technically allocated to the drivers who may require a long or short time slot. Dynamic allocation and pricing process increase the complexity of evaluating the performance. We design a Physical Internet (PI) enabled parking management system to establish parking networks and collect real-time information for management and evaluation. Then, we propose a truthful, reverse Vickrey auction to allocate and price parking spaces in a static setting. We further incorporate the static auction mechanism into a continuous-time Markov Chain model and analyze the effects of the key factors (e.g., dynamic arrival rate and abandonment rate) in a dynamic setting. Our experimental results show that the expected price of the reverse Vickrey auction is lower than the market price. The expected profit is increasing in the arrival rate of parking spaces in the system. Finally, we numerically examine the benefits of parking space owners, drivers and the system, and highlight the associated managerial implications.

Original languageEnglish
Article number108083
JournalInternational Journal of Production Economics
Volume235
DOIs
Publication statusPublished - May 2021
Externally publishedYes

Keywords

  • Continuous-time Markov chain
  • Parking space assignment
  • Physical internet
  • Pricing
  • Vickrey auction

ASJC Scopus subject areas

  • General Business,Management and Accounting
  • Economics and Econometrics
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Fingerprint

Dive into the research topics of 'A reverse Vickrey auction for physical internet (PI) enabled parking management systems'. Together they form a unique fingerprint.

Cite this