Cargando…
Time-varying maximum capacity path problem with zero waiting times and fuzzy capacities
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 generalized trapezoidal fuzzy number. An exact algorithm is proposed which can find a optimal solution of problem subj...
Autores principales: | Shirdel, G. H., Rezapour, H. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer International Publishing
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4932022/ https://www.ncbi.nlm.nih.gov/pubmed/27429890 http://dx.doi.org/10.1186/s40064-016-2654-y |
Ejemplares similares
-
Path-planning with waiting in spatiotemporally-varying threat fields
por: Cooper, Benjamin S., et al.
Publicado: (2018) -
Predicted waiting times for orthopaedic surgery: an urgent need to address the deficit in capacity
por: Farrow, Luke, et al.
Publicado: (2022) -
The shortest path problem in the stochastic networks with unstable topology
por: Shirdel, Gholam H., et al.
Publicado: (2016) -
Demand and capacity in an ADHD team: reducing the wait times for an ADHD assessment to 12 weeks
por: Roughan, Laura Ann, et al.
Publicado: (2019) -
Estimation of equilibrium times and maximum capacity of adsorption of heavy metals by E. crassipes (review)
por: Sayago, Uriel Fernando Carreño, et al.
Publicado: (2020)