This is my project for the BWI Coding Challenge, it is an algorithm that generates a transport plan with the highest utility value.
Link to the Challenge
So it's actually just an algorithm that loads products / devices and transporters information from a JSON file. Each of these devices has a number, weight, and utility value. Each transporter has a weight limit of 1100kg, not including the weight of the driver. Two transporters are specified, but this can be expanded by adding more transporters to the JSON file. This algorithm creates a transport plan for each transporter, which is tailored to the weight and has the highest utility value.
-
Install NodeJS if it is not already installed
-
Clone the repo
git clone https://github.com/Intevel/bwi-algorithmus-challenge.git
-
Install NPM packages
npm install
</p>
-
Navigate to the "src" directory
cd src
-
Start application
node index.js
-
Now you can view the results in the documents folder
cd ../documents/
</p>
Distributed under the MIT License. See LICENSE
for more information.