Evolutionary algorithm for the bi-objective green vehicle routing problem with time windows
Authors :
V. Bugcy Mettilda 1 * and N. Meenal 2
Author Address :
1,2 Department of Mathematics, JJ College of Arts and Science Autonomous, [Affiliated to Bharathidasan University, Tiruchirappalli-620024, India.] Pudukkottai-622422, Tamil Nadu, India.
Abstract :
The optimization of bi-objective vehicle routing problem has become a research hotspot in recent decades. In this paper, the bi-objective vehicle routing problem with time windows [BO-VRPTW] is proposed based on the existing research and a bi-objective mathematical model is formulated. This work gives focus on a bi-objective VRPTW to minimize both total distance and time balance of the routes. The main objective of this paper is to find the lowest --cost set of routes to deliver demand using identical vehicles with limited capacity to customers with fixed service time windows. This algorithm is applied for a publicly available set of benchmark instances, resulting in solutions which are better than others previously published.
Keywords :
Vehicle Routing Problem with time windows, Bi-objective optimization, Evolutionary Algorithm, Genetic Algorithms.
DOI :
Article Info :
Received : October 13, 2020; Accepted : December 21, 2020.
