Strategic and tactical intelligence in dynamic segmentation

    公开(公告)号:US12008592B1

    公开(公告)日:2024-06-11

    申请号:US17738495

    申请日:2022-05-06

    CPC classification number: G06Q30/0204 G06Q30/0201

    Abstract: A system and method for performing tactical segmentation including a supply chain network having a tactical segmentation planner, an inventory system, a transportation network, supply chain entities and a computer. The computer performs multi-dimension segmentation on input data by computing feature importance to generate multi-dimensional segments, assigns policy parameters to the supply chain network based on the generated multi-dimensional segments, trains a machine learning model by applying a cyclic boosting process to the standardized features data, where the cyclic boosting process iteratively learns relationships associated with the generated multi-dimensional segments, stores the machine learning model in a database, performs multi-dimension segmentation based on the stored machine learning model, determines whether data drift has occurred in the input data and in response to determining that data drift has occurred, repeats the perform, assign, trains steps, and stores an updated machine learning model in the database.

    Fair Share Band Optimization Using Gaussian Bayesian Network

    公开(公告)号:US20240296401A1

    公开(公告)日:2024-09-05

    申请号:US18662609

    申请日:2024-05-13

    CPC classification number: G06Q10/06315 G06Q10/04

    Abstract: A system and method for efficiently determining the fair-share bands of a supply chain planning problem modeled as a multi-objective hierarchical linear programming problem include a processor and memory and are configured to model a supply chain planning problem as a multi-objective hierarchal linear programming problem, assign weights at each band of a fixed number of at least two bands, determine a direction of improved band values from a value of a Key Process Indicator (KPI) calculated from an expected demand and short quantities, wherein the expected demand and short quantities are calculated from the multi-objective hierarchical linear programming problem using a sample generated by Gibbs sampling of a conditional Gaussian Bayesian Network, and generate a supply chain plan.

    Strategic and Tactical Intelligence in Dynamic Segmentation

    公开(公告)号:US20240311856A1

    公开(公告)日:2024-09-19

    申请号:US18671595

    申请日:2024-05-22

    CPC classification number: G06Q30/0204 G06Q30/0201

    Abstract: A system and method for performing tactical segmentation including a supply chain network having a tactical segmentation planner, an inventory system, a transportation network, supply chain entities and a computer. The computer performs multi-dimension segmentation on input data by computing feature importance to generate multi-dimensional segments, assigns policy parameters to the supply chain network based on the generated multi-dimensional segments, trains a machine learning model by applying a cyclic boosting process to the standardized features data, where the cyclic boosting process iteratively learns relationships associated with the generated multi-dimensional segments, stores the machine learning model in a database, performs multi-dimension segmentation based on the stored machine learning model, determines whether data drift has occurred in the input data and in response to determining that data drift has occurred, repeats the perform, assign, trains steps, and stores an updated machine learning model in the database.

    Fair share band optimization using Gaussian Bayesian Network

    公开(公告)号:US11995588B1

    公开(公告)日:2024-05-28

    申请号:US17373466

    申请日:2021-07-12

    CPC classification number: G06Q10/06315 G06Q10/04

    Abstract: A system and method for efficiently determining the fair-share bands of a supply chain planning problem modeled as a multi-objective hierarchical linear programming problem include a processor and memory and are configured to model a supply chain planning problem as a multi-objective hierarchal linear programming problem, assign weights at each band of a fixed number of at least two bands, determine a direction of improved band values from a value of a Key Process Indicator (KPI) calculated from an expected demand and short quantities, wherein the expected demand and short quantities are calculated from the multi-objective hierarchical linear programming problem using a sample generated by Gibbs sampling of a conditional Gaussian Bayesian Network, and generate a supply chain plan.

Patent Agency Ranking