Resources Requirement and Routing in Courier Service

Lin, C. K. Y.

doi:10.5772/5644

Cited by 4 publications

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These types of studies are perhaps most relevant to our study. Vehicle routing with foot carriers (similar to driver helpers) was considered by several studies, including Lin (2008a), Lin (2008b), and Lin (2011). These studies considered a problem that uses two types of delivery resources, foot carriers and a van (which can carry both delivery items and one or more foot couriers).…”

Section: Literature On Last-mile Problemsmentioning

confidence: 99%

The Last Mile: Managing Driver Helper Dispatching for Package Delivery Services

Clottey

2020

J of Business Logistics

View full text Add to dashboard Cite

H iring seasonal driver helpers is one widely used approach by parcel delivery companies to deal with increased home-delivery volumes during peak seasons. Nonetheless, driver helper-related issues have not received much attention in academic research. This study investigates how driver helpers can be utilized in the most effective way by parcel delivery companies. We show that by separating a parcel delivery route into two sub-routes, namely "no-helper" and "with-helper" routes, the utilization rates of driver helpers can be improved, and the carrier cost be reduced considerably. Three main contributions of this study are as follows. First, based on costtrade-off insights, we develop a new mathematical model for the last-mile distribution problem, which we call the Driver Helper Dispatching Problem. Second, using this mathematical model, we perform a series of numerical experiments to identify the conditions under which the proposed "split-route solution" works most or least effectively. Finally, we perform sensitivity analyses to investigate the impact that changes in model parameters, such as fuel cost, would have on study results.

show abstract

Section: Literature On Last-mile Problemsmentioning

confidence: 99%

The Last Mile: Managing Driver Helper Dispatching for Package Delivery Services

Clottey

2020

J of Business Logistics

View full text Add to dashboard Cite

show abstract

“…A majority of the related literature focuses on heuristic algorithms for ConVRPs (e.g., Gro€ er et al (2009), Coelho et al (2012), Kovacs et al (2014a, c), Braekers and Kovacs (2016), Lian et al (2016), Xu and Cai (2018)). To our knowledge, only the studies by Lian (2017) and Goeke et al (2019) present exact algorithms for ConVRPs. Both studies present BP algorithms for the problem, but without the simultaneous pickup and delivery or scheduling elements considered in CRSPD.…”

Section: 14mentioning

confidence: 99%

“…(2016), Xu and Cai (2018)). To our knowledge, only the studies by Lian (2017) and Goeke et al. (2019) present exact algorithms for ConVRPs.…”

Section: Literature Reviewmentioning

confidence: 99%

Consistent Routing and Scheduling with Simultaneous Pickups and Deliveries

Emadikhiav

Bergman

Day

2020

Production and Operations Management

View full text Add to dashboard Cite

W e study the planning and scheduling of order shipments among laboratories of an instrument-calibration company. To address a generic version of the company's combined routing and scheduling problem, we introduce a model variant with simultaneous pickups and deliveries in which consistency of site visits is also desired. We provide alternative formulations of the problem and propose branch-and-check and branch-and-price implementations, with an analysis of the instance characteristics for which each of these algorithms outperforms the other. Using the data collected from the company, our results indicate that the proposed framework can help the company to significantly reduce transportation costs and shipment times. We also investigate the influence of consistency and tardiness bounds on transportation costs, showing that while tardiness bounds significantly increase transportation costs, the enforcement of consistency requirements results in more consistent solutions at only slightly higher cost. The impact of enforcing consistency requirements increases when tighter tardiness bounds are imposed.

show abstract