AUTOMATED TELECOMMUNICATIONS CALL PROCESSING METHOD

Description

Summary of Invention

[0028] The above-mentioned needs are satisfied by the present invention which includes a system and method for automatically routing telephone calls from a caller to a service location.

[0029] The present invention provides a method of routing all published and unpublished telephone numbers, including unlisted numbers, secondary unpublished business lines, and public pay phones without any violation of federal, state and local laws. The present invention also provides a method for legally conforming to contracted franchise territory definitions executed between franchisers and franchisees by routing customer's calls precisely to the correct legal franchisee area. Additionally, the present invention provides a method for precisely routing telephone calls based on any geographic definition including postal geography, census geography, telecommunications geography, special grid coordinate geography, and all custom geography.

[0030] The present invention provides a method for automatically routing and processing customer calls that do not meet the pre-set client protocols. This "exceptions handling" process routes to a "live" operator who executes preset exceptions handling protocols. The present invention also provides for a method of integrating unrelated geographic information systems and database technology, telecommunications systems and database technology, postal systems and database technology, and computer technology into a common applications driven architecture. Additionally, the present invention provides a method for dynamically and instantaneously updating and integrating Client and Master Tables with no time lags. Furthermore, the present invention provides a method for automating the processing of information that is input by a customer using a customer interface that automatically routes telephone calls to customer requested destinations.

[0031] In one aspect of the present invention there is, in a telephone network, an automatic routing system, comprising means for receiving a calling number of a source location, means for converting the entire calling number into a spatial key, means for converting the spatial key into a client number of a destination location, and means for transmitting the client number to the telephone network, wherein the source location is connected to the destination location by the routed telephone call.

[0032] In another aspect of the present invention there is a call routing system, comprising a telephone network; a switch connected to the telephone network, the telephone switch having a computer with a memory; a master file comprising a plurality of records, each record having a caller telephone number field and a spatial key field, the master file stored in the computer; a client file comprising a plurality of records, each record having a spatial key field and a client telephone number, the client file stored in the computer; means, within the switch, for receiving a selected caller telephone number from the telephone network; means, within the switch, for linking the master table and the client table to produce a selected client telephone number, wherein the master table is indexed by the selected caller telephone number to provide a selected spatial key, and wherein the client table is indexed by the selected spatial key to provide a selected client telephone number; and means, within the switch, for transmitting the selected client telephone number to the telephone network.

[0033] In yet another aspect of the present invention there is, in a telephone network, a method of automatically routing a telephone call, comprising the steps of generating a client table comprising a plurality of records, each record comprising a spatial key and a client telephone number indicative of a service location, storing the client table and a master table comprising a plurality of records, each record comprising a calling telephone number and a spatial key, in the telephone network, receiving a selected calling telephone number from the network, indexing the master table with the selected calling telephone number to obtain a selected master table record, retrieving a selected spatial key from the selected master table record, indexing the client table with the selected spatial key to obtain a selected client table record, and retrieving a selected client telephone number from the selected client table record.

[0034] In another aspect of the present invention there is a table generation process, comprising the steps of providing a plurality of service locations comprising two coordinates, each location having a specified service area; windowing the coordinates with a plurality of prestored spatial key windows, each window having an associated spatial key list, each spatial key list having one or more spatial keys, wherein the spatial key is indicative of a spatial key area, thereby providing a selected spatial key list; intersecting spatial key windows with the service area; and creating a client table record including one of the spatial keys from the spatial key list of an intersected spatial key window and the client telephone number of the service area.

Brief Description of Drawings

[0035]
Figure 1a is a block diagram of the files utilized in the presently preferred Client Table build process of the present invention;

[0036]
Figure 1b is a block diagram of a portion of a dynamic central switch linking process of the present invention that uses the result of the table build process of Figure 1a;

[0037]
Figure 1c is a system level diagram of a presently preferred embodiment of the central switch linking process interconnecting a calling telephone and a destination telephone of the present invention;

[0038]
Figure 2 is a map diagram illustrating an example of a routing network for the system of Figure 1c;

[0039]
Figure 3 is a top-level flow diagram of a process to build a client table using radius defined service areas for the system of Figure 1c;

[0040]
Figure 4 is a map diagram illustrating an example area utilized in the description of the process shown in Figure 3;

[0041]
Figure 5 is a flow diagram of the zip window list function indicated at 182 in Figure 3;

[0042]
Figure 6 is a flow diagram of the zip windows function indicated at 262 in Figure 5;

[0043]
Figure 7 is a flow diagram of the initial zip list function indicated at 184 in Figure 3;

[0044]
Figure 8 is a flow diagram of the remove duplicates from zip list function indicated at 322 in Figure 7;

[0045]
Figure 9 is a flow diagram of the final zip list function indicated at 186 in Figure3;

[0046]
Figure 10 is a flow diagram of the zip∝site radius check function indicated at 188 in Figure 3;

[0047]
Figure 11 is a flow diagram of the service location closest to the caller function indicated at 196 in Figure 3;

[0048]
Figure 12a is a top-level flow diagram of a process to build a client table using polygon defined service areas for the system of Figure 1;

[0049]
Figure 12b is a block diagram of the files utilized in the process of Figure 12a;

[0050]
Figure 13 is a diagram illustrating an example area utilized in the description of the process shown in Figure 12a;

[0051]
Figure 14 is a flow diagram of the zip window list function indicated at 612 in Figure 12a;

[0052]
Figure 15 is a flow diagram of the zip windows function indicated at 680 in Figure 14;

[0053]
Figure 16 is a flow diagram of the initial zip list function indicated at 614 in Figure 12a;

[0054]
Figure 17 is a flow diagram of the remove duplicates from zip list function indicated at 752 in Figure 16;

[0055]
Figure 18 is a flow diagram of the final zip list function indicated at 616 in Figure 12a;

[0056] Figures 19a and 19b are a flow diagram of the line index file function indicated at 618 in Figure 12a;

[0057]
Figure 20 is a flow diagram of the zip∝site polygon check function indicated at 620 in Figure 12a; and

[0058]
Figure 21 is a flow diagram of the point in polygon test function indicated at 930 in Figure 20.

Detailed Description

[0059] The following detailed description of the preferred embodiments presents a description of certain specific embodiments to assist in understanding the claims. However, the present invention can be embodied in a multitude of different ways as defined and covered by the claims.

[0060] Reference is now made to the drawings wherein like numerals refer to like parts throughout.

[0061] For convenience, the discussion of the preferred embodiments will be organized into the following seven principal sections:

[0062] I. System Overview;

[0063] II. Routing Example;

[0064] III. General Client Table Build Process;

[0065] IV. Client Table Build Process for a Radius Defined Service Area;

[0066] V. Client Table Build Process for the Service Location Closest to the Caller Within a Distance Limit;

[0067] VI. Client Table Build Process for a Polygon Defined Service Area; and

[0068] VII. Summary.

[0069] I. System Overview

[0070] The present invention includes an automated telephone routing system which receives input from a common carrier, such as AT&T and AT&T American Transtech. This input includes an updated national list of telephone numbers, telecommunication infrastructure, and exception handling support.

[0071] A system and method for automatically and seamlessly routing a telephone call from a calling telephone to a destination telephone selected by a client will be described. In addition, a method of creating the tables utilized by the routing system, according to criteria established by the client, will also be described.

[0072] Referring to Figure 1a, the number of calculations to be performed and permutations that must be tested is reduced in creating the calling telephone number-to-service location telephone number tables used in the "1-800" routing of the present invention. Accordingly, a zip windows file 104 (Figure 1a) and a process 105 to spatially access and operate on this file are a part of the present invention. It will be understood that the zip windows file 104 is just one embodiment of a spatial windows file which could include different types of spatial keys. The zip windows file 104 contains a list of all zip codes that potentially touch a tenth of a degree (0.1°) latitude and longitude spatial window. By utilizing a set of latitude and longitude extremes (minimums and maximums) for a service area in process 105, a list of 5-digit zip codes that could overlap with the service area is generated. It is then only necessary to calculate distance or perform a point-in-polygon calculation between each service location and a small subset of zip∝codes contained within each service area's returned list of 5-digit zip codes. File 104 and process 105 will be explained further and an example given hereinbelow.

[0073] Update problems and costs associated with continually updating and periodically rebuilding a hundred million plus record, telephone number-to-telephone number table for each business or client using the automated telephone routing system is solved by creating a dynamically linked, updatable system. Instead of creating a telephone number-to-telephone number table for each client, two tables linked by zip∝codes, as shown in Figure 1b, are created. A telephone number with its corresponding physical street address is assigned to a zip∝code, and a Master Telephone Number to Zip∝Table 107 (Figure 1b) (the "Master Table") is built using the Postal Service's Zip∝Address Coding Guide, and commercially available software, e.g., CODE-1® available from GROUP 1 Software, Inc. The preferred Master Table, presently maintained by AT&T American Transtech, is indexed or keyed by telephone number, and is updated on a daily basis. When phone numbers are added, changed or deleted, the table is updated. This table is also updated on a periodic basis to handle the approximate one hundred 5-digit zip code changes per quarter year, e.g., when a new zip code is created, telephone numbers in the new code area must be assigned a new zip∝code. This represents a fairly small amount of change in relation to the 43,000 zip codes (5-digit) in the United States. At routing time, the present system allows all clients to use the same Master Telephone Number to Zip∝Table 107.

