 
Using GIS Maps for Planning of Services
(2008)
Ref: ict0030 This final year BSc
project was undertaken
in an effort to produce a system that would aid town planners with the
placement of service points at optimal locations within a geographic
area, as well as provide some extra features that include an
interactive Graphical User Interface and a Route Planner. This report
presents a solution to the above problem, which is to use clustering
algorithms to place the service points at optimal locations in relation
to the houses in the geographical area, and use Dijkstra’s
algorithm to implement the route planner. The report is
broken
down into the four main sections for any software engineering project;
Design, Implementation, Testing and Results. Each major
function
of the system is described fully and screenshots of the final system
are also included.
1. Introduction The Main Objective Additional Features Report Overview 2. Background and Literature Survey Clustering Algorithms K-Means Clustering Lloyd’s Algorithm Voronoi Diagrams K-Max Clustering Incremental Version Performance Improvements Route Planning Algorithms Dijkstra’s Algorithm 3. Design Requirements Analysis System Design 4. Implementation Optimal Placement Algorithms Voronoi Diagram K-Means Algorithm K-Max Algorithm Supermarket Algorithm Graphical User Interface Route Planner 5. Testing Glass Box Testing Static Testing Dynamic Testing Optimal Placement Testing Route Planner Testing Black Box Testing Test Results 6. Results Opening Screens Optimal Placement Mode Tools Frame Solution Frame Route Planner Mode 7. Conclusion and Evaluation Evaluation Performance Improvements Usability Improvements References Appendix Section How To Order 1. Select reference number ict0030 from the dropdown list 2. Click the PayPal button 3. Click the "Click Here" button on the PayPal page to submit your credit/debit card payment 4. We will email your chosen dissertation in PDF format within 24 hours |