A Learning-Augmented Algorithm for the Parking Permit Problem with Three Permit Types

A Learning-Augmented Algorithm for the Parking Permit Problem with Three Permit Types Full article

Conference

XXIII International Conference Mathematical Optimization Theory and Operations Research
30 Jun - 6 Jul 2024 , Омск

Source

Mathematical Optimization Theory and Operations Research : 23rd International Conference, MOTOR 2024, Omsk, Russia, June 30–July 6, 2024, Proceedings
Compilation, Springer Cham. Switzerland.2024. 464 c. ISBN 978-3-031-62792-7.

Journal

Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349

Output data

Year: 2024, Volume: 14766, Pages: 116-126 Pages count : 11 DOI: 10.1007/978-3-031-62792-7_8

Tags

Learning-augmented · Online algorithm · Prediction

Authors

Kharchenko Yaroslav ¹ , Kononov Alexander ²

Affiliations

1	Novosibirsk State University
2	Sobolev Institute of Mathematics

We consider the parking permit problem with three permit types. First, we prove the tight lower bound on the competitiveness of any deterministic online algorithm. Next, we present a learning-augmented algorithm and show its’ consistency and robustness.

Kharchenko Y. , Kononov A.
A Learning-Augmented Algorithm for the Parking Permit Problem with Three Permit Types
In compilation Mathematical Optimization Theory and Operations Research : 23rd International Conference, MOTOR 2024, Omsk, Russia, June 30–July 6, 2024, Proceedings. – Springer Cham., 2024. – C.116-126. – ISBN 978-3-031-62792-7. DOI: 10.1007/978-3-031-62792-7_8 Scopus OpenAlex

Submitted:	Apr 12, 2024
Published print:	Jun 18, 2024
Published online:	Jun 18, 2024

Scopus:	2-s2.0-85198435324
OpenAlex:	W4399743143

Пока нет цитирований