[0074] Independently, and on an individual client basis, each of over 20 million zip∝codes is assigned, based on their latitude and longitude centroid coordinates, to one or more service locations using standard distance or point in polygon calculations. Hence, the present invention builds a Client Zip∝to Service Location Telephone Number Table 106 (the "Client Table", Figures 1a and 1b). A different table is built for each client or for every "1-800" telephone number that a client may have. The client selects the type of service area definition that is desired for his needs. Three different types of service area definitions are presently utilized: (1) the closest service location to the caller within a predefined distance; (2) all service locations within a specific radius of the caller (there may not be any service location within a particular radius); (3) and a service location whose service area is defined as an irregular shaped polygon that does not overlap with any other polygons. The polygon service area is typical of a franchise type business. The building of Client Tables using these service area definitions will be described hereinbelow.

[0075] The Client Table 106 is then preferably provided to AT&T American Transtech for centralized routing at a telephone switch. This table is indexed or keyed by zip∝code and is updated for each client as they add and delete locations, when they change telephone numbers, and on a periodic basis to handle Post Office zip code changes.

[0076] Using the presently preferred system, both the Master Table 107 and the Client Tables 106 are independently maintained by separate organizations. Using the zip∝code as a spatial key linkage, a calling phone number in the Master Table 107 is then dynamically linked, as shown in Figure 1b, to a service location phone number in the Client Table 106 and the call is automatically routed. The spatial key is a single number that identifies a specific geographically defined area, line, or point that is defined by a set of coordinates. For simple geographies like points and rectangles the spatial key can be a coded version of the coordinate description of the geography.

[0077] The postal zip∝code is the preferred spatial key used to link the master table to the client table, but there are other small geographic areas capable of having unique spatial keys, such as zip≢code areas, census blocks, or very small latitude/longitude grids, tiles, windows, or quad-trees. This two-table indexing approach provides a much higher automated routing rate and a higher percentage of correctly routed calls in an environment where consumers are continually moving and businesses are opening, closing, and/or moving. In addition, the two-table indexing approach also acts as a "fire wall" or buffer between regulated telephone number information and client marketing information to satisfy government regulations.

[0078] The system of the present invention directly routes the telephone call from the caller to the closest service location in approximately 40 milliseconds using the AT&T telecommunications network. The system described by Riskin intercepts the call with a private switch, answers the call with a client recorded message and asks the caller to wait, while it takes approximately 15,000 milliseconds to find the closest service location and then call forwards the call to the service location.

[0079] To route a call, the system of the present invention looks up the caller's 10-digit telephone phone number in its 100,000,000 plus record Master Table, retrieves the spatial key that identifies the location of the caller's phone, looks up the spatial key in the 20,000,000 plus record Client Table, and retrieves the telephone number of the location that services the caller's spatial key or location. The system described by Riskin looks up the caller's 6-digit exchange in its 13,000 record Exchange file having only 2,500 unique coordinates, retrieves the V-H (vertical-horizontal) coordinates of the exchange, interleaves the V-H coordinates, and starts a binary-iterative, V-H key based, size search of the N record client service location database. The Riskin system iterates through this process, adjusting the size of the geographic areas searched, until it retrieves a number of service locations that fall within a predetermined range. Riskin then calculates the distance to each service location. If more than one location fits the criteria to be considered the closest distance, one location is randomly selected as the closest service location.

[0080] II. Routing Example

[0081] Prior to discussing the building of Client Tables in more detail, it will be helpful to first discuss use of this table and the Master Table in a "1-800" routing example. Referring to a central switch process 108 shown in Figure 1c and a routing network shown in Figure 2, an example of telephone call routing will now be given. In this example, a caller dials 1-800-Italian to order a "MyPizza" pizza from his phone (619-755-5666) located at 498 Stevens Avenue in Solana Beach, CA 92075-2064. Of course, the present invention is not limited to use of "800" telephone numbers as other numbers may be used in other embodiments.

[0082]
Figure 1c includes process states and also data at 114, 132, and 146, indicated by parallelogram blocks. Also, the central switch process is handled inside a switch as will be described below.

[0083] The steps involved in having this call automatically routed to the caller's local MyPizza Restaurant are as follows:

[0084] 1. A caller at "Location A" 160 (Figure 2), dials 1-800-Italian at block 110 (Figure 1c) to order, for example, a pizza.

[0085] 2. Based on the 1-800 dialed and the caller's long distance carrier, the call is routed by various telephone companies to an intelligent central switch in Jacksonville, Florida, indicated on Figure 2 by "Location B" 162. The process associated with the switch is shown in Figure 1c as being below the dotted line just before state 112 and above the dotted line just after state 148. The central switch 111 is preferably a "4 ES™" digital switch available from AT&T. The switch includes a general purpose computer (not shown) such as a network control point computer with a memory.

[0086] 3. Once the Jacksonville switch has the call, it pulls the caller's telephone number from the calling information packet 114, by call decoding hardware 112 which performs Automatic Number Identification (ANI). The preferred information packet 114 corresponds to the operation parameter field of the SS7 TCAP message available at the switch 111. The hardware to perform ANI is described in U.S. Patent No. 5,163,087 to Kaplan, and is hereby incorporated by reference. The number equivalent of 1-800-Italian is 1-800-482-5426, and the information packet looks as follows:

[0087] Packet: ..........6197555666......18004825426.......

[0088] If the caller is using a non-Touch Tone telephone, the Caller ID or ANI is "000 000 0000". The "1-800" number is an IN-WATS (inbound wide area telephone service) number and must be translated by a wide area carrier to a POTS (plain old telephone service) number to be routed to the switch 111. Upon receiving the POTS number, the switch 111 translates the number back to the WATS format.

[0089] 4. Then, at decision state 116, the process 108 determines whether the client has chosen to give the caller an option to enter a telephone number on a Touch Tone telephone keypad or other means. In other embodiments, other characters are entered, such as a credit card number, an account number, or product order information, to enable other features of the system. In the presently preferred embodiment, the telephone number represents the location where the caller desires, for example, a product to be delivered or a service to be performed. As an example, if a client had a telephone number such as 800-FLORIST and desires the optional input feature, the caller could choose to have the flowers delivered to the address corresponding to a caller entered telephone number. If the decision state 116 is determined to be true, the process 108 moves to state 118 to capture the telephone number entered by the caller. This number is then used in place of the calling number in the information packet for further handling. However, if the decision state 116 is determined to be false, the original calling number is unchanged, and the process 108 moves to a decision state 120.

[0090] 5. At decision state 120, the process 108 determines if the calling number in the information packet is that of a mobile telephone. A file in the computer of the switch 111 listing mobile telephone numbers is presently maintained by AT&T American Transtech and is updated on an as-needed basis. Mobile telephones are assigned a number from a set of prefixes unique to each area code in the U.S. Therefore the mobile telephone number file only needs to contain the area code and prefix combination (6 digits) to identify that the calling number is that of a mobile telephone. Because the mobile telephone user, as determined at decision state 120, is not associated with a fixed location, the process 108 moves to a state 128 for handling non-routable exceptions. An operator will then request location information from the mobile telephone caller. Additional information about state 128 will be provided below. If the caller is not using a mobile telephone, the process 108 continues from state 120 to state 122.

[0091] 6. At state 122, the process 108 looks up the caller's telephone number preferably using the well-known Indexed Sequential Access Method (ISAM) to index the Master Telephone Number to Zip∝Table 107 (Figure 1b). ISAM is a well known method of searching described in the book Operating System Concepts by Peterson and Silberschatz. Other searching techniques may be used in other embodiments. The Master Table 107 was described in the System Overview section. As an example, a segment of a Master Table 107 is shown in Table 1. This table is indexed by phone number and also contains the zip∝code 132 of the physical address where the calling phone is physically located.

[0092]

1

Table 1 Example: Master Telephone Number to Zip∝Table Segment

PHONE #
ZIP+4.

.
.

6197555664
920751111

6197555665
920141313

6197555666

920752064

6197555668
920071234

.
.

.
.

.
.

[0093] 7. A test is performed at a decision state 126 to determine if the calling number is listed in the Master Table 107. If not, the process 108 moves to state 128 wherein operator assistance is provided to route the call. The non-routable exception handling at state 128 is for situations wherein a Master Table 107 or Client Table (Figure 1a) entry is missing, incorrect, or the caller is using a mobile telephone. In the presently preferred embodiment, operator assistance is provided by AT&T American Transtech. In general, only a small percentage of the calling numbers are not listed in the Master Table 107. If the calling number is listed in the Master Table 107, the process 108 advances to a decision state 130 to determine if there is a zip∝code 132 corresponding to the calling number in the packet 114. If not, the process 108 moves to state 128 wherein operator assistance is provided to route the call as mentioned previously. If a zip∝code 132 is located in the Master Table 107, the process 108 moves on to state 134.

[0094] 8. Since the information packet 114 also contains the number dialed, at state 134 the process 108 opens the Client Zip∝to Service Location Table A 106a that is associated with the client having the telephone number 800-482-5426. The Client Table 106 is selected from a plurality of Client Tables based on the telephone number dialed by the caller. Client Table B 106b and additional tables, as necessary, are for other clients or other phone numbers, e.g., another "800" number, of the same client. The Client Tables are built by the assignee of the present invention, the client, or a third party to the assignee's specifications. There are two types of Client Tables. If calls are to be routed to the closest location or to a service location servicing a non-overlapping polygon trade area, the first type of Client Table contains only a single entry per zip∝code with its corresponding service phone number 146 and distance. In cases where the client wants a random or weighted selection, from multiple selections, whose service areas service the caller or provide the caller a choice, the second type of Client Table can have multiple records per zip∝code, with each record having a different service telephone number and distance. The process 108 looks up the caller's zip∝code in the MyPizza Client Table 106a using the Indexed Sequential Access Method.

[0095] 9. A test is performed at a decision state 140 to determine if the zip∝code 132 is listed in the Client Table 106a. If not, the process 108 moves to state 128 wherein operator assistance is provided to route the call. If the zip∝code is in the Client Table 106a, the process 108 proceeds to a decision state 142 to determine whether there is a client telephone listing for the zip∝code 132. If not, the process 108 moves to state 144 wherein operator assistance is provided to route the call, provide information, or take other action as determined by the client. A negative test result determined at state 142, may arise, for example, if there is no service location within a client specified radius of the calling party. The exception handling at state 144 is for situations where the call is correctly routed, but the calling party does not get what is expected, i.e., the call is not satisfactorily completed (as in states 142, 152, and 154). In these situations, the client may select from a set of alternatives that can be handled by an automated process. An example exception handling message is as follows: "We are sorry, but there is currently no service location within your area. If you desire to talk to a representative, please press zero."

[0096] If there is a client telephone number associated with the zip∝code 132, the process 108 advances to state 148. As an example, a segment of Client Table 106a is shown in Table 2.

[0097]

2

TABLE 2 Example: 800-482-5426 Client Table segment

ZIP+4
Phone #
Distance in miles

.
.
.

.
.
.

920752060
6199423366
3.1456

920752062
6199423366
2.1682

920752064

6194817777

1.2864

920752065
6197591111
0.1234

.
.
.

[0098] 10. After finding the caller's zip∝code 132 and the corresponding service telephone number 146, the switch, at state 148, sends the information packet over the telephone network to ring at the telephone associated with the number 619-481-7777.

[0099] 11. At block 150, the telephone at MyPizza located at 2688 Via De La Valle in Del Mar, CA 92014-1909, "Location C" 164 (Figure 2), rings.

[0100] 12. If the telephone at the client service location is "busy" 152 or there is "no answer" 154, the process 108 proceeds to the exception handling state 144 as described previously. At the client's request, the exception handling at state 144 may, for instance, route the call to the next closest service location. Otherwise, if the "busy" or "no answer" conditions are false, the telephone call is answered and the caller may, for example, order a pizza.

[0101] III. General Client Table Build Process

[0102] The process 105 (Figure 1a) of creating or building a Client Table 106 for each client or each "800", or similar number, for the client will now be described. This process is preferably performed on a general purpose computer, e.g., a personal computer. Such a personal computer preferably has at least an Intel 80486 class processor, at least 16 Megabytes (Mb) of memory, and has a minimum of one Gigabyte of mass storage. As previously mentioned, the present invention includes definitions for three different types of service area. A build process will be discussed for each type of service area definition. An example of the process steps will be given using a fictitious food service business.

[0103] The process for each type of service area definition utilizes four input files as shown in Figure 1a. The zip∝centroid file and zip windows file were briefly discussed in the System Overview section. Each input file is now further described. The following discussion again refers to Figure 1a.

[0104] A. Client Service Locations File

[0105] The first file is a client service locations file 109 containing a list of service locations provided by the client. The service locations are defined by either a latitude/longitude location with a radius, or a latitude/longitude polygon, depending on the build process type. Further detail about file 109 is provided in conjunction with state 174 of Figure 3 (radius) and state 604 of Figure 12a (polygon).

[0106] B. Zip+4_Lat_Lon Centroid File

[0107] The second file is the zip∝latitude and longitude centroid file 100 or zip+4_lat_lon centroid file previously described. This file is available from the U.S. Postal Service or from, for example, Geographic Data Technology, Inc. (GDT).

[0108] C. Zip Array File

[0109] The third file is a zip array file 103 created from the zip∝latitude and longitude centroid file 100 and provides three benefits that improve processing efficiency.

[0110] The first benefit is building an array where the row number of the array is equal to a 5-digit zip code. This provides a very efficient method of indexing to a 5-digit zip code where the 5-digit zip code number is the row number of the array.

[0111] The second benefit is once the 5-digit zip code is accessed in the array, the exact byte offset of where the first zip∝code for this 5-digit zip code starts in the zip∝latitude and longitude centroid file 100 is known. Using this method, it is very efficient to advance to the location of the first zip∝record and read all the zip∝records for a 5-digit zip code in the over 20 million record zip∝latitude and longitude centroid file 100.

[0112] The third benefit of the zip array file 103 is that for each five digit zip code, the file contains the latitude and longitude minimums and maximums for all the zip∝codes in the 5-digit zip code. By checking to see if a radius or a polygon service area set of extremes overlap with the 5-digit zip code extremes, testing each zip∝in a 5-digit zip code is eliminated, if it is determined beforehand that there is no spatial overlap between the zip∝extremes in a 5-digit zip code and the radius or polygon service area.

[0113] The zip array file 103 is created using the GDT or Post Office supplied zip∝latitude and longitude zip∝centroid file 100. Each record in the centroid file 100 contains a zip∝number, and the latitude and longitude defined centroid for each zip+4. A four step, zip array file build process 101, as follows, is used to create the zip array file 103:

[0114] 1.) A 32-bit integer array of 99,999 rows and 6 columns is initialized to zero. Column one is initialized to the row number which is then utilized as the 5-digit zip code.

[0115] 2.) For a 5-digit zip code, every zip∝record in the zip∝latitude and longitude centroid file 100 is read in a sequential manner. The byte offset for the first zip∝within the 5-digit zip code is noted. Temporary variables are initialized and then used to determine the latitude and longitude minimums and maximums of the zip∝centroids for the current 5-digit zip code. The greatest and least of both the latitudes and longitudes among all zip∝codes for the current 5-digit zip code are then passed on to the next step.

[0116] 3.) With each change in 5-digit zip code, the byte offset for the first zip∝within a 5-digit zip code and the latitude and longitude minimums and maximums for all zip∝codes within a five digit zip code are written to memory for the previous 5- digit zip code to its location in the zip array file 103. The latitude and longitude minimum and maximum values are then reinitialized, and the previous and current steps are repeated with the next 5-digit zip code until the end of the zip∝centroid file 100 is reached.

[0117] 4.) Upon reaching the end of the zip∝centroid file 100, the last 5-digit zip code record is written to memory, and then the zip array file stored in memory is written to a mass storage device such as a magnetic disk.

[0118] The column definitions for each row of the zip array file 103 are as follows:

[0119] column(1) is the 5-digit zip code number;

[0120] column(2) is the byte_offset into the zip+4_lat_lon centroid file 100 of the location of the lowest numbered zip∝for the 5-digit zip code of that row;

[0121] column(3) is a minimum latitude for the zip code of that row (zip_lat_min);

[0122] column(4) is a maximum latitude (zip_lat_max);

[0123] column(5) is a minimum longitude (zip_lon_min); and

[0124] column(6) is a maximum longitude (zip_lon_max).

[0125] D. Zip Windows File

[0126] The fourth file is the zip_windows file 104. The purpose of this file is to build a linkage between a latitude and longitude defined area on the earth and the zip codes that could theoretically touch this area. This linkage provides benefit by making spatial computer searches of postal geography much faster and much more efficient.

[0127] The zip_windows file 104 is created from the GDT or Post Office zip∝latitude and longitude centroid file 100 using latitude and longitude, digitized polygon zip code boundaries. The general concept is to divide the earth into one tenth of one degree (0.1°) latitude and longitude rectangles, which, for example, are approximately 6.9 miles by 5.2 miles in dimension at 40° latitude, and then tabulate all zip codes that overlap each rectangle.

[0128] The zip_windows file 104 is created by a zip windows file build process 102 that reads each record from the over 20 million record zip∝centroid file 100 and writes a corresponding record that contains a latitude and longitude (lat/lon) window and a 5-digit zip code. The lat/lon window field is created by multiplying the latitude in degrees times 10, taking the integer portion (INT) of the product, multiplying the integer portion by 10,000, and then adding the integer portion of the product of the longitude in degrees times 10.

[0129] For example, if the input zip∝record is 920141909, the latitude is 32.9862 North and the longitude is 117.2522 West, the output zip_window record would be 3291172 for the lat/lon window and a zip code of 92014. After all records have been written to an initial or temporary zip_windows file (not shown), the file is then sorted by the lat/lon window value or key with the corresponding 5-digit zip code, and duplicate records are eliminated. The resultant final zip_windows file 104 is then written with each record composed of the lat/lon window key and the corresponding 5-digit zip code. Four lat/lon windows 210, 212, 214, 216, corresponding respectively to zip window keys 3301172, 3301171, 3291172, 3291171, are illustrated in Figure 4.

[0130] Now that the input files utilized by the Client Table build process have been described, each of the three different service area definition build processes will be described.

[0131] IV. Client Table Build Process for a Radius Defined Service Area

