by Ira Winder [jiw@mit.edu] as a demonstrative learning aid for Mingrui Wang [9860851159@edu.k.u-tokyo.ac.jp]
---
FOR EDUCATIONAL PURPOSES ONLY!
DO NOT USE THIS ALGORITHM OR RESULTS PRODUCED BY THIS ALGORITHM IN YOUR THESIS WORK!
---
- Parameterized model of a the logistics request network, according to Mingrui's work
- Evaluation of the network's cost
- Genetic Algorithm to discover least cost solution
- Download Processing 3: https://processing.org/download/
- Clone the repository, not changing any of the files or folder structure
- Use Processing to run the included file "GeneticAlgorithm.pde"
The model assumes that 20 given sites create a net amount of refuse that needs to be collected and delivered to a set of "Stations" over a period of time. The model may implement the construction of up to 10 stations that have pre-known locations, construction costs, and transportation costs associated with them.
Since each potential station will have unique capital cost and operations costs, it is not obvious which configuration will be the cheapest to build. Therefore, we build our model to discover solution that achieves the minimum cost while providing enough capacity for all refuse to be collected.
