Reducing the Minimal Fleet Size by Delaying Individual Tasks

Research output: Contribution to journalArticleScientificpeer-review

14 Downloads (Pure)

Abstract

This work formally defines the problem of fleet sizing with delays (FSD), where the option of delaying individual tasks within fleet sizing is considered. We prove that the FSD problem is NP-hard and solve a formulation of the FSD problem as a mixed integer linear problem (MILP). We then analyze the proposed method in detail in an abstract case and validate it in a case study of taxi rides in Manhattan. We show that fleet sizes can be decreased significantly and that the trade-off space of the number of required vehicles to execution time and added delay can be enlarged.

Original languageEnglish
Pages (from-to)11011-11022
Number of pages12
JournalIEEE Transactions on Intelligent Transportation Systems
Volume25
Issue number9
DOIs
Publication statusPublished - 2024

Bibliographical note

Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care
Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.

Keywords

  • multi-agent systems
  • multi-robot systems
  • optimal scheduling
  • Smart transportation
  • vehicle routing

Fingerprint

Dive into the research topics of 'Reducing the Minimal Fleet Size by Delaying Individual Tasks'. Together they form a unique fingerprint.

Cite this