The following information was submitted:
Transactions: INTERNATIONAL JOURNAL of MATHEMATICAL MODELS AND METHODS IN APPLIED SCIENCES
Transactions ID Number: 20-498
Full Name: Miha Moškon
Position: Assistant
Age: ON
Sex: Male
Address: Tržaška cesta 25, SI-1000 Ljubljana
Country: SLOVENIA
Tel:
Tel prefix:
Fax:
E-mail address: miha.moskon@fri.uni-lj.si
Other E-mails: miha.moskon@gmail.com
Title of the Paper: Solving the vaguely defined assignment problems
Authors as they appear in the Paper: Miha Moškon
Email addresses of all the authors: miha.moskon@fri.uni-lj.si
Number of paper pages: 8
Abstract: Assignment problems are defined with two sets of inputs, i.e. set of resources and set of demands. Assignment of each resource to each demand has its own cost. Exactly one resource has to be assigned to each of the demands in such way, that maximal cost of the assignment is minimal when comparing to other assignments. Hungarian algorithm (also known as Kuhn-Munkres algorithm) is able to find an optimal solution of assignment problems in polynomial time, but is only able to solve assignment problems with precisely defined demands and resources. This presents a major problem in many real-life scenarios while the nature of these problems is such that inputs are commonly defined only vaguely (i.e. fuzzily). In order to solve them, their precise formalization is needed. Formalization of their properties is normally far from being a straightforward procedure and can present large costs in the meaning of time and money. Fuzzy logic on the other hand successfully copes wit!
h the processing of imprecise data. The article presents an extension of the Hungarian algorithm with the introduction of fuzzy logic methods – fuzzy Hungarian algorithm. Vaguely defined resources and demands can be easily described with fuzzy values which present an input to fuzzy Hungarian algorithm. The extended version of the algorithm is therefore able to cope with vaguely defined assignment problems, can be used more efficiently (i.e. with no further formalization of vaguely defined terms) and in a wider scope of assignment problems than the basic approach. Basic version of the Hungarian algorithm which was firstly presented by Harold Kuhn is presented in this article. Its extension with fuzzy logic methods is described and its usage on an example of vaguely defined assignment problem is demonstrated. Its benefits were also justified by the comparison of the results between the basic version of Hungarian algorithm and the fuzzy version of Hungarian algorithm on the!
same problem.
Keywords: Hungarian algorithm, Fuzzy logic, Assignment problems, Fuzzy Hungarian algorithm, Optimal resource assignment
EXTENSION of the file: .pdf
Special (Invited) Session: Finding optimal solutions of vaguely defined assignment problems
Organizer of the Session: 653-306
How Did you learn about congress:
IP ADDRESS: 212.235.188.3
