UP TO 15 % DISCOUNT

Get Your Assignment Completed At Lower Prices

Plagiarism Free Solutions
100% Original Work
24*7 Online Assistance
Native PhD Experts
Hire a Writer Now
OMGT2223: Supply Chain Analysis and Design Assignment, RMIT, Singapore The problem selected for this report is the Travelling Salesperson Problem. and This report will be based on the standard TSP model
 University RMIT University (RMIT) Subject OMGT2223: Supply Chain Analysis and Design
Posted on: 17th Aug 2023

# OMGT2223: Supply Chain Analysis and Design Assignment, RMIT, Singapore The problem selected for this report is the Travelling Salesperson Problem. and This report will be based on the standard TSP model

## Background

The problem selected for this report is the Travelling Salesperson Problem (TSP). This report will be based on the standard TSP model.

TSP is a well-known problem in the business world today with many logistics firms using the TSP model to solve various routing and distribution problems. TSP is commonly described as a scenario where a salesperson is required to visit each of his customers based in different cities in his region before returning back to his starting location. The salesperson would like to find the most optimal route that ensures that all customers based in the different cities are visited once(Rasmussen 2011).

The optimal routes can be based on factors such as distance, time, and costs. Different software can be used to solve the TSP models. In this report, the standard TSP model solved using Excel Solver’s “Simplex LP” method will be analyzed.

## Model

TSP’s mathematical model is as follows,

Decision variable

Decision variable = Xij

Where,

“i” represents the current node (salesperson’s current location)

“j” represents the subsequent node (salesperson’s next location from “i”)

Xij = 1 if node “j” is visited immediately after node “i”

Xij = 0 if otherwise

Objective function

n       n

min ∑∑CijXij

i=1  j≠i, j=1

Where,

Cijrepresents the distance between nodes “i” and “j”

“n” represents the number of locations (nodes) visited

Constraints

n        n

Origin:             ∑∑(Xijfrom origin node to subsequent nodes) = 1

i=1  j≠i, j=1

n        n

Destination:     ∑∑(Xij from previous nodes to destination node) = 1

i=1  j≠i, j=1

n

Go-to constraint:   For “i” = 0, 1, …, n – 1,           ∑Xij = 1

j

n

Come-from constraint:    For “j” = 0, 1, …, n – 1,           ∑Xij =

Salesperson departure location:         The location the salesperson visited previously, must be the same location where the salesperson is departing from the subsequent node

Non-negativity:   All values ≥ 0

Binary constraint:    Xij∈ {0,1}

##### Stuck with a lot of homework assignments and feeling stressed ? Take professional academic assistance & Get 100% Plagiarism free papers

Get Help By Expert

Unlock academic success with our dedicated Assignment Helper service, tailored exclusively for students at RMIT University (RMIT). Navigating intricate subjects like OMGT2223: Supply Chain Analysis and Design is seamless with our expert support. From comprehensive assistance to tackling assignments like the Travelling Salesperson Problem in the OMGT2223 project, our proficient professionals are here to assist you. Elevate your academic journey by investing in our Case Study Writing Help service. Paying for expert guidance has never been more rewarding.

Categories:-
##### No Need To Pay Extra
• Turnitin Report

\$10.00

\$9.00
Per Page
• Consultation with Expert

\$35.00
Per Hour
• Live Session 1-on-1

\$40.00
Per 30 min.
• Quality Check

\$25.00
##### Free

New Special Offer

## Get 30% Off

UP TO 15 % DISCOUNT

Get Your Assignment Completed At Lower Prices

Plagiarism Free Solutions
100% Original Work
24*7 Online Assistance
Native PhD Experts
Hire a Writer Now
My Assignment Help SG Services
My Assignment Help SG