A GOAL PROGRAMMING APPROACH TO SOLVE VEHICLE ROUTING PROBLEM USING LINGO

Vehicle routing problem (VRP) which discusses a set of routes for some vehicles, starting and ending at a depot, serving a set of customers such that each customer must be visited once by exactly one vehicle, and having a time constrain is called vehicle routing problem with time window (VRPTW). This paper presents a goal programming approach to solve VRP, especially VRPTW. We have considered an objective function with four main goals: to maximize utilization of vehicle capacity, to minimize the total waiting time, to minimize the total cost to serve the customers and to maximize the number of served customers. The proposed model was implemented and has been solved numerically using LINGO software and the optimal solution is presented.