The class of vehicle routing problems involves the optimization of freight or passenger transportation activities. These problems are generally treated via the representation of the road network as a weighted complete graph. Each arc of the graph represents the shortest route for a possible origin-destination connection. Several attributes can be defined for one arc (travel time, travel cost . ...

The class of vehicle routing problems involves the optimization of freight or passenger transportation activities. These problems are generally treated via the representation of the road network as a weighted complete graph. Each arc of the graph represents the shortest route for a possible origin-destination connection. Several attributes can be defined for one arc (travel time, travel cost . ...

In this paper we present an exact algorithm for the Windy General Routing Problem. This problem generalizes many important Arc Routing Problems and also has some interesting real-life applications. The Branch & Cut method presented here is based on a cutting-plane algorithm that identifies violated inequalities of several classes of facet-inducing inequalities for the corresponding polyhedron. ...

Recently, routing on dBG has been investigated as shortest path and fault tolerant routing but investigation into shortest path in failure mode on dBG has been non-existent. Furthermore, dBG based broadcasting has been studied as local broadcasting and arc-disjoint spanning trees based broadcasting. However, their broadcasting algorithms can only work in dBG(2,k). In this paper, we investigate ...

We tackle the Mixed Capacitated General Routing Problem (MCGRP) which generalizes many other routing problems. Very few papers have been devoted to this argument, in spite of interesting real-world applications. We propose an integer programming model for the MCGRP and extend to its polyhedron inequalities valid for the Capacitated Arc Routing Problem (CARP) polyhedron. Identification procedure...

We have proposed a new architecture for building a scalable multicast ATM switch from a few tens to a few thousands of input/output ports. The switch, called the Abacus switch, employs input and output buffering schemes. Cell replication, cell routing, and output contention resolution are all performed in a distributed way so that the switch can be scaled up to a large size. The Abacus switch a...

We consider a Periodic Load-dependent Capacitated Vehicle Routing Problem (PLCVRP) encountered by medical centers and medical waste collection companies for the design of a weekly inventory routing schedule to transport medical wastes to treatment sites. In addition to minimization of transportation risk, occupational risk related to temporary storage of hazardous wastes at the health-care cent...

Mixed Capacitated Arc Routing Problems (MCARP) aim to identify a set of vehicle trips that, starting and ending at a depot node, serve a given number of links, regarding the vehicles capacity, and minimizing a cost function. If both profits and costs on arcs are considered, the Profitable Mixed Capacitated Arc Routing Problem (PMCARP) may be defined. We present compact flow based models for the...

In cutting and packing problems, Dual Feasible Functions (DFFs) represent a well established tool for deriving high quality lower bounds in very short times. A well-known DFF lower bounding approach consists of using DFFs to rapidly generate feasible values for the dual variables of a Column Generation (CG) program (i.e., of an extended formulation commonly associated to CG). This paper present...

Given the rapid advances in unmanned aerial vehicles, or drones, and increasing need to monitor at a city level, one of the current research gaps is how to systematically deploy drones over multiple periods. We propose a real-time data-driven approach: we formulate the first deterministic arc-inventory routing problem and derive its stochastic dynamic policy. The policy is expected to be of gre...