IntelliPaper
Abstract
In this paper, we consider the Minimum Maximal Network Flow Problem (MMNFP), i.e., minimizing the flow value, minimizing the total time among the maximal flow with time-windows, which is a combinatorial optimization and an NP-hard problem. We propose a new version of a MMNFP, this version is a Minimum Maximal Network Fuzzy Flow Problem with Fuzzy Time-Windows (MMNFFPFTW). After a mathematical modeling problem, we introduce some formulations of the problem and one of them is minimization of the concave function over a fuzzy convex set. The problem can also be cast into a difference of the convex (nonconvex) functions programming. We propose a new algorithm of the MMNFFPFTW.
Explore Digital Article Text
Full-text access for this article is currently being prepared and will be available shortly.
Conflict of Interest
The authors declare no conflict of interest.
Ethical Approval
Not applicable
Data Availability
The datasets used in this study are openly available at [repository link] and the source code is available on GitHub at [GitHub link].
Funding
This work did not receive any external funding.
Cite this article
Related Research
Special Issue
Launch a focused special issue to highlight research, emerging trends, and expert insights in your academic field.
