-
公开(公告)号：US07672855B2
公开(公告)日：2010-03-02
申请号：US11067154
申请日：2005-02-25
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.发明授权Method and apparatus for transportation planning based on mission-specific vehicle capacity constraints 有权基于任务特定车辆能力限制的交通规划方法和装置公开(公告)号：US08626540B2
公开(公告)日：2014-01-07
申请号：US11136045
申请日：2005-05-23
申请人： Roy I. Peterkofsky , Hema Budaraju , Mei Yang , Rongming Sun
发明人： Roy I. Peterkofsky , Hema Budaraju , Mei Yang , Rongming Sun
IPC分类号： G06Q10/00
CPC分类号： G06Q10/08 , G06Q10/063 , G06Q10/0631 , G06Q10/083 , G06Q10/08355
摘要： A computer, for planning moves of freight using vehicles, determines one or more attributes of a mission, based on a group of shipments being consolidated into the mission, computes a total amount of freight to be moved, and decides on feasibility of performing the mission, using a vehicle of a given type based at least on each of (A) the amount of freight, (B) one or more attributes of the mission, and (C) multiple effective capacities of freight moveable by the type of vehicle being selected, which depend on the mission attribute(s). Multiple effective capacities for each vehicle type, and corresponding values of mission attribute(s) at which they are to be applied are stored in the computer ahead of time, based on industry experience. Examples of mission attribute(s) include (1) number of stops, (2) type of stops (whether pooling or not), and (3) a combination thereof.
摘要翻译： 计算机用于计划使用车辆的货物运输，根据正在整合到任务中的一组货物，确定任务的一个或多个属性，计算要移动的货物总量，并决定执行任务的可行性 至少基于（A）货运量，（B）任务的一个或多个属性，以及（C）选择的车辆类型可移动的货物的多个有效能力，至少使用给定类型的车辆 ，这取决于任务属性。 根据行业经验，每台车型的多重有效能力以及其应用的任务属性的相应值将被提前存储在计算机中。 任务属性的示例包括（1）停靠点数，（2）停止类型（是否合并）和（3）其组合。
-
3.发明授权公开(公告)号：US07827051B2
公开(公告)日：2010-11-02
申请号：US11136167
申请日：2005-05-23
IPC分类号： G06F17/30
CPC分类号： G06Q10/08 , G06Q10/0631 , G06Q10/06316 , G06Q10/08355
摘要： A computer, for planning moves of freight automatically adds one or more layover(s) to a mission. Next, the computer determines one or more charge(s) for the layovers, using carriers' rules. Thereafter, the computer uses the charge(s) in deciding whether to include the mission in a transportation plan to be executed. In some embodiments, the computer automatically maintains, for the given mission, counts of attributes on which limits are imposed by a government or by carriers, such as driving time, on-duty time, and driving distance, and when any count exceeds a corresponding limit in the midst of a driving activity, the computer automatically divides up the current driving activity into a truncated driving activity and a remainder driving activity, separated by a layover activity. The computer also determines an estimated time of arrival, including the impact of required layovers, to reach destination(s), and whether layover(s) is/are required at the destination(s), e.g. due to consignee's receiving hours or due to congestion at consignee's dock.
摘要翻译： 一个计算机，用于规划货物的移动，将自动添加一个或多个停泊任务。 接下来，计算机使用运营商的规则来确定出租人的一个或多个费用。 此后，计算机使用费用来决定是否将任务包括在要执行的运输计划中。 在一些实施例中，对于给定的任务，计算机自动维护由政府或运营商施加的限制的属性的计数，例如驾驶时间，在职时间和驾驶距离，以及当任何计数超过相应的 限制在驾驶活动中，计算机自动将当前的驾驶活动分为截断驾驶活动和剩余驾驶活动，并由停电活动隔开。 计算机还确定预计到达时间，包括所需中断的影响，到达目的地，以及是否需要在目的地（例如，目的地）进行停泊。 由于收货人的收货时间或收货人码头的拥挤。
-
4.发明申请公开(公告)号：US20060265264A1
公开(公告)日：2006-11-23
申请号：US11136167
申请日：2005-05-23
申请人： Javier Sanchez , Mei Yang , Rongming Sun , Roy Peterkofsky , Hema Budaraju
发明人： Javier Sanchez , Mei Yang , Rongming Sun , Roy Peterkofsky , Hema Budaraju
IPC分类号： G06F9/46
CPC分类号： G06Q10/08 , G06Q10/0631 , G06Q10/06316 , G06Q10/08355
摘要： A computer, for planning moves of freight automatically adds one or more layover(s) to a mission. Next, the computer determines one or more charge(s) for the layovers, using carriers' rules. Thereafter, the computer uses the charge(s) in deciding whether to include the mission in a transportation plan to be executed. In some embodiments, the computer automatically maintains, for the given mission, counts of attributes on which limits are imposed by a government or by carriers, such as driving time, on-duty time, and driving distance, and when any count exceeds a corresponding limit in the midst of a driving activity, the computer automatically divides up the current driving activity into a truncated driving activity and a remainder driving activity, separated by a layover activity. The computer also determines an estimated time of arrival, including the impact of required layovers, to reach destination(s), and whether layover(s) is/are required at the destination(s), e.g. due to consignee's receiving hours or due to congestion at consignee's dock.
摘要翻译： 一个计算机，用于规划货物的移动，将自动添加一个或多个停泊任务。 接下来，计算机使用运营商的规则来确定出租人的一个或多个费用。 此后，计算机使用费用来决定是否将任务包括在要执行的运输计划中。 在一些实施例中，对于给定的任务，计算机自动维护由政府或运营商施加的限制的属性的计数，例如驾驶时间，在职时间和驾驶距离，以及当任何计数超过相应的 限制在驾驶活动中，计算机自动将当前的驾驶活动分为截断驾驶活动和剩余驾驶活动，并由停电活动隔开。 计算机还确定预计到达时间，包括所需中断的影响，到达目的地，以及是否需要在目的地（例如，目的地）进行停泊。 由于收货人的收货时间或收货人码头的拥挤。
-
公开(公告)号：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.
摘要翻译： 描述了根据拖车布置装置的与运输计划相关联的系统，方法，介质和其他实施例。 一个示例性的计算机实现的方法实施例包括接收根据订单要求来控制要描述要传送到设施的项目的订单。 该方法还可以包括访问运输计划模型，其包括关于可以将订单传送到设施的运输模式和运输方的信息。 运输规划模型还可以包括关于设施和承运人之间的拖车布置的数据。 该方法还可以包括基于运输计划模型和拖车装置的可用性来选择性地将订单合并到货物中。 该方法还可以包括基于运输计划模型和拖车动作的可用性选择性地分配货物到货物。 该方法可以输出例如存储在计算机可读介质上的可操作的负载计划。
-
公开(公告)号：US20060265234A1
公开(公告)日：2006-11-23
申请号：US11136045
申请日：2005-05-23
申请人： Roy Peterkofsky , Hema Budaraju , Mei Yang , Rongming Sun
发明人： Roy Peterkofsky , Hema Budaraju , Mei Yang , Rongming Sun
IPC分类号： G06Q99/00
CPC分类号： G06Q10/08 , G06Q10/063 , G06Q10/0631 , G06Q10/083 , G06Q10/08355
摘要： A computer, for planning moves of freight using vehicles, determines one or more attributes of a mission, based on a group of shipments being consolidated into the mission, computes a total amount of freight to be moved, and decides on feasibility of performing the mission, using a vehicle of a given type based at least on each of (A) the amount of freight, (B) one or more attributes of the mission, and (C) multiple effective capacities of freight moveable by the type of vehicle being selected, which depend on the mission attribute(s). Multiple effective capacities for each vehicle type, and corresponding values of mission attribute(s) at which they are to be applied are stored in the computer ahead of time, based on industry experience. Examples of mission attribute(s) include (1) number of stops, (2) type of stops (whether pooling or not), and (3) a combination thereof.
摘要翻译： 计算机用于计划使用车辆的货物运输，根据正在整合到任务中的一组货物，确定任务的一个或多个属性，计算要移动的货物总量，并决定执行任务的可行性 至少基于（A）货运量，（B）任务的一个或多个属性，以及（C）选择的车辆类型可移动的货物的多个有效能力，至少使用给定类型的车辆 ，这取决于任务属性。 根据行业经验，每台车型的多重有效能力以及其应用的任务属性的相应值将被提前存储在计算机中。 任务属性的示例包括（1）停靠点数，（2）停止类型（是否合并）和（3）其组合。
-
公开(公告)号：US20060206387A1
公开(公告)日：2006-09-14
申请号：US11078675
申请日：2005-03-11
申请人： Roy Peterkofsky , Hema Budaraju , Atul Srivastav , Rekha Argula , Vijay Pillarisetti , Quan Lu , Rongming Sun
发明人： Roy Peterkofsky , Hema Budaraju , Atul Srivastav , Rekha Argula , Vijay Pillarisetti , Quan Lu , Rongming Sun
IPC分类号： G06G1/14
CPC分类号： G06Q10/08 , G06Q20/203
摘要： Systems, methodologies, media, and other embodiments associated with transportation planning with multi-level firming are described. One exemplary computer-implemented method embodiment includes accessing transportation planning elements and a transportation planning model. The method may also include identifying loads that satisfy orders in the transportation planning elements according to constraints in the transportation planning model and then applying multi-level firming designations to transportation planning elements related to the identified loads. The method may also include identifying additional loads based, at least in part, on the multi-level firming designations. The method may output an actionable plan of loads stored, for example, on a computer-readable medium.
摘要翻译： 描述了与多级紧固的运输计划相关联的系统，方法，介质和其他实施例。 一个示例性的计算机实现的方法实施例包括访问运输计划元素和运输计划模型。 该方法还可以包括根据运输计划模型中的约束来识别满足交通规划要素中的订单的负载，然后对与所识别的负载相关的运输规划要素应用多级紧固指定。 该方法还可以包括至少部分地基于多级紧固指定来识别附加负载。 该方法可以输出例如存储在计算机可读介质上的可操作的负载计划。
-
公开(公告)号：US20060224423A1
公开(公告)日：2006-10-05
申请号：US11097435
申请日：2005-04-01
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.
摘要翻译： 描述了与运输计划中的并行优化相关联的系统，方法，介质和其他实施例。 一个示例性方法实施例可以包括并行地选择候选负载以满足一组订单，从候选负载中选择最终负载，并且并行地选择性地将最终负载操纵到降低运输成本的运输计划中。
-
公开(公告)号：US20060241822A1
公开(公告)日：2006-10-26
申请号：US11113906
申请日：2005-04-25
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.
摘要翻译： 这里描述了示例系统，方法，计算机可读介质，软件和其他实施例，其涉及优化运输计划系统的载体选择。 在一个实施例中，给定已经被定义为传送一组配置的负载的一组跳闸，可以提供载波选择逻辑，其被配置成分析该组跳闸并尝试修复或修复一个或多个约束冲突， 存在于一个或多个旅行中。 例如，修复可以包括尝试重新分配分配给不同运营商的行程的运营商（例如，运营商/服务/车辆类型），以便减少该组行程的总体约束违规，并且可以降低整体的全球成本 为一组旅行。
-
公开(公告)号：US08165904B2
公开(公告)日：2012-04-24
申请号：US11248921
申请日：2005-10-11
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.
摘要翻译： 公开了系统，方法和机器可读介质以在供应链中的多个位置分配库存。 在一个实施例中，一种方法包括基于从每个位置处的每个项目的预期需求和交货时间确定的基准库存确定每个位置处的每个商品的总时间库存和目标安全库存水平，目标服务 水平，需求不确定性水平，提前期不确定性水平，承担供应链中的成本和用户对预算，能力和库存的限制。
-
-
-
-
-
-
-
-
-
搜索结果
13 条记录 (耗时 0.023 秒)
