Was originally a network transmission project problems, in order to facilitate understanding of the problem, amateurs, want to seek some solution, also can recommend similar to the classic algorithms of problems
Problem description:
? City A and city B, each have 10000 people to return home, home town 1 respectively, and the destination town 2, 3, the town of 4, the town of 5, the town of 2000 people,
? To think of a town, must through the station S L and the train station,
? Railway station S and L sent to town 1 respectively, town 2, 3, the town of 4, town five different frequency, assume that each train capacity can deliver up to 200 people at a time, same

The purpose of source frequency
S 1 on 1/h
S on 1/2 hour
S 3 on 2/hour
S on 1/4 hours
On 5 2 S/h
L 1 on 2/hour
L on 1/2 hour
On 3 1 L/h
On 4 2 L/h
L 5 on 1/h

? The station S and L capacity is limited, can't more than 2000 people, can not overflow, overflow, if cannot return home,
? A city has A minibus to the railway station and the station S L, minibus can take 10 people, each 10 min A trip;
? B city bus to the railway station S L and the train station, bus each can take 50 people, 10 min a trip;
As soon as possible, to everyone how to arrange the full return,

Scheme results in the form of:
A city of 1 town residents ride on x railway station;
A city, town residents ride on 2 x the railway station;
3 town residents of A city bus to the railway station x;
A city of 4 town residents ride on x railway station;
A city of town residents ride on 5 x railway station;

1 B city town residents ride on x railway station;
2 B city town residents ride on x railway station;
3 B city town residents ride on x railway station;
4 B city town residents ride on x railway station;
5 B city town residents ride on x railway station;

CodePudding user response:

Bottleneck on the bus and minibus