Simple Policies for Capacitated Resupply Problems

Mette Wagenvoort, Martijn Van Ee, Paul Bouman, Kerry M. Malone

Research output: Chapter/Conference proceedingConference proceedingAcademicpeer-review

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.

Original languageEnglish
Title of host publication23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2023
EditorsDaniele Frigioni, Philine Schiewe
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959773027
DOIs
Publication statusPublished - Sept 2023
Event23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2023 - Amsterdam, Netherlands
Duration: 7 Sept 20238 Sept 2023

Publication series

SeriesOpenAccess Series in Informatics
Volume115
ISSN2190-6807

Conference

Conference23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2023
Country/TerritoryNetherlands
CityAmsterdam
Period7/09/238/09/23

Bibliographical note

Publisher Copyright:
© 2023 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.

Fingerprint

Dive into the research topics of 'Simple Policies for Capacitated Resupply Problems'. Together they form a unique fingerprint.

Cite this