Read full paper at: http://www.scirp.org/journal/PaperInformation.aspx?PaperID=50798#.VE3cR1fHRK0 Author(s) Nasser A. El-Sherbeny 1,2 Affiliation(s) 1 Mathematics Department, Faculty of Science, Al-Azhar University, Cairo, Egypt . 2 Mathematics Department, Faculty of Applied Medical Science, Taif University, Turabah, KSA . ABSTRACT In this paper, we present a new algorithm of the time-dependent shortest path problem with time windows. Give a directed graph , where V is a set of nodes, E is a set of edges with a non-negative transit-time function . For each node , a time window within which the node may be visited and , is non-negative of the service and leaving time of the n...
Scientific Research Publishing