Welcome to the Delivery Emissions live coding exercise for HIVED, the eco-friendly delivery company 🚚♻️
At HIVED, we will never use fossil fuels, so all our vans are electric. ⚡ But different sizes of vans will vary in their electricity consumption, and so it's better for the planet (and for our wallet! 💸) to carefully select which vans are used for which delivery routes.
We'd like you to write a program that assigns vehicles to routes, in a way that will minimise total energy consumption.
-
routes.jsonThis contains an array of different routes. Each route will have an ID and a list of stops. Each stop will have a distance from the previous stop in kilometers. -
vehicles.jsonThis contains an array of vehicles. Each vehicle will have an ID, a capacity in kWh, and an electricity consumption in kWh/100km.
- Let's establish a baseline: What's the total energy in kWh required to complete all routes using the least efficient vehicle. You can ignore the vehicle's range for this question.
- Find the list of vehicle-route pairs that will minimise total energy consumption. A vehicle can at most be assigned to one route.
- Compare the total energy consumed using the optimal vehicle-route pairing to the baseline established in question 1.
- 💬 See this exercise as an interactive session, ask us questions as you would if we were working together
- 👌 Aim to write code in the way you would every day - you will not be penalised if you don't complete the exercise
- ✏️ Feel free to reach out to ask for clarifications and document your assumptions
- 👌 Aim to write code in the way you would every day - we expect you to complete the exercise