Math/Physic/Economic/Statistic Problems
Kevin is required to transport blood urgently to a hospital located at t in the below network.
He is currently situated at s. Assume he can only travel on the roads given in the below network and has only one mode of transportation.
The travel times on roads are indicated just above each road. For example, travel time from A to B is 12 minutes.
Assume Kevin aims to take the quickest route and travel is possible only in direction of the arrow. Formulate this problem as an integer program. Clearly explain your decision variables and constraints. (20 marks)
Explain the basic structure of a local search algorithm and comment on two strategies to overcome its limitation.
Give a local search heuristic to solve the problem in part a and illustrate two iterations of your heuristic on the given network. (35 marks)
Explain briefly the basic components and the principle behind genetic algorithms.
Explain how you would construct a genetic algorithm for the problem in part a. (4
