levels of city roads and railways. The road network
planning should determine the form of road network;
then determine the nature of roads, width, the form
of road cross section, the location of intersection and
the parking lots and the receipt of road network
maps. The current form of the existing road system
can be summarized into four main types: grid-type,
ring radial, freestyle, and hybrid. Then use model to
plan direction and capacity of roads which make the
overall road network release less emissions.
Optimization methods of road network are
consisted of four-stage method, the total control
method and graph theory method. They are mostly
targeted as maximum economic benefits and least
time consumed, they distributes the predicted traffic
flow to the road after considering these factors,
which are the layout of road network, traffic flow in
the direction and distribution of goods. Further,
according to the amount of traffic flow to determine
technical level, the direction of the selected roads,
extension angle and optimal points to the line.
However, the above methodologies ignore the
environmental effects. Carbon emissions are related
to traffic volume and road resistance coefficient,
while considering carbon emission, there are
four-stage method and graph theory method can be
selected.
Four-stage method is based on investigation, and
then predicts the future distribution at the base of
traffic condition. The basic steps are traffic
generation, traffic distribution, traffic model
selected, traffic assignment. We can gain some
parameters about cargo flow through investigation.
But it is difficult to implement, it will cost a lot of
manpower, material and financial resources, so the
minimum cost maximum flow is practical to
optimize the road network. The so-called minimum
cost maximum flow problem is to find a maximum
flow f; simultaneously the total cost is minimum.
Studying this problem is trying to find out: In order
to achieve minimum cost, how to choose the path
and assign traffic flow from A to B. The meaning of
cost can be defined as carbon emissions in this
model.
3 THE ESTABLISHMENT OF
THE OPTIMIZE MODEL OF
ROAD NETWORK IN
LOGISTICS HUB
3.1 The Establishment Mind
While the initial road network planning is finished,
then we can use EcoTransIT tool to obtain carbon
emissions’ weight, as we get the parameters about
the minimum cost maximum flow, the road network
can be optimized. Network planning is to reach the
minimum carbon emissions based on meeting
logistics requirements and rational distribution
network. At the condition of knowing the total
demand in a cycle, the permitted maximum capacity
of each road, and carbon emissions of unit weight on
different road type, we can determine which can be
used as the trunk roads, secondary roads and slip
roads for two random entrances of Logistics Hub.
3.2 Mathematical Model
If f whose flow is v(f) is the minimum cost flow of
all feasible flow, and u is the smallest-cost
augmented chain of all the augmented chain
contained f, then adjust f along u, we will get f’,
which is the minimum cost flow of all the feasible
flow. Thus, when f’ is the maximum flow, it is what
required minimum cost maximum flow.
As b
≥0, so f=0 must be the minimum cost
flow whose flow is 0. This always starts from f=0.
Generally, it also sets f is the minimum cost flow,
and its flow is v (f), the remaining problem is how to
find the augmented chain of minimum cost about f.
So we can construct a weighted diagraph w(f), its
vertices are vertices of the original network D, and
change arc included in D into two arcs in opposite
directions (vi,vj) and (vj,vi). We define the
weights of arcs in the w (f) as:
Wij=
b
,
<
+∞,
=
(1)
=
−b
,
>0
+∞,
=0
(2)
So seek the minimum cost flow in network D is
equivalent to find the shortest paths in the weighted
diagraph. Therefore, the following algorithm is:
Firstly, it can setf
(
0
)
=0, if at the (k-1) step we
get the minimum cost flowf(k − 1), then construct a
THE OPTIMIZATION OF ROAD NETWORK IN LOGISTICS HUB BASED ON LOW-CARBON ASPECT
667