Developing Feasible Search Approach For Tackling Large Vehicle Routing Problem With Time Window Considering Service Disruption

In logistic system, a Vehicle Routing Problem with time windows (VRPTW) is defined as a problem to decide the optimal set of logistic routes used by homogeny vehicles to deliver customers' demand within scheduled service time. The objective is to minimize the total travel cost (related to the travel times or distances) and operational cost (related to the number of vehicles used). In this paper we address a variant of the VRPTW in which the time to deliver and the time departing from a customer are restricted. The problem also include service disruption. We use integer programming model to describe the problem. A feasible neighbourhood approach is proposed to solve the model.