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

1. 发明授权

US06754634B1 Method for scheduling transportation resources 失效
标题翻译：运输资源调度方法
公开(公告)号：US06754634B1
公开(公告)日：2004-06-22
申请号：US09053880
申请日：1998-04-01
申请人： William P. C. Ho
发明人： William P. C. Ho
IPC分类号： G06F1760
CPC分类号： G06Q10/08 , G06Q10/02 , G06Q10/025 , G06Q10/0631
摘要： An improved transportation scheduling method for scheduling trips using multiple vehicles, with each of the vehicles having a trip manifest. The method comprises the steps of first generating a usability matrix that determines which of the vehicles is usable with each of the trips. Next, a determination is made as to a best trip of the trips to be scheduled next. A determination is next made as to the best vehicle from the set of vehicles for accommodating the best trip. Then, a determination is made as to the best insertion pair for the trip manifest for the best vehicle for the best trip and updating the trip manifest to include the best insertion pair. Finally, the usability matrix is updated to reflect the scheduling of the best trip to the best vehicle. The steps are repeated until all of the trips have been scheduled.
摘要翻译：一种用于使用多个车辆调度行程的改进的运输调度方法，其中每个车辆具有行程单。该方法包括以下步骤：首先生成可用性矩阵，其确定哪个车辆可以与每个行程一起使用。接下来，确定下一次要安排的行程的最佳行程。接下来对来自用于容纳最佳行程的一组车辆的最佳车辆进行确定。然后，确定用于最佳旅行的最佳车辆的旅行舱单的最佳插入对，并且更新行程舱单以包括最佳插入对。最后，可用性矩阵被更新以反映最佳旅程的最佳车辆的调度。重复这些步骤，直到所有旅行都已安排。

2. 发明授权

US07127411B2 Method for scheduling transportation resources 有权
标题翻译：运输资源调度方法
公开(公告)号：US07127411B2
公开(公告)日：2006-10-24
申请号：US10830759
申请日：2004-04-23
申请人： William P. C. Ho
发明人： William P. C. Ho
IPC分类号： G06F17/60
CPC分类号： G06Q10/08 , G06Q10/02 , G06Q10/025 , G06Q10/0631
摘要： An improved transportation scheduling method for scheduling a plurality of trips T1–Tn using a plurality of vehicles V1–Vn, each of said plurality of vehicles having a trip manifest. The method comprises the steps of: (a) generating a useability matrix that determines which of said plurality of vehicles V1–Vn is useable with each of said plurality of trips T1–Tn; (b) determining a best trip of said plurality of trips T1–Tn to be scheduled next; (c) determining a best vehicle from said plurality of vehicles V1–Vn for accommodating said best trip; (d) determining a best insertion pair into said trip manifest of said best vehicle for said best trip and updating said trip manifest to include said best insertion pair; (e) updating said useability matrix to reflect the scheduling of said best trip on said best vehicle; and (f) repeating steps (a)–(e) until all of the trips in said plurality of trips T1–Tn have been scheduled.
摘要翻译：一种改进的运输调度方法，用于使用多个车辆V 1 -V N n调度多个行程T 1 -T N n N，所述多个车辆具有行程表。该方法包括以下步骤：（a）生成可用性矩阵，其确定所述多个车辆中的哪个车辆可以与所述多个行驶中的每个行程一起使用 T 1 -T n N n; （b）确定下一个计划的所述多个跳闸T 1→N 2→N 2的最佳跳闸; （c）确定用于容纳所述最佳行程的来自所述多个车辆V 1-N N N N的最佳车辆; （d）确定最佳插入对到所述最佳车辆的所述行程表，以便所述最佳行程并且更新所述行程清单以包括所述最佳插入对; （e）更新所述可用性矩阵以反映所述最佳车辆上所述最佳行程的调度; 和（f）重复步骤（a） - （e），直到所有多个行程T 1至T 1中的所有行程已被调度为止。

3. 发明授权

