Hello,
I am currently looking into, what I think is, a variant of the Traveling Salesman Problem. This is for logistics delivering 1 commodity at a time to a customer, but instead of continuing onto the next customer we would have to return to the original depot or another closer one to restock. If needed, we could deliver again to the same customer or jump to another one if the order has been completed. I am looking to get the most efficient route to fulfill all of the customer orders that day for a given amount of delivery vehicles.
If that makes any sense, can someone please point me to articles on this or at least let me know if this specific example has a name so I can research it more?
I am currently looking into, what I think is, a variant of the Traveling Salesman Problem. This is for logistics delivering 1 commodity at a time to a customer, but instead of continuing onto the next customer we would have to return to the original depot or another closer one to restock. If needed, we could deliver again to the same customer or jump to another one if the order has been completed. I am looking to get the most efficient route to fulfill all of the customer orders that day for a given amount of delivery vehicles.
If that makes any sense, can someone please point me to articles on this or at least let me know if this specific example has a name so I can research it more?