A reduction approach to the Two-Campus transport problem

Hagai Ilani, Elad Shufan, Tal Grinshpoun, Aviad Belulu, Alex Fainberg

نتاج البحث: نشر في مجلةمقالةمراجعة النظراء

8 اقتباسات (Scopus)

ملخص

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.

اللغة الأصليةالإنجليزيّة
الصفحات (من إلى)587-599
عدد الصفحات13
دوريةJournal of Scheduling
مستوى الصوت17
رقم الإصدار6
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - 21 أكتوبر 2014
منشور خارجيًانعم

بصمة

أدرس بدقة موضوعات البحث “A reduction approach to the Two-Campus transport problem'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا