Journal
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
Volume 140, Issue -, Pages -Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.tre.2020.101955
Keywords
Vehicle routing; Synchronization; Split delivery; Multiple time windows; Branch and price and cut
Categories
Funding
- National Natural Science Foundation of China [71971090, 71531009, 71501075, 71571077, 71821001]
- Natural Science Foundation of Guangdong Province [2015A030306007]
- Fundamental Research Funds for the Central Universities [2019ZD15]
Ask authors/readers for more resources
This study addresses a vehicle routing problem (VRP) in which demands are discrete, split delivery is allowed, service time is proportional to the units of delivered products, multiple time windows are provided and the demand of each customer must be delivered in only one time window (this requirement is termed synchronization constraint). We formulate this problem into a three-index vehicle-flow model and a set-covering model. Then, we propose a branch-and-price-and-cut algorithm to solve the problem. We compare our branch-and-price-and-cut algorithm with CPLEX based on 252 randomly generated instances and the computational results demonstrate the effectiveness of our algorithm.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available