The fact that schedule in sequencing problem is unable to return to its actual point till all jobs are accomplished, is the chief difference between sequencing problem and assignment. Thus, as compared to those assignment problems, solving a problem on sequencing is trickier. However, there are certain features which are common to problems of both assignment and sequencing. Thus, with few modifications, a student can easily solve his sequencing problems like that of assignment problems.
The problem of traveling salesman is a type of sequencing problem where it is expected that a salesman will visit all places before he returns to the starting point and finishes his journey in the shortest possible time.
Steps to solve traveling salesman problem
There are certain steps which a salesman needs to adopt to solving this kind of sequencing problem. These steps are-
Step-1:
Step-2:
If those zero cells in matrix are not placed in a way through which possible solutions can be determined, there occurs a further improvement of these solutions till the point they attain a lower cost schedule. In case those zero cells do not provide the best sequence, then the cells having the next higher value are taken into consideration for achieving the best sequence.
To have a better understanding of this sequencing problems, students are advised to practice sums based on the same. This helps in gaining a better knowledge of a complex topic like this. However, there are few questions which too need special consideration.
Test Questions
Links of Previous Main Topic:-
Links of Next Finance Topics:-