[0132] Referring generally to Figures 3 and 4, a Client Table Process 170 for a radius defined service area will be described. Process 170 is a specific version of the client table build process 105 shown in Figure 1a.

[0133] The process 170 begins at a start state 172 and moves to state 174 wherein a client provides a client service locations file 109 (Figure 1a) of service locations in machine readable form with information and format as shown in Table 3. The file 109 can be created by, for example, a commonly available word processing program or a database program, and submitted on a floppy disk or other suitable media. Table 3 includes example information for a service location 218 named MyPizza Ristorante. The map of Figure 4 illustrates some of the same information including a circle 220 to show a 2.5 mile radius from the MyPizza Ristorante as the service area.

[0134]

3

TABLE 3 Record layout in ASCII Characters

Name of Service Location (30) Bytes
: My Pizza Ristorante

Address (36) Bytes
: 2688 Via De La Valle

City (30) Bytes
: Del Mar

State (2) Bytes
: CA

Zip Code (9) Bytes
: 92014

Telephone # (10) Bytes
: 6194817777

Radius in tenths of miles (4) Bytes
: 25

[0135] Of course, other forms, information, and formats may be substituted in other embodiments.

[0136] The process 170 moves to state 176 wherein the list of service locations in file 109 is address standardized, zip∝coded, and latitude and longitude geocoded using commercially available services through companies such as Group I and Geographic Data Technology. Table 4 is an example of a standardized record with latitude and longitude appended.

[0137]

4

TABLE 4

Name of Service Location (30) Bytes
: MY PIZZA RISTORANTE

Address (36) Bytes
: 2688 VIA DE LA VALLE

City (30) Bytes
: DEL MAR

State (2) Bytes
: CA

Zip Code (9) Bytes
: 920141909

Telephone # (10) Bytes
: 6194817777

Radius in tenths of miles (4) Bytes
: 25

Latitude in degrees (10) Bytes
: 32.9862

Longitude in degrees (12) Bytes
:-117.2522

[0138] Moving to state 178, the process 170 establishes the constant of 68.9404 miles per degree latitude and reads the zip array file 103 (Figure 1a) into memory of the computer. At state 180, the process 170 reads a record from the file of service location records and calculates the number of miles per degree longitude for the service location. The miles per degree longitude = 68.9404 * COSINE (latitude). For the example given in Table 4 at 32.9862 degrees latitude, the result is 57.8297 miles per degree longitude.

[0139] The process 170 proceeds to a function 182 which creates a list of zip windows that the service location touches. Touching a zip window means that at least part of the service area is in or overlaps the zip window. The zip windows 210, 212, 214, 216 for the example given in Table 4 are illustrated in Figure 4. The function 182 will be further described in conjunction with Figure 5 hereinbelow.

[0140] Moving to a function 184, the process 170 generates a list of 5-digit zip codes that touch any of the zip windows identified by function 182. This zip list is sorted in ascending order and duplicate zip codes are removed in the function 184. The function 184 will be further described in conjunction with Figure 7 hereinbelow.

[0141] The process 170 proceeds to a function 186 wherein 5-digit zip codes that are not within the service location site radius specified in state 174 are removed from the zip list generated by function 184, and a zip final list is created. The function 186 will be further described in conjunction with Figure 9 hereinbelow.

[0142] Advancing to function 188, the process 170 retrieves all the zip∝records corresponding to the zip codes in the zip final list (generated by function 186), used in conjunction with a zip pointer list (also generated by function 186), and determines if the zip∝is at or inside the service area radius. This determination also yields the distance from the service location to the zip∝centroid (recalling that the zip∝centroids are stored in the zip∝centroid file 100). If the zip∝is determined to be at or inside the service area radius, a raw Client Table record is written that includes the zip∝code, the client telephone number for the instant service location, and the distance of the zip∝centroid to the service location. The function 188 will be further described in conjunction with Figure 10 hereinbelow.

[0143] The process 170 moves to a decision state 190 to determine if additional client service records are to be processed. If so, the loop of states 180 to 188 is repeated for the next service location record. If all service location records have been processed for the instant Client Table, the process 170 advances to state 192. At state 192, the process 170 sorts the raw records, written by function 188, by ascending zip∝code and then by descending distance if the same zip∝code is listed more than once. The same zip∝code could be listed more than once if there are multiple service locations, each with a different client telephone number, within the client specified, radius defined service area.

[0144] Up to decision state 194, the process for building a Client Table 106 is identical for both the radius defined service area and for the service location closest to the caller within a distance limit.

[0145] At decision state 194, if the client selects the service location closest to the caller, the process 170 moves to a function 196 to finish the Client Table build process. The function 196 will be further described in conjunction with Figure 11 hereinbelow.

[0146] If the client selects the radius defined service area at decision state 194, the process 170 moves to a state 198 wherein the sorted Client Table from state 192 is loaded into the computer in the telephone network switch 111 (Figure 1c), and an index key on the zip∝codes is built. Upon completion of either function 196 or state 198, the Client Table build process ends at state 200.

[0147] Referring generally to Figure 5, the function 182 defined in Figure 3 will be described. Function 182 generates a list of zip windows that the site touches by first calculating site latitude and longitude extremes. For this calculation, the absolute value is used for both the latitude and longitude.

[0148] In another embodiment of the present invention, a prefix is assigned to the window key based on the sign of the latitude or longitude. The United States is located in the Northwest quadrant, and the key for this quadrant is zero(0). A leading zero has no impact on the value of the numeric key. The other quadrants are Northeast, east of the prime meridian at Greenwich, England in the Northern hemisphere; Southwest, west of the prime meridian in the Southern hemisphere; and Southeast, east of the prime meridian in the Southern hemisphere.

[0149] Since almost all countries of the world are only in one quadrant, using the absolute value of the latitude and longitude works well. In the few countries that are exceptions (that are in two quadrants), a different coordinate system may be used, e.g., the Ordinance Survey system used in the United Kingdom.

[0150] Beginning at a start state 252 shown in Figure 5, the process 170 moves to a state 254 to calculate latitude extremes of the service area. Several abbreviations will be used hereinforward: "min" for minimum, "max" for maximum, "lat" for latitude, and "lon" for longitude.

[0151] Site_lat_min = site_lat - radius(miles)/miles per degree lat; Site_lat_max = site_lat + radius(miles)/miles per degree lat.

[0152] Computation for the example service location and radius given in Table 4 yields:

[0153] Site_lat_min = 32.9862 - 2.5/68.9404 = 32.9499;

[0154] Site_lat_max = 32.9862 + 2.5/68.9404 = 33.0228.

[0155] The process continues at state 256 wherein longitude extremes of the service area are calculated:

[0156] Site_lon_min = site_lon - radius(miles)/miles per degree lon;

[0157] Site_lon_max = site_lon + radius(miles)/miles per degree lon.

[0158] Computation for the example service location and radius given in Table 4 yields:

[0159] Site_lon_min = 117.2522 - 2.5/57.8297 = 117.2089;

[0160] Site_lon_max = 117.2522 + 2.5/57.8297 = 117.2954.

[0161] Moving to states 258 and 260, the process 170 builds values for zip window minimum and maximum based on the site latitude and longitude, respectively. Computation using the above example and results yields:

[0162] Site_lat_window_min = Int(10*site_lat_min) = 329;

[0163] Site_lat_window_max = Int(10*site_lat_max) = 330;

[0164] Site_lon_window_min = Int(10*site_lon_min) = 1172;

[0165] Site_lon_window_min = Int(10*site_lon_max) = 1172.

[0166] Moving to a function 262, the process 170 generates zip windows based on latitude min and max values, and longitude min and max values and stores them in a zip_windows_list, which is distinct from the zip_windows file 104 (Figure 1a). Function 262 will be further described below in conjunction with Figure 6. The function 182 returns at state 264 to Figure 3.

[0167] Referring to Figure 6, the function 262 defined in Figure 5 will be described. Function 262 builds the actual zip_window_list for the service location. The function begins at a start state 270 and moves to state 272 wherein the variable I is set to equal zero (0), and the variable J is set to equal the value for the site latitude window minimum. After the initialization of state 272, the process 170 moves to state 274 wherein the variable K is set equal to the value for the site longitude window minimum. Moving to state 276, the value of variable I is incremented by one.

[0168] At state 278, a value of the zip_window_list, identified or addressed by the value of variable I, is calculated as the value of the variable J multiplied by 10000 and then adding the value of variable K. State 280 determines whether the value of K has reached the maximum value, and if not, the value of K is incremented by one (1) at state 282, and a loop to state 276 is performed. If K has reached the maximum site longitude value, the process 170 continues at state 284 to determine whether the value of J has reached the maximum value, and if not, the value of J is incremented by one (1) at state 286, and a loop to state 274 is performed. If J has reached the maximum site latitude value, the function 262 returns at state 288 to Figure 5.

[0169] Continuing the example given in conjunction with Figure 5, the result of function 262 is as follows:

[0170] Zip_window_list(1) = 3291172

[0171] Zip_window_list(2) = 3301172

[0172] Referring to Figure 7, the function 184 defined in Figure 3 will be described. Function 184 generates a list of 5-digit zip codes touching the zip windows identified by function 182 (Figure 5). Beginning at a start state 300, the process 170 moves to a state 302 and retrieves the zip_windows file 104 (Figure 1a) previously described and the zip_window_list from function 182. The zip_windows file 104 is indexed by the zip_window key and contains a list of all zip codes that touch the zip window. A sample of the zip_windows file 104 is given in Table 5, which corresponds with Figure 4.

