The capacitated arc routing problem (CARP) is a challenging combinatorial optimization abstracted from many real-world applications, such as waste collection, road gritting, and mail delivery. However, few studies considered dynamic changes during the vehicles’ service, which can cause original schedule infeasible or obsolete. existing are limited by scenarios considered, overly complicated alg...

This paper describes a new architecture for a multicast ATM switch scalable from a few tens to a few thousands of input ports. The switch, called the Abacus switch, has a nonblocking switch fabric followed by small switch modules at the output ports. It has buffers at input and output ports. Cell replication, cell routing, output contention resolution, and cell addressing are all performed in a...

We consider a special routing problem which has a variety of practical applications. In a graph-theoretic context it is known as the Capacitated Chinese Postman Problem. Given an undirected network in which the demand is located on edges, the goal is to determine a least-cost schedule of routes. The route demands, which must not exceed the vehicle capacity, are serviced by a fleet of vehicles w...

This paper studies the routing strategy in non-bifurcated traffic grooming in WDM networks. It is to optimally route the specified traffic over a given logical topology to minimize the congestion of the WDM network. We first present the node-arc formulation. To overcome the computational complexity by implementing exact algorithms, we present an ant colony optimization (ACO) metaheuristic. The ...