CEE 509/CS 572/ORIE 533 Prelim (Text Revised after test given)
October 30, 2007
Put your answers in your test book, show work and explain your reasoning. You enhance your
chances of getting full or partial credit by writing legibly, putting boxes around y

Prelim Exam Solutions 2010
1. (25 points) Hypothesis Testing
Assume you are implementing SA and GA to maximize an expensive cost function. You
run 10 trials of 200 iterations and the best solutions, the means and the standard deviations
are given below:
T

Prelim Exam Solutions 2010
1.
(25 points) Hypothesis Testing
Assume you are implementing SA and GA to maximize an expensive cost function. You
run 10 trials of 200 iterations and the best solutions, the means and the standard deviations
are given below:
T

CEE 5290/CS 5722/ORIE 5340 Heuristic Methods for Optimization
Learning Objectives for Prelim on October 25, 2011
1. Optimization and Heuristics: Definition of optimization problem, formulation, examples of
application of optimization; Impact of Convexity

1.
b) University of Disneyland is not dominated by anyone (because there exists criteria in which it
does better than all other schools) and also dominates Space Cadet Academy in every criteria and
thus dominates that school.
Bedlam College is not dominat

1.
A)
Cost for each state:
State1=(0,1) so cost=2(0-1)^2+0=2
State2=(1,1), cost=2(1-1)^2+1=1
State3=(0,0), cost=2(0-0)^2+0=0
State4=(1,0), cost=2(1-0)^2+1=3
Transition probabilities: f(Cost_i, Cost_j, T)=1/2exp(-Cost/T) for Cost_ij>0 since 1/N(Si)=1/2=pro

For our second method of crossover, we would implement an arithmetic operator, which
places a user-specified weight value on each parents contribution. Namely, if x
represents the child of parents x1 and x2, we would have for the child: x = w*x1 + (1w)*x2

CEE 5290/COM S 5722 Heuristic Methods for Optimization
Homework 6: Binary and Real Genetic Algorithm
Assigned: Friday, October 7, 2011
Due: Friday, October 14, 2011
TA office hours: Wed 10:00-11:00am, Thu: 3:00- 4:30pm in Hollister 203,
Prof. Shoemaker M(

1.
a) 1xxxx: Bits 1 to the crossover point come from parent 1. Therefore, we
only care about parent 1's selection in producing a child with 1xxxx. We also
want to select parents that have 1 in the most significant bit (the leftmost
bit), which would inclu

1i.
Boxplots of Data
500
450
400
350
Cos t
300
250
200
150
100
50
0
SA
GA
Algorithm
GS
Assuming we are trying to minimize cost, SA has the lowest mean while GA has
the highest mean. SA and GS have very similar variances, while GA has an
extremely high var

SOLUTIONS
CEE 509/CS 572/ORIE 533 Prelim
October 30, 2007
(Note these are the posted answers. However, there is a version of the exam was re worded
after the exam was taken (revised or rev in file name) that has better wording of the
questions.
Put your a