Solving matching Stable Marriage and Salesman Algorithm to find in Employment agents

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.