Maximal Flow Problem Algorithms, Sample Assignment

Maximal Flow Problem Algorithm

Step1

Determine a path from source to sink that can hold a positive flow of material. If no such path exists then go to step 5

Step2

Find out the highest flow that can be shipped from this path and indicate by 'k' units.

Step3

Reduce the direct capacity of each branch of this path 'k' and amplify the reverse capacity k1. Add 'k' units to the amount distributed to sink.

Step4

Go on step1

Step5

The maximal flow is the quantity of material delivered to the sink. The optimal shipping schedule is recognized through comparing the original network with the final network. Any deduction in capacity indicates shipment.

Sample Assignment

Take the following network and find the amount of flow among the networks.

1355_Maximal_Flow_Problem_1.png

 

Answer

 

Iteration 1: 1 - 3 - 5

850_Maximal_Flow_Problem_Algorithm.png

 

Iteration 2: 1 - 2 - 3 - 4 - 5

570_maximal_flow_problem_algorithm_1.png

 

Iteration 3: 1 - 4 - 5

 

1197_Maximal_Flow_Problem_Algorithms_2.png

 

Iteration 4: 1 - 2 - 5

700_Maximal_Flow_Problem_3.png

 

Iteration 5: 1 - 3 - 2 - 5

1442_MFA.png

 

Maximum flow = 60 units. Thus the network can be written as

185_MFA1.png

www.tutorsglobe.com - Maximal Flow Problem Assignment Help, Maximal Flow Problem Homework Help, Maximal Flow Problem Assignment Tutors, Maximal Flow Problem Solutions, Maximal Flow Problem Answers, Operation Research Assignment Tutors