配套

parent 7d27c0ff
...@@ -116,53 +116,53 @@ public class Chromosome { ...@@ -116,53 +116,53 @@ public class Chromosome {
private List<GlobalOperationInfo> globalOpList; private List<GlobalOperationInfo> globalOpList = new ArrayList<>();
private CopyOnWriteArrayList<Entry> allOperations; private CopyOnWriteArrayList<Entry> allOperations = new CopyOnWriteArrayList<>();
private CopyOnWriteArrayList<Order> orders; private CopyOnWriteArrayList<Order> orders = new CopyOnWriteArrayList<>();
private List<Machine> InitMachines; private List<Machine> InitMachines = new ArrayList<>();
private List<OrderMaterialRequirement> orderMaterials; private List<OrderMaterialRequirement> orderMaterials = new ArrayList<>();
private CopyOnWriteArrayList<GroupResult> OperatRel; private CopyOnWriteArrayList<GroupResult> OperatRel = new CopyOnWriteArrayList<>();
private ObjectiveWeights objectiveWeights; private ObjectiveWeights objectiveWeights;
private List<Material> materials; private List<Material> materials = new ArrayList<>();
private List<String> materialIds; private List<String> materialIds = new ArrayList<>();
/* /*
* 最早完工时间(最小化) 最小化总加工时间 最小总换型时间 * 最早完工时间(最小化) 最小化总加工时间 最小总换型时间
*/ */
private double[] Objectives ; // 多目标值:[Makespan, TotalFlowTime, TotalChangeover, LoadStd, Delay] private double[] Objectives = new double[0]; // 多目标值:[Makespan, TotalFlowTime, TotalChangeover, LoadStd, Delay]
private double[] MaxObjectives ; // private double[] MaxObjectives = new double[0]; //
private double[] MinObjectives ; // private double[] MinObjectives = new double[0]; //
private int Rank; // 非支配排序等级(1最优) private int Rank; // 非支配排序等级(1最优)
private double CrowdingDistance =0; // 拥挤距离 越小越优 private double CrowdingDistance =0; // 拥挤距离 越小越优
/* /*
*(Objectives - min) / (max - min); *(Objectives - min) / (max - min);
*/ */
private double[] WeightedObjectives;//越靠近1越优 private double[] WeightedObjectives = new double[0];//越靠近1越优
private double WeightedObjective =0; // 加权目标值(用于自定义权重) private double WeightedObjective =0; // 加权目标值(用于自定义权重)
/// <summary> /// <summary>
/// 适应度值 /// 适应度值
/// </summary> /// </summary>
private double[] fitnessLevel; private double[] fitnessLevel = new double[0];
/// <summary> /// <summary>
/// 适应度值 /// 适应度值
/// </summary> /// </summary>
private double Fitness; private double Fitness = 0.0;
/// <summary> /// <summary>
/// 机器 /// 机器
/// </summary> /// </summary>
private List<Machine> Machines; private List<Machine> Machines = new ArrayList<>();
/// <summary> /// <summary>
/// 解码后的调度结果 /// 解码后的调度结果
/// </summary> /// </summary>
private CopyOnWriteArrayList<GAScheduleResult> Result; private CopyOnWriteArrayList<GAScheduleResult> Result = new CopyOnWriteArrayList<>();
/// <summary> /// <summary>
/// 解码后的调度结果 /// 解码后的调度结果
...@@ -172,33 +172,33 @@ public class Chromosome { ...@@ -172,33 +172,33 @@ public class Chromosome {
/// <summary> /// <summary>
/// 最早完工时间 /// 最早完工时间
/// </summary> /// </summary>
private double Makespan; private double Makespan = 0.0;
/// <summary> /// <summary>
/// 总流程时间 /// 总流程时间
/// </summary> /// </summary>
private double TotalFlowTime; private double TotalFlowTime = 0.0;
/// <summary> /// <summary>
/// 总换型时间 /// 总换型时间
/// </summary> /// </summary>
private double TotalChangeoverTime; private double TotalChangeoverTime = 0.0;
/// <summary> /// <summary>
/// 机器负载标准差(越小越均衡) /// 机器负载标准差(越小越均衡)
/// </summary> /// </summary>
private double MachineLoadStd; private double MachineLoadStd = 0.0;
/// <summary> /// <summary>
/// 交付期延迟时间 /// 交付期延迟时间
/// </summary> /// </summary>
private double DelayTime; private double DelayTime = 0.0;
private double SemiJitSlack; private double SemiJitSlack;
private String ScenarioID; private String ScenarioID = "";
private String ScenarioName; private String ScenarioName = "";
private LocalDateTime BaseTime ; // 当前基准时间 private LocalDateTime BaseTime; // 当前基准时间
private List<Integer> reOrderids=new ArrayList<>(); private List<Integer> reOrderids=new ArrayList<>();
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment