Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Individual Project: Question 1 & 2 Question 1 . Consider the 1 0 - city travelling salesman problem ( TSP ) whose links have associated
Individual Project: Question & Question Consider the city travelling salesman problem TSP whose links have associated distances in the following table Table Assume City as the home city depot and rest of the cities are customer locations. a By considering City as the home city depot and rest of the cities are customer locations, perform the following three tasks. i Apply the Nearest Neighbourhood heuristic method to the above problem to generate a TSP tour. ii Produce an alternative TSP tour that exists. Briefly comment on the results of both tours. iii Use the Clarke & Wright sequential procedure to the above problem to find a TSP tour. iv Briefly comment on the solution quality as compared to the solution obtained in i v Use Lin's opt heuristic method to check whether the solution produced in ii can be improved. vi Briefly comment on the opt solution comparing the solutions obtained in i and iii above. Question Consider the distance matrix in Table of Question for the following Vehicle Routing Problem VRP Where City is the depot and rest of the cities are customer locations with known demands. All vehicles leave and terminate at the depot. There are lorries available, each with ton capacity. Assume there are no restrictions on drivertime or the distance travelled by each vehicle. Also consider the following customer demand information. Cities customers Requirements in tons i Solve the above VRP using the Clarke & Write sequential method you may use the list of savings found in Question aiii to satisfy the customer demand at a minimum total distance travelled the lorries subject to the given constraints. List the sequences of customers in the routes and their distances. Calculate total distance travelled by the lorries. ii By looking at the results obtained in Qi above briefly describe why the total distance travelled by two lorries is greater than the distance of the TSP tour produced by C&W method. iii Provide a brief description of a reallife VRP application that fits with the above scenario.
Individual Project: Question &
Question
Consider the city travelling salesman problem TSP whose links have associated distances in the following table Table Assume City as the home city depot and rest of the cities are customer locations.
a By considering City as the home city depot and rest of the cities are customer locations, perform the following three tasks.
i Apply the Nearest Neighbourhood heuristic method to the above problem to generate a TSP tour.
ii Produce an alternative TSP tour that exists. Briefly comment on the results of both tours.
iii Use the Clarke & Wright sequential procedure to the above problem to find a TSP tour.
iv Briefly comment on the solution quality as compared to the solution obtained in i
v Use Lin's opt heuristic method to check whether the solution produced in ii can be improved.
vi Briefly comment on the opt solution comparing the solutions obtained in i and iii above. Question
Consider the distance matrix in Table of Question for the following Vehicle
Routing Problem VRP Where City is the depot and rest of the cities are customer locations with known demands. All vehicles leave and terminate at the depot. There are lorries available, each with ton capacity. Assume there are no restrictions on drivertime or the distance travelled by each vehicle. Also consider the following customer demand information.
Cities customers Requirements in tons
i Solve the above VRP using the Clarke & Write sequential method you may
use the list of savings found in Question aiii to satisfy the customer
demand at a minimum total distance travelled the lorries subject to the given
constraints. List the sequences of customers in the routes and their distances.
Calculate total distance travelled by the lorries.
ii By looking at the results obtained in Qi above briefly describe why the total distance travelled by two lorries is greater than the distance of the TSP
tour produced by C&W method.
iii Provide a brief description of a reallife VRP application that fits with the
above scenario.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access with AI-Powered Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started