Optimization
J. Tayyebi; E. Hosseinzade; M. Niksirat
Articles in Press, Accepted Manuscript, Available Online from 17 October 2026
Abstract
The assignment problem is a foundational combinatorial optimization problem that requires a decision maker to allocate agents to tasks in order to minimize the total cost incurred. From a graph-theoretic perspective, this problem can be framed as a matching problem on a bipartite graph. This paper presents ...
Read More
The assignment problem is a foundational combinatorial optimization problem that requires a decision maker to allocate agents to tasks in order to minimize the total cost incurred. From a graph-theoretic perspective, this problem can be framed as a matching problem on a bipartite graph. This paper presents a natural extension of the traditional assignment problem by considering fuzzy graphs as the underlying framework. This extension proves significant in practical situations where expert opinions contribute to assessing the relative significance level of agents (or tasks) and the satisfaction levels associated with different assignments. The main goal for the decision maker is not just to minimize costs but also to consider expert opinions. This paper addresses this problem by first formulating it as a tri-objective optimization problem. Subsequently, the ϵ-constraint method is applied to propose an interactive algorithm designed to identify satisfactory solutions. Finally, a practical example of assigning teachers to schools is provided to demonstrate the algorithm in a real-world application.
Decision Making
Javad Tayyebi; Adrian Deaconu; Elham Hosseinzade; Amir Mohmmad Golmohammadi
Volume 21, Issue 4 , July and August 2024, , Pages 123-139
Abstract
The maximum capacity path problem (MCPP) is a classical combinatorial optimizationproblem that seeks to find a path with the maximum capacity in a network. Inthis paper, we consider a fuzzy extension of the MCPP, where the capacities are givenas arbitrary fuzzy numbers. Unlike previous approaches that ...
Read More
The maximum capacity path problem (MCPP) is a classical combinatorial optimizationproblem that seeks to find a path with the maximum capacity in a network. Inthis paper, we consider a fuzzy extension of the MCPP, where the capacities are givenas arbitrary fuzzy numbers. Unlike previous approaches that rely on ranking functionsor specific orderings, we formulate the fuzzy MCPP as a bi-objective path-findingproblem, where one objective is to maximize the nominal capacity and the other is tooptimize the reliability value of the path. We propose an efficient algorithm that canfind a Pareto optimal path for any aggregation function between the two objectives.We also analyze the special case where the network is acyclic and show that the algorithmcan be specialized to run in strongly polynomial time. Furthermore, we presentan application of the fuzzy MCPP to the field of optimal control, where we use a discretizationalgorithm to transform a continuous routing problem into a discrete one andsolve it using the proposed algorithm as a subroutine. To implement this applicationin practice, we run the algorithm on an old real-world project in Iran called Iranrud.Moreover, we report some computational results on grid networks with different sizesthat illustrate the performance of the proposed algorithm.