Update README.md

README.md

@@ -15,7 +15,7 @@ tags:
 
 ## Overview
 
-- 🤠GreedRL is a Deep Reinforcement Learning (DRL) based solver that can solve various types of problems, such as TSP, VRPs (CVRP, VRPTW, VRPPD etc), Order Batching Problem, Knapsack Problem etc.
+- 🤠GreedRL is a Deep Reinforcement Learning (DRL) based solver that can solve various types of problems, such as TSP, VRPs (CVRP, VRPTW, VRPPD, etc), Order Batching Problem, Knapsack Problem, etc.
 
 - 🤠GreedRL achieves very high performance by running on GPU while generating high quality solutions.
   **1200 times faster** than [Google OR-Tools](https://developers.google.com/optimization) for large-scale (>=1000 nodes) CVRP, and the solution quality is improved by **about 3%**.
@@ -27,7 +27,7 @@ tags:
 
 ## Editions
 
-We have deliveried the following two editions of 🤠GreedRL for users.
+We have delivered the following two editions of 🤠GreedRL for users.
 
 - **The Community Edition** is open source and available to [download](https://huggingface.co/Cainiao-AI/GreedRL).
 - **The Enterprise Edition** has a higher performance implementation than **The Community Edition** (about 50 times faster), especially when solving larg-scale problems. For more informations, please contact <a href="mailto:jiangwen.wjw@alibaba-inc.com">us</a>.
@@ -361,17 +361,16 @@ class Objective:
 
 ### Real-world scenario problems
 
-In addition to being able to solve standard problems, 🤠GreedRL can also model and solve real-world scenario problems, like `Instant Pickup and Delivery Service` and `Order Batching Problem`.
+In addition to being able to solve standard problems, 🤠GreedRL can also model and solve real-world scenario problems, like *Instant Delivery Service* and *Order Batching Problem*.
 
-#### Instant Pickup and Delivery Service
+#### Instant Delivery Service
 
-> Instant Pickup and Delivery Service are widespread in order dispatching systems of the supply chain, courier delivery services and elsewhere.
-> 
+> Instant Delivery Service are widespread in order dispatching systems of the supply chain, courier delivery services and elsewhere.
 > Orders are generated in real-time. A number of vehicles are scheduled to serve orders from pickup locations to delivery locations while respecting vehicle capacity and service time constraints. The objective is to dynamically assign each order to the most appropriate vehicle so that the overall transportation cost (e.g., overall distances) cound be minimized.
 
 
 <details>
-    <summary>Instant Pickup and Delivery Service</summary>
+    <summary>Instant Delivery Service</summary>
 
 ```python
 from greedrl.feature import *
@@ -462,6 +461,9 @@ class Objective:
 </details>
 
 #### Order Batching Problem
+> The Order Batching Problem is an optimization problem which occurs in a warehouse consists of designing a set of picking batches, such that each customer order (composed by a list of items) is assigned to exactly one batch,
+> each batch have to be collected by a single picker without exceeding a capacity limit, and the total distance traveled by the pickers is minimal.
+
 <details>
     <summary>Order Batching Problem</summary>