Your kid is about to go out to collect some candies. You have learnt how to build, given a set of houses and an energy consumption matrix , a single tour that visits all those houses with the minimum possible consumption of energy. You have realized that this solution may not be feasible if your […]
Author: ccontard
31
Oct 2017
The capacitated trick-or-treat problem
Ok, you modeled for your kid the problem of visiting all the possible houses using the minimum energy consumption as a traveling salesman problem. But now that you look at the solution and realize that it will be not possible to visit all the houses without a bag, and even though, the amount of candies […]
ccontard
Twitter tuesday
No Comments on the capacitated trick-or-treat problem with route length constraints
Well, you now know how to model and solve the problem of visiting all the houses in your neighborhood in the uncapacitated case and also in the case in which your kid has a limited capacity for collecting candies. But now you again analyze the solution given by the solver and realize that each single tour […]
31
Oct 2017
The traveling trick-or-treat problem
It is the 31st, YEAH! It is halloween, YEAH! You or someone in your family (in my case, my 3yo son) must be excited about it. Tonight we collect candies! If you have kids (like I do), you know they cannot walk long distances, and quickly after knocking at a few front doors will get […]