Solving the mobile mapping van problem: A hybrid metaheuristic for capacitated arc routing with soft time windows

Authors:
Pieter Vansteenwegen;Wouter Souffriau;Kenneth Sörensen
Affiliations:
Centre for Industrial Management, Katholieke Universiteit Leuven, Celestijnenlaan 300A, 3001 Leuven, Heverlee, Belgium;Centre for Industrial Management, Katholieke Universiteit Leuven, Celestijnenlaan 300A, 3001 Leuven, Heverlee, Belgium and Information Technology, KaHo Sint-Lieven Gebroeders, Desmetstraat 1, 9000 ...;Universiteit Antwerpen, Faculteit Toegepaste Economische, Wetenschappen, Prinsstraat 13, 2000 Antwerp, Belgium
Venue:
Computers and Operations Research
Year:
2010

Citing 11
Cited 0

Transforming arc routing into node routing problems

Computers and Operations Research
Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Introduction to algorithms

Introduction to algorithms
Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints

Transportation Science
Exact methods based on node-routing formulations for undirected arc-routing problems

Networks
Lower and upper bounds for the mixed capacitated arc routing problem

Computers and Operations Research
A constraint programming approach to the Chinese postman problem with time windows

Computers and Operations Research
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms

Transportation Science
A deterministic tabu search algorithm for the capacitated arc routing problem

Computers and Operations Research
Solving capacitated arc routing problems using a transformation to the CVRP

Computers and Operations Research
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows

Discrete Optimization

Quantified Score

Hi-index	0.03

Visualization

Abstract

Creating digital maps often requires driving around the streets in a so-called ''mapping van''. Tele Atlas, the world leading supplier of maps and map data, uses a fleet of such vehicles to take pictures of streets and road signs. Minimising the number of days that a vehicle needs to traverse all streets in a given region gives rise to a capacitated arc routing problem. A specific characteristic of this problem, however, is the fact that taking pictures in the direction of the sun should be avoided as much as possible. This requirement adds soft time windows to the problem. In this paper we solve the mobile mapping van problem by transforming it into a vehicle routing problem with soft time windows. We then apply a hybrid metaheuristic, consisting of a local search phase to decrease the number of days and an iterated local search phase to minimise the time window violations. An exact linear programming solver is embedded to calculate the ideal starting time of the vehicle in each street. Our method is tested on academic and real-life problem instances and shown to be effective.