论文信息 - A Two-Campus Transport Problem

A Two-Campus Transport Problem

The presented two-campus transport problem (TCTP) is a pickup-anddelivery 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).

[1] Doron Rotem,et al. An Algorithm to Generate all Topological Sorting Arrangements , 1981, Computer/law journal.

[2] Frank Ruskey,et al. Generating Linear Extensions Fast , 1994, SIAM J. Comput..

[3] Jan Karel Lenstra,et al. Computer-Aided Complexity Classification of Dial-a-Ride Problems , 2004, INFORMS J. Comput..

[4] G. Laporte,et al. The diala-ride problem : models and algorithms , .

[5] Richard Bellman,et al. ON A ROUTING PROBLEM , 1958 .

[6] Philip Kilby,et al. Vehicle Routing Problem with Time Windows , 2004 .

[7] Sophie N. Parragh,et al. A survey on pickup and delivery problems Part I : Transportation between customers and depot , 2007 .

[8] Ronald L. Rivest,et al. Introduction to Algorithms, 3rd Edition , 2009 .

[9] Nicolas Jozefowiez,et al. The vehicle routing problem: Latest advances and new challenges , 2007 .

[10] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[11] Kerem Bülbül,et al. Classic Transportation Problems , 2006 .

[12] Uriel G. Rothblum,et al. Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment , 1982 .