Hello!
First of all thanks for the impressive work... It's amazing!
I will ask first the question, and then I will explain the problem just to see if there are other possibilities. When you have a chained planning variable, then is it true that each planning entity can have only one predecessor? Or can the predecessor be different depending on the anchor? I guess the right answer is the first one, but then I don't know how to use a chained variable when the path depends on the anchor... Will I have to go over to the cartesian product space (Anchors x Entities)? I hope not, because it will enlarge too much the complexity! :D
Or maybe the raise in complexity for considering the product is not that much, because only the chains with the same anchor in each step will be valid... I honestly do not know.
Well, I will briefly state the problem to see if it could be thought other way...
I'm trying to improve the system of a company that delivers freight to different locations on a number of trucks. The trucks are fixed to a route (they always travel from A to B and viceversa). The main difference with the VRP problem that you have solved is that there are intermediate nodes where the trucks exchange their loads. So a packet can travel in multiple trucks, and the chain variable you have used (if the answer was the first one) cannot work, because, across each location, many different trucks can travel, and then the chain will not be linear. I thought that maybe instead of considering the locations I could consider the travels as the entities in the chain, but the problem will arise again (there is no single predecessor to each travel; it depends on the packet).
If you could shed some light on this issue I will really, really appreciate it!
I would like to thank you for your time and patience.
Best regards,
Jaime