OASIcs.ATMOS.2023.18.pdf
- Filesize: 0.5 MB
- 6 pages
Document
Simple Policies for Capacitated Resupply Problems (Short Paper)
Authors
Mette Wagenvoort 
,
Martijn van Ee ,
Paul Bouman ,
Kerry M. Malone
-
Part of:
Volume:
23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023)
Series: Open Access Series in Informatics (OASIcs)
Conference: Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2023-08-31
File
Document Identifiers
Author Details
- Faculty of Military Sciences, Netherlands Defence Academy, Den Helder, The Netherlands
Cite AsGet BibTex
Mette Wagenvoort, Martijn van Ee, Paul Bouman, and Kerry M. Malone. Simple Policies for Capacitated Resupply Problems (Short Paper). In 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023). Open Access Series in Informatics (OASIcs), Volume 115, pp. 18:1-18:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/OASIcs.ATMOS.2023.18
https://doi.org/10.4230/OASIcs.ATMOS.2023.18
Abstract
We consider the Capacitated Resupply Problem in which locations with a given demand rate should be resupplied by vehicles such that they do not run out of stock and the number of vehicles is minimised. Compared to related problems, we consider the scenario where the payload of the vehicles may not suffice to bring the stock level back to full capacity. We focus on the Homogeneous Capacitated Resupply Problem and present both simple policies that provide 2-approximations and an optimal greedy policy that runs in pseudo-polynomial time.
Subject Classification
ACM Subject Classification
- Applied computing → Transportation
Keywords
- resupply problems
- periodic schedules
- approximation guarantee
- greedy policy
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
-
Edgar Arribas, Vicent Cholvi, and Vincenzo Mancuso. Optimizing uav resupply scheduling for heterogeneous and persistent aerial service. IEEE Transactions on Robotics, 2023.
-
Amotz Bar-Noy and Richard E Ladner. Windows scheduling problems for broadcast systems. SIAM Journal on Computing, 32(4):1091-1113, 2003.
-
Sofie Coene, Frits C. R. Spieksma, and Gerhard J. Woeginger. Charlemagne’s challenge: The periodic latency problem. Operations Research, 59(3):674-683, 2011.
-
Robert Holte, Al Mok, Louis Rosier, Igor Tulchinsky, and Donald Varvel. The pinwheel: A real-time scheduling problem. In Proceedings of the 22th Annual Hawaii International Conference on System Sciences, volume 2, pages 693-702, 1989.
-
Tobias Jacobs and Salvatore Longo. A new perspective on the windows scheduling problem. arXiv preprint arXiv:1410.7237, 2014.