Algorithmic functions for scheduling systems and methods to move transportation objects through a single route in skip-stop fashion

• US 20040236503A1
• Filed: 05/23/2003
• Published: 11/25/2004
• Est. Priority Date: 05/23/2003
• Status: Active Application

• Current Assignee: Alla Litovchenko, Dmitry Denikin, Vitaliy L. Lyakir
• Original Assignee: Alla Litovchenko, Dmitry Denikin, Vitaliy L. Lyakir
• Inventors: Denikin, Dmitry, Lyakir, Vitaliy L., Litovchenko, Alla
• Application Number:
  US10/443,170
• Publication Number:
  US 20040236503A1
• Time in Patent Office: Days
• US Class Current: 701/201
• CPC Class Codes: G06Q 10/04 Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" market predictions or forecasting for commercial activities G06Q30/0202
• CPC Class Codes: G08G 1/123 indicating the position of vehicles, e.g. scheduled vehicles; Managing passenger vehicles circulating according to a fixed timetable, e.g. buses, trains, tramstransmission of navigation instructions to vehicles G08G1/0968

Abstract

Transportation system members'"'"' the functional optimization with new scheduling methods whereas vehicles'"'"' movement through a single route in skip-stop fashion due to application of algorithmic functions to uniform vehicle movement with extra benefits from multiple resources availability.

Claims

1. The uniform system for planning the vehicle'"'"'s movement through the one-route transportation system.

2. The methods for using an algorithmic function for seeking a transportation schedule wherein the operating costs are minimized, etc.

3. The methods for using an algorithmic function for seeking a transportation schedule wherein the operational speed and other technical features are maximized.