-
公开(公告)号：US11144871B2
公开(公告)日：2021-10-12
申请号：US15168415
申请日：2016-05-31
申请人： SAP SE
发明人： Leiyi Yao , Xin Chen , Ben Xu , Harald Hengelbrock
IPC分类号： G06Q10/08
摘要： In optimized container management system, a booking request with customer locations, booking time, container type, movement mode, depot locations and depot locations stock information are received as input in a solver in a container management system received in a container management system. Based on the movement mode of booking request received by customer, solver algorithm is invoked to build a bipartite graph. A bipartite graph with nodes representing customer locations and depot locations are generated, based on the movement mode. Edges between the customer locations and the depot locations are generated based on a container balancing criteria of a solver algorithm. For remaining booking request, edges between the customer locations and the depot locations are generated based on a cost minimization criteria of the solver algorithm. The depot locations are assigned to the corresponding customer locations based on satisfying the container balancing criteria and the cost minimization criteria.
-
公开(公告)号：US10783466B2
公开(公告)日：2020-09-22
申请号：US15203955
申请日：2016-07-07
申请人： SAP SE
发明人： Raymond Yao , Xin Chen , Philippe Nemery
摘要： Various embodiments of systems and methods for optimizing vehicle utilization are described herein. The method includes determining demand, supply, and availability of vehicles. A graph with nodes (representing source and destination stations of orders) and arcs connecting nodes is generated based on validity conditions, e.g., there is network connectivity from source to destination node, etc. The arc is assigned for repositioning, waiting, and loaded move based upon input such as tolerable delay for orders, waiting cost at stations, repositioning cost, long stand cost, revenue generated from orders, order priority, etc. A network flow solver is successively executed to solve the graph to maximize profit, optimized utilization of vehicles, fulfill order on time, and balance demand and supply. Output tables including key performance indicators (KPIs) and information of fulfilled and unfulfilled orders are generated. Vehicle allocation, repositioning, waiting, and loaded move may in turn are optimized based on the output tables.
-
公开(公告)号：US20180012160A1
公开(公告)日：2018-01-11
申请号：US15203955
申请日：2016-07-07
申请人： SAP SE
发明人： Raymond Yao , Xin Chen , Philippe Nemery
摘要： Various embodiments of systems and methods for optimizing vehicle utilization are described herein. The method includes determining demand, supply, and availability of vehicles. A graph with nodes (representing source and destination stations of orders) and arcs connecting nodes is generated based on validity conditions, e.g., there is network connectivity from source to destination node, etc. The arc is assigned for repositioning, waiting, and loaded move based upon input such as tolerable delay for orders, waiting cost at stations, repositioning cost, long stand cost, revenue generated from orders, order priority, etc. A network flow solver is successively executed to solve the graph to maximize profit, optimized utilization of vehicles, fulfill order on time, and balance demand and supply. Output tables including key performance indicators (KPIs) and information of fulfilled and unfulfilled orders are generated. Vehicle allocation, repositioning, waiting, and loaded move may in turn are optimized based on the output tables.
-
公开(公告)号：US10977582B2
公开(公告)日：2021-04-13
申请号：US15632057
申请日：2017-06-23
申请人： SAP SE
IPC分类号： G06Q10/02
摘要： Methods, systems, and computer-readable storage media for crowd control based on check-in time recommendations, including operations of receiving, from a plurality of users, travel information, the travel information including, for each of the plurality of users, a user identification, a departure location, and a departure time, determining a total number of passengers within a time interval associated to the departure time from the departure location, generating a recommended check-in time for each of the plurality of users based on the travel information and the total number of passengers, displaying for each of the plurality of users the recommended check-in time, and activating a setting of a ticket verification device to prevent access to a portion of the departure location for each of the plurality of users before the recommended check-in time.
-
公开(公告)号：US20180374003A1
公开(公告)日：2018-12-27
申请号：US15632057
申请日：2017-06-23
申请人： SAP SE
IPC分类号： G06Q10/02
摘要： Methods, systems, and computer-readable storage media for crowd control based on check-in time recommendations, including operations of receiving, from a plurality of users, travel information, the travel information including, for each of the plurality of users, a user identification, a departure location, and a departure time, determining a total number of passengers within a time interval associated to the departure time from the departure location, generating a recommended check-in time for each of the plurality of users based on the travel information and the total number of passengers, displaying for each of the plurality of users the recommended check-in time, and activating a setting of a ticket verification device to prevent access to a portion of the departure location for each of the plurality of users before the recommended check-in time.
-
公开(公告)号：US20180182054A1
公开(公告)日：2018-06-28
申请号：US15393065
申请日：2016-12-28
申请人： SAP SE
CPC分类号： G06Q50/28 , G01C21/206 , G06Q10/063112 , G06Q30/0635
摘要： Various examples are directed to systems and methods for managing a warehouse. For example, a set of candidate routes through the warehouse may be generated based at least in part on graph data describing a plurality of nodes comprising a depot node, and a plurality of internode paths. Orders may be assigned to routes from the set of candidate routes to minimize a total duration for the routes. A set of tasks may be generated, where a first task of the set of tasks comprises a route and an order of the plurality of orders matched to the route. Tasks from the set of tasks may be assigned to picking agents to minimize a duration of the longest task from the set of tasks.
-
公开(公告)号：US20180144279A1
公开(公告)日：2018-05-24
申请号：US15359380
申请日：2016-11-22
申请人： SAP SE
CPC分类号： G06Q10/06313 , G06Q10/083
摘要： In a network separator in transportation resource planning, a node table and an arc table corresponding to a network graph, and partition criteria are received as input. The network graph is preliminary processed to remove nodes with a defined minimum degree. In pre-processing, the nodes with the defined minimum degree are removed from the network graph using branch-removal technique. The preliminary processed network graph is input to a network partition solver. The network graph is partitioned into multiple partitions. The partitions represent sub-graphs. The network graph is subsequently processed to append the removed nodes. The removed nodes are appended to the network graph using branch-recovery technique. The network graph is partitioned into multiple sub-graphs. An output table is generated with partition identifiers and corresponding node identifiers.
-
公开(公告)号：US11158017B2
公开(公告)日：2021-10-26
申请号：US15393065
申请日：2016-12-28
申请人： SAP SE
摘要： Various examples are directed to systems and methods for managing a warehouse. For example, a set of candidate routes through the warehouse may be generated based at least in part on graph data describing a plurality of nodes comprising a depot node, and a plurality of internode paths. Orders may be assigned to routes from the set of candidate routes to minimize a total duration for the routes. A set of tasks may be generated, where a first task of the set of tasks comprises a route and an order of the plurality of orders matched to the route. Tasks from the set of tasks may be assigned to picking agents to minimize a duration of the longest task from the set of tasks.
-
公开(公告)号：US10783485B2
公开(公告)日：2020-09-22
申请号：US15168386
申请日：2016-05-31
申请人： SAP SE
发明人： Raymond Yao , Xin Chen , Philippe Nemery
摘要： An input corresponding to a time window is received in an integrated container management system. For containers of a specific container type, a network flow solver implementing a multi-commodity network flow problem is executed based on the input. A graph is generated with nodes representing depot locations, mode of transport locations and customer locations. Arcs connecting nodes, and representing operations and costs associated with the nodes are generated. Pick-up arcs are generated between the depot locations and customer locations. Return arcs are generated between the customer locations and the depot locations. Street turn arcs are generated among customer locations. Unload load arcs are generated between the mode of transport locations and the depot locations. Output tables are generated with values representing functionalities associated with container repositioning, container pick-up and return, and container street turn. Container repositioning, container pick-up and return, and container street turn are optimized based on the values in the output table.
-
10.发明申请公开(公告)号：US20190205815A1
公开(公告)日：2019-07-04
申请号：US15857890
申请日：2017-12-29
申请人： SAP SE
CPC分类号： G06Q10/083 , G06Q10/06316
摘要： Implementations of the present disclosure include methods, systems, and computer-readable storage mediums for receiving input data including one or more original instructions for empty container movement within a network, network configuration data, and a delta supply/demand (S/D) plan, the delta S/D plan defining changes to supply and demand for empty containers at respective locations with respect to a previous S/D plan, processing, by a preprocessor and constraint generator, at least a portion of the input to provide one or more constraints, determining, by a delta balancing optimizer, at least one delta instruction based on the one or more constraints, the network configuration data, and the one or more original instructions, determining whether the at least one delta instruction is of an unacceptable type, and providing one or more refined delta instructions in response to determining that the at least one delta instruction is of an unacceptable type.
-
-
-
-
-
-
-
-
-
搜索结果
10 条记录 (耗时 0.015 秒)
