Optimized Capacity Matching for Transport Logistics Accounting for Individual Transport Schedules
    1.
    发明申请
    Optimized Capacity Matching for Transport Logistics Accounting for Individual Transport Schedules 审中-公开
    针对个人运输时间表运输物流会计的优化能力匹配

    公开(公告)号:US20160379168A1

    公开(公告)日:2016-12-29

    申请号:US14754559

    申请日:2015-06-29

    Applicant: SAP SE

    CPC classification number: G06Q10/08355 G06Q10/063116

    Abstract: An ad-hoc logistics solution can identify optimal solutions for the spatio-temporal problem of adding a transport to the route calendar of a transport vehicle.□ For example, an initial set of transport assignments that may be added to a route calendar of a driver of a vehicle can be identified by eliminating potential transport assignments for which the vehicle does not meet equipment and/or accessibility criteria for a location associated with the potential transport assignment, and suggestions can be found for insertion of a candidate transport assignment from the initial set of transport assignments into the route calendar. The suggestions can be validated by applying a set of constraints to determine whether each suggestion is feasible and then ranked such that a highest ranked suggestion is placed into the route calendar.

    Abstract translation: 特殊物流解决方案可以确定将交通工具添加到运输车辆的路线日历的时空问题的最佳解决方案□例如,可以添加到驾驶员的路线日历中的初始传输分配集 可以通过消除车辆不符合与潜在运输分配相关联的位置的设备和/或可访问性标准的潜在运输分配来识别车辆,并且可以找到从初始设置插入候选运输分配的建议 的运输任务进入路线日历。 可以通过应用一组约束来确定每个建议是否可行,然后进行排名以便将最高排名的建议放置到路线日历中来验证建议。

Patent Agency Ranking