公开(公告)号：US10410150B2

公开(公告)日：2019-09-10

申请号：US14532330

申请日：2014-11-04

申请人： Yu Cheng ,  Mengjiao Wang ,  Wen-Syan Li

发明人： Yu Cheng ,  Mengjiao Wang ,  Wen-Syan Li

IPC分类号： G06Q10/06 ,  G06Q10/08

摘要： The present disclosure relates to a computer system comprising a database including, a reallocation scheduling module, the reallocation scheduling module configured to obtain an objective function including one or more integer-valued decision variables and automatically determine a proposed reallocation scheme for each of one or more items between a plurality of locations based on the objective function, wherein determining the reallocation scheme includes finding values of one or more decision variables that optimize the objective function while obeying the one or more constraints, wherein determining a proposed reallocation scheme includes solving an integer quadratic programming problem.

公开(公告)号：US09350643B2

公开(公告)日：2016-05-24

申请号：US14052557

申请日：2013-10-11

申请人： Mengjiao Wang ,  Yu Cheng ,  Wen-Syan Li

发明人： Mengjiao Wang ,  Yu Cheng ,  Wen-Syan Li

IPC分类号： H04L12/729 ,  H04L12/751

CPC分类号： H04L45/125 ,  H04L45/02

摘要： A system, computer-readable storage medium storing at least one program, and computer-implemented method for route selection based on payload delivery capacity and routing distance are described. Network demand information is obtained. The network demand information may include a network graph and information related to an outbound demand of each node of the network graph. A simplified demand graph based on the outbound demand of each node and a distance between each node pair is generated. A plurality of return routes for the simplified network graph is generated and a payload delivery capacity of each of the routes is calculated. An advised return route from the plurality of return routes is generated based in part on the payload delivery capacities of the plurality of return routes.

摘要翻译： 描述了存储至少一个程序的系统，计算机可读存储介质和用于基于有效载荷传送能力和路由距离的路由选择的计算机实现的方法。 获得网络需求信息。 网络需求信息可以包括网络图和与网络图的每个节点的出站需求相关的信息。 生成基于每个节点的出站需求和每个节点对之间的距离的简化需求图。 生成用于简化网络图的多个返回路线，并且计算每个路线的有效载荷传送能力。 部分地基于多个返回路线的有效载荷传送容量来生成来自多个返回路线的建议返回路线。

公开(公告)号：US20160125333A1

公开(公告)日：2016-05-05

申请号：US14532330

申请日：2014-11-04

申请人： Yu Cheng ,  Mengjiao Wang ,  Wen-Syan Li

发明人： Yu Cheng ,  Mengjiao Wang ,  Wen-Syan Li

IPC分类号： G06Q10/06 ,  G06Q10/08

CPC分类号： G06Q10/06312 ,  G06Q10/083 ,  G06Q10/087

摘要： The present disclosure relates to a computer system comprising a database including, a reallocation scheduling module, the reallocation scheduling module configured to obtain an objective function including one or more integer-valued decision variables and automatically determine a proposed reallocation scheme for each of one or more items between a plurality of locations based on the objective function, wherein determining the reallocation scheme includes finding values of one or more decision variables that optimize the objective function while obeying the one or more constraints, wherein determining a proposed reallocation scheme includes solving an integer quadratic programming problem.

摘要翻译： 本公开涉及包括数据库的计算机系统，所述数据库包括重新分配调度模块，所述重新分配调度模块被配置为获得包括一个或多个整数值决策变量的目标函数，并且自动地确定所提出的重新分配方案中的一个或多个 基于目标函数的多个位置之间的项目，其中确定重新分配方案包括在遵守一个或多个约束的情况下找到优化目标函数的一个或多个决策变量的值，其中确定所提出的重新分配方案包括求解整数二次方 编程问题。

公开(公告)号：US20150178799A1

公开(公告)日：2015-06-25

申请号：US14134567

申请日：2013-12-19

申请人： Yu Cheng ,  Mengjiao Wang ,  Wen-Syan Li

发明人： Yu Cheng ,  Mengjiao Wang ,  Wen-Syan Li

IPC分类号： G06Q30/02 ,  G06Q50/06

CPC分类号： G06Q30/0283 ,  G06Q50/06

摘要： In an example, a method for determining quantities of fuel to dispense at a plurality of terminals along a transit route of a vehicle includes identifying a plurality of terminals along the transit route, each terminal of the plurality of terminals have an associated cost-per-unit of fuel dispensed; initializing a set of candidate fueling scenarios, each candidate fueling scenario including an initial array of values, each value in the array of values indicating a quantity of fuel to dispense to the vehicle at one of the plurality of terminals along the transit route; iteratively, using at least one processor, modifying the set of candidate scenarios; identifying the candidate scenario of the set of candidate scenarios with the lowest total fuel cost; and transmitting for display, the quantity of fuel to dispense at each of the plurality of terminals according to the identified lowest total fuel cost candidate scenario.

