Optimization of Multi Objective Vehicle Routing Problem with Time Windows using Total Time Balance

Abstract

Vehicle Routing Problem time window (VRPW) used in supply chain management in the physical delivery of goods and services, and the determination of all routes for a fleet of vehicles, starting and ending at a depot and serving customers with known demands by increasing the efficiency and profitability of transportation systems. The main objective of this study is to refutes a multi-objective vehicle routing problem with time windows by minimization of the number of vehicles, the total distance traveled and rout balance not sufficient instead of using 'total time balance'. To test the performance of the objective it considers GA with the fitness Aggregation approach comparing with the related literature based on Solomon’s benchmark instance standard data. The time makespan produced by FAGA and the time makespan mentioned in related literature is compared. From the result, fitness Aggregation approach with genetic algorizim (FAGA) provides better result including the real-time window as compared to previous work .