Sie sind auf Seite 1von 5

Running head: HUNGARIAN ALGORITHM 1

HUNHARIAN ALGORITHMS 2

Hungarian Algorithm for Selecting Athletics Team

The event selected is Worlds Strongest Man. The data for the chosen event is sourced from

the Worlds Strongest man Archive, where the top ten top participants in the 2015 Final event

held in Putrajaya, Malaysia has been used. The event had six disciplines (Super Yoke,

Deadlift, Truck Pull, Power Stairs, Log Press and Atlas Stones). The selected four disciplines

were as indicated below.

The best team for the event has the maximum combined score. Therefore, the

assignment is a maximization problem.

Part 2

The randomly selected team of four athletes 9Team A) from the top 10 overall

placings consists of the scores with the highest total points Brian Shaw(53), Zydrunas

Savickas (49.5), Hafpor Bjornsson (49) and Eddie Hall (45.5).

The individuals selected should have the highest scores in the various disciplines.

Hafpor - Super York (score =10), Brian Deadlift (score = 10), Brian Truck Pull (score =

10), Zydrunas Power Stairs (score = 10)


HUNHARIAN ALGORITHMS 3

Using the Hungarian Algorithm

The problem is first converted to a minimization problem by subtracting each element

from the largest element in the array, which is10.

Step 1: Cover the zeros with lines.

Since there are 5 lines, this is not the optimal solution. A 4 X 4 matrix should have 4 lines.

Step 2: Subtract the minimum element in every column

- The smallest element in all columns is zero, so cannot be reduced further.

Since there are only 4 lines, this is the optimal solution. Covering the zero elements

with the corresponding scores in the initial matrix yields the following.
HUNHARIAN ALGORITHMS 4

The optimum (maximum) assignment should give the maximum total score for the

event. The maximum score achieved in each discipline is 10. Therefore, the team will consist

of: Hafpor (super Yoke), Brian (Deadlift), Brian (Truck Pull), and Zydrunas (Power Stairs)

Compared to the prediction made in part 1, the outcome of the Hungarian Algorithm

gives more precise outcome. Both routes yield to the selection of the same team.

Part 3 (Selecting Team B)

The team of 4 is selected by considering the athletes in the various disciplines. The
following four are selected.

The problem is first converted to a minimization problem by subtracting each element


from the largest element in the array, which is7.

Step 1: Reduce the array in both rows and columns through subtraction

- To reduce the rows y subtraction, subtract the smallest element in each row by the row
elements
HUNHARIAN ALGORITHMS 5

- The smallest element in Mikes row is 0, so the row remains unchanged


- The smallest element in JFs row is 0.5, so subtract 0.5 from all elements in the row
- The smallest element in Dimitars row is 3, so subtract 3 from all row elements
- The smallest element in Jerrys row is 2.5, so subtract 2.5 from all row elements

Since the outcome of the process above has four lines as required for a 4 X 4 matrix,
it represents the optimal outcome. Replacing the zero elements with the corresponding scores
in the initial matrix yields the following.

Therefore, the team should consist of Dimitar (Super Yoke), Jerry (Deadlift), JF Caron
(truck Pull) and Mike (power Stairs). Team A is likely to win the competition since it consists
of players who have previously scored higher than Team B players.

PART 4 (Question 1)

(a) Selecting the team for an event with 3 disciplines with 3 athletes each

The number of ways of allocating 3 athletes is given by 3! (Read as 3 factorial) =


3*2*1 = 6

(b) Ways of allocating 4 athletes to 4 disciplines

Number of ways of allocating is given by: 4C4 (read as 4 combination 4) = 4!/(4-1)! =


(4*3*2*1)/(3*2*1) = 4 ways

(c) Ways of allocating n disciplines to n athletes

The number of ways in this case is given by permutations, where the outcome is nPn.

Where, nPn = P(n, n) = n!/(n-n)! = (n(n-1)(n-2)(n-3..2*1)/0!, where 0! = 1