Scribd
Upload
22 views15 pages

Lecture 2.1.5 Travelling Salesman Problem

The document outlines the course outcomes for Operation Research (BAT-308), focusing on model development, mathematical tools for optimization, and the use of software for problem-solving. It specifically discusses the Travelling Salesman Problem (TSP), detailing its significance in logistics and the methods to solve it, including assignment techniques and row/column reduction. The document concludes with an example of solving a TSP scenario with a cost matrix.

Uploaded by

gakhararmaan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
22 views15 pages

Lecture 2.1.5 Travelling Salesman Problem

The document outlines the course outcomes for Operation Research (BAT-308), focusing on model development, mathematical tools for optimization, and the use of software for problem-solving. It specifically discusses the Travelling Salesman Problem (TSP), detailing its significance in logistics and the methods to solve it, including assignment techniques and row/column reduction. The document concludes with an example of solving a TSP scenario with a cost matrix.

Uploaded by

gakhararmaan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 15

INSTITUTE-USB

DEPARTMENT-BBA
Bachelor Of Business Administration
Operation Research(BAT-308)

Operation Research(BAT-308) Operation Research(BAT-308)


DISCOVER . LEARN . EMPOWER
Operation Research(BAT-308)
OPERATION RESEARCH
Course Outcome
CO Number Title Level

CO1 Identify and develop operational research models from Remember


the verbal description of the real system

CO2 Understand the mathematical tools that are needed to Understand


solve optimization problems.

CO3 Use mathematical software to solve the proposed models Understand

CO4 Develop a report that describes the model and the solving Understand
technique, analyze the results and propose
recommendations in language understandable to the
decision-making processes in Management Engineering

https://www.or.tum.de/en/home/
2
2.4 The travelling salesman problem
(TSP)

 Special case of assignment problem


 The task is to find the shortest possible route that visits each
city exactly once and returns to the city of origin
 The TSP has several applications in the field of planning and
logistics
The travelling salesman problem
(TSP)
• There are a number of cities a salesman must visit ex. A, B, C and D.
The distance/time/cost between every pair of cities is given. The
salesman starts from his home city, he must visit every city exactly
once and return to his home city.
The travelling salesman problem
(TSP)
• The problem has to solve by assignment problem technique first and
check the travelling salesman problem condition, if the condition is
not satisfied then go for
• PHASE - 2 procedures if needed. Phase 1: problem can be solved by
assignment technique (Done) Phase 2: i) The solution can be adjusted
by inspection method: (Done) ii) Form a single circuit method: (Done)
The travelling salesman problem
(TSP)

• A travling salesman has planned to visit 4 cities. He would like to start


from a particular city, visit each city only once and return to the
starting (point) city. The traveling cost in rupees is given in the table
below. Find the least cost route to the city
A B C D
A 0 25 75 45
B 35 0 150 25
C 35 40 0 15
D 65 75 130 0
The travelling salesman problem
(TSP)

• Look at the diagonal cells


• It represents same place so logically it is not useful to visit from one
place to same place that’s why the have assigned 0 so when you saw
0 just assign infinity to such columns. Infinity means the highest value
in order to proceed further.
A B C D
A α 25 75 45
B 35 α 150 25
C 35 40 α 15
D 65 75 130 α
Row reduction

A B C D
A α 25 75 45
B 35 α 150 25

C 35 40 α 15
D 65 75 130 α

A B C D
A α 0 50 20
B 10 α 125 0
C 20 25 α 0
D 0 10 65 Α
Column reduction

A B C D
A α 0 50 20
B 10 α 125 0
C 20 25 α 0
D 0 10 65 α

A B C D
A α 0 0 20
B 10 α 75 0
C 20 25 α 0
D 0 10 15 α
Row scanning

A B C D
A α 0 0 20
B 10 α 75 0
C 20 25 α 0
D 0 10 15 α
Column scanning

A B C D
A α 0 0 20
B 10 α 75 0
C 20 25 α 0
D 0 10 15 α
A B C D
A α 0 0 30

B 10 α 65 0

C 20 15 α 0

D 0 0 5 α
Row scanning

A B C D
A α 0 0 30
B 10 α 65 0
C 20 15 α 0
D 0 0 5 α
column scanning

A B C D
A α 0 0 30
B 10 α 65 0
C 20 15 α 0 A B C D
D 0 0 5 α A α 0 0 30
B 10 α 65 0
C 20 15 α 0
D 0 0 5 α
A B C D
A α 0 0 40
B 0 Α 55 0
C 10 5 α 0
D 0 0 5 α
Condition

• The salesman starts from his home city, he must visit every city
exactly once and return to his home city.
• The salesman starts from A and visited to C
• From C he visited to D A B C D
A α 0 0 40
• From D he visited to B Fro B 0 α 55 0
m
• From B he visited to A C 10 5 α 0
D 0 0 5 α

• ACDBA
• 75+15+75+35=200 rs.
THANK YOU

15

You might also like