IP Library › Granted Patent US 11,157,927
Granted Patent B2
US 11,157,927 · App. 15/775,654 · Granted Oct 26, 2021

System and method for determining a service demand in a service network

Inventors: Fang Chen (Alexandria, AU); Yan Xu (Alexandria, AU); Aditya Menon (Alexandria, AU); Chen Cai (Alexandria, AU)
Assignee: National ICT Australia Limited
G06Q30/0202G06Q10/04G06Q10/0631
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,157,927
App. No.
15/775,654
Granted
Oct 26, 2021
Kind
B2
Abstract

A computer-implemented method, software and system for determining a service demand in a service network are disclosed. A first information indicative of prior proportion knowledge of elements of the service demand is received. Two or more elements of the service demand represent service volumes for two or more pairs of zones and the first information indicates reference relative relationships between the two or more elements of the service demand. Second information indicative of instances of service at specific locations in the service network are received. The service demand is determined by minimising a cost function. The cost function is based on the first information and the second information.

Claims (21)

1. A computer-implemented method for determining a service demand in a transport network, wherein two or more elements of the service demand represent traffic volumes for two or more pairs of zones in the transport network, the method comprising:

receiving first information indicative of prior proportion knowledge wherein the prior proportion knowledge comprises a proportion of traffic volume for a pair of zones of the transport network relative to the sum of traffic volumes in the transport network;

receiving, from one or more service detectors, second information indicative of instances of number of vehicles recorded at specific locations in the transport network;

determining the service demand by minimising a cost function that is convex with respect to the elements of the service demand,

wherein the cost function comprises a first measure of match between the service demand and a reference service demand, wherein the reference service demand is calculated based on the service demand and the first information, and

wherein the cost function further comprises a second measure of match between the second information and an approximation of the second information; and

altering the transport network to reroute traffic in response to the determined service demand.

2. The computer-implemented method according to claim 1 , wherein the first measure of match is scalable.

3. The computer-implemented method according to claim 1 , wherein the approximation of the second information is calculated based on an assignment map and the service demand.

4. The computer-implemented method according to claim 1 , wherein the first information is determined based on census data or household survey data.

5. The computer-implemented method according to claim 1 , wherein the one or more service detectors are installed in the transport network.

6. A computer-implemented method for determining a service demand in a transport network, wherein two or more elements of the service demand represent traffic volumes for two or more pairs of zones in the transport network, the method comprising:

(a) receiving first information indicative of prior proportion knowledge, wherein the prior proportion knowledge comprises a proportion of traffic volume for a pair of zones of the transport network relative to the sum of traffic volumes in the transport network;

(b) receiving from one or more service detectors, second information indicative of instances of number of vehicles recorded at specific locations in the transport network;

(c) receiving a reference service demand and an assignment map;

(d) determining a first service demand by minimising a cost function that is convex with respect to the elements of the first service demand, wherein the cost function comprises a first measure of match between the first service demand and the reference service demand, wherein the reference service demand is calculated based on the first service demand and the first information, and wherein the cost function further comprises a second measure of match between the second information and an approximation of the second information, wherein the approximation of the second information is calculated based on the first service demand and the assignment map;

(e) updating the assignment map and the approximation of the second information based on the first service demand;

(f) if a measure of match between the first service demand and the reference service demand does not meet a target, updating the reference service demand to the first service demand, and repeating (d) to (e);

(g) if the measure of match meets the target, determining the first service demand to be the service demand in the transport network; and

(h) altering the transport network to reroute traffic in response to the determined service demand.

7. A non-transitory computer-readable medium, including computer executable instructions stored thereon that, when executed by a processor, causes the computer to perform the method of claim 1 .

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 8, 2021
From: CHEN, FANG; XU, YAN; CAI, CHEN
To: NATIONAL ICT AUSTRALIA LIMITED
Reel/Frame 057416/0576 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 8, 2021
From: MENON, ADITYA
To: NATIONAL ICT AUSTRALIA LIMITED
Reel/Frame 057438/0084 →
Priority Claims (1)
AU 2015904699 · Nov 13, 2015 · national
Continuity (1)
Related Publication 20180349931A1 · Dec 6, 2018