A Multiple Plan Approach for the Dynamic Technician Routing and Scheduling Problem

I presented preliminary results on the Dynamic TRSP at the EURO’12 conference in Vilnius, Lithuania.

V. Pillac, C. Guéret, A. Medaglia
A Multiple Plan Approach for the Dynamic Technician Routing and Scheduling Problem
25th European Conference on Operational Research (EURO 2012), Vilnius, Lithuania (2012)

Abstract

The Dynamic Technician Routing and Scheduling Problem (DTRSP) deals with a crew of technicians that serves dynamically appearing requests. In the DTRSP, each technician has a set of skills, tools, and spare parts, while requests require a subset of each. The problem is then to design a set of tours of minimal total duration such that each request is visited exactly once, within its time window, by a compatible technician, and to dynamically insert new requests into existing tours. We propose a Multiple Plan Approach to solve the DTRSP and illustrate its performance on benchmark instances.

The slides are available here.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s