Αποτελέσματα Αναζήτησης
4 Ιουλ 2016 · In this paper, a new algorithm is proposed for solving MCP in time-varying network by assuming that waiting times at vertices are zero. Moreover, we consider arc capacities are trapezoidal fuzzy numbers.
Zero-waiting load balancing refers to a load balancing algorithm under which a job is routed to an idle server to be processed immediately upon its arrival. The problem has become increasingly important
10 Ιουν 2015 · This section surveys the k-criteria time-varying shortest path with zero waiting times, presents an algorithm for solving the problem and surveys its complexity. Section results presents an example for the mentioned problem.
4 Ιουλ 2016 · In this paper, the maximum capacity path problem in time-varying network is presented, where waiting times at vertices are not allowable. Moreover, the capacities are considered the...
1 Μαΐ 2015 · Shirdel and Rezapour studied a k-objective time-varying shortest path (TVSP) problem, which cannot be combined into a single overall objective [17]. Moreover, they surveyed the TVSP problem...
16 Οκτ 2021 · (1) We propose a wave time-varying neural network framework to solve the time-varying shortest path problem with arbitrary, restricted, or zero waiting polices. The proposed neural network is novel and requires no training.
In this paper, a new algorithm is proposed for solving MCP in time-varying network by assuming that waiting times at vertices are zero. Moreover, we consider arc capacities are trapezoidal fuzzy numbers. The following advantages are obtained by using the proposed algorithm for finding the fuzzy optimal solutions:
