In this paper we deal with a common problem found in the operations of security and preventive/corrective maintenance services: that of routing a number of mobile resources to serve foreseen and unforeseen tasks during a shift. We define the (Mobile Re-Allocation Problem) MRAP as the problem of devising a routing strategy to maximize the expected weighted number of tasks served on time. For obtaining a solution to the MRAP, we propose to solve successively a multi-objective optimization problem called the stochastic Team Orienteering Problem with Multiple Time Windows (s-TOP-MTW) so as to consider information about known tasks and the arrival process of new unforeseen tasks. Solving successively the s-TOP-MTW we find that considering information about the arrival process of new unforeseen tasks may aid in maximizing the expected proportion of tasks accomplished on time.

, , ,
, , , ,
Erasmus Research Institute of Management
hdl.handle.net/1765/10773
ERIM Report Series Research in Management
ERIM report series research in management Erasmus Research Institute of Management
Erasmus Research Institute of Management

Larco Martinelli, J.A, Dekker, R, & Kaymak, U. (2007). Distributed Services with Foreseen and Unforeseen Tasks: The Mobile Re-allocation Problem (No. ERS-2007-087-LIS). ERIM report series research in management Erasmus Research Institute of Management. Erasmus Research Institute of Management. Retrieved from http://hdl.handle.net/1765/10773