算法设计与分析_算法设计

算法设计与分析

Designed for small and medium sized warehouses operating as fulfillment centers for customer orders and last-mile delivery.

专为中小型仓库设计，用作客户订单和最后一英里交付的履行中心。

(Photo by chuttersnap on Unsplash)

(照片由 chuttersnap在 Unsplash上 拍摄 )

A process of collecting items together for customer order in the quantity required at a warehouse is called Picking. It is one of the most pivotal parts of a warehouse daily operations process. Manpower usually accounts for 70% of operations cost within a warehouse and 50–60% of manpower cost is spent on order picking. Picking is a significant part of the warehouse process that often goes overlooked.

将仓库中所需数量的物品一起收集以供客户订购的过程称为拣配。 它是仓库日常运营过程中最关键的部分之一。 人力通常占仓库内运营成本的70％，而人力成本的50-60％用于订单拣选。 拣选是仓库流程中经常忽略的重要部分。

Every warehouse manager understands the value of a smooth and efficient picking process and the possible impact it can have on the bottom line. A picking optimization should be a crucial part of DNA within every warehouse because an effective picking strategy can result in:

每个仓库经理都了解平稳高效的拣选流程的价值及其对底线可能产生的影响。 优化拣选应该是每个仓库中DNA的关键部分，因为有效的拣选策略可以导致：

• Lower inventory management cost
  降低库存管理成本
• Improved customer experience
  改善客户体验
• Higher employee satisfaction and an easier on-boarding and training process
  更高的员工满意度以及更轻松的入职和培训流程
• Improved Revenue
  收益增加

In the blog, we have described a simple yet effective process to improve picking efficiency. Along with algorithm design for path optimization and order allocation, we have described process implementation — technology used for platform integration, employee training and picking SOP. The updated methodology has been successful across all warehouses and has improved the picking efficiency by more than 180%.

在博客中，我们描述了一个简单而有效的过程来提高拣选效率。 除了用于路径优化和订单分配的算法设计之外，我们还描述了流程实现-用于平台集成，员工培训和选择SOP的技术。 更新的方法已在所有仓库中获得成功，并将拣选效率提高了180％以上。

Here are the pointers we will be covering

这是我们将要介绍的指针

• Understanding Process
  了解过程
• Algorithm Design
  算法设计
• Process Rollout
  Craft.io推广
• Measuring Results
  测量结果

了解过程 (Understanding Process)

Before we deep dive into the picking optimization algorithm and its process, we must understand basic concept of picking.

在深入研究拣选优化算法及其过程之前，我们必须了解拣选的基本概念。

• Warehouse Layout

  仓库布局

A warehouse designed to store, pick, pack, and ship usually has a floor plan designed with aisles, racks, shelves, and bins. Bins are the smallest available storing space within a warehouse, it describes a location in the warehouse where goods are stored. A coordinate system is used to locate a bin, with a sequence of Aisle-Rack-Shelf-Bin ID. For instance, A-R2-S1–8 represents Aisle A, Rack 2, Shelf 1, and Bin 8.

设计用于存储，拣选，包装和运输的仓库通常具有一个平面图，该平面图设计有过道，架子，货架和垃圾箱。 垃圾箱是仓库中最小的可用存储空间，它描述了仓库中存储货物的位置。 使用坐标系来定位具有一系列过道-机架-架子-箱ID的箱。 例如，A-R2-S1-8代表过道A，机架2，货架1和箱8。

For optimization, a 2 dimensional view of floor plan is used, where pathways as built at aisle-rack level. A sample floor plan is shown in image below:

为了进行优化，使用了平面图的二维视图，其中的通道是在过道-机架层构建的。 下图显示了示例平面图：

A sample floor plan of a warehouse

仓库样本平面图

• Picking Strategies

  拣货策略

There are 5 types of picking strategies that can be implemented:

可以实施5种选择策略：

1. Discrete Order Picking: One order-picker picks one order, one line item at a time. A very inefficient picking process, it requires high picking time. Not suited for warehouses with multiple orders.
   离散订单拣选：一个订单拣选者一次选择一个订单，一个订单项。 一个非常低效的拣选过程，需要很高的拣选时间。 不适合有多个订单的仓库。
2. Cluster Picking: Methodology of picking into multiple containers at one time. The containers could either be tote containing order batches, discrete order shippers, or discrete order totes. A cluster picking solution optimizes efficiency by allowing operators to batch pick multiple orders in a single pass, minimizing the non-value-added travel time.
   集群拣选：一次拣选多个容器的方法。 容器可以是包含订单批次的手提袋，不连续的订单托运人或不连续的订单手提袋。 集群拣选解决方案通过允许操作员单次批量拣选多个订单来优化效率，从而最大限度地减少了非增值旅行时间。
3. Zone Picking: Order pickers are assigned specific and physically defined zones based on aisles. The picker assigned to each zone is responsible for picking orders in each zone. If the order is fulfilled from multiple zones, the order is passed from zone to zone. Also known as “pick and pass” methodology.
   区域拣配：根据过道为订单拣配器分配了特定的和物理定义的区域。 分配给每个区域的拣配器负责每个区域的拣配订单。 如果订单是从多个区域执行的，则订单将在区域之间传递。 也称为“选择并通过”方法。
4. Waves Picking: Picking based on combination or orders based on various conditions — order recency, SKU Count, delivery date, types of order, customer location, frequency, or SKU location zones. Typically, orders are picked one after another without optimization. Wave based is best suited for medium to large warehouses that have medium or large size SKUs.
   Waves Picking：基于组合或基于各种条件的订单进行拣货-订单新近度，SKU计数，交货日期，订单类型，客户位置，频率或SKU位置区域。 通常情况下，订单是在没有优化的情况下接一个接一个地挑选的。 基于Wave的产品最适合具有中型或大型SKU的中型到大型仓库。
5. Batch Picking: Groups of orders that picked at the same time are called batch picking. It aims to minimize the distance traveled for picking orders where multiple orders can be picked in a single picker run. This methodology has a high potential to optimize and improve process efficiency. However, this picking methodology is best suited for small to medium-sized warehouses and does not work for large SKUs. A key constraint with this methodology is, it requires a dedicated cart design.
   批次拣选：同时拣选的订单组称为批次拣选。 它旨在最大程度地缩短领料订单的行驶距离，在这种情况下，可以在单个拣配器运行中拣选多个订单。 这种方法具有优化和提高过程效率的巨大潜力。 但是，这种拣配方法最适合中小型仓库，不适用于大型SKU。 这种方法的主要限制是，它需要专用的推车设计。

算法设计 (Algorithm Design)

Equipped with the right information and knowledge we start to build the path optimization algorithm for the warehouse. As stated before, the warehouse we are focusing on is small to medium-sized, working as fulfillment centers designed to fulfill customer orders and ship out products for last-mile delivery. These products stored in the warehouse are medical supplies — prescription and OTC drugs, medical devices and products; number of line items are usually in the range of 1 to 6.

配备了正确的信息和知识后，我们开始为仓库构建路径优化算法。 如前所述，我们关注的仓库是中小型的，作为履行中心，旨在满足客户订单并运送产品以实现最后一英里的交付。 这些存储在仓库中的产品是医疗用品-处方药和非处方药，医疗器械和产品； 订单项的数量通常在1到6的范围内。

Wave based picking is deployed in the warehouse, where multiple orders are given to pickers on a single-run as per the order recency and number of SKUs. Orders are sorted based on recency and a picker completes the run by picking one order at a time.

基于Wave的拣配部署在仓库中，在该仓库中，根据订单的近期性和SKU的数量，一次运行将多个订单分配给拣配器。 订单会根据新近度进行排序，而选择器会一次选择一个订单来完成运行。

The algorithm we are proposing is based on batch picking, where a set of orders will be assigned to a picker to be picked as a single order. This would help in reducing the path traveled by the picker and improve the overall picking speed.

我们建议的算法基于批次拣配，将一组订单分配给一个拣配器，以将其作为单个订单进行拣配。 这将有助于减少捡拾器行进的路径并提高整体捡拾速度。

Objective

目的

Design a path optimization algorithm to maximize the SKUs picked by a picker in a single run, while minimizing the time taken to complete the run. No bin should be visited twice in the activity to improve system efficiency.

设计一种路径优化算法，以最大化选择器在单个运行中选择的SKU，同时最大程度地减少完成运行所需的时间。 在该活动中，不应两次访问垃圾箱以提高系统效率。

Assumptions

假设条件

• The algorithm assumes warehouse as a 2-D grid with racks representing nodes on the grid, allowing only orthogonal movement between the racks
  该算法假设仓库为2D网格，其中机架代表网格上的节点，仅允许机架之间的正交移动
• The grid was developed using graph network theory where each rack within an aisle could be considered as node and edges can be drawn between racks that can be accessed from one another without passing other rack.
  网格是使用图网络理论开发的，其中过道中的每个机架都可以视为节点，并且可以在机架之间绘制边缘，这些机架可以相互访问而无需经过其他机架。

