Travelling Salesman Problem - 3 - Imp Exam Problem - Hindi

This is the Shortest possible method of solving a Travelling Salesman Problem(TSP) in examination. I advise the viewers first to learn the Hungarian Assignment Method (HAM) of solving Assignment Problem visiting my YouTube channel. There is a playlist on Assignment Problems which contains lectures explaining HAM through variety of examples @ https://studio.youtube.com/playlist/P... Travelling Salesman Problem (TSP) Case/Problem: [Time (in hours)to reach Shop] To A B C D E From A -- 2 5 7 1 B 6 -- 3 8 2 C 8 7 -- 4 7 D 12 4 6 -- 5 E 1 3 2 8 -- How to solve a TSP? Variety of methods have been suggested to solve a TSP and the method of solving a TSP as an AP is the easiest among them. The steps of solving a TSP are as follows: Part -I 1) Write the TSP in the form of an AP and solve it as an AP for the optimal solution by the HAM. 2) Check whether the OS obtained satisfy the following conditions, particularly the first condition: (i) The, after starting his/her journey from the 'origin', must return to the 'origin' only after visiting each town/city/point/center (only) once. (i.e. each town is to be visited once and then only he should return to the 'origin') (ii) To complete the journey with minimum possible distance/time/cost. If the optimal solution of the AP also satisfies the first condition, it is also proved to be the optimal solution of the TSP. But, if it doesn't satisfy the first condition, we have to modify it to arrive at the optimal solution of the TSP. Part - II To modify the obtained solution, we just have to make assignment to the opportunity cost(s) immediately higher than '0' until we get a solution satisfying the condition of visiting every town/center (only) once before returning to the ;origin'. We can say that during the whole process of solving a TSP we just follow the steps of HAM of solving AP and this uniqueness of this process makes this technique of solving a TSP makes it eh easiest way. #TrevellingSalesmanProblem #travelling_saleaman_problem #TSP #AssignmentProblem #HungarianAssignmentMethod #HAM #freecoaching #solution # education_for_all #OR #operations_research #hindi_explanation OR, Operations Research, Travelling Salesman Problem, TSP, Assignment Problem, AP, Hungarian Assignment Method, HAM, Hindi Explanation, Optimal Solution, Free Education, MBA, MCA, CA, CS, CMA, CPA, ACCA, BBA, BCom, MCom, MA, MSc, BSc, CAIIB, FIII, UPSC, QT, QA, probability, standard deviation, binomial distribution, normal distribution, poisson distribution, probability distribution, assignment problem in operations research, transportation problem in operations research, queuing theory, cpm, pert, binomial distribution in probability, chi square distribution, conditional probability, poisson distribution probability, job sequencing problem, assignment problem, northwest corner method, hungarian method for solving assignment problem, time series analysis in statistics, queuing theory in operations research, replacement problems in operations research, degeneracy in transportation problem, simulation problem in operational research, inventory model in operations research, fitting of binomial distribution, fitting of poisson distribution, pchart, cchart, npchart, mean chart, range chart, fit a binomial distribution, fit a poisson distribution, fitting of poisson distribution, fitting of binomial distribution, dual of transportation problem, duality, dual of linear programming problem, linear programming, simplex method, graphic method, graphical method, graph, odds, data science, data analysis, data mining, data management, dbms, data interpretation, reasoning, logic, coding, python, java, c, c++, c#, exponential distribution, uniform distribution, zvalue, zscore, index number, correlation, regression, www.prashantpuaar.com