Time-dependent prize-collecting arc routing problems (TD-PARPs) generalise the regular (PARPs). PARPs have arcs associated with collectable prizes along travelling costs. TD-PARPs allow travel times to vary at horizon so that real-life uncertain factors such as traffic and weather conditions can be taken into account. A TD-PARP is find a route maximises profit i.e. total collected minus two fac...

The soft-clustered capacitated arc-routing problem (SoftCluCARP) is a variant of the classical problem. only additional constraint that set required edges, is, streets to be serviced, partitioned into clusters, and feasible routes must respect soft-cluster constraint, all edges same cluster served by vehicle. In this article, we design an effective branch-price-and-cut algorithm for exact solut...

In this work we introduce a green inventory routing problem termed the Stochastic Inventory Routing Problem on Electric Roads (S-IRP-ER), in which hybrid vehicle navigates road network with charging opportunities some sections, to cover non-stationary stochastic demand of single product for set retailers network. We model using isochrone graphs represent real an graph nodes are located such tha...

Given integers n ≥ 7 and a,b,c with 1 ≤ a,b,c ≤ n − 1 such that a,n − a,b,n − b,c,n − c are pairwise distinct, the (undirected) triple-loop network TLn(a,b,c) is the degree-six graph with vertices 0, 1, 2, . . . ,n − 1 such that each vertex x is adjacent to x ± a, x ± b, and x ± c, where the operation is modulo n. It is known that the maximum order of a connected triple-loop network of the form...

Natural disasters, including droughts and floods, have caused huge losses to mankind. Hydrological modelling is an indispensable tool for obtaining a better understanding of hydrological processes. The DEM-based routing methods, which are widely used in the distributed models, sensitive both DEM resolution computational cell size. Too little work has been devoted joint effects size on methods. ...

We show that any α(n)-approximation algorithm for the n-vertex metric asymmetric Traveling Salesperson problem yields O(α(C))-approximation algorithms for various mixed, windy, and capacitated arc routing problems. Herein, C is the number of weakly-connected components in the subgraph induced by the positive-demand arcs, a number that can be expected to be small in applications. In conjunction ...

We consider the post-disaster road clearing problem with the goal of restoring network connectivity in shortest time. Given a set of blocked edges in the road network, teams positioned at depot nodes are dispatched to open a subset of them that reconnects the network. After a team finishes working on an edge, others can traverse it. The problem is to find coordinated routes for the teams. We ge...