[0173]

5

TABLE 5

Window
Zip_code

.
.

3291172
92014

3291172
92075

3291172
92130

.
.

3301172
92007

3301172
92014

3301172
92024

3301172
92029

3301172
92075

.
.

.
.

[0174] Continuing at state 304, the process 170 initializes the variable K to the value of zero (0) and the variable J to the value of one (1). Then at state 306, the process 170 advances to the record in the zip_windows file 104 having the key equivalent to the value of the zip_window_list addressed by the variable J. At state 308, the record accessed at state 306 is read to get the zip_window and the associated zip code. Moving to state 310, the variable K is incremented by one (1), followed by state 312 wherein zip code read at state 308 is written to a zip_list addressed by the variable K. A check is then made at a decision state 314 to determine if the value of the zip_window from state 308 is greater than the value of the zip_window_list addressed by the variable J. If not, the next record in the zip_windows file 104 is read by looping back to state 308.

[0175] If the decision state 314 test is true, the process moves to a decision state 316 to determine if the value of J is equivalent to the number of windows in the zip_window_list. If not, the value of J is incremented by one (1) and a loop back to state 306 is performed to process the next window. If the decision state 316 is true, all windows in the zip_window_list have been processed, and the function 184 continues at state 320 wherein the zip_list of 5-digit zip codes is sorted in ascending order. For the continuing example, after state 320, the zip_list appears as follows:

[0176] 92007

[0177] 92014

[0178] 92014

[0179] 92024

[0180] 92029

[0181] 92075

[0182] 92075

[0183] 92130

[0184] Moving to a function 322, the process 170 removes duplicate entries in the zip_list to generate a deduped_zip_list. Function 322 will be further described in conjunction with Figure 8 below. The function 184 returns at state 324 to Figure 3.

[0185] Referring to Figure 8, the function 322 defined in Figure 7 will be described. Function 322 removes duplicate 5-digit zip codes from the zip_list as sorted in state 320 of Figure 7. Beginning at a start state 340, the process 170 moves to a state 342, and the first entry of zip_list is defined to be the first entry of a deduped_zip_list. Proceeding to state 344, a variable L is assigned the value of one (1) and a variable J is assigned the value of two (2). Then at a decision state 346, the process 170 determines whether the value of zip_list addressed by J is equivalent to the value of zip_list addressed by "J minus one". If not, variable L is incremented by one at state 348, and the next entry in deduped_zip_list as addressed by L is written to be equivalent to the entry in the zip_list as addressed by J.

[0186] If the decision state 346 is false or at the completion of state 350, the process 170 moves to a decision state 352 to determine if the value of variable J is equal to the number of zip codes in the zip_list. If not, variable J is incremented by one at state 354, and the process 170 loops back to state 346 to check the next entry in zip_list. However, if all zip codes in zip_list are checked, as determined by state 352, the function 322 returns at state 356 to Figure 7. For the continuing example, the deduped_zip_list at the completion of function 322 is as follows:

[0187] 92007

[0188] 92014

[0189] 92024

[0190] 92029

[0191] 92075

[0192] 92130

[0193] Referring to Figure 9, the function 186 defined in Figure 3 will be described. Function 186 builds a zip_final list and a zip_pointer list by checking zip boundary extremes and getting an offset to the start of the zip+4_lat_lon centroid file 100 (Figure 1a) from the zip array file 103. This procedure eliminates zip codes that do not touch the area covered by the radius of the service area. Beginning at a start state 370, the process 170 moves to a state 372 and accesses the zip array file 103 (Figure 1a). Function 186 utilizes all columns, as previously described, of the zip array file 103 (Figure 1a). Moving to state 374, variable I is set to a value of zero, and variable J is set to a value of one. Proceeding to state 376, variable M is set equivalent to the entry in deduped_zip_list, from function 184, addressed by J.

[0194] Using the site information calculated in Function 182 and the information from the zip array table, a series of checks are performed by decision states 378 to 384. At decision state 378, the process 170 determines whether the site_lat_max is less than the zip_lat_min for the zip array file entry addressed by the variable M. If so, the process 170 moves to a decision state 386. If not, the process continues at decision state 380. At decision state 380, the process 170 determines whether the site_lat_min is greater than the zip_lat_max for the zip array file entry addressed by the variable M. If so, the process 170 moves to decision state 386. If not, the process continues at decision state 382.

[0195] At decision state 382, the process 170 determines whether the site_lon_max is less than the zip_lon_min for the zip array file entry addressed by the variable M. If so, the process 170 moves to decision state 386. If not, the process continues at decision state 384. At decision state 384, the process 170 determines whether the site_lon_min is greater than the zip_lon_max for the zip array file entry addressed by the variable M. If so, the process 170 moves to decision state 386. If not, the process continues at state 392. To get to state 392, a determination has been made that the zip code does touch the area covered by the radius of the site. At state 392, variable I is incremented by one, and at state 394, the process 170 writes the value of M to the zip_final list entry addressed by I. Moving to state 396, the process 170 writes the value of byte_offset from the zip array file entry addressed by the variable M to the zip_pointer list entry addressed by I, and the process moves to state 386.

[0196] If any of the decision states 378 to 384 is true, the current zip code entry from deduped_zip_list is not further used. At decision state 386, a determination is made whether all entries in the deduped_zip_list have been checked. If not, J is incremented by one at state 388, and the process 170 loops back to state 376 to check the next entry. If all entries have been checked as determined by state 386, the function 186 returns at state 398 to Figure 3. For the continuing example, the zip_final list at the completion of function 186 is as follows:

[0197] 92007

[0198] 92014

[0199] 92075

[0200] 92130

[0201] Referring to Figure 10, the function 188 defined in Figure 3 will be described. Function 188 reads all zip∝records as identified by the combination of the zip_final list and zip_pointer list, and determines if the zip∝centroids are inside the site radius. Beginning at a start state 420, the process 170 moves to a state 422 and gets the zip_final list, the zip_pointer list, and the zip∝centroid file 100. At state 424, variable J is set to a value of one. Moving to state 426, the process 170 advances in the zip∝centroid file to the address contained in the zip_pointer list addressed by the variable J. Then, at state 428, the zip∝latitude/longitude record is read at the address from state 426. The zip∝centroid file 100 (Figure 1a) is sorted in ascending zip∝order, and each record in this file contains three fields: zip∝code, latitude in degrees, and longitude in degrees. Moving to state 430, the process 170 calculates the distance from the service location to the zip∝centroid. The site latitude and longitude are available from state 176 while the zip∝latitude and longitude are available from state 428. Moving to state 432, the process 170 determines if the distance squared from state 430 is greater than the radius squared (which is available from state 174). If not, the zip∝code is inside the site radius, and the process 170 moves to state 434 to write a raw client table zip∝telephone number record. This record contains the zip∝code, the telephone number of the client service location, and the square root of the distance squared.

[0202] If the distance squared is greater than the radius squared, the zip∝code is outside the site radius, and the process moves to a decision state 436. At state 436, the process 170 determines if the current zip∝code is greater than 10000 times the value of the zip_final list entry addressed by the variable J plus 9999. The current zip∝is compared to a value for the highest possible numbered zip∝for the current zip code by appending 9999 to the 5-digit zip code. For example, if the zip code is 92007, the highest possible number for a zip∝for this zip code is 920079999. While reading the zip∝records for zip code 92007, if the zip∝record read is greater than 920079999, then the end of zip∝records for the 92007 zip code is passed, and the process 170 moves to the next zip code in the zip_final list. If the decision state 436 is false, the process 170 moves to state 438 and advances to the next zip∝record for the same 5-digit zip code in the zip∝centroid file 100. The next record is read by looping back to state 428.

[0203] If decision state 436 is true, the process 170 moves to a decision state 440 to determine if all records in the zip_final list have been read. If not, the variable J is incremented by one at state 442, and the process loops back to state 426 and repeats the procedure for the next 5-digit zip code in the zip_final list. If all 5-digit zip codes have been processed as determined by state 440, the function 188 returns at state 444 to Figure 3. For the continuing example, a sample record of the raw Client table at the completion of state 434 is as follows: Sample record: 920752064 6194817777 1.2865.

[0204] V. Client Table Build Process for the Service Location Closest to the Caller Within a Distance Limit

[0205] The "closest" process is identical to the process for building a Client Table 106 for a radius defined service area with the exception of the last step. For the "closest" process, function 196, as shown in Figure 3, is used instead of state 198. The radius defined service area can result in a zip∝code assigned to more than one service area. However, there can only be one closest service area.

[0206] States 172 to 194 in the radius defined service area process are identical for the "closest" process.. Referring to Figure 11, function 196 as defined in Figure 3 will be described. Function 196 removes multiple assignments of a zip∝code and keeps the one with the shortest distance. Beginning at a start state 500, function 196 accesses the sorted intermediate Client Table (not shown) which is available at the completion of state 192. Moving to state 504, a variable "last_zip+4" is set equal to the value of zero. Then, at state 506, beginning with the first record, a record is read from the intermediate Client Table. Moving to a decision state 508, a determination is made whether the zip∝just read in the record from state 506 is equivalent to the value of last_zip+4. If not, the current record is written to the Client Table 106 at state 510, followed by setting the variable last_zip∝equivalent to the current zip∝code at state 512.

[0207] At the completion of state 512, a decision state 514 determines if the end of the sorted intermediate Client Table has been reached. If not, the function 196 advances to the next zip∝code in the intermediate Client Table and loops back to state 506 to process the next record. If the end of the intermediate Client Table has been reached as determined by state 514, the Client Table 106 is loaded in the computer of the telephone switch 111 and an index key on the zip∝code is built. Function 196 returns at state 520 to state 200 of Figure 3 to end the "closest" process.

[0208] VI. Client Table Build Process for a Polygon Defined Service Area

[0209] In general, there are two types of polygon defined service areas. The first type is an exclusive or non-overlapping trade area, and the second type is a non-exclusive or overlapping trade area.

[0210] For a non-overlapping polygon defined service area, each franchisee has a defined trade area, such as the area in which they deliver a product. The following situation is given to illustrate this concept. A customer could be located closer to, say, Franchisee B than Franchisee A, but if the customer is in the polygon area for Franchisee A, only the telephone number for Franchisee A will be in the Client Table 106 (Figure 1a) record corresponding to the location of the customer. However, if the service areas for Franchisee A and Franchisee B are overlapping, the Client Table 106 would have one record with the telephone number and distance for Franchisee A, and another record with the telephone number and distance for Franchisee B. Therefore, the client table build process 105 accommodates both types of polygon defined service areas.

[0211] Referring generally to Figures 12a, 12b, and 13, a Client Table process 600 for a polygon defined service area will be described. Process 600 is another specific version of the general process 105 shown in Figure 1a. Many parts of the polygon defined service area process 600 (also referred to as the polygon process) are identical with those of the radius defined service area process 170. Some functions have minor changes. Other functions are totally different. For functions that are almost identical only the differences will be identified and explained to avoid repetition. The new functions will be described in some detail.

[0212] The process 600 begins at a start state 602 and moves to state 604 wherein a client provides a client service locations file 109 (Figure 1a) of service locations in machine readable form with information and format as previously shown in Table 3. The client also provides a detailed street map with the polygon service area of the service location drawn on the street map with the telephone number of the service location written inside the polygon service area. The map of Figure 13 illustrates an example polygon service area 640.

[0213] The process 600 moves to state 606 wherein the list of service locations in file 109 is address standardized, zip∝coded, and latitude and longitude geocoded using commercially available services through companies such as Group I and Geographic Data Technology. Table 4 is the example of a standardized record with latitude and longitude appended. In addition, the latitude and longitude vertices for the polygon service area drawn on the street map are digitized using a commercially available GIS system such as Infomark for Windows available from Equifax National Decision Systems. The digitizing process of state 606 assigns latitude and longitude coordinates for the vertices of the polygon and creates a polygon file 607 as shown in Figure 12b. An example of the polygon file 607 is shown in Table 6 with the following data items :

[0214]

6

TABLE 6

Geocode
: 6194817777

Name
: MyPizza Del Mar

Number of vertices
: 5

Lat/Lon vertex pairs
: 33.0170-117.2910

: 32.9503-117.2874

: 329623-117.2132

: 33.0187-117.2084

: 33.0170-117.2910

[0215] The last latitude/longitude vertex pair must equal the first pair to close the polygon. This example is for a very simple polygon. Typical franchise polygons are very complex; the polygon may follow non-linear street boundaries and contain hundreds of vertices. The geocode is the telephone number of the service location.

[0216] Moving to state 608, the process 600 establishes the constant of 68.9404 miles per degree latitude and reads the zip array file 103 (Figure 1a) into memory of the computer. At state 610, the process 600 reads a record from the client service location file 109 and calculates the number of miles per degree longitude for the service location. The miles per degree longitude = 68.9404 * COSINE (latitude). For the example given in Table 4 at 32.9862 degrees latitude the result is 57.8297 miles per degree longitude.

[0217] The process 600 proceeds to a function 612 which generates a list of zip windows that the service location touches. Touching a zip window means that at least part of the service area is in or overlaps the zip window. The zip windows for the example given in Table 4 are illustrated in Figure 13. The function 612 will be further described in conjunction with Figure 14 hereinbelow.

[0218] Moving to a function 614, the process 600 generates a list of 5-digit zip codes that touch any of the zip windows identified by function 612. This zip list is sorted in ascending order and duplicate zip codes are removed in function 614. The function 614 will be further described in conjunction with Figure 16 hereinbelow.

[0219] The process 600 proceeds to a function 616 wherein 5-digit zip codes that are not within the polygon service area specified in state 604 are removed from the zip list generated by function 614, and a zip final list is created. The function 616 will be further described in conjunction with Figure 18 hereinbelow.

[0220] Advancing to function 618, the process 600 builds a line index file 619 shown in Figure 12b of discrete latitude and longitude points that define the polygon. Function 618 will be further described in conjunction with Figure 19a and 19b hereinbelow.

[0221] Continuing to function 620, the process 600 retrieves all the zip∝records corresponding to the zip codes in the zip final list generated by function 616 and determines if the zip∝code is at or inside the polygon service area. If so, a record is written in a raw Client Table (not shown) that includes the zip∝code, the client telephone number for the instant service location, and the distance of the zip∝centroid to the service location. The function 620 will be further described in conjunction with Figure 20 hereinbelow.

[0222] The process 600 moves to a decision state 622 to determine if additional client service records are to be processed. If so, the loop of states 610 to 620 is repeated for the next service location record. If all service location records have been processed for the instant raw Client Table, the process 600 advances to state 624. At state 624, the process 600 sorts the raw records, written by function 620, by ascending zip∝code and then by descending distance, if the same zip∝code is listed more than once. The same zip∝code could be listed more than once if there are multiple overlapping polygon service locations, each with a different client telephone number.

[0223] The process 600 then moves to a state 626 wherein the sorted Client Table from state 624 is loaded onto the computer of the telephone network switch 111, and an index key on the zip∝codes is built. Upon completion of state 626, the Client Table build process 600 for a polygon defined service area ends at state 628.

[0224] Referring generally to Figure 14, the function 612 defined in Figure 12a will be described. Function 612 generates a list of zip windows that the site touches by first calculating site latitude and longitude extremes. For this function, the absolute value is used for both the latitude and longitude.

[0225] Beginning at a start state 670, the process 600 moves to a state 672 to establish latitude extremes of the service area. The polygon file 607 is accessed to retrieve the polygon vertices latitude minimum and maximum values.

[0226] Site_lat_min = polygon_lat_min;

[0227] Site_lat_max = polygon_lat_max.

[0228] For the example service location and polygon given in Table 6, the results are as follows:

[0229] Site_lat_min = 32.9503;

[0230] Site_lat_max = 33.0187.

[0231] The process continues at state 674 wherein longitude extremes of the service area are established. The polygon vertices longitude minimum and maximum values are retrieved from the polygon file 607.

[0232] Site_lon_min = polygon_lon_min;

[0233] Site_lon_max = polygon_lon_max.

[0234] For the example service location and polygon given in Table 6, the results are as follows:

[0235] Site_lon_min = 117.2084;

[0236] Site_lon_max = 117.2910.

