in this paper, we consider a stochastic time-cost tradeoff problem (tctp) in pert networks for project management, in which all activities are subjected to a linear cost function and assumed to be exponentially distributed. the aim of this problem is to maximize the project completion probability with a pre-known deadline to a predefined probability such that the required additional cost is min...

We analyze a class of stochastic and dynamic vehicle routing problems in which demands arrive randomly over time and the objective is minimizing waiting time. In our previous work ([6], [7]), we analyzed this problem for the case of uniformly distributed demand locations and Poisson arrivals. In this paper, using quite different techniques, we are able to extend our results to the more realisti...

The optimal reactive power dispatch (ORPD) is a very important problem aspect of power system planning and is a highly nonlinear, non-convex optimization problem because consist of both continuous and discrete control variables. Since the power system has inherent uncertainty, hereby, this paper presents both of the deterministic and stochastic models for ORPD problem in multi objective and sin...

In this paper, we introduce a model  to optimization of milk run system that is one of VRP problem with time window and uncertainty in inventory. This approach led to the routes with minimum cost of transportation while satisfying all inventory in a given bounded set of uncertainty .The problem is formulated as a robust optimization problem. Since the resulted problem illustrates that grows up ...

Transportation planning has been established as a key topic in the literature and practices of social production, especially urban contexts. To consider traffic environment factors, more researchers are taking time-varying factors into account when scheduling their logistic activities. The time-dependent vehicle routing problem (TDVRP) is an extension classical Vehicle Routing Problem with Time...