Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Transportation Resea...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Transportation Research Part B Methodological
Article . 2001 . Peer-reviewed
License: Elsevier TDM
Data sources: Crossref
versions View all 2 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Optimal timetables for public transportation

Authors: de Palma, Andre; Lindsey, Robin;

Optimal timetables for public transportation

Abstract

Abstract This paper analyzes the optimal timetable for a given number of public transport vehicles on a single transit line when riders differ with respect to the times at which they prefer to travel and the schedule delay costs they incur from traveling earlier or later than desired. The problem of minimizing riders' total schedule delay costs is formulated in continuous time and first-order optimality conditions are identified. An explicit solution is derived for the “line” model in which preferred travel times are uniformly distributed in the population over part of the day and trips cannot be rescheduled between days. This solution is compared with the optimal schedule for the “circle” model in which preferred travel times are uniformly distributed over the full 24 h day and trips can be rescheduled between days.

Keywords

Optimization, Mass transit, Trip timing, Travel time, 330, Scheduling, Public transit, 380, Timetables, Transit riders, Local transit, Costs, Delay costs, Optimisation, Transit, Journey time, operations - scheduling, mode - mass transit

  • BIP!
    Impact byBIP!
    citations
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    102
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 1%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
citations
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
102
Top 10%
Top 1%
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!