We present a column generation approach for obtaining strong lower bounds to the periodic vehicle routing problem with time windows (PVRPTW) where customers must be served several times during a planning period. For this a set-covering model is introduced whose linear programming relaxation is solved. The pricing subproblem, responsible for generating new columns, is an elementary shortest path...

The task of routing streaming data in a sensor network is made arduous by the resource constraints imposed on each node. The control overhead of a routing protocol has to be minimized in order to preserve limited resources at the node. Furthermore, it is widely expected that the gateway of the sensor network will not be static in many application scenarios, but will be moving around the network...

This work presents an exact branch-cut-and-price (BCP) algorithm for the vehicle routing problem with time windows (VRPTW) where the well-known clique inequalities are used as cutting planes defined on the set partitioning master problem variables. It is shown how these cutting planes affect the dominance criterion applied in the pricing algorithm, which is a labeling algorithm for solving the ...

This paper describes an exact algorithm for solving a problem where the same vehicle performs several routes to serve a set of customers with time windows. The motivation comes from the home delivery of perishable goods, where vehicle routes are short and must be combined to form a working day. A method based on an elementary shortest path algorithm with resource constraints is proposed to solv...

In the context of an IP network, this paper investigates an interesting case of the inverse shortest path problem using the concept of network centrality. For a given network, a special probability distribution, namely the centrality distribution associated with the links of a network can be determined based on the number of the shortest paths passing through each link. An entropy measure for t...

We present features of next generation SONET, focusing particularly on path management. Factors such as QoS metrics and path protection are keys to realize automatic and dynamic path management. Two algorithms (the sequential algorithm and the parallel algorithm) to provide QoS and protection path in SONET are proposed and discussed in details. They balance the network load by circumventing hea...

This paper is concerned with some feasibility issues in mathematical programs with equilibrium constraints (MPECs) where additional joint constraints are present that must be satis ed by the state and design variables of the problems. We introduce su cient conditions that guarantee the feasibility of these MPECs. It turns out that these conditions also guarantee the feasibility of the quadratic...

In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (LHMACP) selection, which is NP-complete. Then, we propose the k-shortest paths Extended BellmanFord (k-EB) algorithm, which is capable of computing All Hops k-shortest Paths (AHKP) between a source and a destination. T...

Abstract This paper studies a generalization of the shortest path tour problem with time windows ( GSPTPTW ). The aim is to find single-origin single-destination path, which has pass through an ordered sequence not necessarily disjoint node-subsets. Each node window for each node-subset it belongs. We investigate theoretical properties and propose dynamic programming approach solve it. Numerica...

In this paper, we reduce the logspace shortest path problem to biconnected graphs; in particular, we present a logspace shortest path algorithm for general graphs which uses a logspace shortest path oracle for biconnected graphs. We also present a linear time logspace shortest path algorithm for graphs with bounded vertex degree and biconnected component size, which does not rely on an oracle. ...