The Open Vehicle Routing Problem With Time Windows Considering Driver’s Working Hour

Abstract

This paper presents an optimization model for a logistic management called open vehicle routing problem with time windows with driver's working time (OVRPTWWDWT). This is an extension of the classical OVRPTW which considers driver's working time to model the scheduling of the available drivers with respect of the driving time to satisfy customers' demand. The objective is to schedule the delivery according to the driver's working time and to determine the fleet scheduling and the driver's policy in serving the customer, such that to minimize the amount of cost over all the routes within the planning horizon. We propose a tabu search heuristic algorithms approach to solve the problem.