Coupang, Corporation

Wenting Mo

Xiufang Zhu

Xingzhu Gu

Ying Qin

Jin Hyun Kim

Yoo Suk Kim

Sen Yang

Hongyuan Li

Changquan Piao

Sun Seung Lee

Yuanyuan Cen

Dong Yang

Jinxing Lu

Kai Wei

Zijian Hu

Computer-implemented systems and methods for optimizing sorting and loading of packages are disclosed. An exemplary system includes a memory storing instructions and may include at least one processor configured to execute the instructions. The system may perform operations including receiving data comprising a plurality of package identifiers associated with a plurality of packages. The operations may include determining a plurality of block areas associated with delivery locations for the plurality of packages. The operations may further include determining a delivery route by determining a first set of routes, determining optimal combinations of the inputs for each set of routes and determining a shortest route associated with the optimal combinations. The operations may include determining an order in which to load each of the packages into a delivery vehicle. The operations may further include generating instructions for causing a device to display a visual representation of the loading order.

Systems and methods for modular camp sortation and dynamic loading layout generation

Methods, apparatuses, and systems of route planning for package pickup and delivery includes: receiving predetermined locations in a geographic region and data representing a predetermined route connecting the predetermined locations; determining unit areas in the geographic region based on sequential nearness of the predetermined locations along the predetermined route, the unit areas including a first unit area and a second unit area, and the unit areas being configured such that all locations in the first unit area are to be visited before visiting locations of the second unit area; generating delivery patterns for determining a route connecting at least one of the unit areas, each delivery pattern including at least one of the unit areas associated with a visiting sequence; when receiving task data including target locations to visit, determining a target route using the delivery patterns and the target data; and sending the target route to a mobile apparatus.

Systems, apparatuses, and methods of efficient route planning for e-commerce fulfillment

A system for attendance assignment. The system may include a memory storing instructions and at least processor configured to execute the instructions to perform operations. The operations may include retrieving, from a database, a plurality of delivery routes and a plurality of delivery sub-routes, wherein the delivery sub-routes are part of the delivery routes; calculating, based on the retrieval, a number of packages allocated to the delivery sub-routes; receiving, as input, a number and a type of workers available for deliveries, wherein the type including at least one of classification characteristics or efficiency characteristics; assigning, based on the calculated number of packages and the received input, the workers to a plurality of groups, wherein the groups correspond to different delivery routes or sub-routes; and comparing, based on the assignment, the assigned workers against the delivery routes or the delivery sub-routes.

Balancing package delivery sub-route assignments amongst delivery workers based on worker efficiencies and attendance

A system for attendance pre-assignment. The system may include a memory storing instructions and at least processor configured to execute the instructions to perform operations. The operations may include retrieving, from a database, a plurality of delivery routes and a plurality of delivery sub-routes, wherein the delivery sub-routes are part of the delivery routes; calculating, based on the retrieval, a number of packages allocated to the delivery routes and the delivery sub-routes; receive data comprising groups of pre-assigned workers available for deliveries, the workers being classified into a plurality of categories; comparing, based on the received groups, the pre-assigned workers against the delivery routes and the delivery sub-routes; assigning, based on the comparison, the packages, the delivery routes, and the delivery sub-routes to the pre-assigned workers; generating a plurality of candidate routes associated with the pre-assigned workers; and calibrating, based on the assignment and the generated candidate routes, the delivery sub-routes.

Package delivery sub-route assignments to delivery workers based on expected delivery efficiency

The disclosed embodiments provide computer-implemented systems and methods for batch picking optimization. They system may include one or more memory devices storing instructions and one or more processors configured to execute the instructions to receive an order comprising one or more items for picking. Additionally, the system may calculate one or more high density areas in a fulfillment center by calculating distances between a first item in the one or more items and at least one other item in the one or more items using a search algorithm. Additionally, the system may calculate nearest neighboring items for the one or more items and generate a high density area by choosing a plurality of the nearest neighboring items.

Warehouse batch product picking optimization using high density areas to minimize travel distance

Systems and methods for computerized balanced delivery route assignment

Systems and methods for computerized balanced delivery route pre-assignment

Growing community of inventors

Beijing, China

Wenting Mo