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

Authors

  • P. Chandrakala Associate Professor, Department of Mathematics, Aurora’s Degree & PG College, Chikkadpalli, Hyderabad, Telangana, India. Author

DOI:

https://doi.org/10.47392/irjash.2021.031

Keywords:

Assignment Problem, Unbalanced Transportation Problem, Initial Basic Feasible Solution, Optimal Solution & Traveling Salesman Problem

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

Downloads

Published

2021-02-01

Issue

Vol. 3 No. 2S (2021): IRJASH Vol.03 (Special Issue ICOST 2S) Issue 2S-[FEB 2021]

Section

Research Articles

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.