I have the following problem to solve. We have orders for always the same product in a carton. The orders come in every day and it is not possible to fulfil all of them every day. How do we select these orders so that the route is as optimal as possible?

Is solving the knapsack problem first and then the travelling salesman problem a good lead?

Does the knapsack problem fit here, since the weight is always the same because the carton in the order is the same, and the difference is only the size of the order?