A vehicle routing system to solve a periodic vehicle routing problem for a food chain in Hong Kong

Authors:
Jianfeng Zhu;Wenbin Zhu;Chan Hou Che;Andrew Lim
Affiliations:
School of Computer Science & Engineering, South China University of Technology, Guangzhou, China;Red Jasper Limited, Shatin, New Territories, Hong Kong;Red Jasper Limited, Shatin, New Territories, Hong Kong;School of Computer Science & Engineering, South China University of Technology, Guangzhou, China and Red Jasper Limited, Shatin, New Territories and Hong Kong University of Science and Technology, ...
Venue:
IAAI'08 Proceedings of the 20th national conference on Innovative applications of artificial intelligence - Volume 3
Year:
2008

Citing 2
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we describe the system that we have developed to solve a new variant of the periodic vehicle routing problem with time windows (PVRPTW) for one of the largest food and restaurant chains in Hong Kong. The extension is to limit the number of drivers that any store should see during the fixed period. We name this constraint as limited visiting quota (LVQ). We devise a new method to solve this problem. Our experimental results indicate that our method is able to reduce the number of vehicles used by 23% and thus bring substantial savings to our client. The solver has been integrated into an existing vehicle routing product called VROOM for the daily usage of our client.