Summary: | 碩士 === 淡江大學 === 資訊管理學系碩士班 === 98 === In 2008 our government announced that Tel-Home Care is one of the new type of industry service. The purpose of Tel-Home Care is to take care of cared patients continuously even when they at home. The care workers can take care of them through the Tel-medical information system, but there are some tasks that care workers must pay a visit to patients by themselves, for instance, rehabilitation and meal delivery, thus, care workers have to go to a lot of place when they run their tasks. So we must plan the routing path and visiting order well.
Planning the routing path is a Traveling Salesman Problem, there were some researches propose some methods to solve it, for instance, Ant Algorithm, Tabu Search and Genetic Algorithms. To plan the routing path, we must get geographical information in the real world. Fortunately, the Google company released geographical information on its cloud computing service know as Google Map, we can get its service easily only through its JavaScript API. So, we attempt to combine Google Map service with Traveling Salesman Problem and applying it on Tel-Home Care. We implement a system whitch help care workers to plan visiting order, path and estimated arrival time for each cared patients.
Our System can be divided into two parts, one is Geographical Information Processing Module which communicates with the Google Map service to get geographical information in the real world and send data to the other part, we call it routing path planning module. When it receives the data from geographical information processing module, it assigns nodes and computes routing paths and estimated service intervals for each care worker. Then it returns the processed results to the geographical information processing module for displaying. Finally, we demonstrate the architecture and instructions of our system.
|