Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Nasser A. El-Sherbeny"'
Autor:
Nasser A. El-Sherbeny
Publikováno v:
Journal of Mathematical Sciences: Advances and Applications. 55:1-20
Autor:
Nasser A. El-Sherbeny
Publikováno v:
Journal of Mathematical Sciences: Advances and Applications. 43:1-18
Autor:
Nasser A. El-Sherbeny
Publikováno v:
Applied Mathematics. :2764-2770
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
Autor:
Nasser A. El-Sherbeny
Publikováno v:
American Journal of Mathematical and Management Sciences. 31:55-71
The Vehicle Routing Problem (VRP) is a well-known combinatorial optimization problem. The classical definitions of vehicle routing problems often lack handling of uncertain parameters and flexibility of constraints. The most popular approaches to the
Autor:
Nasser A. El-Sherbeny
Publikováno v:
Journal of King Saud University - Science. 22:123-131
In this paper, we present a review with some limited of exacts, heuristics and metaheuristics methods for the vehicle routing problem time windows (VRPTW). Over the past 20 years vehicle routing problem with time windows has been an area of research