Contains code meant to optimize the route for a tourist visiting the Louvre Museum, such that the satisfaction level is maximised by visiting all/select exhibits in a single working day.
python
optimization
genetic-algorithm
path-planning
simulated-annealing
ant-colony-optimization
optimization-algorithms
integer-programming
branch-and-bound
travelling-salesman-problem
path-optimization
museum-guide
-
Updated
Apr 24, 2021 - Python