专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US08296224B2 Constrained optimized binning for scorecards 有权
标题翻译：对记分卡进行约束优化的合并
公开(公告)号：US08296224B2
公开(公告)日：2012-10-23
申请号：US12241762
申请日：2008-09-30
申请人： Ivan Borges Oliveira , Manoj Keshavmurthi Chari , David Rawlins Duling , Susan Edwards Haller , Robert William Pratt
发明人： Ivan Borges Oliveira , Manoj Keshavmurthi Chari , David Rawlins Duling , Susan Edwards Haller , Robert William Pratt
IPC分类号： G06Q40/00
CPC分类号： G06Q40/02 , G06Q40/00
摘要： Computer-implemented systems and methods are provided for generating bins for a scorecard. An approximate set of bins is generated by applying an optimization model to binning data. The optimization model includes an objective function, constraints, and surrogate weight of evidence metric(s). The approximated set of bins are then used in scorecard operations.
摘要翻译：提供计算机实现的系统和方法用于生成记分卡的存储区。通过将优化模型应用于合并数据来生成一组近似的仓。优化模型包括目标函数，约束和证据量度的代理权重。然后将近似的仓组用于记分卡操作。

2. 发明申请

US20100082469A1 Constrained Optimized Binning For Scorecards 有权
标题翻译：限制优化的成绩记分卡
公开(公告)号：US20100082469A1
公开(公告)日：2010-04-01
申请号：US12241762
申请日：2008-09-30
申请人： Ivan Borges Oliveira , Manoj Keshavmurthi Chari , David Rawlins Duling , Susan Edwards Haller , Robert William Pratt
发明人： Ivan Borges Oliveira , Manoj Keshavmurthi Chari , David Rawlins Duling , Susan Edwards Haller , Robert William Pratt
IPC分类号： G06Q40/00
CPC分类号： G06Q40/02 , G06Q40/00
摘要： Computer-implemented systems and methods are provided for generating bins for a scorecard. An approximate set of bins is generated by applying an optimization model to binning data. The optimization model includes an objective function, constraints, and surrogate weight of evidence metric(s). The approximated set of bins are then used in scorecard operations.
摘要翻译：提供计算机实现的系统和方法用于生成记分卡的存储区。通过将优化模型应用于合并数据来生成一组近似的仓。优化模型包括目标函数，约束和证据量度的代理权重。然后将近似的仓组用于记分卡操作。

3. 发明申请

US20090271241A1 Computer-Implemented Systems And Methods For Pack Optimization 有权
标题翻译：计算机实现的系统和方法用于包优化
公开(公告)号：US20090271241A1
公开(公告)日：2009-10-29
申请号：US12111312
申请日：2008-04-29
申请人： Robert William Pratt
发明人： Robert William Pratt
IPC分类号： G05B11/00
CPC分类号： G05B15/02 , G06Q10/063
摘要： Computer-implemented systems and methods are provided for optimizing the distribution of packs of an item across an entity's distribution network. Constraint values may be specified to limit the values that may be included in a planned distribution of packs. Also, heuristics may be used to reduce the computation time required to determine optimal values for a planned distribution of packs. Modeling of the planned distribution of packs and optimization of the number of packs to be distributed can be accomplished using a mixed-integer linear programming solver.
摘要翻译：提供了计算机实现的系统和方法，用于优化跨实体分发网络的项目包的分发。可以指定约束值来限制可能包含在计划的包分发中的值。此外，启发式可以用于减少为计划的包的分布确定最佳值所需的计算时间。可以使用混合整数线性规划求解器来实现计划的分发分布的建模和要分发的包的数量的优化。

4. 发明申请

US20120179505A1 Systems And Methods For Determining Pack Allocations 有权
标题翻译：用于确定包分配的系统和方法
公开(公告)号：US20120179505A1
公开(公告)日：2012-07-12
申请号：US12987486
申请日：2011-01-10
申请人： Teresa DePaola McMains , Thomas Burkhardt , Robert William Pratt
发明人： Teresa DePaola McMains , Thomas Burkhardt , Robert William Pratt
IPC分类号： G06Q10/00
CPC分类号： G06Q10/04 , G06Q10/06315
摘要： Systems and methods are provided for determining a plurality of pack configurations to make available for distribution to a plurality of stores, wherein a pack configuration contains a particular number of units of each of a plurality of variations of a product. An allowable pack size constraint, a maximum pack configuration constraint, mismatch cost data, and product demand data for the plurality of stores are received. A first pack and a second pack for the store are determined, wherein the first pack contains a particular number of each of the variations of the product, wherein the first pack meets the allowable pack size constraint and minimizes mismatch costs for the store. Stores are clustered based on similarity of their demand data until the total pack configuration amount across all clusters meets the maximum pack configuration constraint.
摘要翻译：系统和方法被提供用于确定多个包配置以使得可用于分发到多个商店，其中包配置包含产品的多个变体中的每一个的特定数量的单元。接收多个商店的允许包大小约束，最大包配置约束，不匹配成本数据和产品需求数据。确定用于商店的第一包和第二包，其中第一包包含产品的每个变体的特定数量，其中第一包满足允许包大小约束并且使商店的不匹配成本最小化。存储根据需求数据的相似性进行聚类，直到所有集群的总包配置量满足最大包配置约束。

5. 发明授权

US08812338B2 Computer-implemented systems and methods for pack optimization 有权
标题翻译：用于包优化的计算机实现的系统和方法
公开(公告)号：US08812338B2
公开(公告)日：2014-08-19
申请号：US12111312
申请日：2008-04-29
申请人： Robert William Pratt
发明人： Robert William Pratt
IPC分类号： G06Q10/00
CPC分类号： G05B15/02 , G06Q10/063
摘要： Computer-implemented systems and methods are provided for optimizing the distribution of packs of an item across an entity's distribution network. Constraint values may be specified to limit the values that may be included in a planned distribution of packs. Also, heuristics may be used to reduce the computation time required to determine optimal values for a planned distribution of packs. Modeling of the planned distribution of packs and optimization of the number of packs to be distributed can be accomplished using a mixed-integer linear programming solver.
摘要翻译：提供了计算机实现的系统和方法，用于优化跨实体分发网络的项目包的分发。可以指定约束值来限制可能包含在计划的包分发中的值。此外，启发式可以用于减少为计划的包的分布确定最佳值所需的计算时间。可以使用混合整数线性规划求解器来实现计划的分发分布的建模和要分发的包的数量的优化。

6. 发明申请

US20120179507A1 Systems And Methods For Determining Pack Allocations 有权
标题翻译：用于确定包分配的系统和方法
公开(公告)号：US20120179507A1
公开(公告)日：2012-07-12
申请号：US12987495
申请日：2011-01-10
申请人： Teresa DePaola McMains , Thomas Burkhardt , Robert William Pratt
发明人： Teresa DePaola McMains , Thomas Burkhardt , Robert William Pratt
IPC分类号： G06Q10/00
CPC分类号： G06Q10/06315 , G06Q10/087
摘要： Systems and methods are provided for determining a distribution of each of a plurality of inner packs to a plurality of stores. Mismatch cost data and product demand data are received for the plurality of stores. A first inner pack quantity for distribution is determined based on the product demand data. A supply difference amount is determined, where the supply difference amount is a difference between the first inner pack quantity and the number of first inner packs available for distribution. A determination is made that adjusting the first inner pack quantity for the particular store based on the supply difference amount would have less effect on mismatch costs than other stores, and the first inner pack quantity is adjusted for the particular store based on the supply difference.
摘要翻译：提供了用于确定多个内包装中的每一个到多个商店的分配的系统和方法。为多个商店接收不匹配成本数据和产品需求数据。基于产品需求数据确定用于分配的第一内包数量。确定供给差量，其中供给差量是第一内包装数量和可分配的第一内包装件数量之间的差。确定基于供给差量来调整特定商店的第一内包装数量将比其他商店对失配成本的影响较小，并且基于供应差异针对特定商店调整第一内包装数量。

7. 发明授权

US08788315B2 Systems and methods for determining pack allocations 有权
标题翻译：用于确定包分配的系统和方法
公开(公告)号：US08788315B2
公开(公告)日：2014-07-22
申请号：US12987486
申请日：2011-01-10
申请人： Teresa DePaola McMains , Thomas Burkhardt , Robert William Pratt
发明人： Teresa DePaola McMains , Thomas Burkhardt , Robert William Pratt
IPC分类号： G06Q10/00
CPC分类号： G06Q10/04 , G06Q10/06315
摘要： Systems and methods are provided for determining a plurality of pack configurations to make available for distribution to a plurality of stores, wherein a pack configuration contains a particular number of units of each of a plurality of variations of a product. An allowable pack size constraint, a maximum pack configuration constraint, mismatch cost data, and product demand data for the plurality of stores are received. A first pack and a second pack for the store are determined, wherein the first pack contains a particular number of each of the variations of the product, wherein the first pack meets the allowable pack size constraint and minimizes mismatch costs for the store. Stores are clustered based on similarity of their demand data until the total pack configuration amount across all clusters meets the maximum pack configuration constraint.
摘要翻译：系统和方法被提供用于确定多个包配置以使得可用于分发到多个商店，其中包配置包含产品的多个变体中的每一个的特定数量的单元。接收多个商店的允许包大小约束，最大包配置约束，不匹配成本数据和产品需求数据。确定用于商店的第一包和第二包，其中第一包包含产品的每个变体的特定数量，其中第一包满足允许包大小约束并且使商店的不匹配成本最小化。存储根据需求数据的相似性进行聚类，直到所有集群的总包配置量满足最大包配置约束。

8. 发明授权

