Publication
Title
Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
Author
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.
Language
English
Source (journal)
Computers & operations research. - New York, N.Y.
Publication
New York, N.Y. : 2010
ISSN
0305-0548
Volume/pages
37:11(2010), p. 1873-1876
ISI
000278504000006
Full text (Publisher's DOI)
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identification
Creation 23.07.2010
Last edited 21.06.2017
To cite this reference