The page below is for explaining to non-engineers, who saw the link on the shopper-bag.

Back in university, engineers learn about the traveling salesman problem — finding the shortest route that visits every city on a list and returns to the start. It sounds simple, but solving it efficiently is incredibly complex. Even computers sweat over it.

Now imagine being in a supermarket with a mental shopping list and a rough map of the store layout. An engineer’s brain kicks in. Without even thinking, we’re solving a real-life shortest path problem. Every aisle, every detour, every item — calculated. Did you interrupt this person? You’ve just introduced chaos into an optimization process.

That’s what the bag is for. It’s not just about carrying groceries—it’s about keeping the system stable. 😄

The shopper problem.
A modern take on the traveling salesman problem:

Want to try it yourself?

  • Read the basics of the traveling salesman problem on Wikipedia.
  • Or try solving it online with this tool by the Technical University of Munich. Start with 3–5 cities for a challenge that won’t melt your brain.

Want the bag?

Let us know, and we’ll make sure you’re equipped for your next optimized grocery mission.