Template-Type: ReDIF-Paper 1.0
Author-Name: Larco Martinelli, J.A.
Author-Name-Last: Larco Martinelli
Author-Name-First: Jose
Author-Name: Dekker, R.
Author-Name-Last: Dekker
Author-Name-First: Rommert
Author-Person: pde16
Author-Name: Kaymak, U.
Author-Name-Last: Kaymak
Author-Name-First: Uzay
Author-Person: pka115
Title: Distributed Services with Foreseen and Unforeseen Tasks: The Mobile Re-allocation Problem
Abstract: 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.
Creation-Date: 2007-12-07
File-URL: https://repub.eur.nl/pub/10773/ERS-2007-087-LIS.pdf
File-Format: application/pdf
Series: RePEc:ems:eureri
Number: ERS-2007-087-LIS
Classification-JEL: C61, L23, M, M11, R4
Keywords: distributed services, location, reliability, routing
Handle: RePEc:ems:eureri:10773