A consortium of municipalities in Romania has decided to locate a first aid centre in a given area. Each intersection of the road network of the interested area is associated with a vertex of the set V, 2, 3, 4, 5, 6, 7, 8, 91 and each road segment is associated with an edge of the set (5, 6), (6, 8), (7,9), (8,9)). The traversal times aij for each edge (i,j) EE are shown in Table 3.32, while the shortest transfer travel time between i and j, for each pair of vertices i, j eV, are reported in Table 3.33. The average speed on the road segments can be assumed equal to 60 km/h Assuming that the first aid centre should be located on the edge (3,9) solve the 1-centre problem by using the Hakimi algorithm. Table 3.32 Traversal time (in minutes) of the edges of the 1-centre problem in Romania. i.j) aj.j)j)j 5 3,7)4(5,6) (1,7) 7(3,9) 7 (6,8) 12 (2,3) (2,6) (3,5) 4 (4,5) 5 11 (4,8) (8,9) A consortium of municipalities in Romania has decided to locate a first aid centre in a given area. Each intersection of the road network of the interested area is associated with a vertex of the set V, 2, 3, 4, 5, 6, 7, 8, 91 and each road segment is associated with an edge of the set (5, 6), (6, 8), (7,9), (8,9)). The traversal times aij for each edge (i,j) EE are shown in Table 3.32, while the shortest transfer travel time between i and j, for each pair of vertices i, j eV, are reported in Table 3.33. The average speed on the road segments can be assumed equal to 60 km/h Assuming that the first aid centre should be located on the edge (3,9) solve the 1-centre problem by using the Hakimi algorithm. Table 3.32 Traversal time (in minutes) of the edges of the 1-centre problem in Romania. i.j) aj.j)j)j 5 3,7)4(5,6) (1,7) 7(3,9) 7 (6,8) 12 (2,3) (2,6) (3,5) 4 (4,5) 5 11 (4,8) (8,9)