-
公开(公告)号：US08321258B2
公开(公告)日：2012-11-27
申请号：US11515111
申请日：2006-08-31
IPC分类号： G06Q10/00
摘要： Embodiments of the invention include a system for scheduling the shipment of a set of products. The shipment may be loaded into a set of vehicles and further configured to fit a set of compartments on those vehicles. The system may include attempts to fill each vehicle and the compartments of each vehicle. The system may include evaluating a set of constraints on the shipment. The constraints may include a complex logical statement.
摘要翻译： 本发明的实施例包括用于调度一组产品的装运的系统。 货物可以装载到一组车辆中，并进一步配置成在这些车辆上安装一组隔间。 该系统可以包括填充每个车辆和每个车辆的隔室的尝试。 系统可以包括评估装运上的一组约束。 约束可能包括一个复杂的逻辑语句。
-
公开(公告)号：US20080065262A1
公开(公告)日：2008-03-13
申请号：US11515111
申请日：2006-08-31
IPC分类号： G06F7/00
摘要： Embodiments of the invention include a system for scheduling the shipment of a set of products. The shipment may be loaded into a set of vehicles and further configured to fit a set of compartments on those vehicles. The system may include attempts to fill each vehicle and the compartments of each vehicle. The system may include evaluating a set of constraints on the shipment. The constraints may include a complex logical statement.
摘要翻译： 本发明的实施例包括用于调度一组产品的装运的系统。 货物可以装载到一组车辆中，并进一步配置成在这些车辆上安装一组隔间。 该系统可以包括填充每个车辆和每个车辆的隔室的尝试。 系统可以包括评估装运上的一组约束。 约束可能包括一个复杂的逻辑语句。
-
公开(公告)号：US20080077464A1
公开(公告)日：2008-03-27
申请号：US11525890
申请日：2006-09-22
IPC分类号： G05B19/418
CPC分类号： G06Q10/08 , G06Q10/087
摘要： Embodiments of the invention include a system for scheduling the shipment of a set of products. The shipment may be loaded into a set of vehicle combinations, which are composed of a combination of vehicles and trailers. The system may include attempts to fill each vehicle and trailer in each vehicle combination. The system may include evaluating a set of constraints on the shipment. The process may include an optimization process to generate the most cost effective use of the available vehicle combinations.
摘要翻译： 本发明的实施例包括用于调度一组产品的装运的系统。 货物可以装载到由车辆和拖车的组合组成的一组车辆组合中。 该系统可以包括在每个车辆组合中填充每个车辆和拖车的尝试。 系统可以包括评估装运上的一组约束。 该过程可以包括优化过程以产生可用的车辆组合的最具成本效益的使用。
-
公开(公告)号：US07660732B2
公开(公告)日：2010-02-09
申请号：US11628469
申请日：2004-06-30
CPC分类号： G06Q10/047 , G06Q10/06312 , G06Q10/06316 , G06Q10/08355
摘要： A method of processing incompatibilities for a transportation plan comprising the following steps: Receiving data which is descriptive of orders, data which is descriptive of available vehicles, and data which is descriptive of available cross-docking locations; reading a set of compatibility types, and a set of compatibility rules with respect to the plurality of orders, vehicles, and cross-docking locations, each compatibility rule specifying a combination of two values which refer to first and second attributes of a defined compatibility type, and being indicative whether or not they are compatible; associating a value with each order, the value being descriptive of the characteristics of the order, such that orders having the same characteristics have the same value associated therewith; replacing the data descriptive of the characteristics by the value associated therewith; and outputting the order data resulting from the preceding step.
摘要翻译： 一种处理运输计划的不兼容性的方法，包括以下步骤：接收描述订单的数据，描述可用车辆的数据和描述可用交叉对接位置的数据; 读取一组兼容性类型以及关于多个订单，车辆和交叉对接位置的一组兼容性规则，每个兼容性规则指定两个值的组合，所述两个值参考所定义的兼容性类型的第一和第二属性 并指示其是否兼容; 将值与每个订单相关联，该值描述订单的特征，使得具有相同特征的订单具有与其相关联的相同值; 将与特征值相关的数据描述为特征值; 并输出由前述步骤得到的订单数据。
-
公开(公告)号：US20100131444A1
公开(公告)日：2010-05-27
申请号：US12324155
申请日：2008-11-26
申请人： Jens Gottlieb , Lars Vogel
发明人： Jens Gottlieb , Lars Vogel
IPC分类号： G06N5/02
CPC分类号： G06N5/04 , G06Q10/063 , G06Q10/0631
摘要： Combining multiple objective functions to perform algorithmic problem solving is described. A first algorithm performs processing on a complex problem and generates multiple solutions to the problem. One or more solutions as generated by the first algorithm are send to one or more additional algorithms for further processing of complex sub-problems bounded by the first algorithm. The solutions to the first algorithm are used as input to the additional algorithms, where those solutions include at least one boundary condition under which the additional algorithms process the sub-problems. Ultimate solutions satisfy boundary conditions of the first algorithm, and all conditions of the additional algorithms. Algorithms may be executed in combinations of parallel and/or sequential operation to generate a final solution considering multiple different sub-problems to the complex problem.
摘要翻译： 描述了组合多个目标函数来执行算法问题解决。 第一种算法对复杂问题执行处理，并为该问题生成多种解决方案。 将由第一算法产生的一个或多个解决方案发送到一个或多个附加算法，用于进一步处理由第一算法界定的复杂子问题。 第一种算法的解决方案被用作附加算法的输入，其中这些解决方案包括至少一个边界条件，附加算法在该边界条件下处理子问题。 最终解决方案满足第一种算法的边界条件，以及其他算法的所有条件。 算法可以以并行和/或顺序操作的组合来执行，以产生考虑复杂问题的多个不同子问题的最终解决方案。
-
公开(公告)号：US07983942B2
公开(公告)日：2011-07-19
申请号：US12703039
申请日：2010-02-09
CPC分类号： G06Q10/08 , G06Q10/06312 , G06Q10/06313 , G06Q10/06316 , G06Q10/08355
摘要： A method of processing incompatibilities for a transportation plan comprising the following steps: Receiving data which is descriptive of orders, data which is descriptive of available vehicles, and data which is descriptive of available cross-docking locations; reading a set of compatibility types, and a set of compatibility rules with respect to the plurality of orders, vehicles, and cross-docking locations, each compatibility rule specifying a combination of two values which refer to first and second attributes of a defined compatibility type, and being indicative whether or not they are compatible; associating a value with each order, the value being descriptive of the characteristics of the order, such that orders having the same characteristics have the same value associated therewith; replacing the data descriptive of the characteristics by the value associated therewith; and outputting the order data resulting from the preceding step.
摘要翻译： 一种处理运输计划的不兼容性的方法，包括以下步骤：接收描述订单的数据，描述可用车辆的数据和描述可用交叉对接位置的数据; 读取一组兼容性类型以及关于多个订单，车辆和交叉连接位置的一组兼容性规则，每个兼容性规则指定两个值的组合，所述两个值参考所定义的兼容性类型的第一和第二属性 并指示其是否兼容; 将值与每个订单相关联，该值描述订单的特征，使得具有相同特征的订单具有与其相关联的相同值; 将与特征值相关的数据描述为特征值; 并输出由前述步骤得到的订单数据。
-
公开(公告)号：US20100205026A1
公开(公告)日：2010-08-12
申请号：US12703039
申请日：2010-02-09
IPC分类号： G06Q10/00
CPC分类号： G06Q10/08 , G06Q10/06312 , G06Q10/06313 , G06Q10/06316 , G06Q10/08355
摘要： A method of processing incompatibilities for a transportation plan comprising the following steps: Receiving data which is descriptive of orders, data which is descriptive of available vehicles, and data which is descriptive of available cross-docking locations; reading a set of compatibility types, and a set of compatibility rules with respect to the plurality of orders, vehicles, and cross-docking locations, each compatibility rule specifying a combination of two values which refer to first and second attributes of a defined compatibility type, and being indicative whether or not they are compatible; associating a value with each order, the value being descriptive of the characteristics of the order, such that orders having the same characteristics have the same value associated therewith; replacing the data descriptive of the characteristics by the value associated therewith; and outputting the order data resulting from the preceding step.
摘要翻译： 一种处理运输计划的不兼容性的方法，包括以下步骤：接收描述订单的数据，描述可用车辆的数据和描述可用交叉对接位置的数据; 读取一组兼容性类型以及关于多个订单，车辆和交叉对接位置的一组兼容性规则，每个兼容性规则指定两个值的组合，所述两个值参考所定义的兼容性类型的第一和第二属性 并指示其是否兼容; 将值与每个订单相关联，该值描述订单的特征，使得具有相同特征的订单具有与其相关联的相同值; 将与特征值相关的数据描述为特征值; 并输出由前述步骤得到的订单数据。
-
公开(公告)号：US20070244677A1
公开(公告)日：2007-10-18
申请号：US11628469
申请日：2004-06-30
IPC分类号： G06N7/06
CPC分类号： G06Q10/047 , G06Q10/06312 , G06Q10/06316 , G06Q10/08355
摘要： A method of processing incompatibilities for a transportation plan comprising the following steps: Receiving data which is descriptive of orders, data which is descriptive of available vehicles, and data which is descriptive of available cross-docking locations; reading a set of compatibility types, and a set of compatibility rules with respect to the plurality of orders, vehicles, and cross-docking locations, each compatibility rule specifying a combination of two values which refer to first and second attributes of a defined compatibility type, and being indicative whether or not they are compatible; associating a value with each order, the value being descriptive of the characteristics of the order, such that orders having the same characteristics have the same value associated therewith; replacing the data descriptive of the characteristics by the value associated therewith; and outputting the order data resulting from the preceding step.
摘要翻译： 一种处理运输计划的不兼容性的方法，包括以下步骤：接收描述订单的数据，描述可用车辆的数据和描述可用交叉对接位置的数据; 读取一组兼容性类型以及关于多个订单，车辆和交叉对接位置的一组兼容性规则，每个兼容性规则指定两个值的组合，所述两个值参考所定义的兼容性类型的第一和第二属性 并指示其是否兼容; 将值与每个订单相关联，该值描述订单的特征，使得具有相同特征的订单具有与其相关联的相同值; 将与特征值相关的数据描述为特征值; 并输出由前述步骤得到的订单数据。
-
公开(公告)号：US08195496B2
公开(公告)日：2012-06-05
申请号：US12324155
申请日：2008-11-26
申请人： Jens Gottlieb , Lars Vogel
发明人： Jens Gottlieb , Lars Vogel
IPC分类号： G06Q10/00
CPC分类号： G06N5/04 , G06Q10/063 , G06Q10/0631
摘要： Combining multiple objective functions to perform algorithmic problem solving is described. A first algorithm performs processing on a complex problem and generates multiple solutions to the problem. One or more solutions as generated by the first algorithm are send to one or more additional algorithms for further processing of complex sub-problems bounded by the first algorithm. The solutions to the first algorithm are used as input to the additional algorithms, where those solutions include at least one boundary condition under which the additional algorithms process the sub-problems. Ultimate solutions satisfy boundary conditions of the first algorithm, and all conditions of the additional algorithms. Algorithms may be executed in combinations of parallel and/or sequential operation to generate a final solution considering multiple different sub-problems to the complex problem.
摘要翻译： 描述了组合多个目标函数来执行算法问题解决。 第一种算法对复杂问题执行处理，并为该问题生成多种解决方案。 将由第一算法产生的一个或多个解决方案发送到一个或多个附加算法，用于进一步处理由第一算法界定的复杂子问题。 第一种算法的解决方案被用作附加算法的输入，其中这些解决方案包括至少一个边界条件，附加算法在该边界条件下处理子问题。 最终解决方案满足第一种算法的边界条件，以及其他算法的所有条件。 算法可以以并行和/或顺序操作的组合来执行，以产生考虑复杂问题的多个不同子问题的最终解决方案。
-
公开(公告)号：US20100131431A1
公开(公告)日：2010-05-27
申请号：US12324317
申请日：2008-11-26
申请人： Andreas Esau , Jens Gottlieb , Holger Thiel
发明人： Andreas Esau , Jens Gottlieb , Holger Thiel
CPC分类号： G06Q10/08 , G06Q10/06 , G06Q10/083 , G06Q50/30 , G06Q99/00
摘要： The embodiments of the invention relates to a transportation management system. Specifically the embodiments of the invention relate to a system and process for generating shipment orders, freight orders and tours automatically from planned transportation activity data. The process reduces planned transportation activity to a set of frames having minimal data to reduce processing time. The frames are then evaluated for soft and hard constraints to identify a set of shipment orders, freight orders and tours. The shipment orders, freight orders and tours are then augmented from the frame state to include the necessary data.
摘要翻译： 本发明的实施例涉及运输管理系统。 具体地说，本发明的实施例涉及从计划的运输活动数据自动产生装运单，货运单和旅行的系统和过程。 该过程将计划的运输活动降低到具有最小数据的一组帧以减少处理时间。 然后评估框架的软和硬约束，以确定一组装运单，货运单和旅行。 货物订单，货运单和旅行团队将从框架状态增加到包含必要的数据。
-
-
-
-
-
-
-
-
-
搜索结果
12 条记录 (耗时 0.023 秒)
