📗 In this project, you will plan the routes of 2 cars to pick up groceries.
➩ You will get 10 units of utility (happiness) for each item on your grocery list.
➩ Your routes should be paths along a graph where the edges represent roads and the nodes represent grocery stores: each road has an integer length measured in miles, and each grocery store a list of items with possibly different prices (integers between 0 and 9) measured in units of utility (happiness).
➩ You can pick the initial positions of your cars, and each of your car can drive a maximum of 5000 miles.
➩ Your plan should take into consideration of the other students' routes: there is only one copy of each item in each grocery store, so you might not get an item if another student bought it before you arrive at the store. In case of ties, the item will be given to the student with an ID closer to the store ID.
➩ The goal is to maximize the total units of utility you get from the groceries minus the prices you paid for them, obtained from both cars.
➩ (Clarification) When each car arrives at a store, it will pick up all the items on your grocery list that are still available at that store. If two of your cars try to pick up the same item at the same time, priority will be given to the first car.
📗 You grocery list is based on your Wisc Net ID (if your Wisc email is xyz123@wisc.edu, please enter xyz123): . Please enter your ID and click this: .
➩ Your grocery list will be: .
➩ (Clarification) Item 0 in the list is the first item, item 1 in the list is the second item, etc. There could be duplicate items in your grocery list, and in that case, you need to visit multiple stores to get multiple copies of that item.
📗 You can choose to be in one of two groups, and the grocery stores will be different for these two groups. In the lists, there are 200 stores, and each store has the following properties (in this order).
➩ ID (4 digit unique ID),
➩ Icon (text),
➩ The prices of each of the 100 items (-1 means the store does not have the item).
➩ The adjacency list and the edge weight (pairs of numbers: ID of the other store then distance (in miles) to that store).