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.

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.

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.

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.

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.

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.