US08688497B2 Systems and methods for determining pack allocations 有权
标题翻译：用于确定包分配的系统和方法
公开(公告)号：US08688497B2
公开(公告)日：2014-04-01
申请号：US12987495
申请日：2011-01-10
申请人： Teresa DePaola McMains , Thomas Burkhardt , Robert William Pratt
发明人： Teresa DePaola McMains , Thomas Burkhardt , Robert William Pratt
IPC分类号： G06Q10/00
CPC分类号： G06Q10/06315 , G06Q10/087
摘要： Systems and methods are provided for determining a distribution of each of a plurality of inner packs to a plurality of stores. Mismatch cost data and product demand data are received for the plurality of stores. A first inner pack quantity for distribution is determined based on the product demand data. A supply difference amount is determined, where the supply difference amount is a difference between the first inner pack quantity and the number of first inner packs available for distribution. A determination is made that adjusting the first inner pack quantity for the particular store based on the supply difference amount would have less effect on mismatch costs than other stores, and the first inner pack quantity is adjusted for the particular store based on the supply difference.
摘要翻译：提供了用于确定多个内包装中的每一个到多个商店的分配的系统和方法。为多个商店接收不匹配成本数据和产品需求数据。基于产品需求数据确定用于分配的第一内包数量。确定供给差量，其中供给差量是第一内包装数量和可分配的第一内包装件数量之间的差。确定基于供给差量来调整特定商店的第一内包装数量将比其他商店对失配成本的影响较小，并且基于供应差异针对特定商店调整第一内包装数量。

9. 发明申请

US20120179506A1 Systems And Methods For Determining Pack Allocations 审中-公开
标题翻译：用于确定包分配的系统和方法
公开(公告)号：US20120179506A1
公开(公告)日：2012-07-12
申请号：US12987489
申请日：2011-01-10
申请人： Teresa DePaola McMains , Thomas Burkhardt , Robert William Pratt
发明人： Teresa DePaola McMains , Thomas Burkhardt , Robert William Pratt
IPC分类号： G06Q10/00
CPC分类号： G06Q10/06315
摘要： Systems and methods are provided for determining a quantity of each of a plurality of inner pack configurations to purchase for a plurality of stores. Available inner pack configurations are received along with a particular number of each inner pack configuration contained in an outer pack and mismatch cost data. A first inner pack configuration is identified from the available inner pack configurations for a store, where the first inner pack configuration best matches the demand profile for the store. Quantities of the first inner pack configuration across purchase orders of the stores are summed to generate a first total to be included in the purchase order. Inner pack configurations are added or subtracted to the purchase order so that an adjusted first total is a multiple of the particular number of inner packs that the outer pack contains.
摘要翻译：提供了用于确定为多个商店购买的多个内包装配置中的每一个的数量的系统和方法。接收到可用的内包装配置以及外包装中包含的每个内包装配置的特定数量和不匹配成本数据。从商店的可用内部包装配置识别第一个内部包装配置，其中第一个内部包装配置最适合商店的需求配置文件。商店采购订单之间的第一内包装配置的数量相加，以产生要包含在采购订单中的第一个总计。内包装配置被添加或减去采购订单，以便调整后的第一个总计是外包装的内包装的特定数量的倍数。

10. 发明授权

US09213550B1 Automated decomposition for mixed integer linear programs with embedded networks requiring minimal syntax 有权
标题翻译：具有嵌入式网络的混合整数线性程序的自动分解，需要极少的语法
公开(公告)号：US09213550B1
公开(公告)日：2015-12-15
申请号：US14722624
申请日：2015-05-27
申请人： Matthew Victor Galati , Robert William Pratt , Leonardo Bezerra Lopes
发明人： Matthew Victor Galati , Robert William Pratt , Leonardo Bezerra Lopes
IPC分类号： G06F9/38
CPC分类号： G06F9/30007 , G06F9/30145 , G06F17/11
摘要： An apparatus includes a communications component to receive computer-executable query instructions to solve a MILP problem, the query instructions including a first expression conveying an objective function and side constraint that define a master problem of the MILP problem, a second expression conveying a mapping of graph data to a graph, and a third expression conveying a selection of a graph-based algorithm to solve a subproblem of the MILP problem; a subproblem component to replace the third expression with a fourth expression during decomposition of the MILP problem, the fourth expression including instructions to implement the graph-based algorithm to solve the subproblem; and an execution control component to perform iterations of solving the MILP problem that include executing the first expression to derive a solution to the master problem; and executing the fourth expression to derive a solution to the subproblem based on the mapping and the master problem solution.
摘要翻译：一种装置包括用于接收计算机可执行查询指令以解决MILP问题的通信组件，所述查询指令包括传达目标函数的第一表达式和定义MILP问题的主要问题的侧约束;第二表达式传达图形数据到图形，以及第三表达式，其传达基于图的算法的选择以解决MILP问题的子问题; 一个子问题组件在MILP问题分解过程中用第四个表达式替换第三个表达式，第四个表达式包括实现基于图的算法来解决子问题的指令; 以及执行控制组件，用于执行解决包括执行所述第一表达式的MILP问题的迭代以导出所述主问题的解决方案; 并且基于映射和主问题解决方案执行第四表达式以导出子问题的解。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式