Let me try to explain my problem better. During the planning process every customer's order (load) have its associated weight and type of the pallet (large or small) it is located on. In reality there more then two types of pallets to be used in the equation but let's stick with just two. Now the optimisation algorithm should answer the question of how to pack available diffrent type of trucks with diffrent not homogeneous pallets. So we can have both large and small pallets with a different combination of sizes in every truck.
Having said that I cannot "specify in advance whether a service/shipment involves the transportation of small or large pallets" In theory such homogeneous division is possible but not used in real lifes scenarios because it is far from the optimum.
So the system should be able to pack the truck given different sizes of pallets.
Yes I can specify in advance how many small and how many large pallets fit into my truck. But as long as a whole load (pallets) are not homogeneous it won't solve my problem, I guess. Note that in real live cases, pallets, which are rectangular in shape may be packed with either shorter or wider side to previuosly loaded pallets which even further complicate the issue. Imagine the client ordered number of items which can be packed on one 1200x800 and one 1200x1200 pallet. Nobody will agree to pack these items on two 1200x1200 to keep homogeneous truck. It is a waste of transportation/capacity space
There are specific bin packing algorithms out there and my question here is whethere jsprit is capable of doing it or prepared through some changes to the core to implement such feature
Please let me know if the problem is still not understandable.
Thanks in advance for your help