Manufacturers, who re-supply a large number of customers, continually struggle with the question of how to formulate a replenishment strategy. The purpose of this paper is to determine the optimal set of routes for a group of vehicles in the transportation network under defined constraints – which is known as the Vehicle Routing Problem (VRP) – delivering new items, and resolving the invent...

In this paper we study local routing strategies on geometric graphs. Such use properties of the graph like coordinates current and target nodes to route. Specifically, in presence constraints which are obstacles that edges not allowed cross. Let P be a set n points plane let S line segments whose endpoints P, with no two intersecting properly. We present first deterministic 1-local O(1)-memory ...

Internet Traffic has grown exponentially over last few years due to provision of multiple class services through Internet backbone. With the explosive use of Internet, contemporary Internet routers are susceptible to overloads and their services deteriorate drastically and often cause denial of services. In this paper, an analysis is made how forecasting technique, routing algorithm and Genetic...

Last-mile routing refers to the final step in a supply chain, delivering packages from depot station homes of customers. At level single van driver, task is traveling salesman problem. But choice route may be constrained by warehouse sorting operations, van-loading processes, driver preferences, and other considerations rather than straightforward minimization tour length. We propose simple eff...

The role of a delay-constrained routing protocol is to nd paths between senders and receivers subject to a delay constraint while eÆciently using network resources. Many delay-constrained routing protocols where proposed these last years, most of them give priority to cost minimization during path computing process. This approach builds paths with end-to-end delays too close to the delay constr...

We study labelling schemes for X-constrained path problems. Given a graph (V,E) and X ⊆ V , a path is X-constrained if all intermediate vertices avoidX. We study the problem of assigning labels J(x) to vertices so that given {J(x) : x ∈ X} for any X ⊆ V , we can route on the shortest X-constrained path between x, y ∈ X. This problem is motivated by Internet routing, where the presence of routin...

This paper presents an approach to power-conserving routing of ad hoc mobile wireless networks. This approach relies on entropy-constrained routing algorithms, which were developed by utilizing the information-theoretic concept of the entropy to gradually reduce the uncertainty associated with route discovery through a deterministic annealing process. Entropy-constrained routing algorithms were...

The capacitated arc routing problem (CARP) is one of the most important routing problems with many applications in real world situations. In some real applications such as urban waste collection and etc., decision makers have to consider more than one objective and investigate the problem under uncertain situations where required edges have demand for more than one type of commodity. So, in thi...