Αποτελέσματα Αναζήτησης
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 study presented k-objective time-varying shortest path problem, where these objectives cannot combined into a single objective. An algorithm was proposed to handle the situation, where waiting times at vertices are zero and its complexity was analyzed.
4 Ιουλ 2016 · Time-varying maximum capacity path problem with zero waiting times and fuzzy capacities. July 2016. SpringerPlus 5 (1):981. DOI: 10.1186/s40064-016-2654-y. License. CC BY 4.0. Authors: G...
1 Μαΐ 2015 · Robust time-varying shortest path with arbitrary waiting time at vertices. Article. Full-text available. Dec 2017. Gholamhassan Shirdel. Hossein Rezapour. ... Gent et al. in [3] solved the...
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:
