IP Library Granted Patent US 12,229,599
Granted Patent B2
US 12,229,599 · App. 17/707,767 · Granted Feb 18, 2025

Algorithmically optimized determination of resource assignments in machine request analyses

Inventors: Robin Andrew Cecil Reid (Bradford, GB); Geoffrey John Cawood (Harrogate, GB); Nicholas James Taylor (Harrogate, GB); Samantha Oxley (Harrogate, GB)
Assignee: Certinia Inc.
G06F9/5027
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 12,229,599
App. No.
17/707,767
Granted
Feb 18, 2025
Kind
B2
Abstract

Techniques for algorithmically optimized determination of resource assignments in machine request analyses are described, including receiving a request having resource request data and criteria data, evaluating the request to identify a resource type and a suitability matrix, which are analyzed to generate a data model, to select an algorithm to apply to the data model, to evaluate an output from the algorithm being applied to the data model to generate a resultant dataset, including evaluating another resultant dataset generated by applying another algorithm to another data model generated using the request data, the criteria data, the resource type, and the suitability matrix, to generate an optimization cost for each solution indicating the resource to be assigned to the request, and to transmit a resultant dataset identifying the one or more resources based on the optimization cost.

Claims (35)

1. A method, comprising:

receiving at a computing platform a request comprising resource request data and criteria data;

evaluating the resource request data and the criteria data to identify a resource type and to generate a suitability matrix, the evaluating comprising invoking an analytical module configured to generate a data model using the resource request data, the criteria data, the resource type, and the suitability matrix;

selecting an algorithm to apply to the data model using the suitability matrix, the resource request data, the criteria data, and the resource type;

evaluating an output from the algorithm being applied to the data model to generate a resultant dataset, including evaluating another resultant dataset generated by applying another algorithm to another data model generated using the resource request data, the criteria data, the resource type, and the suitability matrix;

generating an optimization cost associated with the resultant dataset, the resultant dataset including the optimization cost;

using a simulated annealing algorithm to randomly generate further data indicating a selection of one or more resources using the resource request data and the criteria data, the selection being assigned the optimization cost; and

transmitting from a resource manager module in data communication with the computing platform to a client the resultant dataset identifying a resource, the resultant dataset being configured to at least be rendered on a display.

2. The method of claim 1 , wherein the criteria data indicates a role.

3. The method of claim 1 , wherein the criteria data indicates a region.

4. The method of claim 1 , wherein the criteria data indicates a practice.

5. The method of claim 1 , wherein the criteria data indicates a group associated with a resource.

6. The method of claim 1 , wherein the resultant dataset is configured to assign the resource to the resource request data in a stacked rank order.

7. The method of claim 1 , wherein the criteria data indicates a selection criteria associated with a resource, the resource being matched, using a weighting, to a resource request associated with the resource request data.

8. The method of claim 1 , wherein the selecting the algorithm comprises generating an application call to an application service configured to invoke the simulated annealing algorithm.

9. The method of claim 1 , wherein the selecting the algorithm comprises the simulated annealing algorithm.

10. The method of claim 1 , wherein selecting the resultant dataset comprises a list of the one or more resources associated with the output and an another output, the output and the another output each being indicated as a solution to the request.

11. The method of claim 1 , wherein the selecting the algorithm comprises invoking the simulated annealing algorithm selected based on one or more criteria indicated by the criteria data.

12. The method of claim 1 , wherein the selecting the algorithm comprises generating a call to an algorithm service configured to invoke the simulated annealing algorithm when the algorithm service is called by the computing platform.

13. The method of claim 1 , wherein the criteria data is numerically weighted before the selecting the algorithm and transformatively applied to the resource request data using the criteria data.

14. The method of claim 1 , wherein the algorithm is invoked by the computing platform, the algorithm being applied to the resource request data and the criteria data to generate the optimization cost and the resultant dataset, the resultant dataset being configured to identify the one or more resources assignable to the resource request data, and the criteria data.

15. A system, comprising:

a memory device configured to store resource request data, criteria data, and project data; and

