Sentence examples for routing costs from inspiring English sources

Since up to four customers can visited in each route, we explicitly enumerated the set of feasible routes and used a set-covering formulation to select the subset of routes serving each customer and minimizing routing costs.

The net cost of a route is equal to the sum of routing costs, minus the total collected revenue.

The relationship between density distributions and various routing costs may be further analyzed, and the equivalence between geodesic problems and optimum routing vector field problems can be established.

In the dial-a-ride problem considered in this paper, total routing costs are minimized while respecting time window, maximum user ride time, maximum route duration, and vehicle capacity restrictions.

Moreover, the model considers routing costs of customers who want to travel from origins to destinations.

Moreover, we study the influence of different objective functions on solution attributes and on the contribution of ECVs to the overall routing costs.

The first one primarily aims at minimizing the number of routes and secondarily minimizing the routing cost, whereas the second one only aims at minimizing the cost of the generated route set.

The routing cost comparison results shows that FM has a routing cost 5%% more than the optimum cost, and GADM may have a routing cost 28%% more than the optimum cost.

Indeed, street-turns can be realized by the optimization process itself, when they are useful to decrease the routing cost, instead of being forced a priori upon the routes construction.

The relative mean of FM (or GADM) is defined as the mean of the routing cost of FM (or GADM) divided by the mean of the optimum routing cost (OPT).

The relative mean of FM (or GADM) is defined as the mean of the routing cost of FM (or GADM) divided by the mean of the optimum routing cost.