A bi-objective latency based vehicle routing problem using hybrid GRASP-NSGAII algorithm

ABSTRACT This paper proposes a bi-objective capacitated vehicle routing problem with two types of customers based on priority. The priority customers must be served earlier compared to non-priority customers. This paper aims to minimize the total distance traveled by all the vehicles and minimize customers’ average latency. This paper considers three scenarios for the average latency calculation based on the customer type. In the first scenario, this paper considers only priority customers’ average latency. The second scenario considers the latency of all customers, ignoring the priority. The third scenario considers the average latency of all customers, but priority customers must be served first. A hybrid metaheuristic based on Greedy Randomized Adaptive Search Procedure (GRASP) and Non-dominated Sorting Genetic Algorithm (NSGAII) is developed to solve the proposed model. The proposed model is solved for some of the benchmark data sets from VRP literature, and finally, the results are analyzed with the help of some performance metrics.