a processor configured to receive at a computing platform a request comprising the resource request data and the criteria data, to evaluate the resource request data and the criteria data to identify a resource type and to generate a suitability matrix, the evaluating comprising invoking an analytical module configured to generate a data model using the resource request data, the criteria data, the resource type, and the suitability matrix, to select an algorithm to apply to the data model using the suitability matrix, the resource request data, the criteria data, and the resource type, to evaluate an output from the algorithm being applied to the data model to generate a resultant dataset, including evaluating another resultant dataset generated by applying another algorithm to another data model generated using the resource request data, the criteria data, the resource type, and the suitability matrix, to generate an optimization cost associated with the resultant dataset, the resultant dataset including the optimization cost, to use a simulated annealing algorithm to randomly generate further data indicating a selection of one or more resources using the resource request data and the criteria data, the selection being assigned the optimization cost, and to transmit from a resource manager module in data communication with the computing platform to a client the resultant dataset identifying a resource, the resultant dataset being configured to at least be rendered on a display.

16. The system of claim 15 , wherein the algorithm comprises an algorithm service invoked by the computing platform over a data network coupling the client and the computing platform.

17. The system of claim 15 , wherein the algorithm uses simulated annealing to determine randomly a solution including the one or more resources to be assigned to the request.

18. The system of claim 15 , wherein the resultant dataset is configured to be displayed with a heat map and a list of the one or more resources.

19. A non-transitory computer readable medium having one or more computer program instructions configured to perform a method, the method comprising:

receiving at a computing platform a request comprising resource request data and criteria data;

evaluating the resource request data and the criteria data to identify a resource type and to generate a suitability matrix, the evaluating comprising invoking an analytical module configured to generate a data model using the resource request data, the criteria data, the resource type, and the suitability matrix;

selecting an algorithm to apply to the data model using the suitability matrix, the resource request data, the criteria data, and the resource type;

evaluating an output from the algorithm being applied to the data model to generate a resultant dataset, including evaluating another resultant dataset generated by applying another algorithm to another data model generated using the resource request data, the criteria data, the resource type, and the suitability matrix;

generating an optimization cost associated with the resultant dataset, the resultant dataset including the optimization cost;

using a simulated annealing algorithm to randomly generate further data indicating a selection of one or more resources using the resource request data and the criteria data, the selection being assigned the optimization cost; and

transmitting from a resource manager module in data communication with the computing platform to a client the resultant dataset identifying a resource, the resultant dataset being configured to at least be rendered on a display.

