Routing Assignment
Routing Assignment – A Special Waste Collection Problem
This report analyses the routing problem for a security waste transport company. It looks at processes undertaken in order to identify the best route for the vehicle to take each day taking into account the capacity of the vehicle.
To start the process I needed to identify where location of lab 20 was on the map. The last four digits of my student id is 1290 therefore the coordinates for lab 20 is (12,9). From here I was able to calculate the distances between lab 20 and the other lab locations.
The vehicle had a capacity of 28 boxes of waste per day so I had to take this into account when allocating the labs for the vehicle route over the two day period. To work out the initial routes I carried out a Sweep Algorithm to allocate the labs into the two days. The Sweep Algorithm produced the following results:
Day 1 – Labs: 0, 3, 12, 2, 16, 9, 7, 1, 19, 11, 10, 0. The total boxes of waste was 28 and the total distance was 320.
Day 2 – Labs: 0, 8, 13, 0, 5, 15, 4, 20, 18, 17, 14, 0. The total boxes of waste was 23 and the total distance was 307.
Once I had identified which labs would be visited on each day I put these into XPRESS IVE to identify the optimal solution, i.e the best route for the vehicle to take each day. The optimal routes that were identified are as follows…… Optimal route info.
I drew the resulting routes onto the map and I attempted to make improvements on the routes that were identified by the Sweep Algorithm. The process that I carried out to do this was first by looking at the diagram and seeing if I could see any shortcuts I could see between the labs. I then listed the labs in the order that they were visited on each day. Using 4 labs at a time I swapped some of the locations around to see if this would shorten the route on each day. Eg/ Day 1, the first four labs visited were 0,3,12,2 so I changed the route to 0,12,3,2 this made no improvement so I moved onto the next four which
This report analyses the routing problem for a security waste transport company. It looks at processes undertaken in order to identify the best route for the vehicle to take each day taking into account the capacity of the vehicle.
To start the process I needed to identify where location of lab 20 was on the map. The last four digits of my student id is 1290 therefore the coordinates for lab 20 is (12,9). From here I was able to calculate the distances between lab 20 and the other lab locations.
The vehicle had a capacity of 28 boxes of waste per day so I had to take this into account when allocating the labs for the vehicle route over the two day period. To work out the initial routes I carried out a Sweep Algorithm to allocate the labs into the two days. The Sweep Algorithm produced the following results:
Day 1 – Labs: 0, 3, 12, 2, 16, 9, 7, 1, 19, 11, 10, 0. The total boxes of waste was 28 and the total distance was 320.
Day 2 – Labs: 0, 8, 13, 0, 5, 15, 4, 20, 18, 17, 14, 0. The total boxes of waste was 23 and the total distance was 307.
Once I had identified which labs would be visited on each day I put these into XPRESS IVE to identify the optimal solution, i.e the best route for the vehicle to take each day. The optimal routes that were identified are as follows…… Optimal route info.
I drew the resulting routes onto the map and I attempted to make improvements on the routes that were identified by the Sweep Algorithm. The process that I carried out to do this was first by looking at the diagram and seeing if I could see any shortcuts I could see between the labs. I then listed the labs in the order that they were visited on each day. Using 4 labs at a time I swapped some of the locations around to see if this would shorten the route on each day. Eg/ Day 1, the first four labs visited were 0,3,12,2 so I changed the route to 0,12,3,2 this made no improvement so I moved onto the next four which