Technion, IEM faculty - Operations Research seminar
Speaker: Elad Shufan
Title: A Two Campus Problem
Date: 16/05/2011
Time: 12:30
Place: Bloomfield-527
Abstract:  <>
Or read here:
abstract: The presented two-campus problem (TCP) is a
pickup-and-delivery schedualling problem. It is a problem of a
college with two campuses located at two different cities.
Lecturers living in one city should sometimes teach at the other
city campus. The problem is that of transporting N lecturers
from one campus to the other, using a fleet of k vehicles, so as
to minimize the time the lecturers wait for their transport.
This is an optimal set partition problem. We mathematically
model the one-directional case of the TCP. The feasible space
solution is represented by linear extensions of the requested
departure time partially ordered set and reduction to the
shortest path problem. This enables finding the optimal solution
for the one directional case. The presented TCP is a
two-destinations version of a "dial a ride" problem (DARP).
Based on joint works with Ilani and Grinshpoun.
Technion Math. Net (TECHMATH)
Editor: Michael Cwikel   <> 
Announcement from:  <>