Professional Documents
Culture Documents
Maximum Flow
Maximum Flow
Maximum Flow
Student Name
University Affiliation
Running head: MAXIMUM FLOW METHOD 2
This can be defined as the highest amount of sequence packets that a network could
allow to move from the source node to its sink. A source generates the packets in a network
while a sink consumes it depending on the nature of a problem both the source and sink of a
problem may have a limit. In airline scheduling, a max flow method is used to ensure the best
As one of the largest markets in the world in this age, however, airplanes suffer from
high expenditure costs during their flight and standby times. Therefore, every flight is a huge
bet on whether there will be customers to buy the tickets. There are a lot of resources used by
airlines but no system to use all of them efficiently. Using Ford-Fulkerson’s algorithm to find
the maximum flow in the airline’s network, we can find a workable solution to use these
A network flow diagram can be derived here whereby we start by taking information
from the authority and making a node for every flight connecting and direct. After that, we
give a limit for one node to another. We get this limit from the time the aircraft comes to the
airline. Starting from the current flight whose flow we made 0 we do a BFS from the node
and find an available node from it. After that, check for more flow if it is possible if there is
no more flow then return but more flow occurs then the network needs to be updated by
doing a BFS from the node and finding the available node from the current node.
Running head: MAXIMUM FLOW METHOD 3
Reference
Iqbal, A., Hossain, M. S., & Ebna, H. A. (2018). Airline scheduling with max flow algorithm. Department of
Computer Science and Engineering, Faculty of Electrical & Computer Engineering, Chittagong
https://www.researchgate.net/publication/331967163_Airline_Scheduling_with_Max
_Flow_algorithm