Reinforcement learning methods for discrete and semi-Markov decision problems such as Real-Time Dynamic Programming can be generalized for Controlled Diffusion Processes. The optimal control problem reduces to a boundary value problem for a fully nonlinear second-order elliptic differential equation of HamiltonJacobi-Bellman (HJB-) type. Numerical analysis provides multigrid methods for this ki...

Hub facility location problem looks to find the most appropriate location for deploying such facilities. An important factor in such a problem is the pool of potential locations from which the optimal locations must be selected. The present research was performed to address two key objectives: identifying the factors contributing to the selection locations for hub establishment, and presenting ...

in this paper the conditional location problem is discussed. conditional location problems have a wide range of applications in location science. a new meta-heuristic algorithm for solving conditional p-median problems is proposed and results are compared to those of the previous studies. this algorithm produces much better results than the previous formulations.

In contrast to p-hub problems with a summation objective (p-hub median), minmax hub problems (p-hub center) have not attained much attention in the literature. In this paper, we give a polyhedral analysis of the uncapacitated single allocation p-hub center problem (USApHCP). The analysis will be based on a radius formulation which currently yields the most efficient solution procedures. We show...

This research is motivated by the extraordinary increase in the use of intermodal shipments in recent years for both domestic and global movement of freight. Three mathematical models, which explore the dynamics of intermodal hub-and-spoke networks, are presented. These models use transportation costs, fixed location costs, modal connectivity costs, modal transit times and service time requirem...

Queuing disciplines have now become the subject of intensive discussion in network field. There are several queuing disciplines that claim best performance. In this paper, we evaluate a hypothetical network topology based on multi-class traffic approach. Multi-class traffic provides for aggregate traffic to be classified and conditioned at the edge of the network routers on the basis of perform...

This paper is concerned with a problem of control in the queuing systems. Rather than deal with mean waiting time or average queue length, which is the most often used approach to this problem, it concentrates on transient states and minimizing probability of long queue. First a model of a queuing system with controlled service intensity is analyzed. Subsequently, a system with multiple service...