DYNAMIC BUS DISPATCHING AND LABOR ASSIGNMENT SYSTEM

• US 20100299177A1
• Filed: 05/22/2009
• Published: 11/25/2010
• Est. Priority Date: 05/22/2009
• Status: Abandoned Application

• Current Assignee: Disney Enterprises Incorporated (The Walt Disney Company)
• Original Assignee: Disney Enterprises Incorporated (The Walt Disney Company)
• Inventors: Kilmer, Kathleen A., Buczkowski, Peter S., Lord, Douglas C., Tortorici, Frank J. JR., Mola, Jose A., Simmons, Gary N., Kaufmann, Kurt G.
• Application Number:
  US12/470,750
• Publication Number:
  US 20100299177A1
• Time in Patent Office: Days
• US Class Current: 705/7.13
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
• CPC Class Codes: G06Q 10/06311 Scheduling, planning or task assignment for a person or group
• CPC Class Codes: G06Q 50/30 Transportation; Communications
• CPC Class Codes: G06Q 50/40 Business processes related to the transportation industry shipping G06Q10/083

Abstract

A method of dynamic bus dispatching and labor assignments based on real time vehicle and passenger data. The method includes running a transportation services module on a computer of a dispatch command center. The method includes receiving, at the computer system, current location information for a plurality of buses. The transportation services module determines a route completion time period for the vehicles and then generates a dispatch schedule for each of the vehicles based on the determined route completions. The dispatch schedules are transmitted to the buses and displayed on a monitor to the bus driver, thereby allowing real time or dynamic updating of dispatching based on collected location information. The method also includes determining and reporting a set of labor assignments for drivers of the buses based on the current location information, the route completion time periods, and break and shift information associated with each of the drivers.

Claims

1. A method of performing dynamic passenger-transport vehicle dispatching and dynamic labor assignments, comprising:

running a transportation services module with a processor on a computer system;

at the computer system, receiving current location information for a plurality of vehicles adapted for carrying passengers;

with the transportation services module, determining a route completion time period for each of the vehicles; and

with the transportation service module, generating a dispatch schedule for each of the vehicles based on the route completion time periods.

2. The method of claim 1, further comprising transmitting each of the dispatch schedules to the vehicles associated with the dispatch schedule for display on a monitor to a driver, whereby real time dispatching is provided to the drivers.

3. The method of claim 1, wherein the generating of the dispatch schedule further comprises determining demand for routes serviced by the vehicles based on counts of the passengers, wherein the dispatch schedule is modified based on the determined demand.

4. The method of claim 3, wherein the generating of the dispatch schedule further comprises determining service intervals for the routes serviced by the vehicles based on the received current location information, wherein the dispatch schedule is modified based on the determined service intervals and a set of predefined goal service intervals for the routes.

5. The method of claim 4, wherein the demand and service intervals are determined for a plurality of origin and destination pairs on the routes.

6. The method of claim 4, wherein the generating of the dispatch schedule further comprises assigning penalties to a set of the vehicles based on a comparison of the determined service intervals and the goal service intervals for the routes.

7. The method of claim 1, further comprising determining and reporting a set of labor assignments for drivers of the vehicles based on the current location information, the route completion time periods, and break and shift information associated with each of the drivers.

8. The method of claim 1, wherein the generating of the dispatch schedule comprises constructing a network flow model for a geographic service area for the vehicles and solving the network flow model to provide demand and service information for use by the transportation services module in creating the dispatch schedule for the vehicles on routes serviced by the vehicles.

9. A transportation system, comprising:

a plurality of buses;

an automatic passenger counter positioned on each of the buses;

a vehicle location mechanism positioned on each of the buses; and

a deployment system in wireless communication with the buses receiving count data from the buses from the automatic passenger counters and location information from the vehicle location mechanisms, wherein the deployment system inputs the count data and the location information into a network flow model in memory and, based on the network flow model generates and transmits dispatch schedule information for the buses.

10. The system of claim 9, wherein the count data is attributed to a plurality of origin-destination pairs associated with a plurality of routes services by the buses to determine demand for the buses including determining ridership for each of the buses for at least one of the OD pairs.

11. The system of claim 9, wherein the deployment system determines a next break or shift end for each of driver of the buses and based on the determined next break or shift ends for the drivers and on the location information, generates a set of labor assignments for the drivers including assignments of at least a portion of the drivers to the buses.

12. The system of claim 11, wherein the deployment system further determines a projected completion time of current routes for the buses based on the location information and wherein the generating of the set of labor assignments is performed based on the projected completion times.

13. The system of claim 9, wherein the deployment system further comprises a network flow model stored in the memory modeling routes within a geographic area services by the buses of the transportation system, wherein each of the routes comprises one or more origin-destination pairs, and wherein the network flow model is solved by the deployments system using the count data and the location information to determine demand for origin-destination pairs.

14. The system of claim 13, wherein the deployment system further determines service intervals for the origin-destination pairs and wherein the dispatch schedule information is generated based on a comparison of the determined service intervals and determined demand with transportation service levels stored in the memory.

15. A computer-based method for dynamically dispatching passenger-carrying vehicles and drivers for the vehicles on routes of a transportation system, comprising:

providing a dispatching system with a processor running a dispatch and driver assignment tool and with data storage storing a network flow model modeling the routes of the transportation system;

operating the dispatching system to receive location information from a plurality of the vehicles traveling the routes;

with the dispatch and driver assignment tool, solving the network flow model using the received location information; and

with the dispatch and driver assignment tool, generating a dispatch schedule for the vehicles based on the solved network flow model.

16. The method of claim 15, further comprising operating the dispatch and driver assignment tool to determine current locations of the vehicles within the transportation system, projecting completion times of the routes by the vehicles based on the determined current locations, and generating a labor assignment for the drivers based on the projected completion times and based on break or shift end times associated with each of the drivers.

17. The method of claim 15, further comprising receiving passenger count information from the vehicles and determining with the dispatch and driver assignment tool demand for the routes, wherein the solving the network flow model comprises using the determined demand.

18. The method of claim 15, wherein the routes each comprise a set of origin-destination pairs and the generating of the dispatch schedule comprises determining service intervals for each of the origin-destination pairs, comparing the determined service intervals with predefined goal service intervals stored in the data storage, and modifying the dispatch schedule when one or more of the determined service intervals is greater than one or more of the predefined goal service intervals.

19. The method of claim 15, wherein the operating of the dispatching system to receive the location information, the solving of the network flow model, and the generating dispatch schedule are performed at least every 2 hours during an operating period for the transportation system.

20. The method of claim 19, wherein the location information comprises global positioning satellite (GPS) information and is received at least every 15 minutes.