Please use this identifier to cite or link to this item:
http://148.72.244.84/xmlui/handle/xmlui/5054Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Sura Mahmood Abdullah | - |
| dc.date.accessioned | 2023-10-19T08:31:41Z | - |
| dc.date.available | 2023-10-19T08:31:41Z | - |
| dc.date.issued | 2015 | - |
| dc.identifier.issn | 2222-8373 | - |
| dc.identifier.uri | http://148.72.244.84:8080/xmlui/handle/xmlui/5054 | - |
| dc.description.abstract | The important of stable matching theory is to find the suitable of two sets of data, one of these methods called Stable married problem, and its applied to find best match of set based on other one. The proposal of the paper is find best matches of each sets of employers agent for both companies and individual, then compares which the items have closest rank and give the best rank using one of the heuristic algorithm of AI called Traveling Salesman algorithm. The results shows the best suitor matched for both sets during implemented in employment agents. | en_US |
| dc.description.sponsorship | https://djps.uodiyala.edu.iq/ | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | University of Diyala | en_US |
| dc.subject | stable marriage, TSP, nearest neighbor | en_US |
| dc.title | Solving matching Stable Marriage and Salesman Algorithm to find in Employment agents | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | مجلة ديالى للعلوم الاكاديمية / Academic Science Journal (Acad. Sci. J.) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 27-43 E.pdf | 450 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.