hi folks,
I am trying to solve trailer load allocation planning.This would have been easier if i had w*h*d in my data set, but i have a combination of products for a particular trailer type.And i have multiple dealers/destination spreaded across the region. Have attached below a scenario which explains :1) assume there are 22 product item named as ( R, V, X , B, )
<tbody>
</tbody>2) I have some dealers to which i have to send combinations (listed below) of these 22 products
3) Dealer/Destination list :
<tbody>
</tbody>4) to send this product from origin to different dealers i have 2 types of truck
**the specified combinations actually utilizes full space of truck}
Product Combination Pool to fit in Truck
<tbody>
</tbody>
5) Also we have possible routes of plying as :
**We can use FIFO methodology to prioritize the product combination on basis on bill date.
Regards
Centaur.
I am trying to solve trailer load allocation planning.This would have been easier if i had w*h*d in my data set, but i have a combination of products for a particular trailer type.And i have multiple dealers/destination spreaded across the region. Have attached below a scenario which explains :1) assume there are 22 product item named as ( R, V, X , B, )
| Sr No | Billing Date | Product Code | Dealr code | Dealr City |
| 194 | 01-08-2019 | R | S441 | Manchester |
| 195 | 01-08-2019 | R | S441 | Manchester |
| 196 | 01-08-2019 | R | S441 | Manchester |
| 197 | 01-08-2019 | R | S441 | Manchester |
| 198 | 01-08-2019 | R | S441 | Manchester |
| 199 | 02-08-2019 | R | S441 | Manchester |
| 200 | 03-08-2019 | R | S441 | Manchester |
| 201 | 03-08-2019 | R | S441 | Manchester |
| 202 | 03-08-2019 | V | S441 | Manchester |
| 203 | 03-08-2019 | V | S441 | Manchester |
| 204 | 03-08-2019 | V | S441 | Manchester |
| 205 | 03-08-2019 | X | S431 | Leeds |
| 206 | 03-08-2019 | X | S431 | Leeds |
| 207 | 03-08-2019 | X | S431 | Leeds |
| 208 | 04-08-2019 | B | S871 | Nottingham |
| 209 | 04-08-2019 | B | S871 | Nottingham |
| 210 | 04-08-2019 | B | S871 | Nottingham |
| 211 | 04-08-2019 | B | S871 | Nottingham |
| 212 | 04-08-2019 | B | S871 | Nottingham |
| 213 | 04-08-2019 | V | S401 | Melbourne |
| 214 | 03-08-2019 | V | S401 | Melbourne |
| 215 | 03-08-2019 | V | S871 | Nottingham |
<tbody>
</tbody>
3) Dealer/Destination list :
| Dealr Code | Dealr City |
| S441 | Manchester |
| S431 | Leeds |
| S871 | Nottingham |
| S401 | Melbourne |
<tbody>
</tbody>
- Type 1 Truck : can have a combination of loading product -
- 1st Combination : 6 numbers of R product as { 6R }
- 2nd Combination : 3 numbers of V product and 2 numbers of R product as { 3V, 2R }
- 3rd Combination : 5 numbers of V product as { 5V }
- Type 2 Truck : can have a combination of loading product :
- 4th Combination{ 3V, 3X }
- 5th Combination{ 5B,1V }
**the specified combinations actually utilizes full space of truck}
Product Combination Pool to fit in Truck
| Truck Type 1 | Truck Type 2 | ||
| Comb1 | 6R | Comb4 | 3V,3X |
| Comb2 | 3V,2R | Comb5 | 5B,1V |
| Comb3 | 5V | Comb6 | - |
<tbody>
</tbody>
5) Also we have possible routes of plying as :
- ROUTE A: Manchester , Leeds
- ROUTE B: Nottingham, Melbourne
- I want to figure out what model i need prepare my data set to achieve below:
- How to identify combinations stock (mark them as Allocated in data set after allocation) and idntify what number of trucks i will require ?
**We can use FIFO methodology to prioritize the product combination on basis on bill date.
Regards
Centaur.
Last edited:
