Title: The mobile mapping van problem: a matheuristic for capacitated arc routing with soft time windows and depot selection
Authors: Vansteenwegen, Pieter ×
Souffriau, Wouter
Sörensen, Kenneth #
Issue Date: 2009
Publisher: Elsevier
Host Document: Proceedings of 13th IFAC symposium on information control problems in manufacturing
Conference: IFAC symposium on information control problems in manufacturing edition:13 location:Moscow date:3-5 June 2009
Abstract: The company Tele Atlas utilises mobile mapping vans to take pictures of streets and road signs. The mobile mapping van problem tries to minimise the number of days required to travel through all streets in a region. Furthermore, hotels need to be selected to spend each night and the position of the sun should be taken into account while driving. This problem is converted into a vehicle routing problem
with soft time windows and depot selection. A two step matheuristic (metaheuristic with an embedded linear programming solver) is designed to solve this problem efficiently. Local search moves reduce the number of days and iterated local search, hybridised with a linear solver, reduces the time window violations. The selection of the hotels is updated regularly. High quality results are obtained in a few seconds of computation time for a set of 29 test instances.
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Centre for Industrial Management / Traffic & Infrastructure
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
mobile mapping van problem.pdf Published 101KbAdobe 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.