Author
Listed:
- Liu, Yinying
- Shi, Xin
- Liu, Jianmeng
- Qin, Pengjie
- Tang, Cheng
Abstract
The growing trend of e-commerce enterprises establishing their own warehouses has significantly enhanced operational efficiency in urban delivery. This has given rise to the Warehouse-Distribution Integration Routing Problem (WDIRP), a variant of the Vehicle Routing Problem (VRP). However, this type of problem under real-world transport conditions, especially considering multiple time windows and variable loading efficiency, has been insufficiently studied in the existing literature. This research addresses these characteristics to more accurately reflect real-world urban delivery challenges. To solve the problem, we propose a Mixed Integer Linear Programming (MILP) model for the WDIRP with a novel methodological approach to formulate multiple time windows, which can be efficiently solved using IBM ILOG CPLEX Optimization Studio (CPLEX). Additionally, we develop a two-stage heuristic algorithm that incorporates a multi-greedy method and a Variable Neighborhood Search (VNS) method, featuring new problem-specific neighborhood structures. The computational experiments encompass 20 randomly generated small-scale instances, 20 benchmark instances, and 18 realistic instances derived from diverse geographical areas and periods in Chongqing, China. Eighteen larger-scale extended instances are also developed to further test scalability, involving up to 50 warehouses and 500 customers. The realistic instances incorporate real-world transport conditions, including road topology, traffic performance, node distribution, and customer demand, with their corresponding parameters extracted or predicted using big data technologies. Our results demonstrate that the proposed model outperforms common formulations in computational performance, and the two-stage heuristic algorithm is superior to alternative approaches in solving the WDIRP. In addition to presenting results for various instances, we implement a mountainous city simulation model to achieve the 3D simulation of the delivery scheme. The findings provide valuable insights for logistics enterprises aiming to optimize urban delivery operations.
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:203:y:2025:i:c:s1366554525003849. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.