q3part b

 import java.util.Random;


public class TSPMutation {

    public static void main(String[] args) {
        // Example cities (0, 1, 2, 3, 4)
        int[] chromosome = {0, 1, 2, 3, 4}; // A possible solution (tour)
       
        System.out.println("Original Chromosome:");
        printChromosome(chromosome);
       
        // Apply Mutation (Swap two cities in the path)
        mutate(chromosome);
       
        System.out.println("Mutated Chromosome:");
        printChromosome(chromosome);
    }

    // Mutation function: Swap two cities' positions
    public static void mutate(int[] chromosome) {
        Random rand = new Random();
       
        // Randomly pick two distinct indices in the chromosome
        int index1 = rand.nextInt(chromosome.length);
        int index2 = rand.nextInt(chromosome.length);
       
        // Ensure that the two indices are different
        while (index1 == index2) {
            index2 = rand.nextInt(chromosome.length);
        }
       
        // Swap the cities at the two indices
        int temp = chromosome[index1];
        chromosome[index1] = chromosome[index2];
        chromosome[index2] = temp;
    }

    // Helper function to print the chromosome (tour)
    public static void printChromosome(int[] chromosome) {
        for (int city : chromosome) {
            System.out.print(city + " ");
        }
        System.out.println();
    }
}

Comments

Post a Comment

Popular posts from this blog

Literal table

 #code import java.util.*; class Literal {     String value;     int address;     public Literal(String value) {         this.value = value;         this.address = -1; // not assigned yet     } } public class Ass2{     // Check if a literal already exists in the list     public static boolean literalExists(List<Literal> list, String value) {         for (Literal l : list) {             if (l.value.equals(value)) return true;         }         return false;     }     public static void main(String[] args) {         Scanner scanner = new Scanner(System.in);         List<String> code = new ArrayList<>();         List<Literal> literalTable = new ArrayList<>();         Lis...
Read more

quicksort 1

 import java.util.Random; public class QuicksortExample {     public static void main(String[] args) {         int N = 500; // Number of elements to sort         // Initialize an array of random integers         int[] arr = new int[N];         Random rand = new Random();         for (int i = 0; i < N; i++) {             arr[i] = rand.nextInt(1000); // Random integers between 0 and 999         }         // Displaying the unsorted array (optional)         System.out.println("Unsorted array:");         printArray(arr);         // Start measuring time         long startTime = System.nanoTime();         // Call the quicksort method         quicksort(arr, 0, N - 1);       ...
Read more