better timing
This commit is contained in:
		| @@ -195,7 +195,7 @@ class Optimizer: | ||||
|             for j, spot2 in enumerate(landmarks) : | ||||
|                 t = get_time(spot1.location, spot2.location) + spot1.duration | ||||
|                 dist_table[j] = t | ||||
|             closest = sorted(dist_table)[:20] | ||||
|             closest = sorted(dist_table)[:25] | ||||
|             for i, dist in enumerate(dist_table) : | ||||
|                 if dist not in closest : | ||||
|                     dist_table[i] = 32700 | ||||
|   | ||||
| @@ -214,7 +214,7 @@ class Refiner : | ||||
|             if self.is_in_area(area, landmark.location) and landmark.name not in visited_names: | ||||
|                 second_order_landmarks.append(landmark) | ||||
|  | ||||
|         return take_most_important.take_most_important(second_order_landmarks, len(visited_landmarks)) | ||||
|         return take_most_important.take_most_important(second_order_landmarks, int(self.max_landmarks_refiner*0.75)) | ||||
|  | ||||
|  | ||||
|     # Try fix the shortest path using shapely | ||||
|   | ||||
		Reference in New Issue
	
	Block a user