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

1. 发明授权

US07672855B2 Transportation planning with drop trailer arrangements 有权
标题翻译：运输计划与拖车安排
公开(公告)号：US07672855B2
公开(公告)日：2010-03-02
申请号：US11067154
申请日：2005-02-25
申请人： Roy I. Peterkofsky , Hema Budaraju , Mei Yang , Rongming Sun , Mukundan Srinivasan
发明人： Roy I. Peterkofsky , Hema Budaraju , Mei Yang , Rongming Sun , Mukundan Srinivasan
IPC分类号： G06Q10/00 , G06F19/00
CPC分类号： G06Q10/087 , G06Q10/0631 , G06Q10/083 , G06Q10/08355
摘要： Systems, methodologies, media, and other embodiments associated with transportation planning in light of drop trailer arrangements are described. One exemplary computer-implemented method embodiment includes receiving orders that describe items to be delivered to facilities as controlled by order requirements. The method may also include accessing a transportation planning model that includes information concerning shipping modes and carriers by which an order can be delivered to a facility. The transportation planning model may also include data concerning drop trailer arrangements between facilities and the carriers. The method may also include selectively consolidating orders into shipments based on the transportation planning model and the availability of a drop trailer arrangement. The method may also include selectively assigning shipments to loads based on the transportation planning model and the availability of a drop trailer action. The method may output an actionable plan of loads stored, for example, on a computer-readable medium.
摘要翻译：描述了根据拖车布置装置的与运输计划相关联的系统，方法，介质和其他实施例。一个示例性的计算机实现的方法实施例包括接收根据订单要求来控制要描述要传送到设施的项目的订单。该方法还可以包括访问运输计划模型，其包括关于可以将订单传送到设施的运输模式和运输方的信息。运输规划模型还可以包括关于设施和承运人之间的拖车布置的数据。该方法还可以包括基于运输计划模型和拖车装置的可用性来选择性地将订单合并到货物中。该方法还可以包括基于运输计划模型和拖车动作的可用性选择性地分配货物到货物。该方法可以输出例如存储在计算机可读介质上的可操作的负载计划。

2. 发明申请

US20060195348A1 Transportation planning with drop trailer arrangements 有权
标题翻译：运输计划与拖车安排
公开(公告)号：US20060195348A1
公开(公告)日：2006-08-31
申请号：US11067154
申请日：2005-02-25
申请人： Roy Peterkofsky , Hema Budaraju , Mei Yang , Rongming Sun , Mukundan Srinivasan
发明人： Roy Peterkofsky , Hema Budaraju , Mei Yang , Rongming Sun , Mukundan Srinivasan
IPC分类号： G05B19/418 , G06F15/02 , G06F9/46
CPC分类号： G06Q10/087 , G06Q10/0631 , G06Q10/083 , G06Q10/08355
摘要： Systems, methodologies, media, and other embodiments associated with transportation planning in light of drop trailer arrangements are described. One exemplary computer-implemented method embodiment includes receiving orders that describe items to be delivered to facilities as controlled by order requirements. The method may also include accessing a transportation planning model that includes information concerning shipping modes and carriers by which an order can be delivered to a facility. The transportation planning model may also include data concerning drop trailer arrangements between facilities and the carriers. The method may also include selectively consolidating orders into shipments based on the transportation planning model and the availability of a drop trailer arrangement. The method may also include selectively assigning shipments to loads based on the transportation planning model and the availability of a drop trailer action. The method may output an actionable plan of loads stored, for example, on a computer-readable medium.
摘要翻译：描述了根据拖车布置装置的与运输计划相关联的系统，方法，介质和其他实施例。一个示例性的计算机实现的方法实施例包括接收根据订单要求来控制要描述要传送到设施的项目的订单。该方法还可以包括访问运输计划模型，其包括关于可以将订单传送到设施的运输模式和运输方的信息。运输规划模型还可以包括关于设施和承运人之间的拖车布置的数据。该方法还可以包括基于运输计划模型和拖车装置的可用性来选择性地将订单合并到货物中。该方法还可以包括基于运输计划模型和拖车动作的可用性选择性地分配货物到货物。该方法可以输出例如存储在计算机可读介质上的可操作的负载计划。

