American Journal of Applied Mathematics and Statistics
ISSN (Print): 2328-7306 ISSN (Online): 2328-7292 Website: http://www.sciepub.com/journal/ajams Editor-in-chief: Mohamed Seddeek
Open Access
Journal Browser
Go
American Journal of Applied Mathematics and Statistics. 2019, 7(6), 191-195
DOI: 10.12691/ajams-7-6-1
Open AccessArticle

The Fuzzy Minimum Cost Flow Problem with the Fuzzy Time-Windows

Nasser A. El-Sherbeny1,

1Mathematics Department, Faculty of Science, Al-Azhar University, Nasr City (11884), Cairo, Egypt

Pub. Date: November 25, 2019

Cite this paper:
Nasser A. El-Sherbeny. The Fuzzy Minimum Cost Flow Problem with the Fuzzy Time-Windows. American Journal of Applied Mathematics and Statistics. 2019; 7(6):191-195. doi: 10.12691/ajams-7-6-1

Abstract

The Minimum Cost Flow Problem (MCFP) is a well-known combinatorial optimization and a logical distribution problem. The MCFP is an NP-hard problem with many applications in logistic networks and computer networks. The Fuzzy Minimum Cost Flow Problem with Fuzzy Time-Windows (FMCFPFTW) is an extension of the MCFP. The goal of the problem is to find the minimum amount of the fuzzy flow from the source to the sink that satisfies all constraints of the fuzzy shortest dynamic f-augmenting path with the fuzzy dynamic residual network. We consider a generalized fuzzy version of the MCFP of the fuzzy network. We propose the mathematical model of the FMCFPFTW. Finally, a new algorithm of the FMCFPFTW is presented.

Keywords:
combinatorial optimization minimum cost flow time-windows fuzzy time-windows

Creative CommonsThis work is licensed under a Creative Commons Attribution 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

References:

[1]  R. Ahuja, T. Magnanti, and J. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice Hall, Englewood Cliffs, NJ, 1993.
 
[2]  R. Ahuja, V. Goldberg, B. Orlin and E. Tarjan (1992). Finding minimum cost flows by double scaling, Mathematical Programming, 53, 243-266.
 
[3]  Y. Agarwal, K. Mathur, and H. Salki (1989). A set-partitioning-based exact algorithm for the vehicle routing problem. Networks, (19), 731-749.
 
[4]  G. Busacker and J. Gowen, A procedure for determining a family of minimum cost network flow patterns, Technical Report 15, Operation Research, Johns Hopkins University, 1961.
 
[5]  X. Cai, T. Kloks (1997). Time-varying shortest path problem with constraints, Networks, 29 (3), 141-149.
 
[6]  N. Christofides, and N. Beasley, (1984). The period routing problem, Networks, (14), 237-241.
 
[7]  W. Chiang, and R. Russell, (1996). Simulated annealing metaheuristics for the vehicle routing problem with time windows. Annals of Operations Research, (63), 3-27.
 
[8]  G. Clarke, and W. Wright, (1964). Scheduling of vehicles from a central depot to the number of delivery points, Operations Research, (12), 568-581.
 
[9]  G. Crainic, and G. Laporte, Fleet management and logistics. Kluwer Academic Publishers, 2000.
 
[10]  Y. Dumes, J. Desrosiers, and F. Soumis (1991). The pickup and delivery problem with time windows, European Journal of Operation Research, (54), 7-21.
 
[11]  J. Edmonds and R. Karp, (1972). Theoretical improvements in algorithmic efficiency for network flow problems, Journal of ACM, 248-264.
 
[12]  N. El-Sherbeny (2002), Resolution of a vehicle routing problem with a multi-objective simulated annealing method, Ph.D. dissertation, Faculty of Science, Mons University, Mons, Belgium.
 
[13]  N. El-Sherbeny, (2017). Algorithm of fuzzy maximum flow problem with fuzzy time-windows in the hyper network, International Journal of Pure and Applied Mathematics, 116, No. 4, 863-874.
 
[14]  N. El-Sherbeny, (2011). Imprecision and flexible constraints in fuzzy vehicle routing problem, American Journal of Mathematical and Management Sciences, 31, 55-71.
 
[15]  L. Ford and D. Fulkerson, (1956). Maximal flow through a network, Canadian Journal of Mathematics, 8, 399-404.
 
[16]  V. Goldberg and E. Tarjan, (1990). Solving minimum cost flow problem by successive approximation, Mathematics of Operation Research, 15, 430-466.
 
[17]  T. Havens, J. Bezdek, and C. Leckie, A soft modularity function for detecting fuzzy communities in social networks, IEEE Transactions on Fuzzy Systems, 21, No. 16, 1170-1175, (2013).
 
[18]  L. Ford, D. Fulkerson, Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
 
[19]  Y. Koskosidis, W. Powell, and M. Solomon, (1992). An optimization-based heuristic for vehicle routing and scheduling with soft time windows constraints. Transportation, Science, (26), 57-69.
 
[20]  A. Landeghem, (1988). A bi-criteria heuristic for the vehicle routing problem with time windows. European Journal of Operational Research, (36), 217-226.
 
[21]  D. Lozovanu, S. Pickl, (2004). A special dynamic programming technique for multiobjective discrete control and for dynamic games on graph-based methods, CTWO4 Workshop on Graphs and Combinatorial Optimization, Milano, 184-188.
 
[22]  K. Sullivan, and J. Smith, (2014). Exact algorithms for solving a Euclidean maximum flow network interdiction problem, Networks, 64, No. 2, 109-124.
 
[23]  C. Reeves. Modern heuristic techniques for combinatorial problems. Mc-Greenhill. 1995.
 
[24]  D. Tuyttens, J. Teghem, N. El-Sherbeny, (2004). A multiobjective vehicle routing problem solved by simulated annealing, Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, Berlin, Germany, 535, 133-152.