MIE 597SL: Supply Chain Logistics -Traveling Salesman and Vehicle Routing Problems - Engineering Assignment Help

Assignment Task:

Task:

a) Find the solution that will be given by this formulation for the given network of 6 cities.
b) Does this solution provide a satisfactory traveling salesman tour through the nodes in the network? If not, design a new constraint that will “cut-out” the current solution and solve again.

Given:
– N: set of customers to be visited
– cij: cost (e.g. distance) to travel from customer
i to customer j
Decision variables
– xij: 1 if customer j is visited after customer i; 0 otherwise

MIE 597SL Supply Chain Logistics
Prof. Ana Muriel
c) Does this solution provide a satisfactory traveling salesman tour through the nodes in the network? If not, design a new constraint that will “cut-out“ the current solution and solve again.
d) What happens to the solution cost as we add more constraints?
e) Provide the optimal TSP. (You can simply write the sequence in which customers are visited; e.g. 1 → 2 → 3 → 4→ 5→6 →1)
Q2: TSP Heuristic Solution Approaches
a) Solve the TSP problem above using a heuristic of your choice. Provide a pseudo-code of your heuristic and show your work. You can do this by hand. No need to write a computer code.
b) What is the quality of the solution you developed?

Q3: VRP Exact Solution Approach
A retailer is planning on locating a warehouse facility on node 5 to serve the region. The daily demands are w1=6, w2=3, w3=5 w4=4, w5=4, w6=5. To estimate the daily operational costs the warehouse will incur, management would like to know the minimum distance traveled by vehicles with capacity of 10 to satisfy all the demands in the region.

Observe that the depot (which we can represent as a new node 0) is located at point 5, but a vehicle will need to be sent out to satisfy the customers in location 5, even if their distance to the depot is negligible (the distance from depot, i.e. new node 0, to location 5 is 0 in the distance matrix).
a) Write down two different formulations of the problem.
b) Solve the problem exactly using one of them.

Q4: VRP Heuristic Solution Approaches
a) Solve the VRP problem above using a heuristic of your choice. Provide a pseudo-code of your heuristic and show your work. You can do this by hand. No need to write a computer code.
b) What is the quality of the solution you developed?

This MIE 597SL: Engineering  Assignment has been solved by our Engineering Experts at My Uni Papers. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.

Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.