TRAVELLING TIME ON DENSE NETWORKS

The purpose of this paper is to present an algorithm which finds the minimal travelling time in a network where travelling along various edges may be restricted to given time intervals, and parking at the vertices is prohibited during the specified periods of time. Such a problem is present in the management of a railway system. When various journeys are already scheduled, an edge is closed in one direction for an additional train during the specified time intervals because other trains are scheduled to move on this edge in the opposite direction. Similarly, due to parking limitations in stations and junctions, there are no-parking periods for various vertices of the network.

• Corporate Authors:

  Elsevier Publishing Company, Incorporated

  52 Vanderbilt Avenue
  New York, NY  United States  10017
• Authors:
  • Halpern, J
• Publication Date: 1977-1

Media Info

• Features: References;
• Pagination: p. 1-11
• Serial:
  • Computer Methods in Applied Mechanics and Engineering
  • Volume: 10
  • Issue Number: 1
  • Publisher: North-Holland Publishing Company

Subject/Index Terms

• TRT Terms: Information processing; Network analysis (Planning); Operations research; Railroad facility operations; Railroads; Routes; Scheduling; Simulation; Transportation
• Uncontrolled Terms: Line capacity
• Old TRIS Terms: Route analysis
• Subject Areas: Data and Information Technology; Transportation (General);

Filing Info

• Accession Number: 00165168
• Record Type: Publication
• Source Agency: Engineering Index
• Files: TRIS
• Created Date: Dec 27 1977 12:00AM