Sentence examples for optimal itineraries from inspiring English sources

The algorithm suggests the optimal number of MAs that minimise the overall cost and also constructs optimal itineraries for each of them.

In [28], Chin et al. have proposed directional source grouping (DSG) algorithm to find near optimal itineraries for multiple MAs.

Also the alternative A-MAFE has almost the same performance, since it spends less time for visiting CHs only and by using optimal itineraries.

This paper proposes an optimal itinerary plan for mobile sinks in the network-coding-based WSNs.

MAs collect data over the WSN and intelligently return this to the MS. We then develop dynamic itinerary planning approach for an MA (DIPMA) to find an optimal itinerary that provides more flexible services using widespread WSNs to users.

The three parts of the optimal itinerary are distinctly shown by three different colors.

The site will compute the optimal itinerary for visiting those places, incorporating open-jaws and one-way flights as appropriate.

In the event of an alarm issued by a sensor node, the BS launches a number of MAs supplied with a near-optimal itineraries that visit the nodes in the alarm's surrounding area and notifies, through Wi-Fi (IEEE 802.11), visually impaired people for potential hazards in their proximity.

Since it is NP-hard to find optimal number of disjoint paths with balanced length, we focus on developing efficient heuristic and polynomial time algorithms to make agents work effectively in a WSN and produce near-optimal itineraries.

Near-optimal itinerary design (NOID) algorithm [27] adapts a method called the Esau-Williams heuristic originally designed for network design problems for the constrained minimum spanning tree (CMST) issue to the specific requirements of WSNs.

This is because agent-based architectures lack mechanisms that guarantee near-optimal agents itineraries so as to minimise the total migration cost in terms of the round-trip latency and the incurred traffic.