Methods to move plural sets of transportation objects through a single route in uniformed skip-stop patterns based on scheduling described by linear function equation

• US 20050273247A1
• Filed: 08/12/2005
• Published: 12/08/2005
• Est. Priority Date: 05/23/2003
• Status: Abandoned Application

• Current Assignee: Alla Litovchenko, Dmitry Denikin, Vitaliy Lyakir
• Original Assignee: Alla Litovchenko, Dmitry Denikin, Vitaliy Lyakir
• Inventors: Denikin, Dmitry, Litovchenko, Alla, Lyakir, Vitaliy
• Application Number:
  US11/203,572
• Publication Number:
  US 20050273247A1
• Time in Patent Office: Days
• US Class Current: 701/117
• 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 optimization with scheduling method whereas vehicles movement through a single route in skip-stop fashion due to application of algorithmic functions to uniform vehicles movement with extra benefits from multiple resources availability.

Claims

1. Method to schedule the attendance of stations constituted the transportation route by passenger vehicles moving in cyclical pattern,

wherein each said station is located at shorter distance from each neighboring said station than length of the run of said transportation vehicles between the neighboring stops on said route and therefore creating ability for passenger entering vehicle of said pattern of movement from each said station on said route using for trip no other transportation media than scheduled accordingly said movement pattern,

therefore run the consequent vehicles on uniform skip-stop movement pattern by alternative in their stop assignments sets through one-way transportation route consisting of station divisions identical in the quantitive content,

wherein having all said stations in each said division attended alternatively by each of said vehicle sets member only one time during each session of said division attendance by each said vehicle to be called “

Cycle”

,

therefore having said members of sets of vehicle performing each with equality in their movement pattern described in general by standard linear function equation,

wherein vehicles of plural sets providing passenger service to be called “

Liners”

,

comprising the steps of;

determining quantity of liner sets, constituted the cycle of service vehicles attendance;

determining desirable sequence of liner stops in single group of stations division;

determining stop designations after each liner at first cycle;

continue determining stop designations after each liner at next cycles;

determining all stop designations until the last one on service route after each liner for;

inertia factor to be minimized accordingly decreased demand in serving stops and vehicles'"'"' acceleration afterwards and accordingly decreased demand in vehicles quantity or in vehicle physical parameters,

operating costs to be minimized due to inertia factor minimized,

service speed factor to be maximized accordingly decreased demand in vehicles'"'"' stops and accordingly longer distance between neighboring stops for service vehicles therefore,

vehicle cumulative capacity factor to be maximized accordingly service speed factor increased,

traveling time cost for passenger to be decreased due to accesability of the transportation vehicle performing with increased speed from every station on transportation route.

2. Method to schedule the passenger vehicles movement of claim 1, wherein two or more groups of vehicle sets assigned to provide passenger service on the same route,

wherein each said group have difference in the quantity of service stations constituting said station divisions accordingly,

therefore one of said groups to be the complete set and to be called “

Liners”

, and other groups to be incomplete and to be called “

Shuttle”

,

comprising the steps of;

determining quantity of liner sets, constituted the cycle of stations attendance by service vehicle;

determining desirable sequence of liner stops in single liners'"'"' stations division;

determining stop designations after each liner for first cycle;

continue determining stop designations after each liner for next cycles;

determining all stop designations until the last one on service route after each liner;

determining shuttles'"'"' quantity in one cycle;

determining desirable sequence of shuttle stops in single shuttle stations division;

determining stop designations after each shuttle for first cycle;

continue determining stop designations after each shuttle for next cycles;

determining all stop designations until the last one on service route after each shuttle for;

inertia factor to be minimized accordingly decreased demand in serving stops and vehicles'"'"' acceleration afterwards and accordingly decreased demand in vehicles quantity or in vehicle physical parameters,

operating costs to be minimized due to inertia factor minimized,

service speed factor to be maximized accordingly decreased demand in vehicles'"'"' stops and accordingly longer distance between neighboring stops for service vehicles therefore,

vehicle cumulative capacity factor to be maximized accordingly service speed factor increased,

traveling time cost for passenger to be decreased due to accesability of the transportation vehicle performing with increased speed from every station on transportation route.

3. Method to schedule the passenger vehicles movement of claim 1, wherein said station divisions contain one or more additional stations designated as the mutual stops for all said transportation vehicles called “

Liners”

,

comprising the steps of;

determining quantity of liners sets;

locating the hubs in single stations division;

determining the cycle of stations attendance by service vehicle extended by hubs;

determining desirable sequence of liner stops in extended single stations division;

determining stop designations after each liner at first extended by hubs cycle;

continue determining stop designations after each liner at next extended by hubs cycles;

determining all stop designations until the last one on service route after each liner for;

inertia factor to be minimized accordingly decreased demand in serving stops and vehicles'"'"' acceleration afterwards and accordingly decreased demand in vehicles quantity or in vehicle physical parameters,

operating costs to be minimized due to inertia factor minimized,

service speed factor to be maximized accordingly decreased demand in vehicles'"'"' stops and accordingly longer distance between neighboring stops for service vehicles therefore,

vehicle cumulative capacity factor to be maximized accordingly service speed factor increased,

traveling time cost for passenger to be decreased due to accesability of the transportation vehicle performing with increased speed from every station on transportation route.