Network theory is the study of graphs as a representation of either symmetric relations or asymmetric relations between discrete objects, it is a part of graph theory: a network can be defined as a graph in which nodes and/or edges have attributes.

网络理论是对图的研究，它表示离散对象之间的对称关系或非对称关系，它是图论的一部分：网络可以定义为其中节点和/或边具有属性的图。

• Two kinds of edges can be built
  可以建立两种边缘

a. Direct Edges: Racks in the same aisle that are physically connected

一个。 直接边缘：物理连接在同一通道中的机架

b. Indirect Edges: Set of racks that are not in the same aisle, but a picker can travel directly between them without passing near any other rack in between them. Example — two racks that are facing each other.

b。 间接边：一组不在同一通道中的机架，但是捡拾器可以直接在它们之间移动，而不会靠近它们之间的任何其他机架。 示例—两个相互面对的机架。

• Movement from a point can only be made to another point that is either connected directly or indirectly to the starting point
  从一个点移动只能到另一个直接或间接连接到起点的点
• Distance is measured based on orthogonal movement on X and Y-axis
  距离是根据X和Y轴上的正交运动测量的

Constraints

约束条件

• One order cannot be split into multiple pickers
  一个订单不能拆分为多个选择器
• There is a constraint on the number of SKUs that picker can pick in a single run
  选择器在一次运行中可以选择的SKU数量受到限制
• Size of SKU is a key factor, for ease of communication, the SKUs are divided into four categories — Small, Medium, Large, and Extra Large. Constraints are set based on the quantity of each SKU. These constraints are derived from the cart dimension.
  SKU的大小是一个关键因素，为了便于沟通，SKU分为四类-小，中，大和特大。 根据每个SKU的数量设置约束。 这些约束来自购物车尺寸。

路线优化流程 (Route Optimization Process)

A. Converting floor plan into the network map

A.将平面图转换为网络图

The first part of the algorithm is a detailed study of the floor plan, this involves building a network with racks as nodes and edges representing racks that are connected from each other, the connection here can be either direct or indirect, while the strength of the edge represents the distance between two racks. The graph below shows a sample output for the network of a connected graph based on kamada_kawai_layout.

该算法的第一部分是对楼层平面图的详细研究，其中涉及建立一个以机架为节点，边缘代表彼此连接的机架的网络，此处的连接可以是直接的也可以是间接的，边缘表示两个机架之间的距离。 下图显示了基于kamada_kawai_layout的连接图网络的示例输出。

A network layout of Rack Connectivity Graph of Warehouse

仓库机架连接图的网络布局

Features on warehouse floor plan network layout:

仓库平面图网络布局的功能：

• A fully connected graph, where all racks are connected
  完全连接的图形，其中所有机架都已连接
• High-density show in the right-center of the graph represents starting and ending point in the warehouse, this has been modified to reduce picker crowding and a high density of picker at the same spot (explained later)
  图表右中间的高密度显示代表仓库的起点和终点，已对其进行了修改，以减少拾取器拥挤和同一地点的拾取器高密度(稍后说明)。
• Distance calculation is based on the network, where the smallest pathway between two racks is identified.
  距离计算基于网络，在该网络中可以确定两个机架之间的最小路径。

B. Creating a two-tiered connection map

B.创建两层连接图

However, we can overcome the issue by utilizing the constraints that are built within a warehouse.

但是，我们可以通过利用仓库内构建的约束来克服此问题。

In a standard warehouse, one pathway is flanked by aisles on either end, we have utilized this constraint to build a model that has two-layered of structure

在标准仓库中，一条路径的两端两侧都是通道，我们利用这一约束建立了一个具有两层结构的模型

Updated floor plan with Entry and Exit point of aisle pathway highlighted

更新了平面图，突出了过道的入口和出口点

Within the aisle pathway, a traveling salesman problem is used to build a predefined order.

在过道内，旅行商问题用于建立预定义的订单。

a. Inside aisle pathways:

一个。 内部过道：

Traveling salesman problem is used to build a sequence to cover racks within an aisle pathway which will provide the smallest distance required to cover all the racks inside the aisle pathway.

旅行商问题用于建立覆盖通道通道内机架的顺序，这将提供覆盖通道通道内所有机架所需的最小距离。

b. Inter aisle routes

b。 通道间路线

