question
stringlengths 255
584
| answer
stringlengths 93
105
|
|---|---|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 187 mins, B: 120 mins
A -> GHY: 146 mins, B: 133 mins
B -> GHY: 190 mins, A: 81 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 347 minutes.
#### 347
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 52 mins, B: 144 mins
A -> GHY: 94 mins, B: 189 mins
B -> GHY: 67 mins, A: 151 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β GHY with a total flying time of 308 minutes.
#### 308
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 189 mins, B: 145 mins
A -> GHY: 140 mins, B: 87 mins
B -> GHY: 171 mins, A: 91 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 376 minutes.
#### 376
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 160 mins, B: 89 mins
A -> GHY: 139 mins, B: 137 mins
B -> GHY: 140 mins, A: 133 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 361 minutes.
#### 361
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 92 mins, B: 112 mins
A -> GHY: 78 mins, B: 176 mins
B -> GHY: 194 mins, A: 183 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 373 minutes.
#### 373
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 100 mins, B: 183 mins
A -> GHY: 56 mins, B: 188 mins
B -> GHY: 118 mins, A: 83 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 322 minutes.
#### 322
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 199 mins, B: 70 mins
A -> GHY: 196 mins, B: 116 mins
B -> GHY: 180 mins, A: 80 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 346 minutes.
#### 346
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 194 mins, B: 77 mins
A -> GHY: 159 mins, B: 114 mins
B -> GHY: 189 mins, A: 107 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 343 minutes.
#### 343
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 80 mins, B: 76 mins
A -> GHY: 51 mins, B: 56 mins
B -> GHY: 56 mins, A: 177 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β GHY with a total flying time of 192 minutes.
#### 192
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 123 mins, B: 42 mins
A -> GHY: 191 mins, B: 181 mins
B -> GHY: 66 mins, A: 43 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 276 minutes.
#### 276
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 81 mins, B: 96 mins
A -> GHY: 104 mins, B: 83 mins
B -> GHY: 101 mins, A: 198 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β GHY with a total flying time of 265 minutes.
#### 265
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 134 mins, B: 69 mins
A -> GHY: 81 mins, B: 132 mins
B -> GHY: 133 mins, A: 197 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 347 minutes.
#### 347
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 137 mins, B: 79 mins
A -> GHY: 137 mins, B: 114 mins
B -> GHY: 157 mins, A: 84 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 300 minutes.
#### 300
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 48 mins, B: 193 mins
A -> GHY: 144 mins, B: 141 mins
B -> GHY: 184 mins, A: 183 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β GHY with a total flying time of 373 minutes.
#### 373
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 128 mins, B: 178 mins
A -> GHY: 65 mins, B: 159 mins
B -> GHY: 52 mins, A: 194 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β GHY with a total flying time of 339 minutes.
#### 339
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 122 mins, B: 72 mins
A -> GHY: 93 mins, B: 68 mins
B -> GHY: 106 mins, A: 150 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β GHY with a total flying time of 296 minutes.
#### 296
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 145 mins, B: 180 mins
A -> GHY: 123 mins, B: 170 mins
B -> GHY: 107 mins, A: 59 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 362 minutes.
#### 362
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 190 mins, B: 100 mins
A -> GHY: 145 mins, B: 174 mins
B -> GHY: 88 mins, A: 67 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 312 minutes.
#### 312
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 110 mins, B: 120 mins
A -> GHY: 156 mins, B: 124 mins
B -> GHY: 136 mins, A: 106 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β GHY with a total flying time of 370 minutes.
#### 370
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 133 mins, B: 131 mins
A -> GHY: 187 mins, B: 98 mins
B -> GHY: 60 mins, A: 76 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β GHY with a total flying time of 291 minutes.
#### 291
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 122 mins, B: 150 mins
A -> GHY: 51 mins, B: 161 mins
B -> GHY: 166 mins, A: 121 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 322 minutes.
#### 322
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 174 mins, B: 178 mins
A -> GHY: 77 mins, B: 61 mins
B -> GHY: 151 mins, A: 119 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 374 minutes.
#### 374
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 148 mins, B: 169 mins
A -> GHY: 150 mins, B: 40 mins
B -> GHY: 137 mins, A: 123 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β GHY with a total flying time of 325 minutes.
#### 325
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 132 mins, B: 189 mins
A -> GHY: 116 mins, B: 53 mins
B -> GHY: 168 mins, A: 81 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β GHY with a total flying time of 353 minutes.
#### 353
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 105 mins, B: 178 mins
A -> GHY: 47 mins, B: 148 mins
B -> GHY: 54 mins, A: 68 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 293 minutes.
#### 293
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 53 mins, B: 58 mins
A -> GHY: 186 mins, B: 80 mins
B -> GHY: 189 mins, A: 164 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β GHY with a total flying time of 322 minutes.
#### 322
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 44 mins, B: 74 mins
A -> GHY: 180 mins, B: 119 mins
B -> GHY: 66 mins, A: 177 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β GHY with a total flying time of 229 minutes.
#### 229
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 63 mins, B: 125 mins
A -> GHY: 92 mins, B: 154 mins
B -> GHY: 191 mins, A: 117 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 334 minutes.
#### 334
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 152 mins, B: 193 mins
A -> GHY: 155 mins, B: 76 mins
B -> GHY: 82 mins, A: 129 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β GHY with a total flying time of 310 minutes.
#### 310
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 184 mins, B: 51 mins
A -> GHY: 104 mins, B: 134 mins
B -> GHY: 73 mins, A: 69 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 224 minutes.
#### 224
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 146 mins, B: 177 mins
A -> GHY: 81 mins, B: 106 mins
B -> GHY: 97 mins, A: 89 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 347 minutes.
#### 347
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 73 mins, B: 79 mins
A -> GHY: 173 mins, B: 120 mins
B -> GHY: 102 mins, A: 146 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β GHY with a total flying time of 295 minutes.
#### 295
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 156 mins, B: 133 mins
A -> GHY: 54 mins, B: 160 mins
B -> GHY: 181 mins, A: 163 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 350 minutes.
#### 350
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 71 mins, B: 45 mins
A -> GHY: 166 mins, B: 161 mins
B -> GHY: 76 mins, A: 101 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β GHY with a total flying time of 308 minutes.
#### 308
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 85 mins, B: 95 mins
A -> GHY: 173 mins, B: 85 mins
B -> GHY: 40 mins, A: 186 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β GHY with a total flying time of 210 minutes.
#### 210
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 64 mins, B: 130 mins
A -> GHY: 87 mins, B: 158 mins
B -> GHY: 62 mins, A: 180 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β GHY with a total flying time of 284 minutes.
#### 284
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 82 mins, B: 82 mins
A -> GHY: 121 mins, B: 162 mins
B -> GHY: 133 mins, A: 109 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 312 minutes.
#### 312
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 173 mins, B: 82 mins
A -> GHY: 103 mins, B: 83 mins
B -> GHY: 100 mins, A: 62 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 247 minutes.
#### 247
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 112 mins, B: 97 mins
A -> GHY: 108 mins, B: 178 mins
B -> GHY: 63 mins, A: 156 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β GHY with a total flying time of 353 minutes.
#### 353
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 128 mins, B: 57 mins
A -> GHY: 146 mins, B: 151 mins
B -> GHY: 189 mins, A: 100 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 303 minutes.
#### 303
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 63 mins, B: 68 mins
A -> GHY: 140 mins, B: 190 mins
B -> GHY: 83 mins, A: 189 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β GHY with a total flying time of 336 minutes.
#### 336
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 101 mins, B: 46 mins
A -> GHY: 154 mins, B: 139 mins
B -> GHY: 66 mins, A: 123 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β GHY with a total flying time of 306 minutes.
#### 306
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 78 mins, B: 137 mins
A -> GHY: 122 mins, B: 83 mins
B -> GHY: 76 mins, A: 103 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β GHY with a total flying time of 237 minutes.
#### 237
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 182 mins, B: 89 mins
A -> GHY: 169 mins, B: 49 mins
B -> GHY: 122 mins, A: 68 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 326 minutes.
#### 326
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 109 mins, B: 78 mins
A -> GHY: 163 mins, B: 176 mins
B -> GHY: 166 mins, A: 59 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 300 minutes.
#### 300
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 161 mins, B: 187 mins
A -> GHY: 40 mins, B: 86 mins
B -> GHY: 190 mins, A: 145 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 372 minutes.
#### 372
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 192 mins, B: 53 mins
A -> GHY: 129 mins, B: 57 mins
B -> GHY: 192 mins, A: 142 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 324 minutes.
#### 324
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 147 mins, B: 75 mins
A -> GHY: 156 mins, B: 170 mins
B -> GHY: 182 mins, A: 75 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 306 minutes.
#### 306
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 68 mins, B: 59 mins
A -> GHY: 52 mins, B: 92 mins
B -> GHY: 167 mins, A: 157 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β GHY with a total flying time of 268 minutes.
#### 268
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 57 mins, B: 108 mins
A -> GHY: 107 mins, B: 83 mins
B -> GHY: 124 mins, A: 196 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β GHY with a total flying time of 264 minutes.
#### 264
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 187 mins, B: 86 mins, C: 75 mins
A -> GHY: 65 mins, B: 90 mins, C: 192 mins
B -> GHY: 60 mins, A: 182 mins, C: 122 mins
C -> GHY: 146 mins, A: 69 mins, B: 175 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β C β A β B β GHY with a total flying time of 294 minutes.
#### 294
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 58 mins, B: 145 mins, C: 139 mins
A -> GHY: 184 mins, B: 199 mins, C: 75 mins
B -> GHY: 78 mins, A: 115 mins, C: 69 mins
C -> GHY: 56 mins, A: 176 mins, B: 192 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β C β GHY with a total flying time of 382 minutes.
#### 382
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 157 mins, B: 181 mins, C: 54 mins
A -> GHY: 199 mins, B: 168 mins, C: 177 mins
B -> GHY: 67 mins, A: 92 mins, C: 192 mins
C -> GHY: 169 mins, A: 176 mins, B: 104 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β C β B β A β GHY with a total flying time of 449 minutes.
#### 449
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 44 mins, B: 158 mins, C: 182 mins
A -> GHY: 160 mins, B: 64 mins, C: 115 mins
B -> GHY: 117 mins, A: 123 mins, C: 193 mins
C -> GHY: 188 mins, A: 184 mins, B: 139 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β C β B β GHY with a total flying time of 415 minutes.
#### 415
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 66 mins, B: 53 mins, C: 196 mins
A -> GHY: 171 mins, B: 89 mins, C: 49 mins
B -> GHY: 160 mins, A: 178 mins, C: 116 mins
C -> GHY: 171 mins, A: 140 mins, B: 117 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β C β B β GHY with a total flying time of 392 minutes.
#### 392
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 109 mins, B: 77 mins, C: 56 mins
A -> GHY: 136 mins, B: 104 mins, C: 70 mins
B -> GHY: 57 mins, A: 88 mins, C: 175 mins
C -> GHY: 80 mins, A: 136 mins, B: 132 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β C β GHY with a total flying time of 315 minutes.
#### 315
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 162 mins, B: 95 mins, C: 54 mins
A -> GHY: 101 mins, B: 41 mins, C: 186 mins
B -> GHY: 114 mins, A: 127 mins, C: 151 mins
C -> GHY: 179 mins, A: 160 mins, B: 64 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β C β B β A β GHY with a total flying time of 346 minutes.
#### 346
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 81 mins, B: 111 mins, C: 126 mins
A -> GHY: 52 mins, B: 178 mins, C: 49 mins
B -> GHY: 56 mins, A: 128 mins, C: 177 mins
C -> GHY: 196 mins, A: 151 mins, B: 87 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β C β B β GHY with a total flying time of 273 minutes.
#### 273
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 45 mins, B: 90 mins, C: 111 mins
A -> GHY: 82 mins, B: 50 mins, C: 146 mins
B -> GHY: 84 mins, A: 55 mins, C: 166 mins
C -> GHY: 76 mins, A: 110 mins, B: 144 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β C β GHY with a total flying time of 337 minutes.
#### 337
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 120 mins, B: 95 mins, C: 186 mins
A -> GHY: 82 mins, B: 71 mins, C: 143 mins
B -> GHY: 199 mins, A: 68 mins, C: 80 mins
C -> GHY: 168 mins, A: 178 mins, B: 148 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β C β A β GHY with a total flying time of 435 minutes.
#### 435
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 126 mins, B: 137 mins, C: 60 mins
A -> GHY: 128 mins, B: 199 mins, C: 110 mins
B -> GHY: 91 mins, A: 114 mins, C: 128 mins
C -> GHY: 88 mins, A: 190 mins, B: 84 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β C β B β A β GHY with a total flying time of 386 minutes.
#### 386
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 124 mins, B: 137 mins, C: 144 mins
A -> GHY: 51 mins, B: 97 mins, C: 157 mins
B -> GHY: 176 mins, A: 112 mins, C: 168 mins
C -> GHY: 183 mins, A: 95 mins, B: 190 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β C β A β GHY with a total flying time of 451 minutes.
#### 451
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 173 mins, B: 128 mins, C: 122 mins
A -> GHY: 138 mins, B: 127 mins, C: 78 mins
B -> GHY: 196 mins, A: 133 mins, C: 176 mins
C -> GHY: 169 mins, A: 169 mins, B: 113 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β C β B β A β GHY with a total flying time of 506 minutes.
#### 506
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 72 mins, B: 180 mins, C: 103 mins
A -> GHY: 121 mins, B: 137 mins, C: 68 mins
B -> GHY: 61 mins, A: 51 mins, C: 80 mins
C -> GHY: 122 mins, A: 138 mins, B: 142 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β C β B β GHY with a total flying time of 343 minutes.
#### 343
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 98 mins, B: 46 mins, C: 94 mins
A -> GHY: 189 mins, B: 159 mins, C: 109 mins
B -> GHY: 150 mins, A: 189 mins, C: 81 mins
C -> GHY: 197 mins, A: 132 mins, B: 109 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β C β A β GHY with a total flying time of 448 minutes.
#### 448
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 111 mins, B: 126 mins, C: 149 mins
A -> GHY: 182 mins, B: 198 mins, C: 118 mins
B -> GHY: 48 mins, A: 92 mins, C: 150 mins
C -> GHY: 190 mins, A: 130 mins, B: 71 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β C β B β GHY with a total flying time of 348 minutes.
#### 348
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 89 mins, B: 51 mins, C: 44 mins
A -> GHY: 177 mins, B: 197 mins, C: 197 mins
B -> GHY: 111 mins, A: 125 mins, C: 180 mins
C -> GHY: 160 mins, A: 167 mins, B: 106 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β C β B β A β GHY with a total flying time of 452 minutes.
#### 452
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 134 mins, B: 53 mins, C: 103 mins
A -> GHY: 132 mins, B: 98 mins, C: 41 mins
B -> GHY: 89 mins, A: 91 mins, C: 50 mins
C -> GHY: 113 mins, A: 123 mins, B: 153 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β C β GHY with a total flying time of 298 minutes.
#### 298
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 157 mins, B: 48 mins, C: 73 mins
A -> GHY: 190 mins, B: 145 mins, C: 124 mins
B -> GHY: 124 mins, A: 111 mins, C: 115 mins
C -> GHY: 88 mins, A: 112 mins, B: 94 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β C β GHY with a total flying time of 371 minutes.
#### 371
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 90 mins, B: 76 mins, C: 47 mins
A -> GHY: 180 mins, B: 136 mins, C: 151 mins
B -> GHY: 132 mins, A: 178 mins, C: 71 mins
C -> GHY: 180 mins, A: 87 mins, B: 69 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β C β A β B β GHY with a total flying time of 402 minutes.
#### 402
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 46 mins, B: 185 mins, C: 133 mins
A -> GHY: 69 mins, B: 122 mins, C: 64 mins
B -> GHY: 88 mins, A: 181 mins, C: 52 mins
C -> GHY: 147 mins, A: 188 mins, B: 109 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β C β B β GHY with a total flying time of 307 minutes.
#### 307
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 160 mins, B: 80 mins, C: 139 mins
A -> GHY: 196 mins, B: 106 mins, C: 143 mins
B -> GHY: 54 mins, A: 126 mins, C: 100 mins
C -> GHY: 125 mins, A: 48 mins, B: 198 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β C β A β B β GHY with a total flying time of 347 minutes.
#### 347
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 95 mins, B: 183 mins, C: 111 mins
A -> GHY: 132 mins, B: 43 mins, C: 102 mins
B -> GHY: 61 mins, A: 156 mins, C: 119 mins
C -> GHY: 96 mins, A: 91 mins, B: 62 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β C β A β B β GHY with a total flying time of 306 minutes.
#### 306
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 176 mins, B: 184 mins, C: 189 mins
A -> GHY: 166 mins, B: 75 mins, C: 88 mins
B -> GHY: 138 mins, A: 48 mins, C: 78 mins
C -> GHY: 148 mins, A: 138 mins, B: 88 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β C β GHY with a total flying time of 468 minutes.
#### 468
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 155 mins, B: 155 mins, C: 192 mins
A -> GHY: 171 mins, B: 134 mins, C: 170 mins
B -> GHY: 122 mins, A: 148 mins, C: 133 mins
C -> GHY: 132 mins, A: 136 mins, B: 117 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β C β GHY with a total flying time of 554 minutes.
#### 554
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 82 mins, B: 69 mins, C: 177 mins
A -> GHY: 163 mins, B: 85 mins, C: 89 mins
B -> GHY: 147 mins, A: 61 mins, C: 45 mins
C -> GHY: 59 mins, A: 66 mins, B: 128 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β C β GHY with a total flying time of 271 minutes.
#### 271
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 115 mins, B: 53 mins, C: 98 mins
A -> GHY: 96 mins, B: 106 mins, C: 59 mins
B -> GHY: 149 mins, A: 155 mins, C: 197 mins
C -> GHY: 127 mins, A: 179 mins, B: 85 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β C β GHY with a total flying time of 394 minutes.
#### 394
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 184 mins, B: 136 mins, C: 78 mins
A -> GHY: 43 mins, B: 50 mins, C: 61 mins
B -> GHY: 143 mins, A: 127 mins, C: 151 mins
C -> GHY: 73 mins, A: 170 mins, B: 43 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β C β B β A β GHY with a total flying time of 291 minutes.
#### 291
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 109 mins, B: 162 mins, C: 93 mins
A -> GHY: 52 mins, B: 154 mins, C: 51 mins
B -> GHY: 106 mins, A: 90 mins, C: 85 mins
C -> GHY: 47 mins, A: 75 mins, B: 87 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β C β B β A β GHY with a total flying time of 322 minutes.
#### 322
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 52 mins, B: 159 mins, C: 189 mins
A -> GHY: 128 mins, B: 71 mins, C: 93 mins
B -> GHY: 49 mins, A: 186 mins, C: 187 mins
C -> GHY: 67 mins, A: 100 mins, B: 163 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β C β B β GHY with a total flying time of 357 minutes.
#### 357
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 176 mins, B: 83 mins, C: 93 mins
A -> GHY: 61 mins, B: 101 mins, C: 53 mins
B -> GHY: 72 mins, A: 87 mins, C: 109 mins
C -> GHY: 58 mins, A: 185 mins, B: 182 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β C β GHY with a total flying time of 281 minutes.
#### 281
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 108 mins, B: 67 mins, C: 173 mins
A -> GHY: 89 mins, B: 167 mins, C: 49 mins
B -> GHY: 106 mins, A: 198 mins, C: 159 mins
C -> GHY: 51 mins, A: 100 mins, B: 112 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β C β GHY with a total flying time of 365 minutes.
#### 365
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 107 mins, B: 52 mins, C: 92 mins
A -> GHY: 164 mins, B: 188 mins, C: 134 mins
B -> GHY: 195 mins, A: 189 mins, C: 58 mins
C -> GHY: 77 mins, A: 144 mins, B: 143 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β C β A β GHY with a total flying time of 418 minutes.
#### 418
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 51 mins, B: 177 mins, C: 136 mins
A -> GHY: 164 mins, B: 196 mins, C: 94 mins
B -> GHY: 190 mins, A: 66 mins, C: 132 mins
C -> GHY: 91 mins, A: 128 mins, B: 123 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β C β GHY with a total flying time of 428 minutes.
#### 428
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 179 mins, B: 105 mins, C: 190 mins
A -> GHY: 52 mins, B: 88 mins, C: 161 mins
B -> GHY: 58 mins, A: 60 mins, C: 152 mins
C -> GHY: 58 mins, A: 185 mins, B: 182 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β C β GHY with a total flying time of 384 minutes.
#### 384
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 152 mins, B: 131 mins, C: 161 mins
A -> GHY: 120 mins, B: 68 mins, C: 78 mins
B -> GHY: 45 mins, A: 46 mins, C: 70 mins
C -> GHY: 88 mins, A: 101 mins, B: 141 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β C β GHY with a total flying time of 343 minutes.
#### 343
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 199 mins, B: 45 mins, C: 97 mins
A -> GHY: 67 mins, B: 111 mins, C: 86 mins
B -> GHY: 50 mins, A: 154 mins, C: 123 mins
C -> GHY: 195 mins, A: 67 mins, B: 89 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β C β A β GHY with a total flying time of 302 minutes.
#### 302
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 192 mins, B: 122 mins, C: 96 mins
A -> GHY: 174 mins, B: 79 mins, C: 65 mins
B -> GHY: 105 mins, A: 115 mins, C: 120 mins
C -> GHY: 93 mins, A: 76 mins, B: 64 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β C β A β B β GHY with a total flying time of 356 minutes.
#### 356
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 118 mins, B: 174 mins, C: 96 mins
A -> GHY: 130 mins, B: 187 mins, C: 178 mins
B -> GHY: 72 mins, A: 69 mins, C: 104 mins
C -> GHY: 190 mins, A: 185 mins, B: 107 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β C β B β A β GHY with a total flying time of 402 minutes.
#### 402
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 78 mins, B: 121 mins, C: 157 mins
A -> GHY: 181 mins, B: 42 mins, C: 174 mins
B -> GHY: 145 mins, A: 118 mins, C: 184 mins
C -> GHY: 61 mins, A: 150 mins, B: 115 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β C β GHY with a total flying time of 365 minutes.
#### 365
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 146 mins, B: 99 mins, C: 172 mins
A -> GHY: 92 mins, B: 50 mins, C: 45 mins
B -> GHY: 124 mins, A: 62 mins, C: 121 mins
C -> GHY: 166 mins, A: 162 mins, B: 132 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β C β GHY with a total flying time of 372 minutes.
#### 372
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 165 mins, B: 157 mins, C: 63 mins
A -> GHY: 169 mins, B: 198 mins, C: 61 mins
B -> GHY: 61 mins, A: 104 mins, C: 192 mins
C -> GHY: 147 mins, A: 128 mins, B: 191 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β C β A β B β GHY with a total flying time of 450 minutes.
#### 450
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 108 mins, B: 130 mins, C: 47 mins
A -> GHY: 156 mins, B: 49 mins, C: 159 mins
B -> GHY: 47 mins, A: 178 mins, C: 107 mins
C -> GHY: 55 mins, A: 126 mins, B: 187 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β C β A β B β GHY with a total flying time of 269 minutes.
#### 269
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 126 mins, B: 158 mins, C: 159 mins
A -> GHY: 144 mins, B: 181 mins, C: 152 mins
B -> GHY: 42 mins, A: 191 mins, C: 54 mins
C -> GHY: 56 mins, A: 176 mins, B: 160 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β C β GHY with a total flying time of 417 minutes.
#### 417
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 80 mins, B: 79 mins, C: 74 mins
A -> GHY: 190 mins, B: 107 mins, C: 188 mins
B -> GHY: 89 mins, A: 93 mins, C: 102 mins
C -> GHY: 166 mins, A: 132 mins, B: 173 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β C β A β B β GHY with a total flying time of 402 minutes.
#### 402
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 139 mins, B: 134 mins, C: 176 mins
A -> GHY: 106 mins, B: 195 mins, C: 79 mins
B -> GHY: 73 mins, A: 113 mins, C: 74 mins
C -> GHY: 149 mins, A: 111 mins, B: 61 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β C β B β GHY with a total flying time of 352 minutes.
#### 352
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 81 mins, B: 77 mins, C: 89 mins
A -> GHY: 133 mins, B: 55 mins, C: 182 mins
B -> GHY: 106 mins, A: 193 mins, C: 90 mins
C -> GHY: 116 mins, A: 131 mins, B: 89 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β C β GHY with a total flying time of 342 minutes.
#### 342
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 139 mins, B: 127 mins, C: 93 mins
A -> GHY: 56 mins, B: 80 mins, C: 180 mins
B -> GHY: 110 mins, A: 91 mins, C: 68 mins
C -> GHY: 132 mins, A: 199 mins, B: 183 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β A β B β C β GHY with a total flying time of 419 minutes.
#### 419
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 189 mins, B: 86 mins, C: 152 mins
A -> GHY: 154 mins, B: 186 mins, C: 182 mins
B -> GHY: 129 mins, A: 69 mins, C: 178 mins
C -> GHY: 118 mins, A: 122 mins, B: 191 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β C β GHY with a total flying time of 455 minutes.
#### 455
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 143 mins, B: 127 mins, C: 44 mins
A -> GHY: 173 mins, B: 168 mins, C: 57 mins
B -> GHY: 163 mins, A: 91 mins, C: 151 mins
C -> GHY: 70 mins, A: 134 mins, B: 51 mins
Find the most optimal tour.
|
The most optimal tour is: GHY β B β A β C β GHY with a total flying time of 345 minutes.
#### 345
|
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 7