Citation
A Two-Campus Transport Problem. In proceedings of the 5th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2011), 9-11 August 2011, Phoenix, Arizona, USA, pages 173-184, 2011.
Paper
Abstract
The presented two-campus transport problem (TCTP) is a pickup-and-delivery scheduling 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 TCTP. 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. TCTP is a two-destinations version of a dial-a-ride problem (DARP).
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2011-173-184-P, author = {E. Shufan and H. Ilani and T. Grinshpoun},
title = {A Two-Campus Transport Problem},
booktitle = {In proceedings of the 5th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2011), 9-11 August 2011, Phoenix, Arizona, USA},
year = {2011},
editor = {J. Fowler and G. Kendall and B. McCollum},
pages = {173--184},
note = {Paper},
abstract = {The presented two-campus transport problem (TCTP) is a pickup-and-delivery scheduling 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 TCTP. 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. TCTP is a two-destinations version of a dial-a-ride problem (DARP).},
owner = {gxk},
timestamp = {2011.08.15},
webpdf = {2011-173-184-P.pdf} }