With the inside-aisle pathway resolved, the number of nodes to optimized is reduced by a magnitude of 23. Compared to 200 nodes and 580 edges, now we have to be optimize for 18 nodes and 25 edges (only orthogonal movements allowed).

解决了内部通道路径后，要优化的节点数减少了23个。与200个节点和580个边相比，现在我们必须针对18个节点和25个边进行优化(仅允许正交移动)。

Model 1 — Vehicle Routing Problem

模型1 –车辆路线问题

Vehicle Routing Problem: A critical problem that uses route optimization methodologies, it aims to identify an optimal set of routes for a fleet of vehicles to traverse to deliver to a given order customer. Determining a solution for the vehicle routing problem is NP-Hard and often solvers tend to use heuristics due to the size and frequency of real-world VRPs they need to solve.

车辆路线问题：这是一个使用路线优化方法的关键问题，旨在为一组车队确定最佳路线集，以穿越并交付给给定订单的客户。 确定车辆路线问题的解决方案是NP-Hard，并且由于求解器需要解决的实际VRP的大小和频率，它们通常会使用启发式方法。

As a first attempt for optimizing the overall path traveled based on Vehicle Routing Problem, this methodology was deployed to work on live data creating dynamic paths and order allocation.

作为基于“车辆路径问题”优化总体行驶路径的首次尝试，此方法被部署为处理实时数据，以创建动态路径和订单分配。

Input for this algorithm was — list of orders, location of SKUs within the list was provided as input, predefined routes for inside-aisle pathways, and network map connecting start and endpoints for pathways. The model still had the constraints and the assumption as stated before.

该算法的输入为-订单列表，列表中SKU的位置作为输入，通道内路径的预定义路线以及连接路径起点和终点的网络图。 该模型仍然具有前面所述的约束和假设。

Overall, this methodology proved very effective in terms of simulated output, simulations showed an average of 53% reduction in distance traveled when compared against a simulation for standard wave-based picking approach and 50% improvement over a simulated random picking methodology. However, the processing time for a list of 200 orders was above 20 mins. With high processing time and capability, this algorithm was not the best fit.

总体而言，该方法论在模拟输出方面非常有效，与标准基于波的采摘方法的模拟相比，模拟显示出行进距离平均降低了53％，与随机采摘方法相比提高了50％。 但是，处理200个订单的时间超过20分钟。 具有高处理时间和能力，该算法不是最合适的。

Model 2 — Traveling Salesman Problem & predefined routes

模型2 –旅行商问题和预定路线

Traveling salesman problem or TSP aims to find the shortest possible route that visits every node exactly once and returns to the starting point. The problem is NP-hard problem.

旅行商问题或TSP的目的是找到一条尽可能短的路线，该路线只访问每个节点一次，然后返回起点。 问题是NP难问题。

Similar to predefined calculations for within-aisle pathway, a route map was developed to travel between aisles. A standard traveling salesman problem approach was used to identify the optimal sequence connecting the endpoints of aisles within the floor plan, assuming orthogonal movements between the points.

与过道内的预定义计算类似，路线图也可以在过道之间移动。 假设点之间的正交运动，则使用标准的旅行商问题解决方法来确定连接平面图内过道端点的最佳顺序。

With this approach, we still need the algorithm to handle order-picker allocation, which is described below.

使用这种方法，我们仍然需要用于处理顺序选择器分配的算法，如下所述。

C. Order allocation

C.订单分配

Order allocation, a significant part of the pre-defined route methodology was done with the same overall objective of reducing the distance traveled by the picker.

订单分配是预定义路线方法的重要组成部分，其总体目标是减少拣选人员的行驶距离。

Order allocation is done on three levels:

订单分配分为三个级别：

• Orders are sorted based on the number of aisle-ends points orders cover, with order just assigned to 1 or 2 same endpoints allocated together.
  订单根据订单涵盖的过道端点数量进行排序，其中订单仅分配给一起分配的1个或2个相同端点。
• Order with 3 or less different endpoints are sorted based on two-tier map and assigned to the picker
  具有3个或更少不同端点的订单基于两层映射进行排序并分配给选择器
• For orders with 3 or more endpoints, a simple linear optimization algorithm is used to complete the order allocation
  对于具有3个或更多端点的订单，使用简单的线性优化算法来完成订单分配

All the order allocation is done as per the number of orders, number of SKUs within the tour, and size of the SKU.

所有订单分配都是根据订单数量，游览中的SKU数量以及SKU的大小完成的。

Simulation result for model based on TSP and the predefined path has slightly lower path distance improvements but extremely low processing time. The output showed an improvement of 48% over the random picking process, but the processing time was under 5 seconds for 200 orders.

基于TSP和预定义路径的模型的仿真结果，路径距离的改进略低，但处理时间极短。 与随机拣选过程相比，输出显示出48％的改进，但是200个订单的处理时间不到5秒。

Graph comparing the decrease in pick path distance and processing time

该图比较了拾取路径距离和处理时间的减少

Quick note — simulation was done on multiple sets of random orders with a wide variety of SKUs under harsh constraints on order and SKU quantity (10 orders and 30 SKU per picker).

快速说明—在对订单和SKU数量有严格限制(每个拣配器10个订单和30个SKU)的严格限制下，对具有多种SKU的多组随机订单进行了仿真。

D. Avoiding Picker Crowding

D.避免拣选人员拥挤

Picker operate in the closed and confined spaces of warehouse, hence the algorithm has to ensure pickers are not gathered together at hot zones at the same time. To solve this issue, two further modifications were made to the algorithm:

拣选员在仓库的封闭和密闭空间中操作，因此算法必须确保拣选员不会同时在热区聚集在一起。 为了解决此问题，对该算法作了两个进一步的修改：

1. Changing the connectivity with the start point: As shown in the network graph above certain endpoints of the aisle pathway were connected to the picklist generation point in order to create a more distributed graph.
   更改与起点的连通性：如网络图中的上方所示，将过道路径的某些端点连接到选择列表生成点，以便创建分布更广的图。
2. Random reverse picking list: Certain picklist generated from the algorithm were reversed. This primarily worked in warehouses where a high density of heat map was closer to the picklist generation point.
   随机反向选择列表：从算法生成的某些选择列表已被反向。 这主要是在仓库中，热图的密度较高，更接近选择列表的生成点。

E. Output

E.输出

A python script was created using open source libraries where a list of orders with SKU is provided as input along with SKU Location and a static file with a two-tiered map for the warehouse; it produces an output with picklist allocated to a picker ID and sorted in an order the picklist should be picked.

使用开放源代码库创建了python脚本，其中提供了带有SKU的订单列表作为输入以及SKU位置和带有仓库两层地图的静态文件； 它会产生一个输出，该输出具有分配给选择器ID的选择列表，并按照应选择该选择列表的顺序进行排序。

系统整合 (System Integration)

To scale the picklist operation, the script has to be incorporated into the in-house build CRM system designed for the warehouse. Two key systems were used for the integration:

为了扩展选择列表操作，必须将脚本合并到为仓库设计的内部构建CRM系统中。 集成使用了两个关键系统：

• AWS Lambda

  AWS Lambda

Lambda is a service-less architecture that lets you run code without provisioning or managing servers and you pay only for the compute time you consume. Containers are deployed each time a request is made to run the script. Lambda provides scalability as you can run code for virtually any type of application or back-end service — all with zero administration. Within lambda, a python runtime environment is being used to run the picklist generator code and deploying libraries used in the code.

Lambda是一种无服务的体系结构，可让您运行代码而无需置备或管理服务器，而只为所消耗的计算时间付费。 每次发出运行脚本的请求时都会部署容器。 Lambda提供了可伸缩性，因为您几乎可以为任何类型的应用程序或后端服务运行代码-只需进行零管理即可。 在lambda中，正在使用python运行时环境来运行选择列表生成器代码并部署该代码中使用的库。

• AWS SQS

  AWS SQS

Amazon Simple Queue Service (SQS) is a fully managed message queuing service that enables you to decouple and scale micro-services, distributed systems, and server-less applications.

Amazon Simple Queue Service(SQS)是一项完全托管的消息队列服务，使您能够解耦和扩展微服务，分布式系统和无服务器应用程序。

For the picklist to be generated, a CRM system will publish the input in AWS SQS which is a simple queue invoking the lambda container with the python script and the result is pushed into another SQS queue which will be subscribed by the CRM.

对于要生成的选择列表，CRM系统将在AWS SQS中发布输入，该输入是使用python脚本调用lambda容器的简单队列，结果被推入另一个SQS队列中，然后由CRM进行订阅。

Process rollout

流程推出

The algorithm moves picking methodology from waves based picking to batch picking, with high optimization results (48% reduction in travel distance based on simulations). However, the batch process would not help reduce the aging of the orders in the picking pipeline. A combination of wave and batch-based picking would be best suited for the overall picking methodology.

