Urban freight distribution/delivery usually leads to traffic congestion, safety concerns, air pollution, and high logistic costs. In recent years, more and more carriers and shippers have recognized the importance of designing efficient distribution strategies to improve the level of customers service and reduce the financial and environmental cost of freight transportation. However, the extensive literature on the classical vehicle routing problem (VRP) and its variants have primarily considered the problem using static traffic information with corresponding constant travel times. In recent years, a number of studies take account of substantial variation in speeds and improve the model by taking the time dependency of travel times into consideration. Therefore, in order to optimize the freight distribution performance in urban settings, both the random and timevarying properties of the link travel times must be considered. In this paper, we refer to the stochastic time-dependent VRP with hard time window (STDVRPTW). The aim of this study is to devise good and computationally efficient approaches to assist the fleet dispatchers operating in an urban congested environment. To utilize available resources for serve timesensitive customers