Suppose you are planning deliveries to the following cities in Denmark starting from and coming back to Odense: Aalborg, Aarhus, Herning, Vejle, Esbjerg, Silkeborg and Snderborg. Using the data from a maps service, set up an optimization problem to minimize the total distance required to make the deliveries, visiting every place only once. Moreover, due to capacity limitations, all the deliveries can not be done by one vehicle. Here are the questions: Is the routing problem you set up symmetric or asymmetric? Assuming there are two identical vehicles available with the capacity to visit not more than 4 locations, what are the optimal routes for each vehicle? What are the routes for the same two vehicles obtained using the Savings algorithm? Aalborg 249 Odense 0 249 151 153 80 0 d Odense Aalborg Aarhus Herning Veile Esbjerg Silkeborg Snderborg Aarhus 151 119 0 87 72 Vejle 80 181 72 Herning 153 128 87 0 69 Esbjerg 141 223 155 69 0 88 84 119 128 181 223 115 302 Silkeborg Snderborg 138 169 115 302 44 193 40 193 60 126 115 124 0 180 180 0 141 88 84 155 44 40 138 169 60 126 0 115 124 193 193 dij Odense Aalborg Aarhus Herning Vejle Esbjerg Silkeborg Snderborg Odense 0 249 151 153 80 141 138 169 1081 Aalborg 249 0 119 128 181 223 115 302 1317 Aarhus 151 119 0 87 72 155 44 193 821 Herning 153 128 87 0 69 88 40 193 758 Vejle 80 181 72 69 0 84 60 126 672 Esbjerg 141 223 155 88 84 0 115 124 930 Silkeborg 138 115 44 40 60 115 0 180 692 Snderborg 169 302 193 193 126 124 180 0 1287 1081 1317 821 758 672 930 692 1287 3 0 8 4 0 5 1 1 1 6 0 0 0 2 1 0 3 0 1 0 0 0 0 0 0 0 1 2 0 0 1 0 0 0 0 0 4 0 0 0 0 0 0 0 0 0 0 1 7 0 0 0 0 1 0 0 0 5 1 1 0 0 0 0 0 0 0 6 0 0 0 0 0 1 0 1 7 1 1 0 0 8 1 0 0 0 1 1 1 1 Suppose you are planning deliveries to the following cities in Denmark starting from and coming back to Odense: Aalborg, Aarhus, Herning, Vejle, Esbjerg, Silkeborg and Snderborg. Using the data from a maps service, set up an optimization problem to minimize the total distance required to make the deliveries, visiting every place only once. Moreover, due to capacity limitations, all the deliveries can not be done by one vehicle. Here are the questions: Is the routing problem you set up symmetric or asymmetric? Assuming there are two identical vehicles available with the capacity to visit not more than 4 locations, what are the optimal routes for each vehicle? What are the routes for the same two vehicles obtained using the Savings algorithm? Aalborg 249 Odense 0 249 151 153 80 0 d Odense Aalborg Aarhus Herning Veile Esbjerg Silkeborg Snderborg Aarhus 151 119 0 87 72 Vejle 80 181 72 Herning 153 128 87 0 69 Esbjerg 141 223 155 69 0 88 84 119 128 181 223 115 302 Silkeborg Snderborg 138 169 115 302 44 193 40 193 60 126 115 124 0 180 180 0 141 88 84 155 44 40 138 169 60 126 0 115 124 193 193 dij Odense Aalborg Aarhus Herning Vejle Esbjerg Silkeborg Snderborg Odense 0 249 151 153 80 141 138 169 1081 Aalborg 249 0 119 128 181 223 115 302 1317 Aarhus 151 119 0 87 72 155 44 193 821 Herning 153 128 87 0 69 88 40 193 758 Vejle 80 181 72 69 0 84 60 126 672 Esbjerg 141 223 155 88 84 0 115 124 930 Silkeborg 138 115 44 40 60 115 0 180 692 Snderborg 169 302 193 193 126 124 180 0 1287 1081 1317 821 758 672 930 692 1287 3 0 8 4 0 5 1 1 1 6 0 0 0 2 1 0 3 0 1 0 0 0 0 0 0 0 1 2 0 0 1 0 0 0 0 0 4 0 0 0 0 0 0 0 0 0 0 1 7 0 0 0 0 1 0 0 0 5 1 1 0 0 0 0 0 0 0 6 0 0 0 0 0 1 0 1 7 1 1 0 0 8 1 0 0 0 1 1 1 1