US08554467B2 Travel time determination 有权
标题翻译：行程时间决定
公开(公告)号：US08554467B2
公开(公告)日：2013-10-08
申请号：US13227348
申请日：2011-09-07
申请人： William P. C. Ho
发明人： William P. C. Ho
IPC分类号： G01C21/00
CPC分类号： G01C21/3407
摘要： The present invention relates to travel time determination, for example, determining a predicted travel time between locations based on historical data. One aspect of the invention is directed toward a method for determining a predicted amount of time required to travel from one location to another that includes dividing a region into multiple grid portions and designating each grid portion that contains at least one address of interest as a departure grid, a destination grid, or both. The method can further include generating a searchable data arrangement that includes travel times associated with traveling from selected departure grids to selected destination grids, and updating the travel times using historical data.
摘要翻译：本发明涉及行驶时间确定，例如，基于历史数据确定位置之间的预测行驶时间。本发明的一个方面涉及一种用于确定从一个位置行进到另一个位置所需的预测时间量的方法，该方法包括将区域划分成多个网格部分，并且将包含至少一个感兴趣的地址的每个网格部分指定为出发网格，目标网格或两者。该方法还可以包括生成可搜索的数据排列，其包括与从所选择的出发格栅到选定的目的地网格的行进相关联的旅行时间，以及使用历史数据来更新旅行时间。

4. 发明授权

US08438118B2 Transportation management processes and systems 有权
标题翻译：运输管理流程和系统
公开(公告)号：US08438118B2
公开(公告)日：2013-05-07
申请号：US13229320
申请日：2011-09-09
申请人： William P. C. Ho
发明人： William P. C. Ho
IPC分类号： G06Q30/00
CPC分类号： G06Q10/047 , G06Q10/06 , G06Q10/06316 , G06Q10/06375 , G06Q10/08355 , G06Q50/28
摘要： The present invention relates to transportation management processes and systems. One aspect of the invention is directed toward a method in a computer system for determining one or more routes for transporting items, including receiving multiple orders to transport items from an origination stop to a destination stop, generating one or more consolidations, and generating one or more shipments wherein each shipment includes a selected consolidation that meets at least one shipment parameter or an order. The method further includes generating one or more routes with an ordered sequence of stops wherein each route is associated with one or more shipments. The method still further includes selecting one or more routes based on one or more route parameters.
摘要翻译：本发明涉及运输管理过程和系统。本发明的一个方面涉及一种用于确定用于运输物品的一个或多个路线的计算机系统中的方法，包括接收多个命令以将物品从始发站运送到目的地站点，生成一个或多个合并，以及生成一个或多个更多的货物，其中每个货物包括满足至少一个装运参数或订单的选定的合并。该方法还包括利用有序序列生成一个或多个路线，其中每个路线与一个或多个货物相关联。该方法还包括基于一个或多个路由参数来选择一个或多个路由。

5. 发明授权

US08036822B2 Travel time determination 失效
标题翻译：行程时间决定
公开(公告)号：US08036822B2
公开(公告)日：2011-10-11
申请号：US11520088
申请日：2006-09-12
申请人： William P. C. Ho
发明人： William P. C. Ho
IPC分类号： G01C21/00
CPC分类号： G01C21/3407
摘要： The present invention relates to travel time determination, for example, determining a predicted travel time between locations based on historical data. One aspect of the invention is directed toward a method for determining a predicted amount of time required to travel from one location to another that includes dividing a region into multiple grid portions and designating each grid portion that contains at least one address of interest as a departure grid, a destination grid, or both. The method can further include generating a searchable data arrangement that includes travel times associated with traveling from selected departure grids to selected destination grids, and updating the travel times using historical data.
摘要翻译：本发明涉及行驶时间确定，例如，基于历史数据确定位置之间的预测行驶时间。本发明的一个方面涉及一种用于确定从一个位置行进到另一个位置所需的预测时间量的方法，该方法包括将区域划分成多个网格部分，并且将包含至少一个感兴趣的地址的每个网格部分指定为出发网格，目标网格或两者。该方法还可以包括生成可搜索的数据排列，其包括与从所选择的出发格栅到选定的目的地网格的行进相关联的旅行时间，以及使用历史数据来更新旅行时间。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式