IJPAM: Volume 116, No. 4 (2017)

Title

ALGORITHM OF FUZZY MAXIMUM FLOW PROBLEM
WITH FUZZY TIME-WINDOWS IN HYPER NETWORK

Authors

Nasser A. El-Sherbeny
Department of Mathematics
Faculty of Science
Al-Azhar University
Nasr City, 11884, Cairo, EGYPT
Department of Mathematics
Faculty of Applied Medical Science
Taif University
Turabah, KSA

Abstract

The maximum flow problem is one of the classic combinatorial optimization and an NP-hard problem with many application in computer networks, communication networks and logistic networks. The Fuzzy Maximum Flow Problem with Fuzzy Time-Windows in Hyper Network (FMFPFTWHN) is an extension of the maximum flow problem. The goal of the problem is to find the maximum amount of flow from the source to the sink in hyper networks that satisfy a fuzzy time-windows constraint. In this paper, we consider a generalized fuzzy version of the maximum flow problem in hyper networks. Finally, we propose a new algorithm of the FMFPFTWHN, our algorithm is a class of genetic algorithms.

History

Received: 2017-02-24
Revised: 2017-07-01
Published: November 9, 2017

AMS Classification, Key Words

AMS Subject Classification: 05C35, 68R10, 90C27
Key Words and Phrases: combinatorial optimization, optimization network, genetic algorithm, maximum flow, fuzzy time-windows

Download Section

Download paper from here.
You will need Adobe Acrobat reader. For more information and free download of the reader, see the Adobe Acrobat website.

Bibliography

1
R. Ahuja, T. Magnanti, and J. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice Hall, Englewood Cliffs, NJ, 1993.

2
C. Changdar, G. S. Mahapatra, and R.K. Pal, An improved genetic algorithm based approach to solve constrained knapsack problem in fuzzy environment, Expert Systems with Applications, 42, No. 4 (2015), 2276-2286.

3
D. Dressler and M. Strehler, Polynomial-time algorithms for special cases of the maximum confluent flow problem, Discrete Applied Mathematics, 163 (2014), 142-154.

4
N.A. El-Sherbeny, Difference of convex functions optimization methods: algorithm of minimum maximal network flow problem with time-windows, International Journal of Sciences: Basic and Applied Research, 25, No. 1 (2016), 67-81.

5
N.A. El-Sherbeny, Algorithm of the inverse minimum flow problem with time-windows, Journal of Mathematical Science: Advances and Applications, 43 (2017), 1-18, doi: https://doi.org/10.18642/jmsaa7100121736.

6
N.A. El-Sherbeny, Imprecision and flexible constraints in fuzzy vehicle routing problem, American Journal of Mathematical and Management Sciences, 31 (2011), 55-71, doi: https://doi.org/10.1080/01966324.2011.10737800.

7
N.A. El-Sherbeny, Minimum cost flow time-windows problem with interval bounds and flows, Theoretical Mathematics & Applications, Scienpress Ltd, 6 (2016), 15-32.

8
L.R. Ford, D.R. Fulkerson, Flow in Network, Princeton University Press, Princeton, 1962.

9
A. Hafezalkotob and A. M. Ahmed, Cooperative maximum-flow problem under uncertainty in logistic networks, Applied Mathematics and Computation, 250 (2015), 593-604.

10
S.W. Han, Z.X. Peng, and S.Q. Wang, The maximum flow problem of uncertain network, Information Sciences, 265 (2014), 167-175.

11
T.E. Harris, F.S. Ross, Fundamentals of a Method for Evaluating Rail Net Capacities, U) RAND Corporation, Research Memorandum RM-1573, 1956.

12
J. Holland, Adaptatin in Natural and Artificial System, University of Michigan Press. Ann Arbor, MI, 1975.

13
T.C. Havens, J.C. Bezdek, and C. Leckie, A soft modularity function for detecting fuzzy communities in social networks, IEEE Transactions on Fuzzy Systems, 21, No. 16 (2013), 1170-1175.

14
E.D. Howe and O. Nicolis, Genetic algorithm in the wavelet domain for large p small n regression, Communications in Statistics Simulation and Computation, 44, No. 5 (2015), 1144-1157.

15
D.S. Kostyanoi, A.V. Mokryakov, and V.I. Tsurkov, Hyper-graph recovery algorithms from a given vector of vertex degrees, Journal of Computer and Systems Sciences International, 53, No. 4 (2014), 511-516.

16
T. Illes and R. Molnar-Szipai, On strongly polynomial variants of the MBU-simplex algorithm for a maximum flow problem with non-zero lower bounds, Optimization, 63, No. 1 (2014), 39-47.

17
R. Rashedi and T. Hegazy, Capital renewal optimization for large-scale infrastructure networks: Genetic algorithms versus advanced mathematical tools, Structure and Infrastructure Engineering, 11, No. 3 (2015), 253-262.

18
K.M. Sullivan and J.C. Smith, Exact algorithms for solving a euclidean maximum flow network interdiction problem, Networks, 64, No. 2 (2014), 109-124.

19
H. Turan, N. Kasap, and H. Savran, Using heuristic algorithms for capacity leasing and task allocation issues in telecommunication networks under fuzzy quality of service constraints, International Journal of Systems Science, 45, No. 3 (2014), 307-324.

20
D. Tuyttens, J. Teghem, N. El-Sherbeny, A particular multiobjective vehicle routing problem solved by simulated annealing, Lecture Notes in Economics and Mathematical Systems, 535, 133-152 (2004), doi: https://doi.org/10.1007/978-3-642-17144-4.

21
J. Wang, C.H. Wang, and C.L.P. Chen, The bounded capacity of fuzzy neural networks (FNNs) via a new fully connected neural fuzzy inference system (F-Confis) with its application, IEEE Transactions on Fuzzy Systems, 22, No. 6 (2014), 1373-1386.

22
L. Yan, J.S. Li, and W. Gao, Notes on vertex classification problem in hyper-graph setting, Information Technology Journal, 12, No. 15 (2013), 3309-3314.

23
D. Zhou, J. Huang, and B. Scholkopf, Learning with hyper-graphs, clustering, classification, and embedding, In: Proceedings of 20-th Annual Conference on Neural Information Processing Systems, Vancouver/Whistler, IEEE, Canada (2006), 1601-1608.

24
L.L. Zhu and W. Gao, Analysis of classification algorithm on hyper-graph, The Open Cybernetics & Systemics Journal, 8 (2014), 122-127.

How to Cite?

DOI: 10.12732/ijpam.v116i4.6 How to cite this paper?

Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2017
Volume: 116
Issue: 4
Pages: 863 - 874


Google Scholar; DOI (International DOI Foundation); WorldCAT. بازی انفجار

CC BY This work is licensed under the Creative Commons Attribution International License (CC BY).