HomeMy WebLinkAbout2011-383a ES - Logistic Systems, Inc. for Shortest Path FSD W -7<r_"
CIL_
fiA
A A
6LO
a .
LOGISTIC SYSTEMS INC
Shortest Path
Functional Specification Document
Orange County
This agreement,made this day of 2011,by and between
Orange County Emergency Services and Logistic Systems, Inc. is made part of the
Service,License,and Maintenance Agreement for a Computer-Aided Dispatch System
executed on December 12, 1997. This agreement recognizes the review, approval, and
authorization of the functionality described and defined in the document titled, Shortest
Path, NO 120523,version 1 ,Dated 06/21/11,by both parties.
IN WITNESS WHEREOF,the parties hereto have executed,or caused to be executed by
their duty authorized officials,this Agreement in duplicate each of which shall be deemed
an original on the date first above written.
Orange County Logistic Systems,Inc.
Authorized Signature: Authorized Signature:
Srinivas Mondava
President
LogiSYS Project Manager Review(Initial): MT
For Orange County Use Only
Approved as to technical content:
R.Frank N esd ca,Emergency Services Director
Approved as to form and legal sufficiency:
An iette M. 9ore,StA Attorney
"This instrument has been pre-audited in the manner required by the Local Government Budget and Fiscal Control Act."
Clarence G.Grier, Financial Services Director ate
4
FI RSTCALL
Shortest Path
Orange
WO 120523
DOCUMENT VERSION 1 .0
10
LOGISYS
• LOSISTIC SYSTEMS . INC
02011 by Logistic Systems,Inc.
All rights reserved.
LogiSYS is a trademark of Logistic Systems,Inc.
Logistic Systems,Inc.
3000 Palmer
Missoula,Montana 59808
This document,and the information contained herein,is proprietary and confidential to Logistic Systems,Inc.
Disclosure of this information to any third party corporation, agency,or other entity of any kind without the
express written permission of Logistic Systems, Inc. is strictly prohibited.
.I
t
, li Il �lli�
i � t
r'
i. 1 i
.ti , r
s
Ail
IMM
„i Shortest Path . . . .. .. . . . . . . . . ... . . . .... . ... . . . .. . . . . . . . . . . .... . . . .. . .t
Mili
i
11 ui
I
(�
- ,
II
� r
11
,t 1
1111
z
II
I,
1
Fr
l�C it i I i
lu
II i
d
t
i
s
ii
*,
1 I 1
x�
i
ate- "III
i c kSw i,
ill, 11 I r .:
x u l%Viii
p
11 1111 .ik`s
SYSTEM DESCRIPTION
IM
Interfaces:
SHORTEST PATH
Sites have an option of using a shortest path algorithm to recommend the closest"vehicles."
Without this option,the system recommends units by boundaries. With Shortest Path Routing,
units are recommended by closest"station."If a site interfaces with AVLs,then the system recom-
mends the closest unit.
Sites can purchase the option of using a shortest path algorithm to recommend the closest vehi-
cles. Without this option, units are recommended by boundaries. With Shortest Path Routing,
units are recommended by closest station. If a site interfaces with Automatic Vehicle Location
devices,then the system recommends the closest unit.
Shortest path routing calculates the shortest path between an origin address and a destination
address. When valid origin and destination addresses are entered, a Zoom Level of the area dis-
plays location markers for the origin and destination addresses and provides driving directions.
The following origin and destination location entries are valid: exact street number and street
name, exact street name alone and intersections. When you choose Plot>Travel Directions,the
Request Travel Directions window opens.
When you enter a Start Address and Destination Address and choose Apply, a Travel Directions
window opens with travel instructions of the shortest path from the Start Address to the Destina-
tion Address.
� � 02/18/09