发明名称 Optimized Capacity Matching for Transport Logistics Accounting for Individual Transport Schedules
摘要 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.
申请公布号 US2016379168(A1) 申请公布日期 2016.12.29
申请号 US201514754559 申请日期 2015.06.29
申请人 SAP SE 发明人 Foerster Theodor;Moellers Jakob;Hochstein Petra
分类号 G06Q10/08;G06Q10/06 主分类号 G06Q10/08
代理机构 代理人
主权项 1. A computer program product comprising a non-transitory machine-readable medium storing instructions that, when executed by at least one programmable processor, cause the at least one programmable processor to perform operations comprising: identifying an initial set of transport assignments that may be added to a route calendar of a driver of a vehicle, the identifying comprising eliminating a potential transport assignment for which the vehicle does not meet equipment and/or accessibility criteria for a location associated with the potential transport assignment; finding suggestions for insertion of a candidate transport assignment from the initial set of transport assignments into the route calendar, the finding comprising inserting the candidate transport assignment in all possible temporal combinations with one or more existing transport assignments in the route calendar; validating the suggestions by applying a set of constraints to determine whether each suggestion is feasible, the validating resulting in a list of feasible suggestions; ranking the list of feasible suggestions based on one or more ranking criteria; and inserting a highest ranked suggestion from the list into the route calendar.
地址 Walldorf DE