Planning Tips Within Cities using a Smart Place Selection and Routing Algorithm
| dc.contributor.advisor | Abdelhaq, Dr. Hamed | |
| dc.contributor.author | Nasoura, Tareq | |
| dc.contributor.author | Ghulmi, Momen | |
| dc.contributor.author | Minwer, Ahmad | |
| dc.date.accessioned | 2020-06-02T10:36:05Z | |
| dc.date.available | 2020-06-02T10:36:05Z | |
| dc.date.issued | 2018 | |
| dc.description.abstract | Trip planning within a city to do some daily-life activities, e.g., shopping, paying bills, visiting friends etc, is non-trivial and a time-consuming process. The problem here is figuring out where to conduct the activity and to determine the order of places to visit. These places might be groceries, malls, restaurants, parks, schools, and banks, to name but a few. Planning a trip within a city is the process of establishing a schedule that shows the order of places that a user should visit to finish his/her trip within predefined time constraints. In this project, we will collect information about places and enrich OpenStreetMap accordingly. Then, given a list of activities to conduct, we will examine the problem of finding alternative place sets. This might be non-trivial knowing that there are some places that can serve many activities at the same time, e.g., paying bills and buying milk from a supermarket. Finally, we will adapt a solution for TSP problem and exploit it in finding the route allowing user to visit all places within time constraints. The solution should also be restricted to a relative place order a user specifies, e.g., visiting a friend should be done first before shopping. | en_US |
| dc.identifier.uri | https://hdl.handle.net/20.500.11888/14947 | |
| dc.subject | Trip, Planning, Shopping, Routing, Activities | en_US |
| dc.title | Planning Tips Within Cities using a Smart Place Selection and Routing Algorithm | en_US |
| dc.type | Graduation Project | en_US |