Class PositionBasedCrossover
java.lang.Object
org.uma.jmetal.operator.crossover.impl.PositionBasedCrossover
- All Implemented Interfaces:
Serializable,CrossoverOperator<PermutationSolution<Integer>>,Operator<List<PermutationSolution<Integer>>,List<PermutationSolution<Integer>>>
public class PositionBasedCrossover
extends Object
implements CrossoverOperator<PermutationSolution<Integer>>
Position-Based Crossover operator for permutation-based genetic algorithms. This operator selects
random positions to inherit genes from one parent. The remaining genes are filled from the other
parent in the order they appear, ensuring a valid permutation without duplicates.
- Author:
- Nicolás R. Uribe
- See Also:
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptiondoubleexecute(List<PermutationSolution<Integer>> solutions) intint
-
Constructor Details
-
PositionBasedCrossover
public PositionBasedCrossover(double probability)
-
-
Method Details
-
execute
- Specified by:
executein interfaceOperator<List<PermutationSolution<Integer>>,List<PermutationSolution<Integer>>> - Parameters:
solutions- The data to process
-
crossoverProbability
public double crossoverProbability()- Specified by:
crossoverProbabilityin interfaceCrossoverOperator<PermutationSolution<Integer>>
-
numberOfRequiredParents
public int numberOfRequiredParents()- Specified by:
numberOfRequiredParentsin interfaceCrossoverOperator<PermutationSolution<Integer>>
-
numberOfGeneratedChildren
public int numberOfGeneratedChildren()- Specified by:
numberOfGeneratedChildrenin interfaceCrossoverOperator<PermutationSolution<Integer>>
-