Authors:
Javad Tayyebi
1
;
Mihai-Lucian Rîtan
2
and
Adrian Deaconu
2
Affiliations:
1
Department of Industrial Engineering, Birjand University of Technology, Industry and Mining Boulevard, Ibn Hesam Square, Birjand, Iran
;
2
Department of Mathematics and Computer Science, Transilvania University of Brașov, Iuliu Maniu st. 50, Brașov, Romania
Keyword(s):
Capacity Path Problems, Combinatorial Optimization, Polynomial Algorithms.
Abstract:
The focus of this paper is on an extension of the maximum capacity path problem, known as the generalized maximum capacity path problem. In the traditional maximum capacity path problem, the objective is to find a path from a source to a sink with the highest capacity among all possible paths. However, this extended problem takes into account the presence of loss factors in addition to arc capacities. The generalized maximum capacity path problem is regarded as a network flow optimization problem, where the network comprises arcs with both capacity constraints and loss factors. The main goal is to identify a path from the source to the sink that allows for the maximum flow along the path, considering the loss factors while satisfying the capacity constraints. The paper introduces a zero-one formulation for the generalized maximum capacity path problem. Additionally, it presents two efficient polynomial-time algorithms that can effectively solve this problem.