A Multicircle Order Acceptance Strategy for Dynamic Vehicle Routing Problems Considering Customer Choice of Last-Mile Delivery Modes and Time Slots | IGI Global Scientific Publishing
Welcome to the InfoSci Platform
Reference Hub1
A Multicircle Order Acceptance Strategy for Dynamic Vehicle Routing Problems Considering Customer Choice of Last-Mile Delivery Modes and Time Slots

A Multicircle Order Acceptance Strategy for Dynamic Vehicle Routing Problems Considering Customer Choice of Last-Mile Delivery Modes and Time Slots

Hanguang Qiu, Cejun Cao, Jie Zhen, Hongyong Fu, Jixiang Zhou
Copyright: © 2021 |Volume: 14 |Issue: 4 |Pages: 19
ISSN: 1935-5726|EISSN: 1935-5734|EISBN13: 9781799859932|DOI: 10.4018/IJISSCM.2021100101
Cite Article Cite Article

MLA

Qiu, Hanguang, et al. "A Multicircle Order Acceptance Strategy for Dynamic Vehicle Routing Problems Considering Customer Choice of Last-Mile Delivery Modes and Time Slots." IJISSCM vol.14, no.4 2021: pp.1-19. https://doi.org/10.4018/IJISSCM.2021100101

APA

Qiu, H., Cao, C., Zhen, J., Fu, H., & Zhou, J. (2021). A Multicircle Order Acceptance Strategy for Dynamic Vehicle Routing Problems Considering Customer Choice of Last-Mile Delivery Modes and Time Slots. International Journal of Information Systems and Supply Chain Management (IJISSCM), 14(4), 1-19. https://doi.org/10.4018/IJISSCM.2021100101

Chicago

Qiu, Hanguang, et al. "A Multicircle Order Acceptance Strategy for Dynamic Vehicle Routing Problems Considering Customer Choice of Last-Mile Delivery Modes and Time Slots," International Journal of Information Systems and Supply Chain Management (IJISSCM) 14, no.4: 1-19. https://doi.org/10.4018/IJISSCM.2021100101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

A multicircle order acceptance strategy was proposed to decide whether to accept customer requests for specific last-mile delivery modes (including attended home or reception box delivery) and time slots. The strategy was composed of initializing acceptable time slot allocations, reallocating acceptable time slots, matching reference sites, and assessing time slot deviations. A strategy-oriented insertion algorithm for dynamic vehicle routing problems with hard time windows was constructed, thereby showing the proposed strategy achieves a better balance between revenue and distance than the “first come and first served” strategy. Always accepting global optimization result is not significantly better than adopting the result conditionally or based on simulated annealing theory. The distance and revenue gradually increase with the number of reference sites, while revenue/distance ratio decreases. The vehicles are available to serve more attended home delivery orders with a gradual increase in time slot interval, thereby leading to an increase of AHD and total revenue.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global Scientific Publishing bookstore.