Scribd
Upload
18 views11 pages

Math Project

The report analyzes traffic flow in a network of four one-way streets using a system of linear equations to optimize vehicle routing and reduce congestion. It establishes a mathematical model based on traffic data collected during peak hours and discusses the implications of various traffic flow scenarios. The findings indicate that traffic flows can be managed through traffic lights, with specific constraints ensuring nonnegative vehicle flow.

Uploaded by

anshumanbehera981
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
18 views11 pages

Math Project

The report analyzes traffic flow in a network of four one-way streets using a system of linear equations to optimize vehicle routing and reduce congestion. It establishes a mathematical model based on traffic data collected during peak hours and discusses the implications of various traffic flow scenarios. The findings indicate that traffic flows can be managed through traffic lights, with specific constraints ensuring nonnegative vehicle flow.

Uploaded by

anshumanbehera981
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

REPORT ON FINDING THE

TRAFFIC FLOW IN THE NET


OF ONE-WAY STREETS
CONTENTS

Introduction
Mathematical Model
Model Assumptions
Discussion of Results
INTRODUCTION

In mathematics, traffic flow is the study of interactions between


vehicles, drivers, and infrastructure, with the aim of understanding
and developing an optimal road network with efficient movement
of traffic and minimal traffic congestion problems. It aims at
applying a system of linear equations to traffic flow for a network
of four one-way streets in a locality. It also aims to determine the
number of vehicles that should be allowed to route the four one-
way streets under study in the model in order to reduce traffic
congestion in a locality.
MATHEMATICAL MODEL
A system of linear equations was used to analyze the flow of traffic
for a network of four one-way streets in a locality. The variables
and represent the flow of the traffic between the four intersections
in the network. The data was obtained by counting the number of
vehicles that travelled around the four one-way streets between
the hours of 7am to 9 am, and 4pm to 6pm during the mid-week
peak traffic hours. The arrows in the diagram indicate the direction
of flow of traffic in and out of the network that is measured in
terms of number of vehicles per hour ( vph ). The diagram in below
figure describes the four one-way streets in a locally under study
in the model:
MODEL ASSUMPTIONS
The following assumptions were made in order to ensure the smooth flow
of the traffic;
i)Vehicles entering each intersection should always be equal to the
number of vehicles leaving the intersection.
ii) The streets must all be one-way with the arrows indicating the direction of
traffic flow.
The system of equations for the model was formulated as follows:
At intersection A: Traffic in = w + x , Traffic out-400-225.
Thus, w + x = 625.
At intersection B: Traffic in = 350 +125 , Traffic out = w+2
Thus, w + z = 475,
At intersection C: Traffic in= y + z, Traffic out=600+300.
Thus, y + z = 900.
At intersection D: Traffic in= 800+ 250, Traffic out=x + y
Thus, x + y =1050.
The constraints were written as a system of linear
equations as follows:
W + x = 625
W + z=475
Y + z = 900
x + y = 1050
We then used the Gauss-Jordan elimination method to
solve the system of equations. The augmented matrix
and reduced row-echelon form of the above system are
as follows:

The system of equations that corresponding Row-


echelon form is:

W + z = 475
X - z = 150
y + z = 900
Expressing each leading variable in terms of the remaining variable, we had,

W= -z + 475
x= z+ 150
y= -z+ 900

Discussion of Results
The system of the modeling equations has many solutions, and
therefore many traffic flows are possible. A driver has a certain
amount of choice at the intersection, due to the nature of the model.
Considering the stretch DC, it is desirable to have small traffic flow y
as possible along this stretch of road. The flows can be controlled
along various branches by means of traffic lights.
All traffic flows must be nonnegative. The third
equation in the system tells us that y will be a
minimum when z as large as possible, as long as
it does not exceed 900. The largest value z can
be without causing negative values of w or x is
475. Thus the smallest value of y is -475+900, or
425. Any road work on Street III should allow for
traffic volume of at least 425 vph.

You might also like