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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
