A Class of Train-Scheduling Problems

Arjang A. Assad
Additional contact information
Arjang A. Assad: University of Maryland, College Park, Maryland

Transportation Science, 1982, vol. 16, issue 3, 281-310

Abstract: We relate the question of determining stop-schedules for trains that deliver traffic on a line of stations to the maximization of submodular set functions. We prove that a greedy algorithm is optimal under certain assumptions and report computational experience on the performance of the greedy heuristic as compared to the exact algorithm when the optimality of the greedy heuristic cannot be guaranteed.

Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.16.3.281 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:16:y:1982:i:3:p:281-310

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().