mobile-ad-hoc-networks (manets) are self-configuring networks of mobile nodes, which communicate through wireless links. the infrastructure of a mobile ad hoc network (manet) has no routers for routing, and all nodes must share the same routing protocol to assist each other when transmitting messages. the main issues in manets include the mobility of the network nodes, the scarcity of computati...

In this paper we consider approximation of the Capacitated Arc Routing Problem, which is the problem of servicing a set of edges in a graph using a fleet of capacity constrained vehicles. We present a 7 3 2 W approximation algorithm for the problem and prove that this algorithm outperforms the only existing approximation algorithm for the problem. Furthermore, we give computational results show...

In this dissertation, mainly two problems are considered, both of which are routing problems. The first part of the dissertation explores the Capacitated Arc Routing Problem (CARP), which was first suggested by Golden and Wond 1981 [1]. This is the problem of servicing a set og edges in a graph, using a fleet of capacity-constrained vehicles. The problem occurs in practice in situations where s...

Abstract: This paper considers an extended version of the Capacitated Arc Routing Problem (E-CARP), obtained by adding realistic constraints like prohibited turns to the basic CARP. Two integer linear models are presented, a mono-objective version and a biobjective one. A cutting plane method for the first version provides either an optimum or a lower bound that are used to benchmark a genetic ...

This paper describes a dynamic capacitated arc routing problem motivated from winter gritting applications. In this problem, the service cost on each arc is a piecewise linear function of the time of beginning of service. This function also exhibits an optimal time interval where the service cost is minimal. Since the timing of an intervention is crucial, the dynamic aspect considered in this w...

A well known transformation by Pearn, Assad and Golden reduces a Capacitated Arc Routing Problem (CARP) into an equivalent Capacitated Vehicle Routing Problem (CVRP). However, that transformation is regarded as unpractical, since an original instance with r required edges is turned into a CVRP over a complete graph with 3r + 1 vertices. We propose a similar transformation that reduces this grap...

We consider two types of path selection problems for arc capacitated network. Given an arc capacitated network and a set of commodities, one problem is to find a subset of commodities to be routed and an assignment of them to the paths so that profit is maximized. The other problem is to route all given commodities in the network so that cost is minimized. Bifurcation of flow is not allowed in ...