3. 发明申请

US20060224423A1 Transportation planning with parallel optimization 审中-公开
标题翻译：并行优化运输规划
公开(公告)号：US20060224423A1
公开(公告)日：2006-10-05
申请号：US11097435
申请日：2005-04-01
申请人： Rongming Sun , Mukundan Srinivasan , Georges-Henri Moll , Vinay Yadappanavar , Mei Yang
发明人： Rongming Sun , Mukundan Srinivasan , Georges-Henri Moll , Vinay Yadappanavar , Mei Yang
IPC分类号： G06F9/44
CPC分类号： G06Q10/08 , G06Q10/04 , G06Q10/0631 , G06Q10/06315 , G06Q10/06316 , G06Q10/06375
摘要： Systems, methodologies, media, and other embodiments associated with parallel optimization in transportation planning are described. One exemplary method embodiment may include selecting, in parallel, candidate loads to satisfy a set of orders, selecting final loads from the candidate loads, and in parallel selectively manipulating the final loads into a transportation plan that reduces a transportation cost.
摘要翻译：描述了与运输计划中的并行优化相关联的系统，方法，介质和其他实施例。一个示例性方法实施例可以包括并行地选择候选负载以满足一组订单，从候选负载中选择最终负载，并且并行地选择性地将最终负载操纵到降低运输成本的运输计划中。

4. 发明申请

US20060241822A1 Optimization of carrier selection for transportation planning system 有权
标题翻译：运输规划体系选择优化
公开(公告)号：US20060241822A1
公开(公告)日：2006-10-26
申请号：US11113906
申请日：2005-04-25
申请人： Vinay Yadappanavar , Rongming Sun , Mukundan Srinivasan
发明人： Vinay Yadappanavar , Rongming Sun , Mukundan Srinivasan
IPC分类号： G07B15/02
CPC分类号： G06Q10/08 , G06Q10/025 , G06Q10/06312 , G06Q10/083 , G06Q10/0834
摘要： Example systems, methods, computer-readable media, software, and other embodiments are described herein that relate to optimizing carrier selection for a transportation planning system. In one embodiment, given a set of trips that have been defined to transport a set of configured loads, a carrier selection logic can be provided that is configured to analyze the set of trips and attempt to repair or cure one or more constraint violations that may exist in one or more of the trips. For example, the repair may include attempting to reassign a carrier (e.g. carrier/service/vehicle type) that is assigned to a trip to a different carrier in order to reduce overall constraint violations for the set of trips and may reduce the overall global cost for the set of trips.
摘要翻译：这里描述了示例系统，方法，计算机可读介质，软件和其他实施例，其涉及优化运输计划系统的载体选择。在一个实施例中，给定已经被定义为传送一组配置的负载的一组跳闸，可以提供载波选择逻辑，其被配置成分析该组跳闸并尝试修复或修复一个或多个约束冲突，存在于一个或多个旅行中。例如，修复可以包括尝试重新分配分配给不同运营商的行程的运营商（例如，运营商/服务/车辆类型），以便减少该组行程的总体约束违规，并且可以降低整体的全球成本为一组旅行。

5. 发明授权

