Question
a) Consider the following travelling salesman problem involving 9 cities
| Parent 1 | G | J | H | F | E | D | B | I | C |
| Parent 2 | D | C | H | J | I | G | E | F | B |
Determine the children solution using.
i) Order crossover #1, assuming and
sites as the crossover sites
ii) Order crossover #2, assuming
and
as the key positions.
Answer :
Word Count : 516
Let's solve the given Traveling Salesman Problem (TSP) crossover operations numerically. We are given two parent solutions: Parent 1: G → J → H → F → E → D → B → I → C Parent 2: D → C → H → J → I → G → E → F → B We will perform two types of Order Crossover (OX1 and OX2). --- ### (i) Order Crossover #1 (OX1) - Crossover sites: 4th and 7th positions - The 4th to 7th segment from Parent 1 will be copied directly into the offspring. #### Step 1: Copy the segment from Parent 1 From Parent 1, the segment between 4th to 7th positions is: F → E → D → B #### Step 2: Fill in the _______ _______ ___ ________ ______ ______ ______ ______ ___ __________ __________ _________.
______ _________ _______ ________ __________ _____.
________ ________ ____ _________ _________.
____ ___ _______ __________ _____.
___ ________ __________ _______ ___.
_________ _______ __________ _________ ______ ______ ________ ______ ___ _____.
_____ ____ ____ ___ ________ ________ ___ _______ ______ _______.
_____ ________ _________ _______ __________ _______ ___ _____ ____.
______ ___ ________ ________ _____ ______ ____ ______ _________.
________ ____ _______ ________ ________ __________ _______ _____ ____.
_______ _____ ___ __________ _________ _______ ______ ________ ___ ___ _________.
___ _______ __________ _______ _____.
_________ ______ ____ _______ ____ __________ ________.
______ ______ _____ ______ _____ ________ _________ _____ ___ ____.
_____ _______ _______ ___ _______ _________ ______.
________ ______ _____ ___ _______ ____ ______.
____ __________ ______ _______ _________ ___ ___ ______ __________ _________.
________ _______ ________ ___ _____ ______.
______ _____ _______ _________ _______ _________ _________ ____ __________ _____ _________ ___.
__________ ______ ________ ____ ___ ________.
________ ______ ______ __________ _______ ______ __________.
______ _________ _________ __________ _________ ________ ___ ________ _______ __________ ______ ___.
______ __________ ______ ________ _____ _____ _________ _____.
_____ ____ ___ ______ _____ ___.
_____ __________ _____ _________ ___ ____ _________ ______ ______.
_________ ______ _____ ___ ________ __________ ___.
______ ____ _________ ________ ___ ____ ___.
_______ _____ ________ _____ _____ _____.
__________ __________ _________ _________ __________ _______ _________ _________.
____ ____ ________ __________ _________ __________ ___ _________.
________ _________ _________ __________ _________ __________ _______.
__________ _________ _____ _________ ____ ________ ________ _________.
_________ ____ _______ __________ _______ __________ ________.
________ ________ _____ ____ ___ ____.
____ ________ __________ ____ _________ _____ ________ _____ __________ ________ __________.
____ ________ ___ ______ _________ ______ _______ _______ ______ ___.
____ _______ ___ ______ ______ _________.
_____ _________ _________ __________ _______ ___ __________ ____ ______ ____ _________ _______.
_________ _________ __________ ______ _____ ___ _______ _______ ________.
________ _________ ___ _________ _____ ________ ____ __________ _________ ____.
_____ _____ _________ __________ _____.
__________ ___ __________ ___ _________ ________ ________ ___ _________ _________ ______ _________.
_____ ____ _________ ________ ___ __________ ______ ____.
________ _____ _____ ___ ____ _______.
_________ __________ ______ ____ ____ _______ _______ ________ ____ _______ _________.
__________ ______ _____ _______ ____ ________.
____ ________ ______ _____ ______ ______ _______ ___ __________ _______ _____ _________.
_________ _______.
Get Full Answer on WhatsApp
Let's solve the given Traveling Salesman Problem (TSP) crossover operations numerically. We are given two parent solutions: Parent 1: G → J → H → F → E → D → B → I → C Parent 2: D → C → H → J → I → G → E → F → B We will perform two types of Order Crossover (OX1 and OX2). --- ### (i) Order Crossover #1 (OX1) - Crossover sites: 4th and 7th positions - The 4th to 7th segment from Parent 1 will be copied directly into the offspring. #### Step 1: Copy the segment from Parent 1 From Parent 1, the segment between 4th to 7th positions is: F → E → D → B #### Step 2: Fill in the _______ _______ ___ ________ ______ ______ ______ ______ ___ __________ __________ _________.
______ _________ _______ ________ __________ _____.
________ ________ ____ _________ _________.
____ ___ _______ __________ _____.
___ ________ __________ _______ ___.
_________ _______ __________ _________ ______ ______ ________ ______ ___ _____.
_____ ____ ____ ___ ________ ________ ___ _______ ______ _______.
_____ ________ _________ _______ __________ _______ ___ _____ ____.
______ ___ ________ ________ _____ ______ ____ ______ _________.
________ ____ _______ ________ ________ __________ _______ _____ ____.
_______ _____ ___ __________ _________ _______ ______ ________ ___ ___ _________.
___ _______ __________ _______ _____.
_________ ______ ____ _______ ____ __________ ________.
______ ______ _____ ______ _____ ________ _________ _____ ___ ____.
_____ _______ _______ ___ _______ _________ ______.
________ ______ _____ ___ _______ ____ ______.
____ __________ ______ _______ _________ ___ ___ ______ __________ _________.
________ _______ ________ ___ _____ ______.
______ _____ _______ _________ _______ _________ _________ ____ __________ _____ _________ ___.
__________ ______ ________ ____ ___ ________.
________ ______ ______ __________ _______ ______ __________.
______ _________ _________ __________ _________ ________ ___ ________ _______ __________ ______ ___.
______ __________ ______ ________ _____ _____ _________ _____.
_____ ____ ___ ______ _____ ___.
_____ __________ _____ _________ ___ ____ _________ ______ ______.
_________ ______ _____ ___ ________ __________ ___.
______ ____ _________ ________ ___ ____ ___.
_______ _____ ________ _____ _____ _____.
__________ __________ _________ _________ __________ _______ _________ _________.
____ ____ ________ __________ _________ __________ ___ _________.
________ _________ _________ __________ _________ __________ _______.
__________ _________ _____ _________ ____ ________ ________ _________.
_________ ____ _______ __________ _______ __________ ________.
________ ________ _____ ____ ___ ____.
____ ________ __________ ____ _________ _____ ________ _____ __________ ________ __________.
____ ________ ___ ______ _________ ______ _______ _______ ______ ___.
____ _______ ___ ______ ______ _________.
_____ _________ _________ __________ _______ ___ __________ ____ ______ ____ _________ _______.
_________ _________ __________ ______ _____ ___ _______ _______ ________.
________ _________ ___ _________ _____ ________ ____ __________ _________ ____.
_____ _____ _________ __________ _____.
__________ ___ __________ ___ _________ ________ ________ ___ _________ _________ ______ _________.
_____ ____ _________ ________ ___ __________ ______ ____.
________ _____ _____ ___ ____ _______.
_________ __________ ______ ____ ____ _______ _______ ________ ____ _______ _________.
__________ ______ _____ _______ ____ ________.
____ ________ ______ _____ ______ ______ _______ ___ __________ _______ _____ _________.
_________ _______.
Get Full Answer on WhatsApp
IGNOU NEWS
Assignment Submission Last Date Extended Till 30 June 2026 Click Here★★★IGNOU June 2026 TEE Date Sheet Released Click Here★★★