Secondly, after tentatively adding each POI to all the trajectories, the calculation of length difference between the maximal and minimal trajectories in current mobile sensor network costs O k|V|) time.
Is the network cost-effective?
A more complex example showing the augmentation of a minimal cost network is provided in Fig. 7.
Thus, we can efficiently augment the minimal cost network flow that solves the model given by Eqs.
After solving the problem as formulated above, the traffic flows (footprints) relative to the single links composing the minimal cost network flow are identified.
5): the exact optimal solution identifying the footprints of the city bus relative to all the arcs forming the minimal cost network; the augmenting paths corresponding to the pickup stage, the PoI visiting stage and the drop-off stage.
Figure 6b depicts the augmented minimal cost network, that is, the three directed paths corresponding to the three optimal sub-itineraries that the city bus must actually pursue to successfully complete its three-stage journey.
The GAMS code developed for this project returns: (1) the exact optimal solution identifying the footprints of the city bus relative to all the arcs forming the minimal cost network; (2) the augmenting paths corresponding to the pickup stage, the PoI visiting stage and the drop-off stage.
(13) to (18) using GAMS. the exact optimal solution identifying the footprints of the city bus relative to all the arcs forming the minimal cost network; the augmenting paths corresponding to the pickup stage, the PoI visiting stage and the drop-off stage.
