Intelligent Route Designer Test phase, srs, design phase and source code final deliverable

Get help with
Phd, Masters Thesis & Mcs Final Project
MBA Final Project
Cs619,Fin619,Mgt619,Bnk619,Hrm619,Mkt619
WhatsApp: 0092-3125718857
Skype: trust_aware
Email: projecthelp77@gmail.com
Click here to Join Our Facebook Page
Click here to Join Our YouTube Channel!

Intelligent Route Designer Test phase, srs, design phase and source code final deliverable

Programming

Abstract / Introduction

A travel agency plans different tours for customers to visit different places of intercity or intra city. They are using Google map application to find a path from a starting point to multiple destinations. Google map gives a static path according to the order of places entered in the application. They need an intelligent route designer (IRD) application that can use Google map API but instead of static path the application should find multiple optimized paths on the basis of entered starting point and multiple destinations.

Functional Requirements:

Following are the functional requirements of intelligent route designer (IRD) application.

  • The application should have option to enter one starting point and many destinations.
  • The application will use the entered information in the form of starting point to destinations and find five best paths.
    • Show five best paths on the basis of travel time.
    • Show five best paths on the basis of total distance.
  • Starting point and destinations can be enter in the form of an address.
  • Starting point and destinations can be entered int the form of latitude & longitude. Ø There should be option to generate a link of calculated path and share with others.
  • Your application will show five paths on the basis of distance and travel time.
    • Click on any generated path must show a path with path as showing below in two screenshots.

Working Scenario:

Suppose the man wants to start from point A and he has to travel to points B, C, D, E and return to point A. Your application will find five possible combinations of optimized paths

from A to A using B, C, D and E in different order. The path can be like

  • A => C => E => D => B => A
  • A => E => D => B => C => A 

Note: Students will find and provide detailed requirements in the SRS document.

Suppose the travel agency want to plan a tour for their clients for the locations showing in screenshot in the table on the left side. Google map give them an optimized path on the basis of the order of places entered. Your application will not change start and end place and try multiple combinations in between places to find multiple optimized paths.

Shareable Link: https://goo.gl/maps/cVSquNv66tt8AkxY9

Here is another path which is more optimized from previous.

Shareable Link: https://goo.gl/maps/RHjgE3RbKXn1F9Vg9

Tools: Python, PHP, ASP.Net

Supervisor:

Name: Muhammad Ahmad Lodhi

 

Leave a Reply

Your email address will not be published. Required fields are marked *

× WhatsApp Us