Practical Experiences in Schedule Synchronization

In complex networks schedule synchronization has a major importance when constructing timetables. Restrictions in this field are based on the structure and the complexity of the existing network, different headways, and the origin-destination pairs of the demand structure. With respect to service quality one main objective coming to mind consists of minimizing the sum of all waiting times of all passengers at transfer nodes in a transit system. Furthermore, modifications of such an objective function incorporating the maximum waiting time may have to be observed as well as interrelationships between service level and operating cost.

[1]  A. Adamski.  Transfer Optimization in Public Transport , 1995 .

[2]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[3]  Joachim R. Daduna,et al.  Practical Experiences Using an Interactive Optimization Procedure for Vehicle Scheduling , 1993 .

[4]  Timothy J. Lowe,et al.  m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases , 1992, Oper. Res..

[5]  Albert T. Jones,et al.  New Directions for Operations Research in Manufacturing , 1992 .

[6]  Wolf-Dieter Klemt,et al.  Schedule Synchronization for Public Transit Networks , 1988 .

[7]  Jean-Marc Rousseau,et al.  SYNCRO: A Computer-Assisted Tool for the Synchronization of Transfers in Public Transit Networks , 1992 .

[8]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[9]  Avishai Ceder.  A procedure to adjust transit trip departure times through minimizing the maximum headway , 1991, Comput. Oper. Res..

[10]  Jadranka Skorin-Kapov,et al.  Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..

[11]  Stefan Voß,et al.  Tabu search techniques for the quadratic semiassignment problem , 1992 .

[12]  James H. Bookbinder,et al.  Transfer Optimization in a Transit Network , 1992, Transp. Sci..

[13]  Stefan Voß,et al.  Solving Quadratic Assignment Problems Using the Reverse Elimination Method , 1995 .

[14]  Stefan Voß,et al.  Technical Note - On the Cancellation Sequence Method of Tabu Search , 1991, INFORMS J. Comput..

[15]  Stefan Voß,et al.  Dynamic tabu list management using the reverse elimination method , 1993, Ann. Oper. Res..

[16]  Martin Desrochers,et al.  Computer-Aided Transit Scheduling , 1992 .

[17]  Stefan Voß.  Network Design Formulations in Schedule Synchronization , 1992 .

[18]  Stefan Voß,et al.  Tabu Search: Applications and Prospects , 1993 .

[19]  Wolfgang Domschke,et al.  Schedule synchronization for public transit networks , 1989 .

[20]  Andrew B. Whinston,et al.  On Optimal Allocation in a Distributed Processing Environment , 1982 .

[21]  Patrick D. Krolak,et al.  A man-machine approach toward solving the traveling salesman problem , 1970, DAC '70.