摘要翻译： 在一个示例中，用于确定在沿着交通路线的多个终端处分配的燃料量的方法包括：沿着所述运输路线识别多个终端，所述多个终端中的每个终端具有相关联的成本 - 燃油单位 初始化一组候选加油场景，每个候选加油场景包括初始数值阵列，所述值阵列中的每个值表示沿所述运输路线在所述多个终端中的一个终端处分配给所述车辆的燃料量; 迭代地使用至少一个处理器，修改所述一组候选场景; 确定具有最低总燃料成本的一组候选情景的候选情景; 以及根据所识别的最低总燃料成本候选情景，发送用于显示在所述多个终端中的每一个处分配的燃料量。

公开(公告)号：US20150081077A1

公开(公告)日：2015-03-19

申请号：US14043415

申请日：2013-10-01

申请人： Wen-Syan Li ,  Yu Cheng ,  Mengjiao Wang

发明人： Wen-Syan Li ,  Yu Cheng ,  Mengjiao Wang

IPC分类号： G05B19/418

CPC分类号： G05B19/41865 ,  G05B2219/32304 ,  G05B2219/32333 ,  Y02P90/04 ,  Y02P90/20 ,  Y02P90/28

摘要： In accordance with aspects of the disclosure, systems and methods are provided for managing production resources including scheduling production events for production resources used to manufacture products relative to time intervals while maintaining collaboration among the production resources. The systems and methods may include retrieving information related to each production resource, evaluating each production event for each product to determine a sequence of the production events, and generating potential production scheduling schemes for use of each production resource within the time intervals while maintaining collaboration among the production resources. The systems and methods may include generating a production schedule for the production events within the time intervals based on the potential production scheduling schemes for use of each production resource within the time intervals while maintaining collaboration among the production resources.

摘要翻译： 根据本公开的方面，提供了用于管理生产资源的系统和方法，包括为维持生产资源之间的协作而相对于时间间隔制造产品的生产资源的调度生产事件。 系统和方法可以包括检索与每个生产资源相关的信息，评估每个产品的每个生产事件以确定生产事件的顺序，以及在时间间隔期间生成用于使用每个生产资源的潜在生产调度方案，同时保持在 生产资源。 系统和方法可以包括在时间间隔内基于用于在生产资源之间的协作的时间间隔内的每个生产资源的潜在生产调度方案在时间间隔内生成生产事件的生产计划。

公开(公告)号：US09380107B2

公开(公告)日：2016-06-28

申请号：US14046470

申请日：2013-10-04

申请人： Wen-Syan Li ,  Yu Cheng ,  Mengjiao Wang

发明人： Wen-Syan Li ,  Yu Cheng ,  Mengjiao Wang

IPC分类号： H04L12/911 ,  H04L29/08 ,  G06F9/50 ,  G06N3/12

CPC分类号： H04L67/1002 ,  G06F9/5083 ,  G06N3/126

摘要： In accordance with aspects of the disclosure, systems and methods are provided for scheduling migration events for server resources in a server cluster relative to a time interval while considering load balance constraints and data transfer constraints of the server cluster. The systems and methods may include generating one or more potential migration scheduling schemes for migration of each server resource to at least one other server resource in the server cluster within the time interval while considering the load balance constraints and the data transfer constraints of the server cluster, and generating a migration event schedule for each migration event within the time interval based on the one or more potential migration scheduling schemes generated for migration of each server resource to at least one other server resource in the server cluster.

摘要翻译： 根据本公开的方面，提供了系统和方法，用于在考虑服务器集群的负载平衡约束和数据传输约束的同时针对时间间隔调度服务器集群中服务器资源的迁移事件。 系统和方法可以包括在考虑负载平衡约束和服务器集群的数据传输约束的情况下，在时间间隔内生成用于将服务器资源迁移到服务器集群中的至少一个其他服务器资源的一个或多个潜在的迁移调度方案 以及基于为每个服务器资源的迁移生成的一个或多个潜在的迁移调度方案在所述时间间隔内为所述服务器集群中的至少一个其他服务器资源生成用于每个迁移事件的迁移事件调度。

公开(公告)号：US20150081911A1

公开(公告)日：2015-03-19

申请号：US14046470

申请日：2013-10-04

申请人： Wen-Syan Li ,  Yu Cheng ,  Mengjiao Wang

发明人： Wen-Syan Li ,  Yu Cheng ,  Mengjiao Wang

IPC分类号： H04L12/911

CPC分类号： H04L67/1002 ,  G06F9/5083 ,  G06N3/126

摘要： In accordance with aspects of the disclosure, systems and methods are provided for scheduling migration events for server resources in a server cluster relative to a time interval while considering load balance constraints and data transfer constraints of the server cluster. The systems and methods may include generating one or more potential migration scheduling schemes for migration of each server resource to at least one other server resource in the server cluster within the time interval while considering the load balance constraints and the data transfer constraints of the server cluster, and generating a migration event schedule for each migration event within the time interval based on the one or more potential migration scheduling schemes generated for migration of each server resource to at least one other server resource in the server cluster.

