in static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. in this paper, the static scheduling problem of automated guided vehicles in container terminal is solved by the network simplex algorithm (nsa). the algorithm is based on graph model and their performances are at least 100 times faster than traditional si...

this article addresses an efficient and novel method for singularity-free path planning and obstacle avoidance of parallel manipulator based on neural networks. a modified 4-5-6-7 interpolating polynomial is used to plan a trajectory for a spherical parallel manipulator. the polynomial function which is smooth and continuous in displacement, velocity, acceleration and jerk is used to find a pat...

We develop the first results on the local sensitivity analysis for the solution of a broad class of equality-constrained convex network optimization problems when perturbations are made on the constraints. In the context of the minimum-cost network flow problem — a paradigm in the theory of optimization — these results suggest a notion of decay of correlation for constrained optimization proced...

While a significant amount of traffic will migrate from mobile to fixed networks, a much greater amount of traffic will migrate from fixed to mobile networks. In many countries mobile operators are offering mobile broadband services at prices and speeds comparable to fixed broadband. Though there are often data caps on mobile broadband services that are lower than those of fixed broadband, some...