Vehicle allocation problem (VAP) is faced by carriers that generate revenue by transporting full loads. VAP decides which loads to be accepted (and which loads to be rejected) and how to position empty vehicles.

Assume that a company solved VAP for three days, and two cities, zmir and Eskiehir using the following data set.

Demand

#	From	To	Day	Unit
1	zmir	Eskiehir	1	1
2	zmir	Eskiehir	3	1
3	Eskiehir	zmir	2	1
4	Eskiehir	zmir	3	1

# of vehicles that will become available

City	Day	Units
zmir	1	1
zmir	2	1

The travel time from zmir to Eshiehir is one day. However, it takes two days from Eshiehir to zmir due to some maintenance work carried out on the road.

Show the flows on time expanded graphs for the following cases:

1. Company accepts the first and second demands and rejects the others
2. Company accepts all demands except the second one.