ITSC 2024 Paper Abstract

Close

Paper WeBT11.2

Kronmueller, Maximilian (Delft University of Technology), Fielbaum, Andres (University of Sydney), Alonso-Mora, Javier (Delft University of Technology)

Fleet Sizing for the Flash Delivery Problem from Multiple Stores: A Case Study in Amsterdam

Scheduled for presentation during the Regular Session "Intelligent Logistics" (WeBT11), Wednesday, September 25, 2024, 14:50−15:10, Salon 19/20

2024 IEEE 27th International Conference on Intelligent Transportation Systems (ITSC), September 24- 27, 2024, Edmonton, Canada

This information is tentative and subject to change. Compiled on October 3, 2024

Keywords Intelligent Logistics, Public Transportation Management, Theory and Models for Optimization and Control

Abstract

In this paper, we present an approach for fleet sizing in the context of flash delivery, a time-sensitive delivery service that requires the fulfilment of customer requests in minutes. Our approach effectively combines individual delivery requests into groups and generates optimized operational plans that can be executed by a single vehicle or autonomous robot. The groups are formed using a modified routing approach for the flash delivery problem. Combining the groups into operational plans is done by solving an integer linear problem. To evaluate the effectiveness of our approach, we compare it against three alternative methods: fixed vehicle routing, non-pooled deliveries and a strategy encouraging the pooling of requests. The results demonstrate the value of our proposed approach, showcasing its ability to optimize the fleet size and improve operational efficiency. Our experimental analysis is based on a real-world dataset provided by a Dutch retailer, allowing us to gain valuable insights into the design of flash delivery operations and to analyze the effect of the maximum allowed delay, the number of stores to pick up goods from and the employed cost functions.

 

 

All Content © PaperCept, Inc.


This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2024 PaperCept, Inc.
Page generated 2024-10-03  03:44:30 PST  Terms of use