Abstract
The Enhanced Zero Suffix Method is implementing in this paper to find an optimal solution to the problem of assignment & traveling salesman. To achieve optimality, the proposed approach requires a smaller number of iterations for finding the optimal ASP solution. In order to verify the validity of the proposed procedure, numerical examples are provided here. The approach proposed is very basic, easy to understand and implement.
)