Skip to content

The Museum Problem - Optimization

Latest
Latest
Compare
Choose a tag to compare
@Prajwal-Prathiksh Prajwal-Prathiksh released this 24 Apr 13:37
· 4 commits to main since this release
v1.0
92dd910
This commit was created on GitHub.com and signed with GitHub’s verified signature. The key has expired.
GPG key ID: 4AEE18F83AFDEB23
Expired
Learn about vigilant mode.

About

Contains the benchmarked and verified codes 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 fixed time interval.

Contains the working implementation of the following algorithms:

  1. Branch and Bound (Limited Functionality)
  2. Ant Colony Optimization (Limited Functionality)
  3. Genetic Algorithm
  4. Simulated Annealing Algorithm

Installation

  1. Download the source code
  2. Install the requirements using - pip install -r requirements.txt
  3. Refer to the README.md for instructions on how to run.

Documentation

For further documentation on the algorithms and the references, refer to the documents in the ./presentations folder.

Citation

To cite the code: DOI

Thank you & Godspeed! 🙂💙🚀

Assets 2
Loading