Assignments (5)
CHANGE OF ADDRESS Recorded Sep 12, 2024
From: CERTINIA INC.
To: CERTINIA INC.
Reel/Frame 068948/0361 →
SECURITY INTEREST Recorded Aug 7, 2023
From: CERTINIA INC.
To: BLUE OWL CREDIT INCOME CORP., AS COLLATERAL AGENT
Reel/Frame 064510/0495 →
CHANGE OF NAME Recorded Jul 3, 2023
From: FINANCIALFORCE.COM, INC.
To: CERTINIA INC.
Reel/Frame 064194/0104 →
CHANGE OF ADDRESS Recorded May 12, 2023
From: FINANCIALFORCE.COM, INC.
To: FINANCIALFORCE.COM, INC.
Reel/Frame 063633/0852 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 31, 2022
From: REID, ROBIN ANDREW CECIL; CAWOOD, GEOFFREY JOHN; TAYLOR, NICHOLAS JAMES; OXLEY, SAMANTHA
To: FINANCIALFORCE.COM, INC.
Reel/Frame 060059/0821 →
Continuity (1)
Related Publication 20230315524A1 · Oct 5, 2023
References Cited (104)
US 6829621B2 · Keller · 2004 [cited by applicant]
US 8316296B2 · Paek et al. · 2012 [cited by applicant]
US 8667495B1 · Brandwine · 2014 [cited by examiner]
US 8675842B2 · Franklin-Barr et al. · 2014 [cited by applicant]
US 9262218B2 · Bostic et al. · 2016 [cited by applicant]
US 9754226B2 · Zheng et al. · 2017 [cited by applicant]
US 10169035B1 · Caspi · 2019 [cited by applicant]
US 10224035B1 · Koenig et al. · 2019 [cited by applicant]
US 10276185B1 · Ma et al. · 2019 [cited by applicant]
US 10304014B2 · Garza · 2019 [cited by examiner]
US 10346809B1 · Byrne · 2019 [cited by applicant]
US 10467218B2 · Willcock et al. · 2019 [cited by applicant]
US 10509683B2 · Furman · 2019 [cited by examiner]
US 10616402B2 · Byrne · 2020 [cited by applicant]
US 10635748B2 · Liu et al. · 2020 [cited by applicant]
US 10636013B2 · Byrne · 2020 [cited by applicant]
US 10880429B2 · Byrne · 2020 [cited by applicant]
US 10901787B2 · Kaul · 2021 [cited by examiner]
US 10902385B2 · Byrne · 2021 [cited by applicant]
US 11043217B2 · Byrne · 2021 [cited by applicant]
US 11182707B2 · Sahni · 2021 [cited by examiner]
US 11256860B2 · Murashin · 2022 [cited by applicant]
US 11321293B2 · Willcock et al. · 2022 [cited by applicant]
US 11687370B2 · Nagar · 2023 [cited by examiner]
US 11693702B2 · Rosanova · 2023 [cited by examiner]
US 20020091707A1 · Keller · 2002 [cited by applicant]
US 20040186763A1 · Smith · 2004 [cited by applicant]
US 20050027577A1 · Saeed · 2005 [cited by examiner]
US 20050069103A1 · DiVenuta et al. · 2005 [cited by applicant]
US 20050257148A1 · Goodman et al. · 2005 [cited by applicant]
US 20060047550A1 · Dineen · 2006 [cited by examiner]
US 20070244673A1 · Khosla · 2007 [cited by examiner]
US 20070250335A1 · Hodges · 2007 [cited by examiner]
US 20070276713A1 · Lee · 2007 [cited by examiner]
US 20080114683A1 · Neveu et al. · 2008 [cited by applicant]
US 20090048896A1 · Anandan · 2009 [cited by examiner]
US 20100088205A1 · Robertson · 2010 [cited by applicant]
US 20110066490A1 · Bassin · 2011 [cited by examiner]
US 20110276565A1 · Zheng et al. · 2011 [cited by applicant]
US 20120198466A1 · Cherkasova · 2012 [cited by examiner]
US 20130031137A1 · Chen et al. · 2013 [cited by applicant]
US 20130090090A1 · Rivere · 2013 [cited by applicant]
US 20140012502A1 · Joshi et al. · 2014 [cited by applicant]
US 20140052489A1 · Prieto · 2014 [cited by examiner]
US 20140114683A1 · Natanzon et al. · 2014 [cited by applicant]
US 20140122143A1 · Fletcher et al. · 2014 [cited by applicant]
US 20140156634A1 · Buchmann et al. · 2014 [cited by applicant]
US 20140236884A1 · Clark et al. · 2014 [cited by applicant]
US 20140344119A1 · Haines · 2014 [cited by applicant]
US 20150032366A1 · Man et al. · 2015 [cited by applicant]
US 20150094097A1 · Fraccaroli · 2015 [cited by applicant]
US 20150161271A1 · Gur et al. · 2015 [cited by applicant]
US 20150195344A1 · Surendran et al. · 2015 [cited by applicant]
US 20160253463A1 · Shu · 2016 [cited by examiner]
US 20170048339A1 · Straub · 2017 [cited by applicant]
US 20170161651A1 · Demarchi et al. · 2017 [cited by applicant]
US 20170206454A1 · Jihn · 2017 [cited by applicant]
US 20170268892A1 · Singh et al. · 2017 [cited by applicant]
US 20170293610A1 · Tran · 2017 [cited by applicant]
US 20180081921A1 · Willcock et al. · 2018 [cited by applicant]
US 20190045050A1 · Gallagher et al. · 2019 [cited by applicant]
US 20190197489A1 · Byrne · 2019 [cited by applicant]
US 20190199852A1 · Byrne · 2019 [cited by applicant]
US 20190205368A1 · Wang et al. · 2019 [cited by applicant]
US 20190279162A1 · Byrne · 2019 [cited by applicant]
US 20190392828A1 · Byrne · 2019 [cited by applicant]
US 20200050996A1 · Generes, Jr. et al. · 2020 [cited by applicant]
US 20200089745A1 · Murashin · 2020 [cited by applicant]
US 20200160253A1 · Johnson et al. · 2020 [cited by applicant]
US 20200195774A1 · Byrne · 2020 [cited by applicant]
US 20200219064A1 · Byrne · 2020 [cited by applicant]
US 20210142249A1 · Ellsworth · 2021 [cited by examiner]
US 20210152688A1 · Byrne · 2021 [cited by applicant]
US 20220188480A1 · Shimada · 2022 [cited by examiner]
WO 2005022353A3 · 2005 [cited by applicant]
WO 2019029721A1 · 2019 [cited by applicant]
Zhang et al.; “Simulation-based optimization for dynamic resource allocation”; 2004 Elsevier B.V.; doi:10.1016/j.autcon.2003.12.005 ; (Zhang_2003.pdf; pp. 409-420) (Year: 2003). [cited by examiner]
Pandit et al.; “Resource Allocation in Cloud using Simulated Annealing”; 2014 IEEE; (Pandit_2014.pdf; pp. 21-27) (Year: 2014). [cited by examiner]
Byrne, Matthew, Notice of Allowance and Fee(s) Due mailed Feb. 19, 2021 for U.S. Appl. No. 16/240,457. [cited by applicant]
Cai et al., “Itinerary recommender system with semantic trajectory pattern mining from geo-tagged photos,” Expert Systems With Applications, vol. 94, ISSN 0957-4174, pp. 2-40, URL: https://doi.org/10.1016/j.eswa.2017.10… [cited by applicant]
Corrielus, Jean M., Non-Final Office Action mailed Jan. 25, 2019 for U.S. Appl. No. 15/271,186. [cited by applicant]
Corrielus, Jean M., Non-Final Office Action mailed Sep. 28, 2021 for U.S. Appl. No. 16/601,125. [cited by applicant]
Corrielus, Jean M., Notice of Allowance and Fee(s) Due mailed Jan. 4, 2022 for U.S. Appl. No. 16/601,125. [cited by applicant]
Corrielus, Jean M., Notice of Allowance and Fee(s) Due mailed Jun. 12, 2019 for U.S. Appl. No. 15/271,186. [cited by applicant]
Dean Jr., Joseph E., Non-Final Office Action mailed Jun. 27, 2019 for U.S. Appl. No. 16/420,076. [cited by applicant]
Dean Jr., Joseph E., Non-Final Office Action mailed May 15, 2020 for U.S. Appl. No. 16/821,039. [cited by applicant]
Dean Jr., Joseph E., Non-Final Office action mailed Nov. 24, 2021 for U.S. Appl. No. 16/952,033. [cited by applicant]
Dean Jr., Joseph E., Non-Final Office Action mailed Oct. 26, 2021 for U.S. Appl. No. 16/952,032. [cited by applicant]
Dean, Jr., Joseph E., Final Office Action mailed Jan. 8, 2020 for U.S. Appl. No. 16/420,076. [cited by applicant]
Dean, Jr., Joseph E., Non-Final Office Action mailed Aug. 8, 2018 for U.S. Appl. No. 15/853,150. [cited by applicant]
Dean, Jr., Joseph E., Non-Final Office Action mailed Mar. 20, 2020 for U.S. Appl. No. 16/801,845. [cited by applicant]
Dean, Jr., Joseph E., Notice of Allowance and Fee(s) Due mailed Aug. 25, 2020 for U.S. Appl. No. 16/801,845. [cited by applicant]
Dean, Jr., Joseph E., Notice of Allowance and Fee(s) Due mailed Feb. 14, 2019 for U.S. Appl. No. 15/853,150. [cited by applicant]
Dean, Jr., Joseph E., Notice of Allowance and Fee(s) Due mailed Jan. 10, 2020 for U.S. Appl. No. 15/853,265. [cited by applicant]
Dean, Jr., Joseph E., Notice of Allowance and Fee(s) Due mailed Jan. 31, 2020 for U.S. Appl. No. 16/420,076. [cited by applicant]
Dean, Jr., Joseph E., Notice of Allowance and Fee(s) Due mailed Mar. 8, 2022 for U.S. Appl. No. 16/952,033. [cited by applicant]
Dean, Jr., Joseph E., Notice of Allowance and Fee(s) Due mailed Sep. 18, 2020 for U.S. Appl. No. 16/821,039. [cited by applicant]
Elahee, Md S, Non-Final Office Action mailed Jun. 11, 2020 for U.S. Appl. No. 16/240,457. [cited by applicant]
Elahee, Md S., Advisory Action mailed Dec. 16, 2020 for U.S. Appl. No. 16/240,457. [cited by applicant]
Elahee, Md S., Final Office Action mailed Sep. 17, 2020 for U.S. Appl. No. 16/240,457. [cited by applicant]
Mercado Vargas, Ariel, Final Office Action mailed Jan. 1, 2021 for U.S. Appl. No. 16/130,946. [cited by applicant]
Mercado Vargas, Ariel, Non-Final Office Action mailed May 12, 2021 for U.S. Appl. No. 16/130,946. [cited by applicant]
Mercado Vargas, Ariel, Notice of Allowance and Fee(s) Due mailed Oct. 14, 2021 for U.S. Appl. No. 16/130,946. [cited by applicant]
Singletary, Tyrone E., Non-Final Office Action mailed Dec. 24, 2021 for U.S. Appl. No. 17/076,762. [cited by applicant]