https://github.com/baobabkoodaa/2018-reaktor-santa

My entry into Reaktor's "Traveling Santa" competition
https://github.com/baobabkoodaa/2018-reaktor-santa

Last synced: 11 days ago
JSON representation

My entry into Reaktor's "Traveling Santa" competition

• Host: GitHub
• URL: https://github.com/baobabkoodaa/2018-reaktor-santa
• Owner: baobabKoodaa
• Created: 2019-01-02T04:20:06.000Z (about 6 years ago)
• Default Branch: master
• Last Pushed: 2019-01-03T03:04:13.000Z (about 6 years ago)
• Last Synced: 2024-12-24T22:02:58.373Z (15 days ago)
• Language: Java
• Homepage:
• Size: 760 KB
• Stars: 1
• Watchers: 2
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Ho ho ho!

My entry into Reaktor's 2018 ["Traveling Santa"](https://traveling-santa.reaktor.com/) competition. The goal is to minimize distance for visiting all nodes, but it differs from classic Traveling Salesman problem in that we can't fit all nodes into a single trip due to weight constraints (like a Knapsack problem).

My solution is a mix of heuristics (creating a "smart" route from scratch) and optimization (modifying an existing route).

![alt text](3d-visualization-1.png "Visualization 1")

![alt text](3d-visualization-2.png "Visualization 2")

Visualization credit to henkkuli.