Patents by Inventor Leiyi YAO

Leiyi YAO has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 11158017
    Abstract: 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.
    Type: Grant
    Filed: December 28, 2016
    Date of Patent: October 26, 2021
    Assignee: SAP SE
    Inventors: Leiyi Yao, Xin Chen, Likun Hou
  • Patent number: 11144871
    Abstract: 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.
    Type: Grant
    Filed: May 31, 2016
    Date of Patent: October 12, 2021
    Assignee: SAP SE
    Inventors: Leiyi Yao, Xin Chen, Ben Xu, Harald Hengelbrock
  • Patent number: 10977582
    Abstract: 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.
    Type: Grant
    Filed: June 23, 2017
    Date of Patent: April 13, 2021
    Assignee: SAP SE
    Inventors: Likun Hou, Xin Chen, Leiyi Yao
  • Publication number: 20200097907
    Abstract: In one embodiment, a method receives requests where each request includes an origin, a destination, a time dependency, a request, and a cost of the request. Lines are generated from the requests with each line including a duration from the time dependency, the origin, the destination, and a profit based on the cost. Paths are generated that include a set of lines with each path including an identification of the lines in the path, a set of requests in the path, and a weight based on the profit of the set of requests in the path. The paths are analyzed to select a number of paths from the paths based on the weight of each path. A schedule to fulfill the requests is then output. A combination of requests is assigned to a single entity based on a set of requests in a path selected for the single entity.
    Type: Application
    Filed: September 20, 2018
    Publication date: March 26, 2020
    Inventors: Leiyi Yao, Wenjun Zhou, Wen-Syan Li
  • Publication number: 20190205815
    Abstract: 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.
    Type: Application
    Filed: December 29, 2017
    Publication date: July 4, 2019
    Inventors: Leiyi Yao, Xin Chen, Likun Hou
  • Publication number: 20180374003
    Abstract: 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.
    Type: Application
    Filed: June 23, 2017
    Publication date: December 27, 2018
    Inventors: Likun Hou, Xin Chen, Leiyi Yao
  • Publication number: 20180182054
    Abstract: 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.
    Type: Application
    Filed: December 28, 2016
    Publication date: June 28, 2018
    Inventors: Leiyi Yao, Xin Chen, Likun Hou
  • Publication number: 20180144279
    Abstract: 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.
    Type: Application
    Filed: November 22, 2016
    Publication date: May 24, 2018
    Inventors: Leiyi Yao, Xin Chen, Likun Hou
  • Publication number: 20170178073
    Abstract: A non-transitory computer-readable storage medium may comprise instructions stored thereon for determining optimized routes for repositioning empty shipping containers. When executed by at least one processor, the instructions may be configured to cause a computing system to at least generate candidate paths for repositioning empty shipping containers based on container depots, direct paths between the container depots, and scheduled paths between the container depots; present the candidate paths to a user; receive a selection of preferred paths from the user, the preferred paths being a subset of the candidate paths; and generate the optimized routes for repositioning the empty shipping containers between the container depots based on the preferred paths and movements of full shipping containers between the container depots.
    Type: Application
    Filed: December 17, 2015
    Publication date: June 22, 2017
    Inventors: Leiyi YAO, Xin CHEN