BBOT Univenity is planning to implement shuttle services onong its five destinations (Asti Bohelieuler 7.Cd, Capa,...

Transcribed Image Text:

BBOT Univenity is planning to implement shuttle services onong its five destinations (Asti Bohçelieuler 7.Cd, Capa, Tepe Prime, Kizilay) and the man campus. The table below shows the distance (site O) od the five stops (Asti (site (1) Bahcelieuter (site 2), Capa (Site 3), Tepe Prime (site 4) Kızılay (site 5), in this order). in minutes between the main compus (symmeric) Travelling time motriv 1 3 4 11 7 8 9 17 111 216 37 12 ه 9 26 12 51 12 48 17 11 5/16 13 15 10 11 912 d 7 17 5 16 13 it is to 15 17 20 20 Each bus should have a round trip time (from and to the main compus) of 50 minutes or less. This time should not include the loading and unloading time of the main compus. However, it should include the time to load and unload at a stop, 5 minutes per stop, Each should be visited only once, BBAT University pays a fixed cast of 100 TLitrip for each bus used, in addition to the fuel cast, which is a5 TL/min on the average stop sched- o) (7 points) Use nearest neighbor heuristic to find the le thor will meet the time constraint and determine the number of buses to be used and the total cost of the solution, blUsing the Cloke-Wright algorithm, develop the rasting schedule that will meet time constraint and determine the number of buses to be used, ad the total cost of the solution, which solution is better, why? Comicance de trandi BBOT Univenity is planning to implement shuttle services onong its five destinations (Asti Bohçelieuler 7.Cd, Capa, Tepe Prime, Kizilay) and the man campus. The table below shows the distance (site O) od the five stops (Asti (site (1) Bahcelieuter (site 2), Capa (Site 3), Tepe Prime (site 4) Kızılay (site 5), in this order). in minutes between the main compus (symmeric) Travelling time motriv 1 3 4 11 7 8 9 17 111 216 37 12 ه 9 26 12 51 12 48 17 11 5/16 13 15 10 11 912 d 7 17 5 16 13 it is to 15 17 20 20 Each bus should have a round trip time (from and to the main compus) of 50 minutes or less. This time should not include the loading and unloading time of the main compus. However, it should include the time to load and unload at a stop, 5 minutes per stop, Each should be visited only once, BBAT University pays a fixed cast of 100 TLitrip for each bus used, in addition to the fuel cast, which is a5 TL/min on the average stop sched- o) (7 points) Use nearest neighbor heuristic to find the le thor will meet the time constraint and determine the number of buses to be used and the total cost of the solution, blUsing the Cloke-Wright algorithm, develop the rasting schedule that will meet time constraint and determine the number of buses to be used, ad the total cost of the solution, which solution is better, why? Comicance de trandi

Answer rating: 100% (QA)

It looks like youve presented a case study involving RBOT Universitys plan to implement shuttle services among five destinations the main campus Site ... View the full answer