Declarative Representation and Solution of Vehicle Routing with Pickup and Delivery Problem

Bădică, Amelia; Bǎdicǎ, Costin; Leon, Florin; Luncean, Lucian

doi:10.1016/j.procs.2017.05.261

Cited by 10 publications

(1 citation statement)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this context, the search for an optimal periodic distribution policy, i.e., a plan on whom to serve, how much to deliver, and what regularly repeated routes to travel on by what fleet of vehicles, can be viewed as belonging to the class of Vehicle Routing Problem (VRP) [3,4], which are NP-hard problems [5,6]. Moreover, since the policy searched for must be such that a stock out is never caused at any of the customers, the maximum inventory level at the customers is never exceeded and the vehicle capacity is always satisfied, the problem considered is a capacitated and consistent VRP with multi-trip multi-traffic pick-up and delivery with time windows and synchronization, which is a combination of variants of the VRP with multiple trips, the VRP with time windows, and the vehicles with capacitated constraints routing and delivery problem [7].…”

Section: Introductionmentioning

confidence: 99%

Management and Production Engineering Review

Bocewicz,

Bożejko,

Wójcik

et al. 2019

View full text Add to dashboard Cite

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.

show abstract