MAXIMUM FLOW PROBLEM IN ETHIOPIAN AIRLINES

Haftom Gebreanenya

Haftom Gebreanenya Department of Mathematics, College of Natural and Computational Sciences Adigrat University, Adigrat, Ethiopia

Keywords: maximum flow problem, augmenting path, and Ford and Fulkerson algorithm.

Abstract

Maximum flow problem is a problem which involves a directed network with arcs carrying flow. The problem is to find the maximum flow that can be sent through the arcs of the network from some specified node S, called the source, to a second specified node T, called the sink. In this paper we are going to see what maximum flow problem is and its solution algorithm called the Ford and Fulkerson algorithm. This paper also contains a problem of maximum flow problem in Ethiopian Airlines solved using the Ford and Fulkerson algorithm.

Downloads

Download data is not yet available.

References

Dimitris Bertsimas, John N.Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, Belmont, Massachusetts, 1997.

Frederick S.Hillier,Gerald J.Lieberman, introduction to Operations research, seventh edition, McGraw hill, New York, 2000.

Hamdy A.Taha, Operations research: An introduction, eighth edition, Pearson Prentice Hall, New Jersey, 2007.

Igor Griva, Stephen G.Nash, and Ariela Sofer, Linear and Nonlinear Optimization, second edition, Fairfax, Virginia, 2009.

J.A.Bondy and U.S.R.Murty, Graph Theory with Application, Elsevier Science publishing co.,Inc, New York, 1982.

Ravindra K.Ahuja, Thomas L.Magnanti, and James B.Orlin, Network Flows: Theory, Algorithm, and Applications, Prentice Hall, New Jersy, 1993.

Wayne L.winston, Operations research applications and algorithms, Duxbury press, fourth edition, Belmont, 2004