Examining the impact of transfers in pickup and delivery systems

Abstract: As an attractive feature for modern transportation systems, the potential of the transfers capability (the load/passenger transfer between the two vehicles in its route) in reducing costs, increasing customer satisfaction and increasing the flexibility of the system, has been approved. But how profitable it could be under different circumstances? In other words, to which factors its influence depends on? what are its benefits versus its costs? The present research aimed to give a relatively comprehensive answer to these questions using a mathematical model of the pickup and delivery system with transfers. According to the model results under different situations, many factors such as modeling assumptions, system goals, transportation network scheme, vehicle fleet in terms of capacity, cost rate, and time window of activity and requests in terms of the length (direct distance between the pickup and delivery points), time windows and the volume to vehicle capacity ratio, affect the transfers benefits. As the small-scale numerical results indicate, we have an average of 5.7% reduction in the trip cost under normal conditions, which increases with the heterogeneity of vehicles, shorter time windows, and an increase in the length of the request. On the other hand, it is expected that profitability increases by problem size.

How to cite this paper

 Shiri, H., Rahmani, M & Bafruei, M. (2020). Examining the impact of transfers in pickup and delivery systems.Uncertain Supply Chain Management, 8(1), 207-224.

Refrences

Bouros, P., Sacharidis, D., Dalamagas, T., & Sellis, T. (2011). Dynamic Pickup and Delivery with Transfers. Advances in Spatial and Temporal Databases (pp. 112–129).
Coltin, B., & Veloso, M. M. (2014). Scheduling for Transfers in Pickup and Delivery Problems with Very Large Neighborhood Search. AAAI, 2250–2256.
Cortés, C. E., Matamala, M., & Contardo, C. (2010). The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method. European Journal of Operational Research, 200(3), 711–724.
Godart, A., Manier, H., Bloch, C., & Manier, M.-A. (2018). MILP for a Variant of Pickup & Delivery Problem for both Passengers and Goods Transportation. 2018 IEEE International Conference on Systems, Man, and Cybernetics (SMC), 2692–2698. IEEE.
Gørtz, I. L., Nagarajan, V., & Ravi, R. (2009). Minimum makespan multi-vehicle dial-a-ride. In Algorithms-ESA 2009 (pp. 540–552).
Kerivin, H. L. M., Lacroix, M., Mahjoub, A. R., & Quilliot, A. (2008). The splittable pickup and delivery problem with reloads. European Journal of Industrial Engineering, 2(2), 112–133.
Li, H., & Lim, A. (2003). A metaheuristic for the pickup and delivery problem with time windows. International Journal on Artificial Intelligence Tools, 12(02), 173–186.
Lotfi, S., Abdelghany, K., & Hashemi, H. (2019). Modeling Framework and Decomposition Scheme for On-Demand Mobility Services with Ridesharing and Transfer. Computer-Aided Civil and Infrastructure Engineering, 34(1), 21–37.
Masson, R., Lehuédé, F., & Péton, O. (2013a). An adaptive large neighborhood search for the pickup and delivery problem with transfers. Transportation Science, 47(3), 344–355.
Masson, R., Lehuédé, F., & Péton, O. (2013b). Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers. Operations Research Letters, 41(3), 211–215.
Masson, R., Lehuédé, F., & Péton, O. (2014). The Dial-A-Ride Problem with Transfers. Computers & Operations Research, 41, 12–23.
Masson, R., Lehuédé, F., Péton, O., & others. (2011). A tabu search algorithm for the Dial-a-Ride Problem with Transfers. Proceedings of the IESM 2011 Conference.
Mitrović-Minić, S., & Laporte, G. (2006). The pickup and delivery problem with time windows and transshipment. INFOR: Information Systems and Operational Research, 44(3), 217–227.
Mues, C., & Pickl, S. (2005). Transshipment and time windows in vehicle routing. 8th International Symposium on Parallel Architectures,Algorithms and Networks, 2005. ISPAN 2005.
Nakao, Y., & Nagamochi, H. (2008). Worst Case Analysis for Pickup and Delivery Problems with Transfer. IEICE Trans. Fundam. Electron. Commun. Comput. Sci., E91-A(9), 2328–2334.
Qu, Y., & Bard, J. F. (2012). A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment. Computers & Operations Research, 39(10), 2439–2456.
Rais, A., Alvelos, F., & Carvalho, M. S. (2014). New mixed integer-programming model for the pickup-and-delivery problem with transshipment. European Journal of Operational Research, 235(3), 530–539.
Sampaio Oliveira, A. H., Savelsbergh, M. W., Veelenturf, L. P., & van Woensel, T. (2018). The benefits of transfers in crowdsourced pickup-and-delivery systems.
Shang, J. S., & Cuff, C. K. (1996). Multicriteria pickup and delivery problem with transfer opportunity. Computers & Industrial Engineering, 30(4), 631–645.
Thangiah, S. R., Fergany, A., & Awan, S. (2007). Real-time split-delivery pickup and delivery time window problems with transfers. Central European Journal of Operations Research, 15(4), 329–349.

Journals

USCM Volumes

Keywords

Authors

Countries

Uncertain Supply Chain Management

Examining the impact of transfers in pickup and delivery systems Pages 207-224 Download PDF

Add Reviews