Enhanced Zero Suffix approach for the Optimal Solution of a Travelling Salesman and Assignment Problem: A summary

Chandrakala P

doi:10.47392/irjash.2021.031

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.

Highlights

One of the earliest applications is the problem of assignment, and it is a special case of linear programming issues that occur in a number of fields, such as healthcare, transport, education, and sports
Zero Suffix method, to solve the problem of distinct from the previous methods to be applied to assignment and travelling salesman, which is different from previous methods
Step 5: assign a person a task by choosing a maximum S value, and if the maximum value of the task is one and we can assign the s=. Task to their respective persons, and if the value of the task is over a maximum S value

Summary

Introduction

One of the earliest applications is the problem of assignment, and it is a special case of linear programming issues that occur in a number of fields, such as healthcare, transport, education, and sports. The rows represent the objects or people to be assigned, whereas the columns represent the items or tasks to be assigned. The. Hungarian method of assignment problem [5-7] is known to be much faster and more effective. Hungarian method of assignment problem [5-7] is known to be much faster and more effective In this method, we can reduce the given matrix by at least one zero per row and column. Zero Suffix method, to solve the problem of distinct from the previous methods to be applied to assignment and travelling salesman, which is different from previous methods

Enhanced Zero Suffix Method

Conclusion

Approximation Method for Unbalanced