Collaborative transportation for attended home deliveries

Abstract

Attended home deliveries (AHDs) are characterized by dynamic customer acceptance and narrow customer-specific delivery time windows. Both impede efficient routing and thus make AHDs very costly. In this article, we explore how established horizontal collaborative transportation planning methods can be adapted to render AHDs more efficient. The general idea is to enable request reallocation between multiple collaborating carriers after the order capture phase. We use an established centralized reallocation framework that allows participating carriers to submit delivery requests for reallocation. We extend this framework for AHD specifics such as the dynamic arrival of customer requests and information about delivery time windows. Using realistic instances based on the city of Vienna, we quantify the collaboration savings by solving the underlying routing and reallocation problems. We show that narrow time windows can lower the savings obtainable by the reallocation by up to 15%. Therefore, we suggest enhancing the decision processes of request selection and request bundling using information about delivery time windows. Our findings demonstrate that adapting methods of request selection and bundle generation to environments with narrow time windows can increase collaboration savings by up to 25% and 35%, respectively in comparison to methods that work well only when no time windows are imposed.