1. Design and implement a GA to solve the following problem.

An airline intends to extend its air fleet by purchasing three types of aircrafts, denoted by I, II and III
respectively. The available budget is 5000 units. The three types have the following features:
I. costs 100 units, has a range of 6.000 km and the collision avoidance system range is 30 km;
II. costs 60 units, has a range of 4.200 km and the collision avoidance system range is 48 km;
III. costs 50 units, has a range of 2.800 km and the collision avoidance system range is 32 km;
Compute how many aircrafts from each type should be purchased such that
- the budget is not exceeded
- the mean flight range is maximized
- the mean of the collision avoidance system range is at least 40 km.

2. The N Greek city-states are fighting each other for domination but they decide to unite against an
external threat. They set up a defense meeting, where each city-state may send a representative. Given
the historic animosity among the city-states, use a GA to find out a suitable round-table arrangement
of the representatives, i.e. every two neighbors belong to non-conflicting states. The animosity map is
expressed by the N squared matrix CONFLICT, where
1, 𝑖𝑓 𝑖 𝑎𝑛𝑑 𝑗 𝑎𝑟𝑒 𝑖𝑛 𝑎 𝑠𝑡𝑎𝑡𝑒 𝑜𝑓 𝑐𝑜𝑛𝑓𝑙𝑖𝑐𝑡 (𝑖 ≠ 𝑗 )
𝐶𝑂𝑁𝐹𝐿𝐼𝐶𝑇(𝑖, 𝑗) = {
0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒

3. At the beginning of the academic year, a student has to choose his/her disciplines. The available budget
is 10.000 lei and there are three types of courses:
a. costs 1000 lei, grand 5 credit points and the total hours of individual study is 80;
b. costs 800 lei, worth 3 credit points and the total hours of individual study is 40;
c. costs 1500 lei, grand 8 credit points and the total hours of individual study is 40.

Use a GA to help the student to select the number of courses from each type such that:

- the budget is not exceeded

- the mean credit points is maximized
- the mean of the total hours of individual study does not exceed 70.

4. A merchandise P is produced by two factories in București and Craiova and it is stored for delivery in
three warehouses in Ploiești, Pitești, and Cluj. The factory in Bucharest produces 120 t/week, while the
factory in Craiova produces 140 t/weeks. To cover the demand, the warehouses: 100 t for Ploiești, 60 t
for Pitești, and 80 t for Cluj. The transportation costs per ton are provided below.

Ploiești Pitești Cluj

București 50 70 90

Craiova 60 70 100
 Use a GA to compute how many tons of P should be delivered by the two factories to each warehouse
such that the transportation cost is minimized.

5. Given a set of n points in the plane 𝑆, each point 𝐴 ∈ 𝑆 being represented by its Cartesian coordinates
(xA, yA), design and implement a GA to find, if there exists, 3 collinear points in the set S. The points
𝐴, 𝐵, 𝐶 ∈ 𝑆 are collinear if one of the following properties is true:
- |𝐴𝐵| = |𝐴𝐶| + |𝐶𝐵|
- |𝐴𝐶| = |𝐴𝐵| + |𝐵𝐶|
- |𝐶𝐵| = |𝐶𝐴| + |𝐴𝐵|

where |𝐴𝐵| = √(xA − xB)2 + (yA − yB)2