A collaborative system for providing routes between locations

Simple item page
buir.advisorDavenport, David
dc.contributor.authorUluğ, Kerem Ali
dc.date.accessioned2016-01-08T18:06:17Z
dc.date.available2016-01-08T18:06:17Z
dc.date.issued2008
dc.departmentDepartment of Computer Engineeringen_US
dc.descriptionAnkara : The Department of Computer Engineering and the Institute of Engineering and Science of Bilkent University 2008.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 2008.en_US
dc.descriptionIncludes bibliographical references leaves 55-57.en_US
dc.description.abstractMany systems, such as in-car GPS devices and airline company web sites, provide route information between locations. Although such systems are used widely and can provide route information successfully, users of these systems cannot contribute to the data entry process. In these systems, data is entered by the administrators and these systems cannot take advantage of the route expertise of their users. In this work, we present a collaborative system, which provides routes between locations upon user queries. The data in the system is entered by the users of the system. We present a model which is containing locations, links between locations and relationships between locations (containment, neighborhood and intersection) in order to store the data. For the route finding purpose, we present a customized version of the A* search algorithm. This customized version, named A*CD (A* for Collaborative Data), uses heuristics for estimating the cost remaining to the target location while processing the nodes. A*CD can also provide alternative routes, exclude certain link types in the searches according to user preferences and handle the problems associated with multiple stop transportation lines. As the cost models, we use duration and financial cost. We also present the intuitive connections concept. Even if a route does not exist between the selected locations, the system can provide a route with missing links. The gap(s) between the disconnected locations are filled by the help of the relationships between locations. In order to evaluate the performance of the A*CD algorithm, we present automated tests. These tests show that the costs of the routes that are provided by the A*CD algorithm are close to the actual shortest routes. In order to demonstrate the intuitive connections concept, we also present manual test queries.en_US
dc.description.degreeM.S.en_US
dc.description.statementofresponsibilityUluğ, Kerem Alien_US
dc.format.extentvii, 90 leavesen_US
dc.identifier.itemidBILKUTUPB109244
dc.identifier.urihttp://hdl.handle.net/11693/14731
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectHeuristic searchen_US
dc.subjectCollaborative systemsen_US
dc.subjectA* searchen_US
dc.subject.lccTK5105.5 .U48 2008en_US
dc.subject.lcshComputer networks.en_US
dc.subject.lcshRouters (Computer networks)en_US
dc.subject.lcshHuman-computer interaction.en_US
dc.subject.lcshHeuristic programming.en_US
dc.subject.lcshLocal transit Data processing.en_US
dc.titleA collaborative system for providing routes between locationsen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
0003591.pdf
Size:
1.29 MB
Format:
Adobe Portable Document Format
Download

Collections

Dept. of Computer Engineering - Master's degree