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: | , |
---|---|
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 |
_version_ | 1782440990237261824 |
---|---|
author | Shirdel, G. H. Rezapour, H. |
author_facet | Shirdel, G. H. Rezapour, H. |
author_sort | Shirdel, G. H. |
collection | PubMed |
description | 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 subject to the time of path is at most T, where T is a given time horizon. |
format | Online Article Text |
id | pubmed-4932022 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2016 |
publisher | Springer International Publishing |
record_format | MEDLINE/PubMed |
spelling | pubmed-49320222016-07-16 Time-varying maximum capacity path problem with zero waiting times and fuzzy capacities Shirdel, G. H. Rezapour, H. Springerplus Research 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 subject to the time of path is at most T, where T is a given time horizon. Springer International Publishing 2016-07-04 /pmc/articles/PMC4932022/ /pubmed/27429890 http://dx.doi.org/10.1186/s40064-016-2654-y Text en © The Author(s) 2016 Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. |
spellingShingle | Research Shirdel, G. H. Rezapour, H. Time-varying maximum capacity path problem with zero waiting times and fuzzy capacities |
title | Time-varying maximum capacity path problem with zero waiting times and fuzzy capacities |
title_full | Time-varying maximum capacity path problem with zero waiting times and fuzzy capacities |
title_fullStr | Time-varying maximum capacity path problem with zero waiting times and fuzzy capacities |
title_full_unstemmed | Time-varying maximum capacity path problem with zero waiting times and fuzzy capacities |
title_short | Time-varying maximum capacity path problem with zero waiting times and fuzzy capacities |
title_sort | time-varying maximum capacity path problem with zero waiting times and fuzzy capacities |
topic | Research |
url | 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 |
work_keys_str_mv | AT shirdelgh timevaryingmaximumcapacitypathproblemwithzerowaitingtimesandfuzzycapacities AT rezapourh timevaryingmaximumcapacitypathproblemwithzerowaitingtimesandfuzzycapacities |