摘要翻译： 根据本公开的方面，提供了系统和方法，用于在考虑服务器集群的负载平衡约束和数据传输约束的同时针对时间间隔调度服务器集群中服务器资源的迁移事件。 系统和方法可以包括在考虑负载均衡约束和服务器集群的数据传输约束的情况下，在时间间隔内生成用于将服务器资源迁移到服务器集群中的至少一个其他服务器资源的一个或多个潜在的迁移调度方案 以及基于为每个服务器资源的迁移生成的一个或多个潜在的迁移调度方案在所述时间间隔内为所述服务器集群中的至少一个其他服务器资源生成用于每个迁移事件的迁移事件调度。

公开(公告)号：US10031517B2

公开(公告)日：2018-07-24

申请号：US14043415

申请日：2013-10-01

申请人： Wen-Syan Li ,  Yu Cheng ,  Mengjiao Wang

发明人： Wen-Syan Li ,  Yu Cheng ,  Mengjiao Wang

IPC分类号： G05B19/418

摘要： In accordance with aspects of the disclosure, systems and methods are provided for managing production resources including scheduling production events for production resources used to manufacture products relative to time intervals while maintaining collaboration among the production resources. The systems and methods may include retrieving information related to each production resource, evaluating each production event for each product to determine a sequence of the production events, and generating potential production scheduling schemes for use of each production resource within the time intervals while maintaining collaboration among the production resources. The systems and methods may include generating a production schedule for the production events within the time intervals based on the potential production scheduling schemes for use of each production resource within the time intervals while maintaining collaboration among the production resources.

公开(公告)号：US09798634B2

公开(公告)日：2017-10-24

申请号：US14528482

申请日：2014-10-30

申请人： Mengjiao Wang ,  Yu Cheng ,  Wen-Syan Li

发明人： Mengjiao Wang ,  Yu Cheng ,  Wen-Syan Li

IPC分类号： G06F11/14 ,  G06F11/20 ,  H04L29/08 ,  G06F9/50 ,  H04L29/14 ,  G06F9/455

CPC分类号： G06F11/203 ,  G06F9/452 ,  G06F9/45558 ,  G06F9/50 ,  G06F11/1451 ,  G06F11/1484 ,  G06F2009/45562 ,  G06F2009/4557 ,  G06F2009/45575 ,  G06F2201/805 ,  G06F2201/84 ,  H04L41/0663 ,  H04L67/1008 ,  H04L67/1095 ,  H04L69/40

摘要： A failover manager may be configured to determine a plurality of tenants executable on a server of a plurality of servers, each tenant being a virtual machine executable on the server in communication with at least one corresponding user. The failover manager may include a replicated tenant placement selector configured to dispatch a first replicated tenant for a first tenant of the plurality of tenants to a first standby server of the plurality of servers, and configured to dispatch a second replicated tenant for a second tenant of the plurality of tenants to a second standby server of the plurality of servers. The failover manager also may include a replicated tenant loader configured to activate, based on a failure of the server, the first replicated tenant on the first standby server to replace the first tenant, and the second replicated tenant on the second standby server to replace the second tenant.

公开(公告)号：US09207090B2

公开(公告)日：2015-12-08

申请号：US14056701

申请日：2013-10-17

申请人： Yu Cheng ,  Mengjiao Wang ,  Wen-Syan Li

发明人： Yu Cheng ,  Mengjiao Wang ,  Wen-Syan Li

IPC分类号： G01C21/00 ,  G01C21/34

CPC分类号： G01C21/3492

摘要： Techniques of dynamic path optimization are disclosed. In some embodiments, a method comprises receiving an instruction to determine an optimal path from a source geographical location to a destination geographical location, and determining an optimal path from the source geographical location to the destination geographical location using corresponding historical traffic information for each one of a plurality of sub-paths. The historical traffic information for each sub-path may correspond to an estimated arrival time at a start location for the corresponding sub-path and be used to select sub-paths from the plurality of sub-paths. The selected sub-paths may define the optimal path. In some embodiments, the historical traffic information comprises an indication of traffic flow for the corresponding sub-path. In some embodiments, the indication of traffic flow comprises an average speed of traffic flow.

摘要翻译： 公开了动态路径优化技术。 在一些实施例中，一种方法包括接收用于确定从源地理位置到目的地地理位置的最佳路径的指令，以及使用相应的历史交通信息来确定从源地理位置到目的地地理位置的最佳路径 多个子路径。 每个子路径的历史交通信息可以对应于相应子路径的起始位置处的估计到达时间，并且用于从多个子路径中选择子路径。 所选择的子路径可以定义最佳路径。 在一些实施例中，历史交通信息包括对应子路径的业务流的指示。 在一些实施例中，业务流的指示包括业务流的平均速度。