[0237] States 676 and 678 are identical to states 258 and 260 of function 182 (Figure 5). As defined in Figure 14, function 680 (Figure15 is identical to function 262 (Figure 6). Function 612 returns at state 682 to Figure 12a.

[0238] As defined in Figure 12a, function 614 (Figure 16) is identical to function 184 (Figure 7). As defined in Figure 16, function 752 (Figure 17) is identical to function 322 (Figure 8). As defined in Figure 12a, function 616 (Figure 18) is identical to function 186 (Figure 9).

[0239] Referring to Figures 19a and 19b, the function 618 defined in Figure 12a will be described. Function 618 builds the line index file 619 by rounding all modified polygon vertices latitudes and longitudes to an integer value, thereby creating a record of every discrete point along the line generated by connecting adjacent vertices listed in the polygon file 607. The modification performed to the polygon vertices is subtracting the site_lat_min or site_lon_min as will be seen below.

[0240] Beginning at a start state 830, the process 600 moves to a state 832 and initializes a variable J to equal the value one. Moving to state 834, the process 600 initializes a tangent (denoted by "T" in Figure 19) array element addressed by the variable J to equal the value zero. At state 836, a latitude array (denoted by "LAT" in Figure 19) element addressed by J is written to the value calculated by: subtracting site_lat_min (available from function 612, Figure 14) from the vertices latitude (lat_vertices) addressed by J in the polygon file 607 (available from state 606), multiplying the result by 10,000, and then taking the integer (INT) portion of the product. Advancing to state 838, a longitude array (denoted by "LON" in Figure 19) element addressed by J is written to the value calculated by: subtracting site_lon_min (available from function 612, Figure 14 from the vertices longitude (lon_vertices) addressed by J in the polygon file 607 (available from state 606), multiplying the result by 10,000, and then taking the integer portion of the product.

[0241] At a decision state 840, the process 600 determines if all vertices in the polygon file 607 have been processed. The number of vertices is available from state 606 as shown in the example in Table 6. If not, variable J is incremented by one at state 842, and the process 600 loops back to state 834 to process the next vertices. If all vertices have been processed, variable J is set equal to the value two at state 844.

[0242] States 846 through 860 are used to find vertices that are tangent to a latitude line. States 846 through 854 form a loop to sequence through all elements of the LAT array to determine if either of the conditions of decision states 846 or 850 are met. If so, the element of the tangent array addressed by J is set equal to one. If not, the next element is checked, by incrementing J at state 854 and looping back to state 846, until the end of the LAT array is reached, i.e., all vertices are tested, and decision state 852 is true. Decision state 846 determines whether the values of the elements of array LAT immediately before and immediately after the current element are greater than the value of the current element. In other words, decision state 846 determines whether a latitude line is tangent to vertex(J). Decision state 850 determines whether the values of the elements of array LAT immediately before and immediately after the current element are less than the value of the current element. In other words, decision state 850 determines whether a latitude line is tangent to vertex(J).

[0243] When J equals the number of vertices minus one, the process 600 moves to states 856 through 860 to perform the follow tests:

[0244] decision state 856: If LAT(1) > LAT(2) AND LAT(1) > LAT(number_vertices-1) then T(J) = 1;

[0245] decision state 860: If LAT(1) < LAT(2) AND LAT(1) < LAT(number_vertices-1) then T(J) = 1.

[0246] Number_vertices is used to represent the number of vertices as available from state 606. Decision states 856 through 860 test for a special case of previous states 846 through 854 to determine if vertex(1) is tangent to a latitude line. If so, the element of the tangent array addressed by J is set equal to one.

[0247] At state 862, the process 600 sets variable J equal to one. Block 864 is an off page connector from Figure 19a to Figure 19b. Continuing on from block 864 on Figure 19b, the process 600 generates a pseudo-line of discrete latitude points connecting the polygon vertices. Each point that defines the line is described by an X,Y coordinate. Each Y coordinate or latitude point is one ten-thousandth of a degree latitude apart on the Y axis.

[0248] Decision state 866 checks for parallel latitude lines, and if true, the process 600 moves to decision state 886 to determine if all vertices have been processed. If not, J is incremented by one at state 888, and the process loops back to decision state 866 to check the next element of array LAT. If LAT(J) does not equal LAT(J+1) as determined by decision state 866, the process 600 moves to state 868, sets a variable K to equal the value of LAT(J), and moves to state 870.

[0249] State 870 is used to leave out latitude tangent vertices points. State 870 determines if K is equivalent to LAT(J) and T(J) equals one. If so, the process 600 moves to decision state 882 to determine if K should be incremented by one at state 884, or if K has reached the value "LAT(J+1) - 1" and decision state 886 is to be performed. If K is incremented at state 884, the process 600 loops back to decision state 870.

[0250] If decision state 870 is false, the process 600 moves to state 872 to calculate a variable "delta_lat" to be "LAT(J) - LAT(J+1)". At state 874, a variable "delta_lon" is calculated as the difference between the value of the array LON element addressed by J and the value of the array LON element addressed by J plus one. Moving to state 876, a variable "lat_point" is set equivalent to the value of variable K. State 878 is used to calculate a longitude (variable "lon_point") for latitude line point using the following equation:

[0251] lon_point = INT((K-LAT(J)/delta_lat) * delta_lon+LON(J)).

[0252] Moving to state 880, the process 600 writes the values of lat_point and lon_point to the line index file and then loops back to decision state 882 to check on the value of K.

[0253] At decision state 886, if J equals the number of vertices minus one, all vertices have been processed, and the process 600 moves to state 890. At state 890, the process 600 sorts the line index file by ascending latitude point, and then by ascending longitude point within the latitude point. Moving to state 894, process 600 builds the polygon line index file 619 using the latitude point as the indexing key. Function 618 returns at state 894 to Figure 12a.

[0254] Referring to Figure 20, the function 620 defined in Figure 12a will be described. Function 620 reads all zip∝records as identified by the combination of the zip_final list and zip_pointer list, and determines if the zip∝centroids are inside the polygon service area.

[0255] Beginning at a start state 910, the states 912 through 918 are identical to states 422 through 428 of function 188 (Figure 10). Then beginning at state 920 through state 926, the process 600 compares the latitude and longitude of the zip∝centroid to the minimums and maximums of the site latitude and longitude available from function 612 (Figure 14). In other words, the process 600 determines if the zip∝centroid is inside the latitude and longitude extremes of the polygon service area. If not, at state 928 the process 600 advances to point to the next zip∝record and then loops back to state 918 to read the zip∝record.

[0256] However, if the zip∝centroid is determined to be inside the latitude and longitude extremes of the polygon service area by states 920 through 926, the process 600 moves a function 930. Function 930 is a final test to determine if the zip∝centroid is indeed inside the polygon. The point- in-polygon test of function 930 returns with either an "inside" flag or "outside" flag. If the zip∝centroid is not inside the polygon, the "outside" flag is set by function 930, and the process 600 moves to state 928 to advance to the next zip∝record. However, if the zip∝centroid is inside the polygon, the "inside" flag is set by function 930, and the process 600 moves to state 932 to perform a distance calculation. State 932 is identical to state 430 of function 188 (Figure 10). States 934 through 940 and 928 are identical to states 434 through 442 of function 188. Function 620 returns at state 942 to Figure 12a.

[0257] Referring to Figure 21, the function 930 defined in Figure 20 will be described. Function 930 tests to determine if the zip∝centroid is inside the polygon. Function 930 conceptually draws a line from the zip∝latitude in a negative longitude direction and then counts the number of times the line crosses the polygon boundary. If the line crosses an odd number of times, the zip∝centroid is inside the polygon, but an even number of line crossings determines that the zip∝centroid is outside the polygon.

[0258] Beginning at a start state 960, the process 600 moves to state 962 to calculate a value for a variable "lat" by: subtracting site_lat_min (available from function 612, Figure 14) from zip+4_lat (available from the zip∝centroid file 100), multiplying the result by 10,000, and then taking the integer (INT) portion of the product. Moving to state 964, the process 600 calculates a value for a variable "lon" by: subtracting site_lon_min (available from function 612) from zip+4_lon (available from the zip∝centroid file 100), multiplying the result by 10,000, and then taking the integer portion of the product.

[0259] Moving to state 966, the process 600 initializes the variable "count" to a value of zero and proceeds to state 968 to access the line index file 619. At state 970, the process 600 reads the polygon line index file 619 (available from function 618, Figure 19) to retrieve the values for the variables "lat_point" and "lon_point". The process 600 advances in the polygon line index file 619 to the first occurrence of "lat" in the file by use of the file ISAM index. Moving to a decision state 972, the process 600 determines if "lat_point" is greater than "lat". If "lat_point" is greater than "lat", then all records in the polygon line index file 619 have been read. If not, a test is performed at a decision state 974 to determine if "lon_point" is less than "lon". If "lon_point" is less than "lon", a line drawn from the zip∝centroid toward negative infinity is defined to cross a polygon line. At state 976, "count" is incremented by one to indicate the line crossing exists, and the process 600 loops back to state 970. However, if decision state 974 is false, the process 600 loops back to state 970 to perform the next read of the line index file 619.

[0260] If process 600 determines at decision state 972 that "lat_point" is greater than "lat", process 600 moves to a decision state 978 to check if "count MODULUS 2" is equal to zero. If so, an even number of line crossings exist, the "outside" flag is then set, and the function 930 returns at state 980 to Figure 20. If decision state 978 is false, i.e., "count MODULUS 2" is not equal to zero, an odd number of line crossings exist which denotes that the zip∝centroid is inside the polygon. The process 600 sets the "inside" flag, and the function 930 returns at state 982 to Figure 20.

[0261] VII. Summary

[0262] The present invention utilizes ANI information as an index to a table containing partitions of a country into small geographic areas, such as postal service zip∝codes. These partitions are further utilized to access one of a plurality of service locations that may be anywhere within the country.

[0263] The automated telephone routing system of the present invention provides the ability to reduce costs by routing a very high percentage of calls made to a single national telephone number without any human intervention and the marketing advantage for a client of a single, easy to remember, toll free or nominal fee national telephone number. The system also provides geographically precise results due to the use of all ten digits of the calling and called telephone numbers which correspond with the zip∝codes for the locations of these numbers. The automated routing system provides the ability for a business to choose among different types of destination service area definitions. Preferably, these service area definitions include the closest service location to the caller within a predefined distance; all service locations within a specific radius of the caller; and a service location whose service area is defined as an irregular shaped polygon that may or may not overlap with any other polygons.

[0264] The present invention provides a method of routing all published and unpublished telephone numbers, including unlisted numbers, secondary unpublished business lines, and public pay phones without any violation of federal, state and local laws. The present invention also provides a method for legally conforming to contracted franchise territory definitions executed between franchisers and franchisees by routing customer's calls precisely to the correct legal franchisee area. Additionally, the present invention provides a method for precisely routing telephone calls based on any geographic definition including postal geography, census geography, telecommunications geography, special grid coordinate geography, and all custom geography.

[0265] The present invention provides a method for automatically routing and processing customer calls that do not meet the pre-set client protocols. This "exceptions handling" process routes to a "live" operator who executes preset exceptions handling protocols. The present invention also provides for a method of integrating unrelated geographic information systems and database technology, telecommunications systems and database technology, postal systems and database technology, and computer technology into a common applications driven architecture. Additionally, the present invention provides a method for dynamically and instantaneously updating and integrating Client and Master Tables with no time lags. Furthermore, the present invention provides a method for automating the processing of information that is input by a customer using a customer interface that automatically routes telephone calls to customer requested destinations.

[0266] While the above detailed description has shown, described, and pointed out the fundamental novel features of the invention as applied to various embodiments, it will be understood that various omissions and substitutions and changes in the form and details of the device illustrated may be made by those skilled in the art, without departing from the spirit of the invention.

Claims

1. A method of determining information about a second location relatively near a first location, the second location being selected from a plurality of possible second locations based on a location identifier received during communication over a network and based on information derived from the United States Census Bureau Topological Integrated Geographic Encoding and Referencing (TIGER) files, the method comprising:
2. The method of Claim 1, wherein the location identifier corresponds to a telephone number.
3. The method of Claim 1, wherein the location identifier corresponds to a street address.
4. The method of Claim 1, wherein the location identifier corresponds to a coordinate address.
5. The method of Claim 1, wherein the location identifier is provided by the network.
6. The method of Claim 1, wherein the location identifier is provided by the first party.
7. The method of Claim 1, wherein the location identifier corresponds to an address of the first party.
8. The method of Claim 1, wherein the location identifier corresponds to an address of a second party.
9. The method of Claim 1, wherein the spatial location definition includes a coordinate.
10. The method of Claim 1, wherein the spatial location definition includes a polygon.
11. The method of Claim 1, wherein the spatial location definition includes a radius.
12. The method of Claim 1, wherein the spatial location definition encompasses all possible address locations.
13. The method of Claim 1, wherein the spatial location definition is client defined.
14. The method of Claim 1, wherein linking the received location identifier to a relatively spatially near second location comprises linking to a location with a polygonal spatial location definition that contains the location associated with the location identifier.
15. The method of Claim 1, wherein linking the received location identifier to a relatively spatially near second location comprises linking to a location nearest to the location associated with the location identifier.
16. The method of Claim 1, wherein linking the received location identifier to a relatively spatially near second location comprises linking to a location with a radius-defined spatial location definition that contains the location associated with the location identifier.
17. The method of Claim 1, wherein linking the received location identifier to a relatively spatially near second location comprises linking to a list of relatively spatially near second locations.
18. The method of Claim 1, wherein linking based on information obtained at least in part from the TIGER files comprises using data from a file derived from the TIGER files.
19. The method of Claim 1, wherein linking based on information obtained at least in part from the TIGER files comprises using information from the TIGER files to obtain information associated with one of: the location identifier associated with the first location and the relatively spatially near second location.
20. The method of Claim 1, wherein linking based on information obtained at least in part from the TIGER files comprises using information from the TIGER files to obtain information associated with both the location identifier associated with the first location and the relatively spatially near second location.
21. The method of Claim 1, wherein retrieving information associated with said second location includes retrieving information based on data obtained from the U.S. Post Office.
22. The method of Claim 21, wherein the data obtained from the U.S. Post Office comprises information from an Address Coding Guide.
23. The method of Claim 1, wherein the information associated with said second location includes a second location telephone number.
24. The method of Claim 23, further comprising connecting a telephone call from the first party to the second location telephone number.
25. A method of locating a nearby location over a communications network based on information derived from the United States Census Bureau Topological Integrated Geographic Encoding and Referencing (TIGER) files, the method comprising:
26. The method of Claim 25, wherein receiving the telephone number comprises capturing a telephone number provided by the communications network.
27. The method of Claim 25, wherein receiving the telephone number comprises capturing a telephone number provided by a party using the communications network.
28. The method of Claim 25, wherein linking the location corresponding to the telephone number to a relatively spatially near second location comprises linking the location corresponding to the telephone number to a list of relatively spatially near second locations.
29. The method of Claim 25, wherein providing the retrieved information over the communications network comprises providing the telephone number to the communications network to connect a telephone call.
30. A method of enabling a first party to order products or services from a second location relatively nearby a first location, the second location being selected from a plurality of possible second locations based on a first location identifier received during communication over a network, the method comprising:
31. The method of Claim 30, wherein the file containing the majority of all the street links in the United States includes street names and address ranges for the links.
32. The method of Claim 30, wherein the file containing the majority of all the street links in the United States comprises a United States Census Bureau Topological Integrated Geographic Encoding and Referencing (TIGER) file.
33. The method of Claim 30, wherein the order is for a service.
34. The method of Claim 30, wherein the order is for a product.
35. The method of Claim 30, wherein the order is for food.
36. The method of Claim 30, wherein the order is for pizza.
37. The method of Claim 30, wherein the order is for delivery.
38. A method of associating servicing locations with serviced locations in a network communication system based on address information corresponding to a particular serviced location, the method comprising:
39. The method defined in Claim 38, wherein the servicing location spatial data and the serviced location spatial data comprise latitude and longitude data.
40. The method defined in Claim 38, wherein the servicing location spatial data and serviced location spatial data comprise zip code data.
41. The method defined in Claim 40, wherein the zip code data comprises zip∝data.
42. The method defined in Claim 40, wherein the zip code data comprises zip≢data.
43. The method defined in Claim 38, wherein the identifying data for the servicing location comprises a service area.
44. The method defined in Claim 43, wherein the service area comprises a polygon.
45. The method defined in Claim 43, wherein the service area comprises a center point and a radius.
46. The method defined in Claim 38, wherein the identifying data for the serviced location comprises a service area.
47. The method defined in Claim 46, wherein the service area comprises a polygon.
48. The method defined in Claim 46, wherein the service area comprises a center point and a radius.
49. The method defined in Claim 38, further comprising providing a service area definition associated with the particular serviced location, and wherein the generating generates the list of at least one servicing location related to a particular serviced location based on the service area definition.
50. The method defined in Claim 49, wherein the service area definition comprises a polygon.
51. The method defined in Claim 49, wherein the service area definition comprises a center point.
52. The method defined in Claim 49, wherein the service area definition comprises a center point and a radius.
53. The method defined in Claim 38, wherein a single database comprises the first and second databases.
54. The method defined in Claim 38, wherein the generating is preceded by selecting the particular serviced location corresponding to a telephone number.
55. The method defined in Claim 38, wherein the generating is preceded by selecting the particular serviced location corresponding to a street address.
56. The method defined in Claim 38, wherein the generating is preceded by selecting the particular serviced location corresponding to a zip code.
57. The method defined in Claim 38, wherein the generating comprises generating a list of servicing locations that are nearest to the particular serviced location.
58. The method defined in Claim 57, wherein the list of servicing locations that are nearest to the particular serviced location is ordered by distance from serviced location.
59. The method defined in Claim 57, wherein the list of servicing locations that are nearest to the particular serviced location includes a distance from serviced location to each servicing location in the list.
60. A method of associating servicing locations with serviced locations in a network communication system based on address information corresponding to a particular serviced location, the method comprising:
61. The method defined in Claim 60, wherein the servicing location spatial data and the serviced location spatial data comprise latitude and longitude data.
62. The method defined in Claim 60, wherein the servicing location spatial data and the serviced location spatial data comprises zip code data.
63. The method defined in Claim 60, further comprising providing a service area definition associated with the particular servicing location, and wherein the generating generates the list of at least one serviced location related to a particular servicing location based on the service area definition.
64. The method defined in Claim 63, wherein the service area definition comprises a polygon.
65. The method defined in Claim 60, wherein a single database comprises the first and second databases.
66. The method defined in Claim 60, wherein the generating is preceded by selecting the particular servicing location corresponding to a telephone number.
67. The method defined in Claim 60, wherein the generating is preceded by selecting the particular servicing location corresponding to a street address.
68. The method defined in Claim 60, wherein the generating is preceded by selecting the particular servicing location corresponding to a zip code.
69. The method defined in Claim 60, wherein the generating comprises generating a list of serviced locations that are nearest to the particular servicing location.
70. The method defined in Claim 69, wherein the list of serviced locations that are nearest to the particular servicing location is ordered by distance from servicing location.
71. The method defined in Claim 69, wherein the list of serviced locations that are nearest to the particular servicing location includes a distance from the servicing location to each serviced location in the list.

Cross Reference to Related Applications

[0001] This application is a continuation of U.S. Patent Application No. 09/100,567 filed on June 19, 1998, which is a continuation-in-part of U.S. Patent Application No. 08/659,318 (now U.S. Patent No. 5,982,868) filed on June 6, 1996, which is a continuation-in-part of U.S. Patent Application No. 08/598,392 (now U.S. Patent No. 5,848,131) filed on February 8, 1996, which is a continuation-in-part of U.S. Patent Application No. 08/365,325 (now U.S. Patent No. 5,506,897) filed on December 28, 1994, which is a file-wrapper continuation of U.S. Patent Application No. 08/020,653 (now abandoned), filed on February 22, 1993.

Continuations (1)

	Number	Date	Country
Parent	09/100567		US
Child	10053290	Jan 2002	US

AUTOMATED TELECOMMUNICATIONS CALL PROCESSING METHOD

Information

Publication Number

Date Filed

Date Published

Inventors

Original Assignees

CPC

US Classifications

International Classifications

Abstract

Description

Claims

Cross Reference to Related Applications

Continuations (1)