初始话

src/main/java/com/aps/service/Algorithm/HybridAlgorithm.java

@@ -118,7 +118,7 @@ public class HybridAlgorithm {
         // 步骤1：使用构造启发式算法生成初始种群
         FileHelper.writeLogFile("构造启发式初始化-----------开始-------");
        // List<Chromosome> population = initialization.generateHeuristicInitialPopulation(param);
-         List<Chromosome> population = initialization.generateHybridInitialPopulation(param);
+        List<Chromosome> population = initialization.generateHybridInitialPopulation(param);
 
         FileHelper.writeLogFile("构造启发式初始化-----------结束-------");
 

src/main/java/com/aps/service/Algorithm/Initialization.java

@@ -344,9 +344,9 @@ public class Initialization {
     /**
      * 使用构造启发式算法生成初始种群
      */
-    public List<Chromosome> generateHeuristicInitialPopulation(ScheduleParams param) {
+    public List<Chromosome> generateHeuristicInitialPopulation(ScheduleParams param,int _PopulationSize) {
         List<Chromosome> population = new ArrayList<>();
-        int populationSize = param.getPopulationSize();
+        int populationSize = param.getPopulationSize()==0?_PopulationSize:param.getPopulationSize();
         this.baseTime=param.getBaseTime();
         // 按比例生成不同启发式规则的个体（优化：增加混合策略和瓶颈优先）
         int sptCount = (int) (populationSize * 0.15);
@@ -1116,7 +1116,7 @@ public class Initialization {
             subParam.setBaseTime(param.getBaseTime());
 
             List<Chromosome> heuristicPopulation =
-                    generateHeuristicInitialPopulation(subParam);
+                    generateHeuristicInitialPopulation(subParam,remaining);
             for (Chromosome chromo : heuristicPopulation) {
                 chromo.setOrders(new CopyOnWriteArrayList<>(orders));
             }