GPU-based approach to large scale dynamic vehicle routing problem Online publication date: Mon, 21-Feb-2022
by Achraf Berrajaa; Abdelhamid Benaini
International Journal of Logistics Systems and Management (IJLSM), Vol. 41, No. 1/2, 2022
Abstract: Vehicle routing problems (VRPs) are fundamental optimisation problems of transportation systems. In the real-world, VRPs are dynamic in the sense that new customers' requests continuously arrive over time, after a number of vehicles have already started their tours. Dynamic VRPs (DVRPs) require making decisions as fast as possible. This needs resolution methods with high computational efficiency especially for problems with a large number of customers. The aim of this paper is to attempt to achieve this objective. For this, we design a genetic algorithm for the DVRP and we implement it on GPU. The proposed approach inserts new requests into already planned routes then it optimises the resulting solution via genetic operators. To our knowledge, this is the first attempt to solve large DVRP on the GPU using evolutionary algorithm and seems to be efficient according to the experimental results on some published benchmarks and on our large instances (up to 10,000 nodes).
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Logistics Systems and Management (IJLSM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook