Engineered Science

Operating Ford and Fulkerson Algorithm for Minimization of

Traffic

Journal: Engineered Science

Manuscript ID Draft

Manuscript Type: Original Research

Fo
Date Submitted by the
n/a
Author:

Complete List of Authors: Ugale, Shankar; SJJTU, Mathematics; Nutan Maharashtra Institute of
rR

Engineering and Technology, First Year

Sidana, Hritick; Nutan Maharashtra Institute of Engineering and
Technology, Computer
Sateeja, Kushagar; Nutan Maharashtra Institute of Engineering and
ev

Technology, Computer
Palve, Madhukar; Prof Ramkrishna More Arts Commerce and Science
College, Mathematics
iew

Basotia, Vineeta ; SJJTU, Mathematics

Takale, Kirti; SJJTU, Mathematics

Keywords: Routes, Maximum Flow, Traffic, Max flow Min cut Theorem
On
ly

https://mc04.manuscriptcentral.com/engineered-science
Page 1 of 14 Engineered Science

1
2 Operating Ford and Fulkerson Algorithm for Minimization of Traffic
3
4
5 Operating Ford and Fulkerson Algorithm for Minimization of
6
7
Traffic
8
9 Shankar D. Ugale, Hritick Sidana, Kushagar, Dr. Madhukar Palve
10 Dr. Vineeta Basotia, Kirti Takale
11
12
Research Scholar, Mathematics Department, JJTU University, India
13
Student, Nutan Maharashtra Institute of Engineering and Technology, Pune, India.
14
15 Student, Nutan Maharashtra Institute of Engineering and Technology, Pune, India.
16 Prof.Ramkrishna More Arts, Commerce and Science College Pune,
17 Associate Professor, Mathematics Department, JJTU University, India
18 Research Scholar, Mathematics Department, JJTU University, India
19 Corresponding Authors: Shankar D Ugale, Dr. Madhukar Palve
20 Email: [email protected], [email protected] .
21
Fo

22
Abstract: Indian economy is fastest growing economy with increasing rate of population of around 1.4
23
24 billion people. Number of Vehicles in a family are increasing due to need of transportation. There are
rR

25 huge number of heavy commercial vehicles in Industrial Area. Traffic is the main problem in Talegaon
26 Dabhade city, Due to Talegaon-Chakan Industrial Area. In this Research Paper we have found
27 maximum flow paths from different locations of city. Hence to manage the traffic efficiently we have
28
ev

29
used ford and Fulkerson algorithm as it will tell us the maximum capacity. We have carried out different
30 routes from Source to destination. Data is collected manually at location points. Maximum flows are
31 find out by Ford-Fulkerson Algorithm and Maximum Flow Minimum Cut Theorem is used to find
iew

32 Networks. These augmented paths will be useful for smooth traffic distribution and traffic control.
33 Keywords: Routes, Maximum Flow, Traffic, Max flow Min cut Theorem, etc.
34
35 1 Introduction:
36 Talegaon Dabhade place is situated in Talegaon, Chakan, and Hinjewadi Industrial Belt. This city
On

37 linked between Mumbai and Pune, Two Metropolitan Cities. Heavy traffic problem occurs daily in
38
Talegaon Dabhade city. There are central reserved police force head quarter, National Disaster Rapid Force
39
40 head quarter, ordinance factory located in and near by the city. Talegaon is well associated with major
ly

41 towns of the state by all the major highways. National Highway NH-48 is known as old Mumbai-Pune four
42 lane Highway. National Highway 548D is from Talegaon to Shikrapur is also four lane highway proposed
43 for eight lanes. Railway connectivity is also there from Talegaon Station to Mumbai and Pune.Due to poor
44
45
management of traffic control there are lots of accidents happened in the city.
46 There is need to know maximum capacity of each route so that the traffic can be easily managed. Traffic
47 congestion is categorized in 2 types:
48 1. Recurring congestion
49
50
2. Non recurring congestion
51 Recurring congestion is the congestion in the peak hour while the Nonrecurring congestion is the
52 congestion due to an unexpected event like any rally, program etc. Traffic congestion need to be managed
53 efficiently. Hence we have used Ford Fulkerson Algorithm to find out the maximum flow so as to manage
54
the traffic efficiently. This will help us to know that which roadway facilities need to be improved.
55
56 2. Literature Review:
57 Application of Ford and Fulkerson algorithm is used for maximum flow water distribution in the paper
58
namely Application of Ford-Fulkerson Algorithm to Maximum Flow in Water Distribution Pipeline
59
60
Shankar D. Ugale, Hritick Sidana, Kushagar, Dr. Madhukar Palve Dr. Vineeta Basotia. 1 | P a g e

https://mc04.manuscriptcentral.com/engineered-science
 Engineered Science Page 2 of 14

1
2 Operating Ford and Fulkerson Algorithm for Minimization of Traffic
3
4 Network from International Journal of Scientific and Research Publications 2018.Trafic congestion
5
problem solution is given in paper Road traffic analysis on the congestion problem using the Ford-
6
7 Fulkerson algorithm” Journal of Road and Traffic Engineering 2022. Traffic solution in Kota Kinabalu city
8 in Malaysia is studied in paper Using Ford-Fulkerson Algorithm and Max Flow-Min Cut Theorem to
9 Minimize Traffic Congestion in Kota Kinabalu, Sabah 2017. Whale optimization algorithm is used in
10 research paper Whale Optimization Algorithm for Solving the Maximum Flow Problem” Journal of
11
Theoretical and Applied Information Technology. Maximum flow problems involve finding a feasible max
12
13 flow through a source-sink flow network. The line goal is to figure out how much stuff can be passed from
14 source to sink. Modification of EDMONDS-KARP Algorithm for Solving Maximum Flow Problem,
15 International Journal of Innovation and Applied Studies. Maximum Flow Problem in Ethiopian Airlines”
16 Journal of Progressive Research in Mathematics (JPRM). Neighboring Vehicle traffic is studied in research
17
18 paper (2019) “V2v-Based Method For The Detection Of Road Traffic Congestion” IET Intelligent
19 Transport Systems. Ethiopian airline problem is solved by Ford and Fulkerson algorithm in research paper
20 of Maximum Flow Problem in Ethiopian Airlines, Journal of Progressive Research in Mathematics (JPRM)
21 2016.Study of causes and solution on Talegaon Dabhade traffic is used in paper Traffic Congestion -
Fo

22
Causes And Solutions: A Study Of Talegaon Dabhade City, Journal Of Information, Knowledge And
23
24 Research In Civil Engineering 2014.
rR

25
26 3. Scope:
27
28 The Scope of this study is traffic management of Talegaon city. There are different possible routes in
ev

29 Talegaon city. In first route we have set Limb Phata as the Source and Maratha Kranti Chowk as the Sink.
30 In second route we set Shivaji Chowk as Source and Limb Phata as Sink. In third route we set Maratha
31 Kranti Chowk as Source and Vadgaon Phata as Sink. There are many possible routes out of which we
iew

32
choose these three routes by taking consideration of traffic. After identifying all the routes, we have
33
34 generated a network diagram. The network diagram is further used to calculate the maximum flow and min
35 cut values. Hence the aim of our research is to find out the bottleneck paths so as to minimize the traffic
36 congestion. Ford Fulkerson algorithm is a very useful algorithm for finding out the bottleneck paths and to
On

37 get the maximum flow for a better performance.

38
39
40 4. Research Methodology:
ly

41 Algorithmic research methodology is used in this study. Ford-Fulkerson Algorithm is applied on different
42
43
routes to find maximum flow of traffic. Maximum flow and minimum cut theorem is also applied on
44 network.
45 Data Collection:
46 There are different methods to count traffic volume which are manual count and automatic count. Manual
47
48
count method is most common method which involve group of peoples. Three students have collected the
49 traffic data from Nine Locations of Talegaon city. Locations are:
50 Vadgaon Phata,Station Chowk, Maratha Kranti Chowk, Hutching School, ABC Petrol Pump, Limb Phata,
51 Jijamata Chowk, Yashwant Nagar, Sivaji Chowk, Kaka Halwai Chowk, General Hospital.
52
53 Different classes of Vehicles are counted manually; classes of vehicles are:
54 Passenger Car, Tempo, Auto Rickshaw, Agricultural Tractor, Bus, Truck, Tractor-Trailer Unit, Motor
55 Cycle, Scooter, Pedal Cycle.
56
57
58
59
60
Shankar D. Ugale, Hritick Sidana, Kushagar, Dr. Madhukar Palve Dr. Vineeta Basotia. 2 | P a g e

https://mc04.manuscriptcentral.com/engineered-science
Page 3 of 14 Engineered Science

1
2 Operating Ford and Fulkerson Algorithm for Minimization of Traffic
3
4 5. Results and Discussion:
5
6 Transport Network:
7 A weighted directed connected graph is called a transport network. If the following conditions are verified.
8 i) It is without loop
9
10 ii) There is only one vertex in the graph which has no incoming edge called as “Source”.
11 iii) There is only one vertex in the graph which has no outgoing edge called as “Sink”.
12 iv) The weight of each edge should be non-negative real number, it is known as capacity of that edge. The
13
capacity of the edge (i, j) is denoted by W (i, j).
14
15 Φ (i, j) is flow in a transport network assigned to each edge (i, j) such that,
16 i) Φ(i, j) ≤ W(i, j) for each (i, j)
17 i.e. the volume of traffic through the route cannot greater than the capacity of route.
18
19 ii) ∑ Φ (i, j) =∑ Φ (i, j) for each vertex j except source and sink,
20 I.e. incoming traffic flow = outgoing traffic flow
21 The value of flow is given by:
Fo

22
Φv= ∑ Φ (a, i) - ∑ Φ (k, z)
23
24 For a given flow an edge (i, j) is said to be saturated if Φ (i, j) = W (i, j)
rR

25 A edge (i, j) is said to be unsaturated if Φ (i, j) <W (i, j)

26
Maximum Flow:
27
28 A Maximum flow in traffic network is a flow having largest traffic value.
ev

29 Cut:
30 A cut in traffic network is the minimum set of edges that divides the graph in two parts and
31
iew

separates the source from the sink. The Max flow min cut Theorem says that in a Network Flow diagram
32
33 the maximum flow from source to sink is equivalent to the weight of the cut edges.
34
35 Ford-Fulkerson Algorithm:
36
1. Select the source and the Sink.
On

37
38 2. Find out the paths from source to sink and select the edge with min capacity.This is the flow of
39 that particular path.
40 3. Subtract that min capacity from each edge in that path. The edge with 0 capacity left will be
ly

41
42 blocked.
43 4. Repeat step 2 and step 3 for each path from source to sink.
44 5. Maximum flow is the addition of all the traversed path flows.
45 6. Select the cut edges from source to sink, calculate weight of that cut edges and the sum of the
46
weight of cut edges should be equal to maximum flow.
47
48 7. End
49
50
51
52
53
54
55
56
57
58
59
60
Shankar D. Ugale, Hritick Sidana, Kushagar, Dr. Madhukar Palve Dr. Vineeta Basotia. 3 | P a g e

https://mc04.manuscriptcentral.com/engineered-science
 Engineered Science Page 4 of 14

1
2 Operating Ford and Fulkerson Algorithm for Minimization of Traffic
3
4
5
6
Flowchart:
7
8
9
10 START
11
12
13
14
15
16 Calculate Initial residual graph
17
18
19
20
21
Fo

22
23 Find the directed path from source to sink
24
rR

25
26
27
28
ev

29
30 Augment the flow on path by amount equal to
31
iew

the minimum residual capacity along this path

32
33
34
35
36
On

37
38
39 Update the initial graph
40
ly

41
42
43
44
45 Yes
46
Augment
47
48 Path
49
50
51 No
52
53
54
STOP
55
56
57
58
59
60
Shankar D. Ugale, Hritick Sidana, Kushagar, Dr. Madhukar Palve Dr. Vineeta Basotia. 4 | P a g e

https://mc04.manuscriptcentral.com/engineered-science
Page 5 of 14 Engineered Science

1
2 Operating Ford and Fulkerson Algorithm for Minimization of Traffic
3
4
5
6 Case Study: We used Ford and Fulkerson algorithm for study and evaluation, minimization of traffic
7 and bottle necks at Talegaon Dabhade City in Maharashtra state India.
8 Traffic congestion in Talegaon
9
10 Traffic lights were meant to control the traffic and smooth functioning of the roads. However, the problem
11 of traffic could not be fully solved by these lights properly. As Talegaon is an industrial area so in peak
12 time huge volume of traffic is present. Hence a more optimal solution must be provided.
13 Capacity Estimation
14
15 We have estimated the capacity of the road manually by counting the no of vehicles in the peak hour in the
16 evening. We have taken the readings of 5 minutes of the peak hour and then multiplied the result by 12 to
17 get the desired result. Calculation was done based on the PCU value of the vehicle. Table 1 is the
18 calculation of passenger car Unit value (PCU)
19
20 Class of Vehicle PCU value
21 Car, Taxi, Auto 1.00
Fo

22 Bus, Truck, Heavy vehicle 3.00

23
24
Bike, Scooter, Bicycle 0.50
rR

25 Table 1
26
27
No Location Name From To Car, Tempo, Bus,Truck Two Calculatio Total
28
ev

29 Auto , Tractor Wheele n Capacit

30 r y in
31 PCU
iew

32
33 1 ABC Petrol to G H 28 1 39 50.5 606
34 Hatching School
35 2 Hatching School H G 18 0 29 32.5 390
36
to ABC Petrol
On

37
38 3 Limb Phata to K J 30 2 80 76 912
39 Jijamata Chowk
40 4 Jijamata to Limb J K 34 5 68 83 996
ly

41 Phata
42 5 Station Chowk to B A 31 11 39 83.5 1002
43
Vadgaon Phata
44
45 6 Vadgaon Phata to A B 40 19 25 109.5 1314
46 Station Chowk
47 7 Vadgaon Phata to A G 73 7 86 137 1644
48 ABP Petrol Pump
49 8 ABC Petrol G A 76 26 54 181 2172
50 Pump to Vadgaon
51
Phata
52
53 9 Limb Phata to K G 84 7 63 136.5 1638
54 ABC Petrol
55 Pump
56 10 ABC Petrol G K 123 17 40 194 2328
57 Pump to Limb Max
58 Phata
59
60
Shankar D. Ugale, Hritick Sidana, Kushagar, Dr. Madhukar Palve Dr. Vineeta Basotia. 5 | P a g e

https://mc04.manuscriptcentral.com/engineered-science
 Engineered Science Page 6 of 14

1
2 Operating Ford and Fulkerson Algorithm for Minimization of Traffic
3
4 11 General Hospital C D 20 2 86 69 828
5
to Yashwant
6
Nagar
7
8 12 Yashwant Nagar D C 21 2 46 50 600
9 to General
10 Hospital
11 13 General Hospital C F 64 14 131 171.5 2058
12 to Maratha Kranti
13 Chowk
14
14 Maratha Kranti F C 44 13 100 133 1596
15
16
Chowk to
17 General Hospital
18 15 Yashwant Nagar D E 12 1 117 73.5 882
19 to Shivaji Chowk
20 16 Shivaji Chowk to E D 9 0 46 32 384
21 Yashwant Nagar Min
Fo

22
23 17 Shivaji Chowk to E F 27 2 108 87 1044
24 Maratha Kranti
Chowk
rR

25
26 18 Maratha Kranti F E 29 3 109 92.5 1110
27 Chowk to Shivaji
28 Chowk
ev

29 19 Kaka Halwai I F 13 0 64 45 540

30 Chowk to
31
iew

Maratha Kranti
32
Chowk
33
34 20 Maratha Kranti F I 17 0 80 57 684
35 Chowk to Kaka
36 Halwai Chowk
On

37 21 Kaka Halwai I J 52 4 150 139 1668

38 Chowk to
39 Jijamata Chowk
40
22 Jijamata Chowk J I 40 2 146 119 1428
ly

41
42
to Kaka Halwai
43 Table 2
44
45 By calculation of PCU Maximum capacity is 2328 PCU shown in green color and Minimum capacity is
46 384 shown in yellow color.
47
48 Now we will study Maximum flow of traffic in three cases. In first route we have set Limb Phata as the
49 Source and Maratha Kranti Chowk as the Sink. In second route we set Sivaji Chowk as Source and Limb
50
Phata as Sink. In third route we set Maratha Kranti Chowk as Source and Vadgaon Phata as Sink
51
52
53
54
55
56
57
58
59
60
Shankar D. Ugale, Hritick Sidana, Kushagar, Dr. Madhukar Palve Dr. Vineeta Basotia. 6 | P a g e

https://mc04.manuscriptcentral.com/engineered-science
Page 7 of 14 Engineered Science

1
2 Operating Ford and Fulkerson Algorithm for Minimization of Traffic
3
4
5
6
Talegaon Dabhade Traffic Flow Graph
7
8
9 384
10
11 D E
12 882
13
14
15 600 1044 1110
16 828
17
18
1002 1638
19 1596
20 A B C F
21
Fo

22 1314 1662 2058

23
1664 1542
24 2172
1440
rR

25 390 684
26
27 G H
28
ev

29 606
30 972 822
31 540
iew

32
33
34 1638 I
2328
35
36
On

37
38 1668 1428
39
40
ly

41 912
42
43 K J
44
45 996
46
47 Graph 1
48
49
50
51
52
53
54
55
56
57
58
59
60
Shankar D. Ugale, Hritick Sidana, Kushagar, Dr. Madhukar Palve Dr. Vineeta Basotia. 7 | P a g e

https://mc04.manuscriptcentral.com/engineered-science
 Engineered Science Page 8 of 14

1
2 Operating Ford and Fulkerson Algorithm for Minimization of Traffic
3
4
5
6
CASE STUDY 1: Source: K (Limb Phata), Sink: F (Maratha Kranti Chowk)
7
8
9 D E
10
11 882
12
13
14 828
15 600 ` 1044
16
17
18
19 1662/348
20 1314/0 /24/0 2058/744/420/396
21 A B C
Fo

F
22
23
24
2172 1440/1116/1092
rR

25
26 /858 390
27
28 G H
ev

29
30 606/282
31 972
iew

32 540/0
33
34
35 I
36
On

37
38 1638
39
1428
40 /324
ly

41 /0
42
43
K J
44
45 912/888/348
46 Graph 2
47
48
49 Maxflow Calculation:
50 1. K->G->A->B->C->F Flow: 1314 vehicles per hour
51 2. K->G->H->B->C->F Flow: 324 vehicles per hour
52 3. K->J->I->H->B->C->F Flow: 24 vehicles per hour
53
54 4. K->J->I->F Flow: 540 vehicles per hour
55
56 Max flow: 2202vehicle per hour
57 Min Cut: 1638+564=2202 shown by blue line which is equal to Maximum Flow.
58
59
60
Shankar D. Ugale, Hritick Sidana, Kushagar, Dr. Madhukar Palve Dr. Vineeta Basotia. 8 | P a g e

https://mc04.manuscriptcentral.com/engineered-science
Page 9 of 14 Engineered Science

1
2 Operating Ford and Fulkerson Algorithm for Minimization of Traffic
3
4
5
6
CASE STUDY 2: Source: E (Shivaji Chowk), Sink: K (Limb Phata)
7
8
9
10 D E
11
12 384/0
13
14 600/216
15 1044/436/0
16
17
18 1638/1254/6
19 1002 36/200 1596/978/542
20 A B C
21 F
Fo

22
23 1644/126
24
1542/1106
0/642
rR

25 390
26
27 G H
28
ev

29 606
30 822/386
31
iew

32 684
33 2328/1
34 944/13 I
35 26
36
On

37
38 1668/1232
39
40
ly

41
42 996/560
43 K J
44
45
46 Graph 3
47
48
49 Max flow Calculation:
50 1. E->D->C->B->A->G->K Flow: 384 Vehicles per hour
51 2. E->F->C->B->A->G->K Flow: 618Vehicles per hour
52
3. E->F->C->B->H->G->K Flow: 436Vehicles per hour
53
54 Max flow: 1438Vehicles per hour
55 Min Cut: 384+1054=1438shown by blue line which is equal to Maximum Flow.
56
57
58
59
60
Shankar D. Ugale, Hritick Sidana, Kushagar, Dr. Madhukar Palve Dr. Vineeta Basotia. 9 | P a g e

https://mc04.manuscriptcentral.com/engineered-science
 Engineered Science Page 10 of 14

1
2 Operating Ford and Fulkerson Algorithm for Minimization of Traffic
3
4 CASE STUDY 3: Source: F (Maratha Kranti Chowk), Sink: A (Vadgaon Phata)
5
6
7 384/138
8 D E
9
10
11
12 600/354
13
14
1110/864
15
16 1638/636/246/ 0
17 1002/0
1596/594/204
18
19 A B C F
20
21 2172/1 1440
Fo

22 782/10 1542/1152/906
23
24
98/852 390/0
rR

25 G H
26
27
606
28
ev

29 822
30 972/726
684/0
31
iew

32 I
33 1638/
34 954/
35 708
36
1668/984/738
On

37
38
39
40
J
ly

41 K
42
43 996/312/66
44
45 Graph 4
46
Max flow Calculation:
47
48 1. F->C->B->A Flow: 1002 vehicles per hour
49 2. F->C->B->H->G->A Flow: 390 vehicles per hour
50 3. F->I->J->K->G->A Flow: 684 Vehicles per hour
51
4. F->E->D->C->B->H->I->J->K->G->a Flow: 246 vehicles per hour
52
53 Max flow: 2322 vehicles per hour
54 Min Cut: 1320+1002=2322shown by blue line which is equal to Maximum Flow.
55
56
57
58
59
60
Shankar D. Ugale, Hritick Sidana, Kushagar, Dr. Madhukar Palve Dr. Vineeta Basotia. 10 | P a g e

https://mc04.manuscriptcentral.com/engineered-science
Page 11 of 14 Engineered Science

1
2 Operating Ford and Fulkerson Algorithm for Minimization of Traffic
3
4 6. Conclusion
5
6 This research paper gives main emphasize to determine the maximum flow and minimum cut of
7 Talegaon Dabhade city in Maharashtra state and also identify the bottleneck paths. Using Ford and
8 Fulkerson algorithm, we have generated network graphs for further calculations. Calculation of
9 capacity of road on roads was based on PCU values of the vehicles. Heavy vehicles such as Truck
10
correspond to higher PCU value while two wheelers had the minimum PCU value. The maximum flow
11
12 turned out to be 2322 vehicles per hour when the source was taken as Maratha Kranti Chowk and sink
13 was taken as Vadgaon Phata. This research work also shows the Bottleneck path is general hospital to
14 Talegaon station. Hence the traffic manager needs to know about the bottleneck regions. However, it is
15 an approximate data and volume of traffic might get changed depending on the time and day but the
16
17
capacity of the road was constant. Maximum capacity of a road will be static and independent of any
18 other factors.
19
20
REFERENCES
21
Fo

22 [1] Narsingh Deo (2016). “Graph Theory with Application to Engineering and Computer
23 Science”. P.61-93. Dover edition ISBN 9780486807935
24 [2]Myint Than Kyi, Lin Lin Naing (2018) “Application of Ford-Fulkerson Algorithm to Maximum
rR

25
26 Flow in Water Distribution Pipeline Network “International Journal of Scientific and Research
27 Publications, Volume 8, Issue 12, December 2018ISSN 2250-3153.
28 [3] Bopatriciat Boluma Mangataa et all (2022) “Road traffic analysis on the congestion problem using
ev

29 the Ford-Fulkerson algorithm” Journal of Road and Traffic Engineering, Vol 68 No 4 Online ISSN
30
2406-1557 Print ISSN 0478-9733.
31
iew

32 [4] Dr. Shafi K. Pathan, Rameshwar M Indoriya, Lomesh K. Ahire (2020) “Discrete Mathematics”
33 Page No. (5-3) to (5-45) Tech-Neo Publication ISBN: 978-93-90376-05-6
34 [5] Kenneth Rosen (2011). Discrete Mathematics and Its Applications, 7th edition. McGraw-Hill
35
36 Science. p. 749. ISBN 978-0-07-338309-5.
On

37 [6] Noraini Abdullah, Ting Kien Hua (2017) “Using Ford-Fulkerson Algorithm and Max Flow-Min
38 Cut Theorem to Minimize Traffic Congestion in Kota Kinabalu, Sabah” Journal of Information System
39
and Technology Management eISSN: 0128-6666, Volume: 2 Issues: 4, pp.18-34]
40
[7]Raja Masadeh (2018) “Whale Optimization Algorithm for Solving the Maximum Flow Problem
ly

41
42 “Journal of Theoretical and Applied Information Technology,Vol.96. No 8, ISSN: 1992-8645.
43 [8] Dilruba Akter (2011) “Modification of EDMONDS-KARP Algorithm for Solving Maximum Flow
44
Problem “International Journal of Innovation and Applied Studies, Vol. 31 No. 4, ISSN 2028-9324.
45
46 [9] HaftomGebreanenya (2016) “Maximum Flow Problem in Ethiopian Airlines” Journal of
47 Progressive Research in Mathematics (JPRM), Volume 9 Issue 2, ISSN: 2395-0218.
48 [10]Runmin Wang (2019) “V2v-Based Method For The Detection Of Road Traffic Congestion” IET
49
50 Intelligent Transport Systems, ISSN 1751-956X.[11] HaftomGebreanenya (2016) “Maximum Flow
51 Problem in Ethiopian Airlines, Journal of Progressive Research in Mathematics
52 (JPRM) ISSN: 2395-0218,Volume 9, Issue 2
53 [12] Shekhar K. Rahane (2014) “Traffic Congestion - Causes and Solutions: A Study of Talegaon
54
Dabhade City, Journal of Information, Knowledge and Research in Civil Engineering,
55
56 ISSN: 0975 – 6744|, Volume 3, Issue 1
57
58
59
60
Shankar D. Ugale, Hritick Sidana, Kushagar, Dr. Madhukar Palve Dr. Vineeta Basotia. 11 | P a g e

https://mc04.manuscriptcentral.com/engineered-science
 Engineered Science Page 12 of 14

1
2
3 To
4
5 Editor-in-Chief
6
7 Engineered Science
8
9
10
11
Dear sir
12
13
We wish to submit a research manuscript entitled “Operating Ford and Fulkerson Algorithm for
14
15 Minimization of Traffic” for publishing in your esteemed journal. Our research work is in the field of
16 Mathematics. Graph theory has very wide application in optimization. Ford and Fulkerson algorithm
17 gives the easy solution in traffic management. This Paper gives the Traffic flows by Ford Fulkerson
18 Algorithm. We found this journal suitable for publication of Applied mathematics work.
19
Fo
20 we declare that all the authors: Shankar D. Ugale, Hritick Sidana, Kushagar, Dr. Madhukar Palve
21
22 Dr. Vineeta Basotia, Kirti Takale of this manuscript agreed to submit the manuscript to the journal
Engineered Science. We also agree to transfer copyright from the authors to the journal. The manuscript
rR
23
24 has been prepared as per the journal’s guidelines and checked for language correction.
25
26 we do confirm that this work is original and the manuscript is not currently under consideration for
ev

27 publication elsewhere.
28
29 Please address all the correspondence pertaining to this manuscript to me at [email protected]
iew

30
31
.
32
33 Thanking you
34
Sincerely
On

35
36
37 Ugale Shankar D
38
ly

39 Research Scholar
40
41 JJTU India.
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60 https://mc04.manuscriptcentral.com/engineered-science
Page 13 of 14 Engineered Science

1
2
3 Contents
4
5
Introduction ------------------------------------------------------------------------------------------------------- 1
6
7
8
Literature Review ------------------------------------------------------------------------------------------------- 1
9
10 Scope------------------------------------------------------------------------------------------------------------------- 2
11
12 Research Methodology ------------------------------------------------------------------------------------------- 2
13
14 Results and Discussion------------------------------------------------------------------------------------------- 3
15
16 Case Study ------------------------------------------------------------------------------------------------------------ 5
17
18 Conclusion ----------------------------------------------------------------------------------------------------------- 11
19
Fo
20 REFERENCES --------------------------------------------------------------------------------------------------------- 11
21
22
rR
23
24
25
26
ev

27
28
29
iew

30
31
32
33
34
On

35
36
37
38
ly

39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60 https://mc04.manuscriptcentral.com/engineered-science
 Engineered Science Page 14 of 14

1
2
3 This research paper gives the Traffic Flow information and bottle neck in Talegaon Dabhade City using
4
5 Ford and Fulkerson Algorithm.
6
7
8
9
10
11
12
13
14
15
16
17
18
19
Fo
20
21
22
rR
23
24
25
26
ev

27
28
29
iew

30
31
32
33
34
On

35
36
37
38
ly

39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60 https://mc04.manuscriptcentral.com/engineered-science