An algorithm for the fuzzy maximum flow problem
An algorithm for the fuzzy maximum flow problem
The problem of finding the maximum flow between a source and a destination node in a network with uncertainties in its capacities is an important problem of network flows, since it has a wide range of applications in different areas (telecommunications, transportations, manufacturing, etc) and therefore deserves special attention. However, due to complexity in working with this kind of problems, there are a few algorithms in literature, which demand that the user informs the desirable maximum flow, which is difficult when the network is the large scale. In this paper, an algorithm based on the classic algorithm of Ford-Fulkerson is proposed. The algorithm uses the technique of the incremental graph and it does not request that the decision-maker informs the desirable flow, in contrast of the main works of literature. The uncertainties of the parameters are resolved using the fuzzy sets theory.
1-6
Hernandes, Fabio
1315dd71-29de-48d1-9481-6171521ad40c
Lamata, Maria T
e9b1ea2d-8a4f-4fc9-b98a-0fa6e79137f5
Takahashi, Marcia T.
fa084efd-dc46-4325-8fc9-d3f6d1f8b5d0
Yamakami, Akebo
8e244cd5-d564-4ddc-99da-ba0f5e92b365
Verdegay, Jose L
3cefb17f-eb9d-49b1-ae47-7d4041f0a2b6
27 August 2007
Hernandes, Fabio
1315dd71-29de-48d1-9481-6171521ad40c
Lamata, Maria T
e9b1ea2d-8a4f-4fc9-b98a-0fa6e79137f5
Takahashi, Marcia T.
fa084efd-dc46-4325-8fc9-d3f6d1f8b5d0
Yamakami, Akebo
8e244cd5-d564-4ddc-99da-ba0f5e92b365
Verdegay, Jose L
3cefb17f-eb9d-49b1-ae47-7d4041f0a2b6
Hernandes, Fabio, Lamata, Maria T, Takahashi, Marcia T., Yamakami, Akebo and Verdegay, Jose L
(2007)
An algorithm for the fuzzy maximum flow problem.
In 2007 IEEE International Fuzzy Systems Conference.
IEEE.
.
(doi:10.1109/FUZZY.2007.4295464).
Record type:
Conference or Workshop Item
(Paper)
Abstract
The problem of finding the maximum flow between a source and a destination node in a network with uncertainties in its capacities is an important problem of network flows, since it has a wide range of applications in different areas (telecommunications, transportations, manufacturing, etc) and therefore deserves special attention. However, due to complexity in working with this kind of problems, there are a few algorithms in literature, which demand that the user informs the desirable maximum flow, which is difficult when the network is the large scale. In this paper, an algorithm based on the classic algorithm of Ford-Fulkerson is proposed. The algorithm uses the technique of the incremental graph and it does not request that the decision-maker informs the desirable flow, in contrast of the main works of literature. The uncertainties of the parameters are resolved using the fuzzy sets theory.
This record has no associated files available for download.
More information
Published date: 27 August 2007
Venue - Dates:
2007 IEEE International Fuzzy Systems Conference, , London, United Kingdom, 2007-07-23 - 2007-07-26
Identifiers
Local EPrints ID: 455611
URI: http://eprints.soton.ac.uk/id/eprint/455611
PURE UUID: 008967cc-3102-4c72-95fc-69dffdbe5d10
Catalogue record
Date deposited: 29 Mar 2022 16:39
Last modified: 17 Mar 2024 04:09
Export record
Altmetrics
Contributors
Author:
Fabio Hernandes
Author:
Maria T Lamata
Author:
Akebo Yamakami
Author:
Jose L Verdegay
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics
