Package org.uma.evolver.example.base

Class NSGAIIBiObjectiveTSP

java.lang.Object

org.uma.evolver.example.base.NSGAIIBiObjectiveTSP

public class NSGAIIBiObjectiveTSP
extends Object

This class demonstrates the configuration and execution of the NSGA-II (Non-dominated Sorting Genetic Algorithm II) for solving bi-objective Traveling Salesman Problem (TSP) instances. It specifically uses the KroAB100 TSP instance as a benchmark problem, which involves finding optimal routes between 100 cities with two objectives: 1. Minimizing the total distance of the tour 2. Minimizing a second objective (specific to the KroAB100 instance)

The algorithm is configured with the following components by default:

• Population size: 100 solutions
• Maximum evaluations: 1,000,000
• Crossover: Cycle Crossover (CX) with probability 0.6848
• Mutation: Swap mutation with probability 0.0973
• Selection: Binary tournament selection

The results are output to two files:

• VAR.csv: Contains the variable values (permutation of cities)
• FUN.csv: Contains the objective function values

Author:

Antonio J. Nebro (ajnebro@uma.es)

See Also:

• PermutationNSGAII
• KroAB100TSP

Constructor Summary

Constructors

Constructor	Description
NSGAIIBiObjectiveTSP()

Method Summary

Modifier and Type	Method	Description
static void	main(String[] args)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

NSGAIIBiObjectiveTSP

public NSGAIIBiObjectiveTSP()

Method Details

main

public static void main(String[] args)
                 throws IOException

Throws:

IOException