BechirTrabelsi1
commited on
Commit
•
1c3c79f
1
Parent(s):
1752cd1
Update README.md
Browse files
README.md
CHANGED
@@ -44,17 +44,16 @@ The model can classify and extract variables for the following supply chain opti
|
|
44 |
2. **Economic Order Quantity (EOQ)**: Calculates the optimal order quantity to minimize total inventory costs.
|
45 |
3. **Vehicle Routing Problem (VRP)**: Plans optimal routes for a fleet of vehicles to deliver products to customers.
|
46 |
|
47 |
-
### Example Inputs
|
48 |
-
|
49 |
-
- **Newsvendor Problem**: "We have 12 items of X and 7 items of Y left in our inventory. The cost per item of X is $5 and of Y is $15. The storage cost is $1 per unit. We have historical orders for X: [26, 25, 29, 17, 49, 33, 46, 42, 30, 33] and for Y: [31, 26, 50, 25, 21, 16, 21, 39, 27, 45]. The selling price for X is $3 and for Y is $3. The storage limit is 498 units."
|
50 |
-
- **EOQ Problem**: "We need to determine the optimal order quantity for a product with a demand rate of 500 units per year, an ordering cost of $50 per order, and a holding cost of $2 per unit per year."
|
51 |
-
- **VRP Problem**: "We need to plan routes for 5 vehicles to deliver products to 20 customers. Each vehicle has a capacity of 100 units. The customer demands are as follows: [10, 20, 15, 30, 25, 20, 35, 40, 30, 20, 15, 25, 10, 5, 20, 30, 25, 15, 10, 20]."
|
52 |
|
53 |
### Example Inputs
|
54 |
|
55 |
- **Newsvendor Problem**: "We have 12 items of X and 7 items of Y left in our inventory. The cost per item of X is $5 and of Y is $15. The storage cost is $1 per unit. We have historical orders for X: [26, 25, 29, 17, 49, 33, 46, 42, 30, 33] and for Y: [31, 26, 50, 25, 21, 16, 21, 39, 27, 45]. The selling price for X is $3 and for Y is $3. The storage limit is 498 units."
|
56 |
- **EOQ Problem**: "We need to determine the optimal order quantity for a product with a demand rate of 500 units per year, an ordering cost of $50 per order, and a holding cost of $2 per unit per year."
|
57 |
-
- **VRP Problem**: "We need to plan routes for
|
|
|
|
|
|
|
|
|
58 |
|
59 |
## Fine-Tuning Process
|
60 |
|
|
|
44 |
2. **Economic Order Quantity (EOQ)**: Calculates the optimal order quantity to minimize total inventory costs.
|
45 |
3. **Vehicle Routing Problem (VRP)**: Plans optimal routes for a fleet of vehicles to deliver products to customers.
|
46 |
|
|
|
|
|
|
|
|
|
|
|
47 |
|
48 |
### Example Inputs
|
49 |
|
50 |
- **Newsvendor Problem**: "We have 12 items of X and 7 items of Y left in our inventory. The cost per item of X is $5 and of Y is $15. The storage cost is $1 per unit. We have historical orders for X: [26, 25, 29, 17, 49, 33, 46, 42, 30, 33] and for Y: [31, 26, 50, 25, 21, 16, 21, 39, 27, 45]. The selling price for X is $3 and for Y is $3. The storage limit is 498 units."
|
51 |
- **EOQ Problem**: "We need to determine the optimal order quantity for a product with a demand rate of 500 units per year, an ordering cost of $50 per order, and a holding cost of $2 per unit per year."
|
52 |
+
- **VRP Problem**: "We need to plan routes for 3 vehicles to deliver products to 10 customers.
|
53 |
+
Each vehicle has a capacity of 100 units. The customer demands are as follows: 10, 20, 15, 10, 5, 25, 30, 10, 15, 20 units.
|
54 |
+
The coordinates of the delivery locations are: (2,3), (5,5), (8,8), (1,2), (3,6), (7,2), (6,6), (5,9), (2,8), (4,4).
|
55 |
+
The warehouse is located at (0,0)."
|
56 |
+
|
57 |
|
58 |
## Fine-Tuning Process
|
59 |
|