This paper introduces a synchronized arc routing problem for snow plowing operations. In this problem, routes must be designed in such a way that street segments with two or more lanes in the same direction are plowed simultaneously by different synchronized vehicles. A mixed integer formulation and an adaptive large neighborhood search heuristic are proposed. The performance of the proposed al...

Competitive memetic algorithms for arc routing problems – P. Lacomme et al. Competitive memetic algorithms for arc routing problems – P. Lacomme et al. Abstract The Capacitated Arc Routing Problem or CARP arises in applications like waste collection or winter gritting. Metaheuristics are tools of choice for solving large instances of this NP-hard problem. The paper presents basic components tha...

Clustering is a method by which nodes are hierarchically organized on the basis of their relative proximity to one another. Routes can be recorded hierarchically, across clusters, to increase routing flexibility. Hierarchical routing greatly increases the scalability of routing in ad hoc networks by increasing the robustness of routes. This paper presents the Adaptive Routing using Clusters (AR...

The Capacitated Arc Routing Problem (CARP) is a NPHard routing problem with strong connections with real world problems. In this work we aim to enhance the performance of MAENS, a stateof-the-art algorithm, through a self-adaptive scheme to choose the most suitable operator and a diversity-driven ranking operator. Experimental results on 181 problem instances show how these techniques can both ...

In this paper we introduce a new class of facet-inducing inequalities for the Windy Rural Postman Problem and the Windy General Routing Problem. These inequalities are called Zigzag inequalities because they cut off fractional solutions containing a zigzag associated with variables with 0.5 value. Two different types of inequalities, the Odd Zigzag and the Even Zigzag inequalities, are presente...

Money collection presents particular problems in terms of effective vehicle routing. Planning the collection or distribution of money for ATMs or parking meters gives rise to two problems: while the total collecting time should be minimized, tours on successive days should be different to prevent robberies. The combination of these two problems is named as the Dissimilar Routing Problem. When t...

1997 ii ACKNOWLEDGEMENTS We would like mostly to thank Mr. Peter Keenan, who was as much a partner as a supervisor, for his invaluable time and erudite guidance during the summer. We must also pay tribute to our parents for their encouragement and support, not only for the duration of this dissertation, but throughout the year. ABSTRACT The Capacitated Arc Routing Problem is a NP-hard arc routi...

This paper studies the target visitation arc routing problem on an undirected graph. combines well-known rural postman and linear ordering problem. In this problem, there is a set of required edges partitioned into targets, which must be traversed are pairwise preferences for order in some targets serviced, generates revenue if preference satisfied. The aim to find tour that traverses all at le...

This master thesis deals with a special variant of the Vehicle Routing Problem (VRP), where there are many customers per road segment. This kind of VRP arises in many real-life situations, e.g. mail delivery and garbage collection. VRP solvers are part of most Decision Support Systems (DSS) used by companies in this business sector. In an operational setting, it is often more important to get a...