Jaya Algorithm + Savings + 2-Opt Heuristic for Multi-Objective Capacitated Vehicle Routing Problem with Time Constraints & Heterogeneous Fleet of Vehicles

摘要

Vehicle Routing Problem (VRP) plays a vital role in distribution and logistics. The current work focuses on optimum routing of a fleet of pick-up vehicles that collect parts and components from a large number of suppliers (of consumer durables manufacturer) located in the three municipal corporations' viz., Bruhan Mumbai Municipal Corporation, Navi Mumbai Municipal Corporation & Thane Municipal Corporation and a collection center. The objective is to minimize the total distance travelled, which is directly proportional to the transportation costs and minimizing the number of pick-up vehicles. Dynamic nature of the problem restricts use of exact solution algorithms. The solution is found using Jaya Algorithm (Meta Heuristic Approach - a population-based new efficient optimization method that generates a population of solutions to proceed to the global solution) & Savings Algorithm with 2-opt improvement heuristic.