A multi-objective vehicle routing and scheduling problem with uncertainty in customers request and priority
In this paper, a multi-objective vehicle routing and scheduling problem with uncertainty in priority and request of customers is presented. In the proposed model, a set of dynamic requests is received over time, and the planner does not have any information regarding their location and size until they arrive. Moreover, the routing model aims to satisfy different customers according to their specific time windows which were predefined by an expert as (being very important, important, casual or unimportant). This paper uses the proposed model as a multi-objective problem where the total required number of vehicles, the total distance travelled and the waiting time imposed on vehicles are minimized, and the total customers satisfaction for service is maximized. An efficient framework for solving this model is designed and its performance is evaluated in different steps for various test problems generalized from Solomons VRPTW benchmark problems. The various heuristics and improvement concepts incorporate local exploitation in the evolutionary search, and the concept of Pareto optimality for the multi-objective optimization is used in the proposed procedure. The computational experiments on data sets illustrate the efficiency and effectiveness of the proposed approach.
vehicle routing and scheduling problem multi-objective optimization uncertainty in request satisfaction level