Citation
A reduction approach to the two-campus transport problem. Journal of Scheduling, 17 (6): 587-599, 2014.
Selected
Abstract
The two-campus transport problem (TCTP) is a dial-a-ride problem with only two destinations. The problem is motivated by a transport problem between two campuses of an academic college. The two campuses are located in two different cities. Lecturers living in one city are sometimes asked to teach at the other city’s campus. The problem is that of transporting the lecturers from one campus to the other, using a known set of vehicles, so as to minimize the time the lecturers wait for their transport. We mathematically model the general TCTP, and provide an algorithm that solves it, which is polynomial in the number of lecturers. The algorithm is based on a reduction to a shortest path problem.
There is no pdf available for this paper. You might like to try to obtain the original source (see the doi, for example)
doi
The doi for this publication is 10.1007/s10951-013-0348-7 You can link directly to the original paper, via the doi, from here
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
@ARTICLE{2014-587-599-SI, author = {H. Ilani and E. Shufan and T. Grinshpoun and A. Belulu and A. Fainberg},
title = {A reduction approach to the two-campus transport problem},
journal = {Journal of Scheduling},
year = {2014},
volume = {17},
pages = {587--599},
number = {6},
note = {Selected},
abstract = {The two-campus transport problem (TCTP) is a dial-a-ride problem with only two destinations. The problem is motivated by a transport problem between two campuses of an academic college. The two campuses are located in two different cities. Lecturers living in one city are sometimes asked to teach at the other city’s campus. The problem is that of transporting the lecturers from one campus to the other, using a known set of vehicles, so as to minimize the time the lecturers wait for their transport. We mathematically model the general TCTP, and provide an algorithm that solves it, which is polynomial in the number of lecturers. The algorithm is based on a reduction to a shortest path problem.},
doi = {10.1007/s10951-013-0348-7},
owner = {user},
timestamp = {2012.05.25} }