School Driver Essay Example for Free

School Driver Essay My aunt, a school driver, she has a problem of picking the student up to school. She lives in Belvedere Garden, and picks student to the school in Shek Lei Estate (the map is on the last page). In order to save the cost by shorten the distance to the school, she asked me to solve the problem for her. By the virtue of keen competition, she couldnt charge for the high fees from the students. Besides, the fuel is very costly and variable. Thus, her income becomes unstable. She tries to solve it by picks up more students from different places, but the routes will be more complex and the time does not allow her to do so. She has to pick 50 students up from 12 places, there are 10 seats left and therefore she can only save the cost by pick more students up from these 12 places but not the other places. I also found her driving routes have a great problem, she didnt choose the fastest way. So I will choose the fastest routes for her. She has to drive 4 times per school day 1. From BG to SLE (through all places in shortest routes) 2. From SLE to BG (fastest routes to back home) 3. From BG to SLE (fastest routes to back to school) 4. From SLE to BG (through all the places in shortest routes). I have asked her where the 12 places were, how much profits she earns totally per month and how much the costs are. Here is the information: The name of the twelve place: Belevedere Garden Phase 3 (BG) Tsuen King Garden (TKG) Clague Garden Estate (CGE) Discovery Park (DP) Water Side Plaza (WSP) Luk Leung Sun Chuen (LYSC) Pa Tin Pa Tsuen (PTPT) Kwai Yin Court (KYC) Lei Muk Chuen Estate (LMSE) Shek Yam Estate (SYE) Shek Yam East Estate (SYEE) Shek Lei Estate (SLE) The distances between the places: Second drive: After sending the students to the school, my aunt will then go back home (From SLE to BG). Her original route is showed below: BGi DPi KYCi SLE 5km Third drive: She has to pick up the students again after the school (From BG to SLE). Her original route is showed below: Â  BG 13. 09km The total distance of the whole drive is 12. 6 + 5 + 5 + 13. 09=35. 69km There are 22 school days average per month, which means the total distance of one month is 35. 69 x 22 = 785km. In HK, the cost of the fees are 15p per km average, thus her original cost per month is 785 x 15p = i 118 and her income is i 810. So her actual income decreases to i 810 i 118 = i 692 Now I am going to find out the shortest routes of four drives. For the first drive and the last drive, I solve the problem by showing all possible ways as she has to go through all 12 places. The second and the third drive, I do only find the shortest routes and therefore I will use the Dijkstras algorithm. There are 52 way in the first drive and 66 ways in the fourth drive. Possible ways for first drive: BGi TKGi PTPTi Therefore, the new total distance per month is (12. 12 + 4. 93 + 4. 93 + 12. 6) x 22 = 761km The new cost is 761 x 15p = i 114 So her actual income increases to i 810 i 114 = i 696 If my aunt is willing to use this my methods, she could save i 4 a month (i 696 i 692 = i 4) Evaluation As a result, I saved i 4 for my aunt. In England, people may think that i 4 is just a little amount of money. However, i 4 in Hong Kong and China you can help many poor. They may get warm and full by buying food, clean water and clothes. I suggested my aunt that she could save more by delete the second and the third drives. It saves almost i 33 more (4. 93 x 2 x 22 x 15p ). It would spend her leisure at home during the resting time but save her more money. She could also earn more by picking more students from those 12 places. The cost cannot save so much because the routes in Hong Kong are not very long but complex, Hong Kong is just a point in the map only. In addition, she picks students up from 2 districts only and therefore the roads are shorter. The time is a problem as well, she is not allowed to pick more students. Otherwise, all of the students will be late for school and their parents will complain her. In the first drive and fourth drive, I have found out the shortest routes by showing all possible. Actually, its very difficult to find out and its take me a long time. When I was doing it, I needed to check many times whether I had showed all the possible or not. Besides, its easy to make mistakes when I was calculating the distance of the possible routes. In the second and the third drive, I used Djkstras algorithm to find out the shortest easily. It is very convenience and hard to make a mistake. This is the best method for me which I have learned. I impacted my aunt as well and she found it is useful.