16,001,882 members
1.00/5 (1 vote)
See more:
```Input:  < Sub-graph S≡(V,E,ω,D)>
Output:< Load Mixing Sub-graph Optimization SLMO ,where Vertex (V), Edge( E),Cost(ω) and Demand (D)>
Initialize L_(u_k)^(v_j ) and L_Max^(v_j ) and S_LMO
for all v∈V do
for  j = 1 to n do
for all road segments in do v_j
L_(u_k)^(v_j )= (D_(u_k ) .ω_(v_j ));
L_Max^(v_j ) = Max (∑_(k=1)^Ψ▒〖D_(u_k )  .ω_(v_j ) 〗);
end for
end for
end for
Sort all vertices v∈V based on values of L_Max^(v_j ) in ascending order. First, let V^'  be the sorted set of vertices;
let SLMO  = ψ
let of L_Max^v be the least value
add  L_Max^v to SLMO
beginning at L_Max^v ,mark all (V^',v)∈ E as Covered where v∈V;
for j = 1 to n do
if there are more Vertices in V^' to be covered then
check and locate a pairwise connection with the nearest  neighbor in the sorted list and add this vertex to SLMO;
end if
end for
return SLMO;```
Posted
Updated 2-Dec-14 17:25pm
v3
Sergey Alexandrovich Kryukov 2-Dec-14 23:25pm
Sorry, this is not really a question. Rather, it's something like a request "do my work for me". This is not how it works.
And note that you did not even explain what you tried to achieve.
—SA

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Top Experts
Last 24hrsThis month
 Richard Deeming 80 merano99 40 Dave Kreskowiak 15 Pete O'Hanlon 10 brownpeteg 10
 OriginalGriff 631 Richard Deeming 320 Dave Kreskowiak 286 Pete O'Hanlon 270 CPallini 120

CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900