Planning problems over multi-period horizons occur in arc routing but are neglected by OR researchers. This paper presents these new problems, a classification and a hybrid GA able to tackle the planning and scheduling levels simultaneously.

Pieter Vansteenwegen, Wouter Souffriau, and Kenneth Sörensen Centre for Industrial Management, Katholieke Universiteit Leuven Celestijnenlaan 300A, 3001 Leuven (Heverlee), Belgium, [email protected] Information Technology, KaHo Sint-Lieven Gebroeders Desmetstraat 1, 9000 Gent, Belgium, [email protected] Universiteit Antwerpen, Faculteit Toegepaste Economische Wetensc...

Real world applications for vehicle collection or delivery along streets usually lead to arc routing problems, with additional and complicating constraints. In this paper we focus on arc routing with an additional constraint to identify vehicle service routes with a limited number of shared nodes, i.e. vehicle service routes with a limited number of intersections. This constraint leads to solut...

The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of traversing it in each direction. In this paper we deal with the Windy General Routing Problem (WGRP), in which only a subset of edges must be traversed and a subset of vertices must be visited. This is also an NP-hard ...

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...

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...

Self-adaptive mechanisms for the identification of the most suitable variation operator in Evolutionary Algorithms 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 uses a s...

In the Team Orienteering Arc Routing Problem (TOARP) the potential customers are located on the arcs of a graph and are to be chosen on the basis of an associated profit. A limited fleet of vehicles is available to serve the chosen customers. Each vehicle has to satisfy a maximum route duration constraint. The goal is to maximize the profit of the served customers. We propose a matheuristic for...