该算法将拣选方法从基于波浪的拣选转移到批量拣选，具有很高的优化结果(根据模拟，行进距离减少了48％)。 但是，批处理将无助于减少拣配管道中订单的老化。 基于波次和基于批次的拣配的组合将最适合整体拣货方法。

Due to changes in methodology where batch processing requires a specially designed cart which can support multiple orders picking as one order. An output model should provide a combined picklist with tags for each SKU with the order ID. Sample output for the combined picklist is given below.

由于方法的变化，批处理需要专门设计的购物车，该购物车可以支持将多个订单作为一个订单进行拣配。 输出模型应为每个带有订单ID的SKU提供带有标签的组合选择列表。 合并的选择列表的输出示例如下。

Sample output for Combined Picklist

组合选择列表的样本输出

The updated methodology also requires a change in the picking cart. The cart has to support the flexibility of picking multiple orders as one where the selected order goes in a designated basket within the cart.

更新后的方法还需要更改领料车。 手推车必须支持选择多个订单的灵活性，将选定的订单放入手推车内的指定购物篮中。

Sample cart designed for Batch Picking (Source: Twitter)

专为批量领料设计的样品车(来源：Twitter)

Selected pickers were identified within a warehouse and provided training for a couple of hours a day on the updated picking process. The process was slowly rolled out for other pickers and made part of the standard picking process within 10 days.

选定的拣选人员在仓库中被识别，并且每天接受有关更新的拣选流程几个小时的培训。 此过程已慢慢推广到其他采摘者，并在10天内成为标准采摘过程的一部分。

测量结果 (Measuring Results)

A key part of the success here is training pickers on the updated process and ensuring the right SKU is added to the right bucket, we faced issues with training in first few days where there were errors and pickers not following the designed process. With kinks ironed out in a week, we saw an 180% increase (and still increasing) in the picking speed while maintaining a high level of quality. Improvements in implementation were higher than an initially expected improvement of 50% based on a reduction in distance traveled by the picker. Upon further analysis, we identified that wave based picking was muddled with U-turns, overcrowding which slowed down a picker even further, which is solved in the algorithm based picking approach.

成功的关键部分是对拣选人员进行更新流程的培训，并确保将正确的SKU添加到正确的存储桶中，我们在开始的几天就遇到培训问题，因为错误和拣选人员没有遵循设计流程。 在一周内解决了纠结问题后，我们发现采摘速度提高了180％(并且还在提高)，同时保持了较高的质量水平。 实施方面的改进高于最初预期的50％，这是由于采摘者行进距离的减少所致。 经过进一步分析，我们发现基于波浪的拣选与U形弯头混淆，拥挤不堪进一步拖慢了拣选速度，这在基于算法的拣选方法中得以解决。

下一步 (Next Steps)

• This number can be improved by updating the constraints assigned to the process due to the order count and SKU count. A modified picking cart could result in further improvements by a margin of 50%.
  由于订单数量和SKU数量，可以通过更新分配给流程的约束条件来提高此数量。 修改后的拣货车可能会进一步提高50％的利润率。
• Path optimization could be used for the process of putting away, where the process can be migrated from waves based to batch or cluster-based put away.
  路径优化可用于收货过程，该过程可从基于波浪的收货迁移到基于批次或基于群集的收货。

This project would not have been possible without help and guidance from

没有项目的帮助和指导，这个项目是不可能的

• Operations and Management team at 1mg partner warehouse, who were open, willing, and eager components for driving this project from a theoretical concept into reality. Their continuous work, even during the COVID-19 crunch was very valuable and important in implementing this design and improving the algorithm within a month.
  1mg合作伙伴仓库的运营和管理团队开放，乐于助人并且渴望将项目从理论概念变为现实。 即使在COVID-19紧缩期间，他们的连续工作也非常重要，对于实现这种设计和在一个月内改进算法非常重要。
• Technology team at partner warehouses, took this project in stride and worked overtime to help me integrate this within the existing CRM system. Their expertise in connecting the dots between business and platform was evident and a helpful asset.
  合作伙伴仓库的技术团队全力以赴地完成了这个项目，并加班工作以帮助我将其集成到现有的CRM系统中。 他们在连接业务和平台之间的点上的专业知识是显而易见的，也是有益的资产。
• 1mg Management team — for showing openness and eagerness to experiment and improve, even during a time of crisis.
  1mg管理团队-即使在危机时期也表现出开放和渴望进行试验和改进的渴望。

翻译自: https://medium.com/1mgofficial/a-simple-measure-to-improve-warehouse-picking-efficiency-a4bcfbd23383

算法设计与分析