US08165904B2 Allocating inventory levels 有权
标题翻译：分配库存水平
公开(公告)号：US08165904B2
公开(公告)日：2012-04-24
申请号：US11248921
申请日：2005-10-11
申请人： Mukundan Srinivasan , Rongming Sun , Saurabh Thapliyal
发明人： Mukundan Srinivasan , Rongming Sun , Saurabh Thapliyal
IPC分类号： G06Q10/00
CPC分类号： G06Q10/087 , G06Q10/063 , G06Q10/0631 , G06Q10/06315 , G06Q10/08 , G06Q50/04 , G06Q50/30 , Y02P90/30
摘要： Systems, methods, and machine-readable media are disclosed to allocating inventory across a plurality of locations in a supply chain. In one embodiment, a method comprises determining a total time-phased inventory and target safety stock level for each of the items at each location based on the baseline inventory as determined from expected demand and lead times for each item at each location, a target service level, a demand uncertainty level, a lead time uncertainty level, carrying costs in the supply chain and user constraints on budget, capacity and inventory.
摘要翻译：公开了系统，方法和机器可读介质以在供应链中的多个位置分配库存。在一个实施例中，一种方法包括基于从每个位置处的每个项目的预期需求和交货时间确定的基准库存确定每个位置处的每个商品的总时间库存和目标安全库存水平，目标服务水平，需求不确定性水平，提前期不确定性水平，承担供应链中的成本和用户对预算，能力和库存的限制。

6. 发明授权

US07765120B2 Optimization of carrier selection for transportation planning system 有权
标题翻译：运输规划体系选择优化
公开(公告)号：US07765120B2
公开(公告)日：2010-07-27
申请号：US11113906
申请日：2005-04-25
申请人： Vinay M. Yadappanavar , Rongming Sun , Mukundan Srinivasan
发明人： Vinay M. Yadappanavar , Rongming Sun , Mukundan Srinivasan
IPC分类号： G06F17/50 , G06Q10/00 , G06Q30/00
CPC分类号： G06Q10/08 , G06Q10/025 , G06Q10/06312 , G06Q10/083 , G06Q10/0834
摘要： Example systems, methods, computer-readable media, software, and other embodiments are described herein that relate to optimizing carrier selection for a transportation planning system. In one embodiment, given a set of trips that have been defined to transport a set of configured loads, a carrier selection logic can be provided that is configured to analyze the set of trips and attempt to repair or cure one or more constraint violations that may exist in one or more of the trips. For example, the repair may include attempting to reassign a carrier (e.g. carrier/service/vehicle type) that is assigned to a trip to a different carrier in order to reduce overall constraint violations for the set of trips and may reduce the overall global cost for the set of trips.
摘要翻译：这里描述了示例系统，方法，计算机可读介质，软件和其他实施例，其涉及优化运输计划系统的载体选择。在一个实施例中，给定已经被定义为传送一组配置的负载的一组跳闸，可以提供载波选择逻辑，其被配置成分析该组跳闸并尝试修复或修复一个或多个约束冲突，存在于一个或多个旅行中。例如，修复可以包括尝试重新分配分配给不同运营商的行程的运营商（例如，运营商/服务/车辆类型），以便减少该组行程的总体约束违规，并且可以降低整体的全球成本为一组旅行。

7. 发明申请

US20070083413A1 Allocating inventory levels 有权
标题翻译：分配库存水平
公开(公告)号：US20070083413A1
公开(公告)日：2007-04-12
申请号：US11248921
申请日：2005-10-11
申请人： Mukundan Srinivasan , Rongming Sun , Saurabh Thapliyal
发明人： Mukundan Srinivasan , Rongming Sun , Saurabh Thapliyal
IPC分类号： G06F9/46
CPC分类号： G06Q10/087 , G06Q10/063 , G06Q10/0631 , G06Q10/06315 , G06Q10/08 , G06Q50/04 , G06Q50/30 , Y02P90/30
摘要： Systems, methods, and machine-readable media are disclosed to allocating inventory across a plurality of locations in a supply chain. In one embodiment, a method comprises determining a total time-phased inventory and target safety stock level for each of the items at each location based on the baseline inventory as determined from expected demand and lead times for each item at each location, a target service level, a demand uncertainty level, a lead time uncertainty level, carrying costs in the supply chain and user constraints on budget, capacity and inventory.
摘要翻译：公开了系统，方法和机器可读介质以在供应链中的多个位置分配库存。在一个实施例中，一种方法包括基于从每个位置处的每个项目的预期需求和交货时间确定的基准库存确定每个位置处的每个商品的总时间库存和目标安全库存水平，目标服务水平，需求不确定性水平，提前期不确定性水平，承担供应链中的成本和用户对预算，能力和库存的限制。

8. 发明申请

US20060241990A1 Transportation planning with multi-level pooling model 审中-公开
标题翻译：交通规划与多层次池模型
公开(公告)号：US20060241990A1
公开(公告)日：2006-10-26
申请号：US11113514
申请日：2005-04-25
申请人： Rongming Sun , Mukundan Srinivasan , Vinay Yadappanavar
发明人： Rongming Sun , Mukundan Srinivasan , Vinay Yadappanavar
IPC分类号： G06F9/46
CPC分类号： G06Q10/08 , G06Q10/04 , G06Q10/06316 , G06Q10/06375
摘要： Systems, methodologies, media, and other embodiments associated with multi-level pooling in transportation planning are described. One exemplary method embodiment includes, co-operatively and in parallel choosing pooling points and order-legs to consolidate. The example method may also include constructing a cost-optimal trip based, at least in part, on the contemporaneously chosen pooling points and orders-legs.
摘要翻译：描述了与运输计划中的多级别池相关联的系统，方法，介质和其他实施例。一个示例性方法实施例包括协同操作并且并行地选择合并点和顺序排以进行整合。该示例性方法还可以包括至少部分地基于同时选择的汇集点和订单支路构建成本最优的行程。

9. 发明申请

US20130117162A1 METHOD FOR FAIR SHARE ALLOCATION IN A MULTI-ECHELON SERVICE SUPPLY CHAIN THAT CONSIDERS SUPERCESSION AND REPAIR RELATIONSHIPS 审中-公开
标题翻译：多元化服务供应链公平分配方法，考虑到监督和维修关系
公开(公告)号：US20130117162A1
公开(公告)日：2013-05-09
申请号：US13480850
申请日：2012-05-25
申请人： TAO FENG , Mei Yang , Jeroen Dirks , Zhisu Zhu , Mukundan Srinivasan
发明人： TAO FENG , Mei Yang , Jeroen Dirks , Zhisu Zhu , Mukundan Srinivasan
IPC分类号： G06Q10/08
CPC分类号： G06Q10/04 , G06Q10/087 , G06Q10/20
摘要： Embodiments of the invention provide systems and methods for fair share allocation of inventory levels throughout a supply chain. According to one embodiment, a first round main Linear Programming (LP) solve can generate an initial solution. Post-processing heuristics for fair sharing can be applied to the first round solve of the main LP. Circular sourcing heuristics can be applied to the first round solve when adjusting for fair sharing allocation requirements. For example, applying the circular sourcing heuristics to the first round solve of the main LP can comprise determining a firmed supply surplus and shortage based on a demand picture from the first round solve of the main LP adjusted for fair sharing. A second round main LP solve can be executed using the fixed inter-organizational transfer variables and fixed supply towards independent demand variables from the post-processing heuristics.
摘要翻译：本发明的实施例提供了在整个供应链中公平分配库存水平的系统和方法。根据一个实施例，第一轮主线性规划（LP）求解可以产生初始解。公平共享的后处理启发式可以应用于主LP的第一轮解决。循环采购启发式可以适用于公平分配分配要求的第一轮解决。例如，将循环采购启发式应用于主LP的第一轮解决可以包括根据调整为公平共享的主LP的第一轮解决，根据需求图确定确定的供应剩余和短缺。可以使用固定的组织间转移变量和来自后处理启发式的独立需求变量的固定供应来执行第二轮主要LP解决方案。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式