diff options
| author | JonZhao <[email protected]> | 2019-06-05 15:45:16 +0800 |
|---|---|---|
| committer | JonZhao <[email protected]> | 2019-06-05 15:45:16 +0800 |
| commit | 332f13fefb21cf47361562db42bac73ef608ec0d (patch) | |
| tree | 1514b1540179818351aa9aff187931d0a6ee68ad /multiple_ant_colony_system.py | |
| parent | 2ccd546062ac96fdf9e1e9229d8ec3df5997e928 (diff) | |
| download | VRPTW-ACO-python-332f13fefb21cf47361562db42bac73ef608ec0d.tar.gz VRPTW-ACO-python-332f13fefb21cf47361562db42bac73ef608ec0d.tar.bz2 VRPTW-ACO-python-332f13fefb21cf47361562db42bac73ef608ec0d.zip | |
use limited vehicle num to initiate path in acs-vei
Diffstat (limited to 'multiple_ant_colony_system.py')
| -rw-r--r-- | multiple_ant_colony_system.py | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/multiple_ant_colony_system.py b/multiple_ant_colony_system.py index 6dced28..751a441 100644 --- a/multiple_ant_colony_system.py +++ b/multiple_ant_colony_system.py @@ -233,7 +233,7 @@ class MultipleAntColonySystem: global_best_distance = None # 使用nearest_neighbor_heuristic算法初始化path 和distance - current_path, current_path_distance, _ = new_graph.nearest_neighbor_heuristic() + current_path, current_path_distance, _ = new_graph.nearest_neighbor_heuristic(max_vehicle_num=vehicle_num) # 找出当前path中未访问的结点 current_index_to_visit = list(range(new_graph.node_num)) @@ -373,7 +373,7 @@ class MultipleAntColonySystem: while acs_vehicle_thread.is_alive() and acs_time_thread.is_alive(): # 如果在指定时间内没有搜索到更好的结果，则退出程序 - given_time = 5 + given_time = 10 if time.time() - start_time_found_improved_solution > 60 * given_time: stop_event.set() self.print_and_write_in_file(file_to_write, '*' * 50) |