This work addresses the problem of determining optimal routing decisions in signalized traffic networks, where arc travel times vary over time and are known only probabilistically (i.e. in stochastic, time-varying (STV) networks) and additional delay due to signal operations is explicitly considered. While prior works in the literature address problems of routing in STV networks, none explicitl...

In this paper, we discuss the relation of unsplittable shortest path routing (USPR) to other routing schemes and study the approximability of three USPR network planning problems. Given a digraph D = (V,A) and a set K of directed commodities, an USPR is a set of flow paths Φ(s,t), (s, t) ∈ K, such that there exists a metric λ = (λa) ∈ Z+ with respect to which each Φ(s,t) is the unique shortest ...

1Dept. of Urban Management, Kyoto University (C1-2-334 Bldg., Kyoto daigaku-Katsura, Nishikyo-ku, Kyoto 615-8530, Japan) E-mail: [email protected] 2Professor, Dept. of Urban Management, Kyoto University (C1-2-335 Bldg., Kyoto daigaku-Katsura, Nishikyo-ku, Kyoto 615-8530, Japan) E-mail: [email protected] 3Lecturer, Dept. of Urban Management, Kyoto University ...

We propose a new algorithm for the Capacitated Arc Routing Problem (CARP). Our motivation to deal with this problem is related to its application in several real world scenarios such as street sweeping, urban waste collection and electric meter reading just to mention a few. Based on BRKGA metaheuristic, our algorithm introduces a new random key encoding for CARP, mutation to random keys string...

In the Capacitated Arc Routing Problem (CARP), a subset of the edges of an undirected graph has to be serviced at least cost by a fleet of identical vehicles in such a way that the total demand of the edges serviced by each vehicle does not exceed its capacity. This paper describes a new lower bounding method for the CARP based on a set partitioning-like formulation of the problem with addition...

Self-adaptive mechanisms for the identification of the most suitable variation operator in Evolutionary meta-heuristics rely almost exclusively on the measurement of the fitness of the offspring, which may not be sufficient to assess the optimality of an operator (e.g., in a landscape with an high degree of neutrality). This paper proposes a novel Adaptive Operator Selection mechanism which use...

In this paper we deal with the Windy Rural Postman Problem. This problem generalizes several important Arc Routing Problems and has interesting real-life applications. Here, we present several heuristics whose study has lead to the design of a Scatter Search algorithm for the Windy Rural Postman Problem. Extensive computational experiments over different sets of instances, with sizes up to 988 ...

The Bridges of Königsberg is one of the most famous problems in graph theory. In the summer of 2005, two of the authors visited Königsberg, now called Kaliningrad. This article provides geographical and historical information on Königsberg and its bridges, as well as updated information on the current day situation. Key-words: graph theory, arc routing, history, Euler.

Routing tendons in straight paths along an elastic backbone is a widely used method of actuation for continuum robots. Tendon routing paths which are general curves in space enable a much larger family of robots to be designed, with configuration spaces and workspaces that are unattainable with straight tendon routing. Harnessing general tendon routing to extend the capabilities of continuum ro...

The capacitated arc routing problem (CARP) focuses on servicing edges of an undirected network graph. A wide spectrum of applications like mail delivery, waste collection or street maintenance outlines the relevance of this problem. A realistic variant of the CARP arises from the need of intermediate facilities (IFs) to load up or unload the service vehicle and from tour length restrictions. Th...