Milk-run routing and scheduling subject to a trade-off between vehicle fleet size and storage capacity

• Published in: Management and Production Engineering Review Vol. 10; no. 3
• Main Authors: Bocewicz, Grzegorz, Bożejko, Wojciech, Wójcik, Robert, Banaszak, Zbigniew
• Format: Journal Article
• Language: English
• Published: Warsaw Polish Academy of Sciences 01.09.2019
• Subjects: Computer science; Process engineering; Replenishment; Route selection; Scheduling; Storage capacity; Tradeoffs; Traffic congestion; Vehicles; Windows (intervals); Work stations
• ISSN: 2080-8208; 2082-1344
• DOI: 10.24425/mper.2019.129597

The objective of the milk-run design problem considered in this paper is to minimize transportation and inventory costs by manipulating fleet size and the capacity of vehicles and storage areas. Just as in the case of an inventory routing problem, the goal is to find a periodic distribution policy with a plan on whom to serve, and how much to deliver by what fleet of tugger trains travelling regularly on which routes. This problem boils down to determining the trade-off between fleet size and storage capacity, i.e. the size of replenishment batches that can minimize fleet size and storage capacity. A solution obtained in the declarative model of the milk-run system under discussion allows to determine the routes for each tugger train and the associated delivery times. In this context, the main contribution of the present study is the identification of the relationship between takt time and the size of replenishment batches, which allows to determine the delivery time windows for milkrun delivery and, ultimately, the positioning of trade-off points. The results show that this relationship is non-linear.