{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

ass11_due042708_sol

# ass11_due042708_sol - sequence 123789(19 represents a...

This preview shows pages 1–2. Sign up to view the full content.

ISE310 Spring 2008 Session 25 04/28/08 Assignment 11 Solution Due 04/27/08 – Individual homework 1. Problem 10.4 (1 point) 2. Resolve problem 10.4 as a minisum location problem (1 point) 3. Get a good solution for one of the quiz problems from 4/21 using a genetic algorithm approach (2 points) You are to choose the arrangement of 6 departments, all of equal size and located in two adjacent rows of 3. The adjacency (having a common border, not just touching vertices) score is to be maximized, given the values below. A B C D E F A x 1 2 4 2 1 B x 3 2 4 6 C x 4 6 4 D x 1 3 E x 2 F x Select a string of random numbers between 1 and 2. 2 1 2 1 1 2 1 1 1 1 1 1 1 2 1 2 1 1 1 1 1 2 1 1 2 1 2 2 2 2 2 2 1 1 1 1 I will alternate between top and bottom row to create individuals and offspring. The

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: sequence 123789(19) represents a layout with ABC in the first row and DEF in the second row. Gen 1: 132789(24) 123879(16) 132789(24) Offspring: 132879(21) 132879(21) 132798(22) Gen 2: 132789(24) 132798(22) 132789(24) Offspring: 312789(18) 132978(18) 312789(18) The process terminated with 132789 and 24 It turns out that 321897 with 25 is the optimum. That is row 1:CBE, row 2:EFD ISE310 Spring 2008 Session 25 04/28/08 Assignment 11 Solution 4. Repeat 3. Do the same problem with any variation of Simulated annealing that you choose I am going to use the same generation scheme as above....
View Full Document

{[ snackBarMessage ]}

### Page1 / 2

ass11_due042708_sol - sequence 123789(19 represents a...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online