IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Log in (now much improved!) to save this article

Multi-objective integration of timetables, vehicle schedules and user routings in a transit network

Listed author(s):
  • Laporte, Gilbert
  • Ortega, Francisco A.
  • Pozo, Miguel A.
  • Puerto, Justo
Registered author(s):

    The Transit Network Timetabling and Scheduling Problem (TNTSP) aims at determining an optimal timetable for each line of a transit network by establishing departure and arrival times at each station and allocating a vehicle to each timetable. The current models for the planning of timetables and vehicle schedules use the a priori knowledge of users’ routings. However, the actual route choice of a user depends on the timetable. This paper solves the TNTSP in a public transit network by integrating users’ routings in the model. The proposed formulation guarantees that each user is allocated to the best possible timetable, while satisfying capacity constraints. In addition, we perform a trade-off analysis by means of a multi-objective formulation which jointly optimizes the operator’s and the users’ criteria.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261515301776
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Article provided by Elsevier in its journal Transportation Research Part B: Methodological.

    Volume (Year): 98 (2017)
    Issue (Month): C ()
    Pages: 94-112

    as
    in new window

    Handle: RePEc:eee:transb:v:98:y:2017:i:c:p:94-112
    DOI: 10.1016/j.trb.2016.12.018
    Contact details of provider: Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description

    Order Information: Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
    Web: https://shop.elsevier.com/order?id=548&ref=548_01_ooc_1&version=01

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

    as
    in new window


    1. de Palma, André & Lindsey, Robin, 2001. "Optimal timetables for public transportation," Transportation Research Part B: Methodological, Elsevier, vol. 35(8), pages 789-813, September.
    2. Small, Kenneth A, 1982. "The Scheduling of Consumer Activities: Work Trips," American Economic Review, American Economic Association, vol. 72(3), pages 467-479, June.
    3. Gilbert Laporte & Juan Mesa & Francisco Ortega, 1997. "Assessing the efficiency of rapid transit configurations," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 5(1), pages 95-104, June.
    4. Castelli, Lorenzo & Pesenti, Raffaele & Ukovich, Walter, 2004. "Scheduling multimodal transportation systems," European Journal of Operational Research, Elsevier, vol. 155(3), pages 603-615, June.
    5. Juan Mesa & Francisco Ortega & Miguel Pozo, 2014. "Locating optimal timetables and vehicle schedules in a transit line," Annals of Operations Research, Springer, vol. 222(1), pages 439-455, November.
    6. Cacchiani, Valentina & Toth, Paolo, 2012. "Nominal and robust train timetabling problems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 727-737.
    7. Hanne L. Petersen & Allan Larsen & Oli B. G. Madsen & Bjørn Petersen & Stefan Ropke, 2013. "The Simultaneous Vehicle Scheduling and Passenger Service Problem," Transportation Science, INFORMS, vol. 47(4), pages 603-616, November.
    8. Espejo, Inmaculada & Marín, Alfredo & Rodríguez-Chía, Antonio M., 2012. "Closest assignment constraints in discrete location problems," European Journal of Operational Research, Elsevier, vol. 219(1), pages 49-58.
    9. Ibarra-Rojas, Omar J. & Giesen, Ricardo & Rios-Solis, Yasmin A., 2014. "An integrated approach for timetabling and vehicle scheduling problems to analyze the trade-off between level of service and operating costs of transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 70(C), pages 35-46.
    10. Guihaire, Valérie & Hao, Jin-Kao, 2008. "Transit network design and scheduling: A global review," Transportation Research Part A: Policy and Practice, Elsevier, vol. 42(10), pages 1251-1273, December.
    Full references (including those not matched with items on IDEAS)

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:98:y:2017:i:c:p:94-112. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.