Title: Solving the mobile mapping van problem: A hybrid metaheuristic for capacitated arc routing with soft time windows
Authors: Vansteenwegen, Pieter ×
Souffriau, Wouter
Sörensen, Kenneth #
Issue Date: 2010
Series Title: Computers & operations research vol:37 issue:11 pages:1870-1876
Abstract: Creating digital maps often requires driving around the streets in a socalled “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.
ISSN: 0305-0548
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Centre for Industrial Management / Traffic & Infrastructure
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
teleatlas - journal versie.pdfpaper version Published 550KbAdobe PDFView/Open Request a copy

These files are only available to some KU Leuven Association staff members


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science