1. The problem statement, all variables and given/known data My dad is driving coal. His truck has a limited coal-capacity, and enough fuel. He drives this coal from the central which has enough coal, to farmers that need different amounts. As there are many farmers, he has to drive back and forth several times. He knows all distances, and how much coal each farmer needs. When all farmers have their needed coal, he notes the total distance his truck has driven. How can he make a route, that minimizes the total distance his truck has driven? 2. Relevant equations 3. The attempt at a solution This is not from any assignment, but from a real problem which directly affects when my dad gets home from work. I figure, If I get all the distances, I can make a map of the problem using Multidimensional Scaling, and then apply a modified k-nearest neighbors algorithm, that has a stop criteria of the truck capacity, and thus takes the amounts of coal into account. What strategy would you use?