1. Optimization of transport route from logistics center to the urban area of Gwang Ju Industrial engineering Team member 20092359 조성진 20102363 박정훈 20102371 유 현

2. How to perform Progress plan Utilization and Expected effect

4. Situation : Logistics Center detoured was checked though there was a shorter transport route for delivering goods from the advanced logistics center to convenience store(Mini stop) in each district, Gwang ju The goal of task : After examining the shortest path of the convenience store(Mini stop) which is delivered to each of the regions, it is an object to apply this in practice. 1. The total distance to the target 2. Each of the distance 3. Apply techniques 4. Comparison of the new distance with the existing distance

5. How to perform

6. Shortest path algorithm - Dijkstra algorithm - Floyd algorithm - Prim's algorithm - Traveling salesman problem(TSP) Measuring the distance between the store and measure the distance between each distinct from the distribution center and the store should measure the distance to the garage in each store. Starting from the center and through each store should seek the shortest path to the end garage.

7. Utilization and Expected effect

8. This problem can be utilized in a number of vendors have faced problems If the shortest path which came out by calculating if is shorter than the existing path, it will be able to adapt quickly to the scene. This is because it saves time, the travel distance is shorter expected loss of the company is reduced. - Utilization - Expected effect

9. Progress plan

10. 1. Project Team Member. 2. Subject Selection and Plan sought 3. Announced the first presentation 4. The Second Presentation of the Team 5. Modifications and progress 6 ~ 7. Modify the presentation 8. Mid-Term Test 9 ~ 14. presentation 15. Final-Term Test