Locating optimal timetables and vehicle schedules in a transit line

Description

This paper deals with the Transit Network Timetabling and Scheduling Problem (TNTSP) in a public transit line. The TNTSP aims at determining optimal timetables for each line in a transit network by establishing departure and arrival times of each vehicle at each station. We assume that customers know departure times of line runs offered by the system. However, each user, traveling after or before than their desired travel time, will give rise to an inconvenience cost, or a penalty cost if that user cannot be served according to the scheduled timetable. The provided formulation allocates each user to the best possible timetable considering capacity constraints. The problem is formulated using a p-median based approach and solved using a clustering technique. Computational results that show useful applications of this methodology are also included.

Abstract

Ministerio de Ciencia e Innovación MTM2010-19576-C02-01

Abstract

Ministerio de Ciencia e Innovación MTM2009-14243

Abstract

Ministerio de Ciencia e Innovación MTM2012-37048

Abstract

Junta de Andalucía P09-TEP-5022

Abstract

Junta de Andalucía FQM-5849

Additional details