Shortest Route Transportation

TEAM: THE RUNNING MINDSDENNIS HARRIS SIMEONE FREEMAN YELIK MURAT SHALINI RANA

Business Problem

In this application, we find an optimal shipment route for product deliveries from one store location to another The customer gives us their location and selects their desired

car. The manager views the request and the optimal shipment

route

Through using the application, the managers reduce travel time for all of their shipments and delivers customer’s the quickest service.

Method Analysis Our problem is solved using

the “shortest route” model The objective of this model

is to minimize travel time from the starting location to the end location

Our constraints require us to deliver to the locations listed through the routes provided.

Decision Variables

Manager parameters include the following:Available CarsDealership nodes available

Output

The model will output the optimal shortest route from the product’s location to the customer.

This will then be displayed in the MAP model as it shows what nodes are active in the shipment route.

User Types

There are two user types available:Customer – Those who can order

products.Manager – Those who can review what

the customer has ordered.

Solution Steps - Customer The Customer STARTS the

application They are brought to a sheet

that shows what cars are available and can filter through “Car Size”.

They then must select their location and what CarID they want from the selected list.

They CONFIRM their order and it is ready for the manager to view.

Solution Steps – Manager

The manager STARTS the application and is asked for their login information. Upon acceptance they are brought to the Manager Data sheet where

they can view what order the customer has placed, and can move on to the DATA sheet.

The DATA sheet has all the city’s locations and can perform the following functions:

Solution to problem Import new city data

Upon solving the flow is given and can be better seen by viewing the MAP model.