WO2015042452A1 - Système de gestion de distribution de transports d'itinérance - Google Patents

Système de gestion de distribution de transports d'itinérance Download PDF

Info

Publication number
WO2015042452A1
WO2015042452A1 PCT/US2014/056635 US2014056635W WO2015042452A1 WO 2015042452 A1 WO2015042452 A1 WO 2015042452A1 US 2014056635 W US2014056635 W US 2014056635W WO 2015042452 A1 WO2015042452 A1 WO 2015042452A1
Authority
WO
WIPO (PCT)
Prior art keywords
transport
customer
service zone
transports
service
Prior art date
Application number
PCT/US2014/056635
Other languages
English (en)
Inventor
Eric ZEILE
Benjamin EDELBERG
Daniel JUCKETT
Timothy Lee JUCKETT
Original Assignee
Metrobee, Llc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Metrobee, Llc filed Critical Metrobee, Llc
Publication of WO2015042452A1 publication Critical patent/WO2015042452A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/123—Traffic control systems for road vehicles indicating the position of vehicles, e.g. scheduled vehicles; Managing passenger vehicles circulating according to a fixed timetable, e.g. buses, trains, trams
    • G08G1/127—Traffic control systems for road vehicles indicating the position of vehicles, e.g. scheduled vehicles; Managing passenger vehicles circulating according to a fixed timetable, e.g. buses, trains, trams to a central station ; Indicators in a central station
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/20—Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles
    • G08G1/205—Indicating the location of the monitored vehicles as destination, e.g. accidents, stolen, rental
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40—Business processes related to the transportation industry

Definitions

  • the present apparatus and method relate to urban transportation systems.
  • U.S. Patent Publication 2013/0073327 discloses an urban transportation system and method, which provides flexible, door-to-door transportation service between customers within a service area surrounding a node of a station of an urban transportation system, such as a train station, subway station, etc.
  • a transport within a defined service area travels to the location of the customer and then transports the customer between the pick-up location and the node in the transportation system which is the central hub in the service zone.
  • the transport service request instructions are dynamically determined in real time with respect to the customer pick-up location, the current location of the transport, and a predetermined maximum allowable travel time between the customer pick-up and drop-off at the node.
  • the predetermined travel time may be calculated for a transport using the time that the customer reaches the transit node starting with the time of the pick-up request from the customer until the time the customer reaches the transit node or from the time the customer is picked up and dropped off at the node. Either time periods define the predetermined time period essential to efficient operation of the transit model.
  • the transit system must respond to a pick-up request from a customer by directing a transport at a second location within the service area surrounding node to the location of the customer, pick-up the customer and then travel by a flexible, real time determined route to the node so that the customer reaches the node within 15 minutes of initiating a pick-up request.
  • a roaming transport distribution apparatus and method for servicing customer requests for transportation of customers within a service zone includes operating a plurality of transports in a first service zone for transporting customers within the first service zone to and from a first hub and receiving a service request from a first customer at a first location in the first service zone for transportation of the first customer to and/or from the first hub.
  • the method locates one transport of the plurality of transports in the first service zone to answer the service request based on one or more of the location of the first customer, the location of the transport, the distance between the two locations, a travel time of the transport from its location to the customer location, and a travel time of the transport with the picked-up customer from the first location to the first hub or from the first hub to another customer destination.
  • a system manager sends a communication to a transport with a location to pick up the first customer.
  • the system manager further sends a communication to the transport of a travel route from pick up location of the first customer to a customer drop-off location.
  • the system manager directs the plurality of transports in the first service zone to unequally distributed locations with exclusive coverage areas of the transports which are disposed in a non- overlapping arrangement within the first service zone.
  • the method can further unequally distribute all of the transports in the first service zone based on one of population density, historic request density and traffic conditions, creating an exclusive coverage service area about each transport in the first service zone, where the coverage service areas are disposed in a dynamic arrangement with adjacent exclusive transport service sub-areas, and directing the plurality of transports in the first service zone to unevenly distributed locations with non-overlapping coverage areas.
  • the one transport is removed from roaming in the first service zone.
  • the method relocates the position of at least one other transport in the service zone so that the coverage areas of all of the transports are disposed in a dynamic arrangement to insure the predetermined transit time is met for all areas in the service zone.
  • the size and/or location of the coverage areas of at least one of the transports in the service zone is varied to meet the predetermined transit time at all locations within the first service zone.
  • the method further includes choosing the one transport of the plurality of transports to answer a service request where the location of the transport relative to a customer issuing a service request satisfies one of a minimum wait time of customer pick-up and a less than maximum transit time of the customer to the customer destination.
  • the method further includes reinserting a new transport into the first service zone and redistributing all of the coverage areas of the plurality of transports in the first service zone to insure distribution of the coverage areas in the first service zone without overlap.
  • the roaming transportation distribution apparatus includes a system manager choosing the one transport of the plurality of transports to answer a service request where the location of the transport relative to a customer issuing a service request satisfies one of a minimum wait time for customer pick-up and less than a maximum transit time of the customer to the customer destination.
  • the system manager wirelessly communicates travel information to each of the transports to optimize travel of a transport from a current location of the transport to a customer and/or from a customer pick-up location to a customer drop-off destination.
  • the system manager in response to removal of a transport from the plurality of transports in a first service zone when the transport is answering a service request, issues new coordinate
  • the system manager executing program instructions, based on current coordinate locations of the plurality of transports remaining in roaming in the first service zone, to vary a size of the coverage area of at least one of the remaining transports to meet transport transit times associated with responses to customer requests.
  • FIG. 1 is a conceptual diagram illustrating a transportation system providing transportation service to a service zone around a transit mode
  • Fig. 2 is a diagram showing the delivery of a passenger from a pick-up location in one service area to a destination location in another service area according to the method and apparatus;
  • FIG. 3 is a diagram illustrating the use of the present method and apparatus over multiple service areas
  • Fig. 4 is a schematic diagram illustrating the components of the apparatus for implementing the method
  • Fig. 5 is a blocked diagram showing the construction of the system manager
  • FIGs.6, 7, 8, and 9A-9D are pictorial representations illustrating the operation of the present apparatus and method to implement distribution of the transport transports within a service area;
  • Fig. 10 is a pictorial representation of the present method and apparatus implemented in multiple overlapping service areas
  • Fig. 11 is a flowchart depicting the operation of the apparatus and method for an inbound request.
  • FIGs. 12A and 12B are flow diagrams depicting the operation of the apparatus and method for an outbound request.
  • Fig. 1 depicts a service zone 100 which surrounds a centrally located node 102, which may be a train or subway station or a bus stop in an urban transit or transportation system, or any other transportation system having defined locations for transport vehicles to pick-up and drop off passengers.
  • the node 102 also acts as the central hub 102 of the service zone 100.
  • the service zone 100 is illustrated with multiple sub zones has service transports distributed through each of the sub zones to minimize travel time between the location of the transport, a pick-up location of a customer requesting a pick-up and the delivery of the customer to the end drop off destination. It is desirable to provide improvement to such a urban transportation system so as to minimize pick up time as well as meeting the maximum travel time to the drop off location.
  • the service zone 100 may be a single large defined area, with a circular service zone shown by way of example only. It will be understood that the service zone 100 may take other shapes, such as polygonal, triangular, oval, etc., depending upon geographic features surrounding the node 102, population density, service request density and other factors.
  • the service zone 100 is illustrated with concentric sub-zones 101, 103, 105 and 107, with four sub-zones shown in Fig. 1 spaced at one mile, two mile, three mile, and four mile radii, respectively, from the central hub 102.
  • Service transports (hereafter "transports") 104, 106 may be distributed throughout the sub-zones of the larger service zone 100 to minimize travel time between the location of the transport 104 and a pick up location 111 of a customer 110 initiating a pick-up service request.
  • the transports 104, 106 may be any type of transport, such as a car, minivan, bus, SUV, etc.
  • Each transport 104, 106, etc. has global positioning system (GPS) capability.
  • GPS global positioning system
  • a GPS transceiver can be mounted in each transport 104, 106 for communication with the global positioning satellite network to provide a central system manager with the current GPS coordinates of each transport 104, 106.
  • Each transport 104 and 106 also has wireless communication capability with the system manager.
  • the wireless communication capability can include a cellular network transmitter and receiver mounted in the vehicle for communication between the transport 104, 106 and the system manager via a cellular telephone network.
  • cellular wireless network transmitter and receiver mounted in the vehicle for communication between the transport 104, 106 and the system manager via a cellular telephone network.
  • communication can also be implemented by using the driver' s cellular telephone for direct communication via the cellular network with the system manager or through the cellular telephone system of the transport 104, 106.
  • Other forms of wireless communication including satellite communication, etc., can also be employed to transfer data between each transport 104, 106 and the central manager.
  • the overall size of the service zone 100 is selected so that predetermined transit time, such as 15 minutes for example, can be met for all customer pick-up requests at any location within the service zone 100 to the drop off destination.
  • one service zone 100 of a plurality of service zones shown in Fig. 3 can have larger or smaller overall dimensions than that of surrounding service zones.
  • Fig. 1 shows a travel route 108 taken by a transport 104 picking up a first customer 110 at a first location 111 and delivering the first customer 110 to the hub 102. It is possible that the transport 104 can pick up a second customer 112 at a second location 114 when transporting the first customer 110 to the node 102 as long as the predetermined transit time period can still be met.
  • the same predetermined transit time requirement can also apply to transporting a customer 120 from the hub 102 to a second location 122 within the service zone 100.
  • Fig. 2 depicts two service zones 100,130, one surrounding the hub 102, which will be described, for example, as utilizing transports 104 to pick-up a customer 109 and transport the customer 109 to the hub 102.
  • the customer 109 travels along the urban transit system 134 to a hub 132 in a second service zone 130.
  • a separate set of transports 136 transport the customer to drop off location 138 within the second service zone 130.
  • Fig. 3 depicts multiple service zones, each with a small amount of overlap with adjacent service areas arranged in a city or city area along urban transit lines.
  • each customer or potential customer 400 would utilize a communication device 402.
  • the communication device 402 may be any communication device, such as a cellular telephone, smartphone, laptop computer, tablet computer, desk- top computer etc., as long as the communication device 402 is capable of generating a pick-up request via wireless communication network 404, such as cellular network, to a system manager 406, also referred to as a server 406, as well as sending GPS location signals generated by use of a device capable of communication with GPS satellite 408 to identify the pick-up location of the customer 400.
  • Each transport 410 within the service zone 100 will also carry a communication device 412, such as a computer, a portable computer, a cellular telephone, tablet computer, etc., with wireless network communication and GPS communication capabilities.
  • a communication device 412 such as a computer, a portable computer, a cellular telephone, tablet computer, etc., with wireless network communication and GPS communication capabilities.
  • the server 406, as described hereafter, may be a physical computing device with at least one processor, memory, database and wireless and GPS communication capabilities, which communicates with the customers 400 and the transports 410 via the wireless communication network 404 using GPS location data generated by the communication devices 402 and 412 carried by each customer 400 and transport 410.
  • one customer 400 will generate a pick-up request by using an application on his communication device 402 to transmit his GPS location and the pick-up request through the wireless network 404 to the server 406.
  • the pick-up request may identify the customer's name and include other customer information as well as special instructions, including time deadlines, number of passengers, luggage, etc.
  • the server 406 In response to a pick-up request from a customer 400, the server 406, as described hereafter, will dynamically select one service transport 410 within the service zone 100 which is capable of traveling from the current location of the transport 410 to the location of the customer 400, pick up the customer, and then transport the customer along the fastest route to the hub within the predetermined maximum transit time period.
  • This direction of customer 400 travel from a pick-up destination to the node is referred to as an inbound transport.
  • the server 406 sorts the transports in the service zone to determine which transport is closest to the customer making the request in step 900. If the closest transport to the customer making the request is already at full occupant capacity, in step 902, then the server 406 advances to check the next closest transport in the service zone to the customer making the request.
  • the server 406 queries if the transport is roaming in step 904.
  • Roaming is the availability of a transport, either stationarily parked or moving within its defined coverage area, described hereafter, and available for customer transport. A transport is removed from roaming when a transport is directed to pick up a customer or is inbound or outbound with customer(s) to and from the hub in the service zone.
  • the server 406 advances to step 906 to query if the selected transport 410 is inbound to the hub. If the selected transport is not inbound to the hub as determined in step 906, the server 406 advances to the next closest transport.
  • step 904 if the server 406 determines that the selected transport is roaming, the server 406 determines if the wait time between the time that the customer made the request and the time that the selected transport 410 will arrive at the location of the customer is above a maximum wait time. If yes, the server 406 advances to select another transport.
  • the server 406 assigns the selected transport to the customer request in step 910.
  • step 912 queries where the selected transport will have to move in a direction away from the hub in order to pick up another customer making the current request. If the answer is yes from step 906, the server 406 advances to select another transport.
  • step 912 determines if the determination in step 912 is negative, the server 406 in step 914 queries if the selected transport is heading in a direction toward the same hub as the hub in the current customer request. If not, the server 406 selects another transport to honor the customer request. However, if the determination in step 914 is yes, the server determines in step 916 if the trip time for the selected transport of the first customer picked up by the transport will exceed the predetermined transit time, such as 15 minutes, for example, in step 916 if the transport picks up the second customer making the current request. If the transit time for the first customer is less than the predetermined transit time, such as 15 minutes, from step 916, the server assigns the selected transport to honor the customer request in step 918.
  • the predetermined transit time such as 15 minutes
  • the server 406 advances to select another transport to honor the current customer request.
  • Outbound transportation via transport from the hub is also possible after the customer arrives at the hub.
  • the customer communicates via the wireless network through his communication device 402 or other means of communication to the server 406 informing the server 406 of his expected arrival time at one particular hub, along with other customer identification, preferences, etc.
  • the server 406 then communicates with the driver of a transport 410 to insure that a transport 410 is at the hub at the time the customer 400 arrives at the hub.
  • the transport 410 picks up the customer 400 and transports the customer 400 to his or her drop off designation within the service zone 100. This will be referred to hereafter as an outbound transport.
  • the server 406 upon receiving an outbound request from a customer, sorts the transports in the service zone to determine which transport is closest to the hub in step 940. If the first selected transport is determined to be roaming in step 942, the server 406 assigns the selected transport to honor the customer outbound request in step 944.
  • the server 406 queries if the transport is inbound to the hub with customers in step 946. If answer is yes from step 946, the server 406 in step 948 queries if the outbound capacity of the selected transport has been reached. If the answer to the query in step 948 is yes, the server 406 advances to select another transport to honor the outbound customer request.
  • the server 406 determines if the outbound trip time of the selected transport is above the maximum wait time for the outbound customer request in step 950. If the determination is yes, the server 406 advances to select another transport. However, if the inbound trip time is below the maximum wait time to honor the outbound customer request, the server 406 in step 952 determines if the outbound trip time to the customer's destination is greater than the maximum transit time in step 952. If the determination is yes, the server 406 advances to select a different transport.
  • step 952 the server 406 queries in step 954 if the time between drop offs at the hub and the destination of the outbound customer request is too large. If the determination is yes, the server 406 advances to select a different transport. However, if the time between drop offs is not too large or is below a preset maximum time, the server 406 will assign a selected transport to honor the outbound customer request in step 956.
  • step 946 in Fig. 12A if the server 406 determines that the transport is not inbound with customers, the server 406 next checks if the inbound transport is without customers or is waiting at the hub in step 958. If this determination is negative, the server 406 checks for another transport.
  • step 958 determines if the outcome in step 958 is yes. If the outcome in step 958 is yes, the server 406 determines if the outbound capacity of the selected transport has been reached in step 960. If yes, the server 406 searches for another transport. If not, the server 406 determines in step 962 if the outbound trip time for all passengers in the transport is greater than the maximum predetermined transit time in step 962. If the outcome is yes, the server 406 searches for another transport.
  • step 964 determines if the time between drop off locations of the multiple customers going to different destinations in the same transport is greater than a maximum allowed time. If yes, the server 406 searches for a different transport. However, if not, the server 406 assigns the transport in step 966 to the new request.
  • the server 406 communicates via the wireless communication network 404 with the communication device 412 in the transport 410 and provides the driver of the transport 410 with the customer location, customer information, and other pertinent data.
  • the server 406 also transmits information pertaining to the most expeditious route from location of the transport 410 to the first location of the customer 400 and then from the first location to the hub.
  • the server 406 dynamically repositions the transport 410 within the service zone to optimum positions, even when the transport 410 is not transporting a customer or traveling toward a customer pick-up location. This enables the transports 410 within a service zone 100 to be optimally distributed in a manner responsive to population density and service request density in order to enable the predetermined maximum transit period to be met for all customers within a service zone.
  • the server 406 can dynamically change the location of one or more of the transports 410 within the service zone 100 at different times of the day to meet varying service request densities, such as morning rush hour, evening rush hour, afternoon or evening sporting events, etc.
  • the roaming transport distribution management system includes a system manager which may be incorporated into the server 406 shown in Fig. 4.
  • the system manager 406 includes a controller, such as a processor based computing device coupled to a database 504.
  • the controller 502 is responsible for creating, deleting, and managing all of the different components of the system manager.
  • the controller 502 creates hub monitors 506, which monitor one or more hubs 510 within a particular area. For example, a single hub monitor 506 can monitor five hubs 510.
  • the hub monitors 506 gather information necessary for the operation of the controller 502.
  • the hub monitors 506 carry out their own thread gathering asynchronously.
  • the hub monitors 506 primarily keep track of the location of each hub 510 and the area of coverage of the assigned hub 510.
  • a hub locator 508 accesses each of the hub monitors 506 to obtain information about the hubs 510.
  • the controller 502 passes the request to the hub locator 508 which creates a thread and processes the hub information to determine which hub 510 should receive the request.
  • the hub locator 508 is coupled to a hub dispatcher 514, which is responsible for sending the request to a hub, or the hub locator 508 has located hub manager 510 after it.
  • a notification manager 516 is provided as part of the system manager 407 to enable
  • the notification manager 516 also enables threads associated with each customer request and customer transport to the hub to notify other threads when they have completed their tasks. Each thread registers itself with the notification manager 516.
  • Each of the components of the system manager 407 registers itself with the notification manager 516.
  • the hubs 510 also register themselves with the controller 502, which in turn passes on the hub information to the hub monitors 506. If a hub monitor 506 is at full capacity with the predetermined number of hubs, the controller 502 will create a new hub monitor 506.
  • a hub locator 508 thread looks at all of the hubs 510 controlled by hub monitors 506 to locate the closest hub 510 within a certain predetermined distance range from the customer location issuing the request 512.
  • the hub managers 516 controlling each hub 510 include a roaming distribution transport algorithm for distributing transports within a service zone surrounding a hub 510 to enable each customer request 512 to be accepted and the customer delivered to the hub 510 within the predetermined maximum time period or window, such as 15 minutes for example.
  • a roaming distribution transport algorithm for distributing transports within a service zone surrounding a hub 510 to enable each customer request 512 to be accepted and the customer delivered to the hub 510 within the predetermined maximum time period or window, such as 15 minutes for example.
  • the illustrated service zone covers concentric circles up to a four-mile radius, it will be understood that the service zone, depending upon geographic factors, population density and request density, may have a larger or smaller service area, such as from one mile up to greater than four miles.
  • Prior transit applications provide an even distribution of the transports across the entire service zone. However, this does not take into account variations in population density, request density, geographic factor, etc.
  • the roaming distribution transport algorithm executed by each hub manager 510 automatically insures that the transports are distributed in a certain manner across the entire service zone so that a customer request originating from any location within the service zone can be honored within the predetermined transit time period met.
  • Figs. 6-9 depict the service zone 100.
  • the service zone 100 is illustrated as having a circular shape, it may have other shapes, such as rectangular, square, polygonal or an irregular peripheral boundary depending upon population density, transit request density, geographic factors, etc.
  • the service zone 100 can have any maximum radius.
  • the four-mile radius shown in Figs. 1-3 may be applied to the service zone 100.
  • the service zone 100 can represent the one-mile sub-zone of the service zone 100 shown in Figs. 1-3.
  • the service zone could also apply to the entire area covered by the two-mile radius, the three-mile radius, or the four- mile radius.
  • each transport is represented by a geometric exclusive coverage area 600, with the circular shaped coverage area shown by way of example only.
  • Each transport is located at approximately the center of its coverage area 600 and can be stationary, or moving within a small area generally centered within the coverage area 600.
  • the distribution algorithm eliminates overlaps between the coverage areas 600 of all of the transports within the service zone 100.
  • all of the transports have the same size exclusive coverage areas 600 as shown in Fig. 6.
  • the distribution algorithm while preventing overlap between any of the edges of coverage areas 600 of the transports, is capable of moving each coverage areas 600 including coverage areas 600A-600F both radially inward and outward, or circumferentially, or in any direction (straight, arcuate, zigzag, etc.), as shown by the arrows in Fig. 6, to achieve a transport distribution which places one transport within range of any customer issuing a request within the service zone 100 to meet the predetermined maximum transit time for moving a particular transport from the present location of the transport to the location of the customer issuing the request, picking up the customer, and then transporting the customer to the hub 602.
  • the transport in coverage area 600A has moved to pick up a customer and can be transiting toward the hub 602.
  • the hub manager 510 removes the transport 600A from roaming, as shown by the gap in Fig. 7 where coverage area 600A of the assigned transport has been removed. However, its coverage area 600A continues to impact the coverage areas of the remaining roaming transports.
  • the roaming distribution transport algorithm then rebalances the location of at least one or more of the remaining transports and their associated coverage areas 600 by slightly moving one or more of the coverage area 600 in circumferential, straight, curved, or radial directions to the distribution shown by example in Fig. 8.
  • the hub manager 510 for the service zone 100 moves, for example, coverage area 600 E radially inward to fill the gap left by the removal of the transport in coverage area 600A.
  • the arrows in the adjacent coverage areas shows some of the directions that the hub manager 510 can move each of the coverage areas.
  • any of the adjacent coverage areas 600B, 600C, 600E and 600F and their associated transports can also be moved to a new rebalanced distribution.
  • Fig. 9B depicts the operation of the hub manager 510 or server 406 in reinserting a transport back into service zone 100 after the transport has dropped off a customer at the hub 602.
  • the hub manager 510 reinserts a transport shown by its coverage area 600K in the innermost ring of coverage areas surrounding the hub 602.
  • the hub manager 510 rebalances the location of selected ones or all of the coverage areas 600A-600M in the service area 100, as shown in Fig. 9B, to accommodate the reinserted transport and its coverage area 600K.
  • the hub manager 510 operates in a similar manner when a transport has dropped off a customer at the customer destination at any location within the service zone 100, after transit from the hub 602 or from another location within the service zone 100.
  • the hub manager 510 can reinsert the transport, once the customer has been dropped off, at its then current location or direct a transport to a different location to fill a gap in the coverage areas within service zone 100.
  • Fig. 9A three gaps denoted by the removal of transport coverage areas 600H, 6001, and 600J are shown in service area 100.
  • the hub manager 510 and the server 406 can fill these gaps by also enlarging coverage areas associated with selected transports in addition to redistributing the coverage areas within the service zone 100.
  • the enlarged coverage areas 600J, 600L, and 600N still enable customer request within the service zone 100 to be met within the predetermined pickup and/or transit time.
  • the distribution algorithm also is capable of taking into account population density variations within the service zone 100, historic request density variations within the service zone 100, as well as the current distribution of transports within the service zone 100.
  • the distribution algorithm as shown in Fig. 9D, is capable of initially providing or varying the size, in the case of the coverage areas 600 and/or the radius or diameter of each coverage area 600, based on the population or historic request density variations within the service zone 100.
  • Fig. 9D shows multiple different diameter sizes of the coverage areas 600, with the size corresponding to the area of coverage for a particular transport located within each coverage area 600. Larger diameter circles, for example, indicate a larger coverage area for a particular transport. The smallest diameter circles indicate a small exclusive coverage area for a particular transport.
  • variable size indicator capability within the distribution algorithm, when a particular transport is removed from roaming distribution since it is transporting a customer to the hub 602, can redistribute and rebalance the remaining available transports by either resizing the diameter of the coverage area of one or more transports or by adjusting the position of one or more of the transport coverage areas, or both changing the size of certain coverage areas and rebalancing the position of some or all of the transports and their coverage areas.
  • the hub manager 510 will issue position commands to the effected transports via the communication network which direct the transports to change the center of their location, either the position at which they are parked or the center of the position about which they are roaming to a new position.
  • the algorithm can incorporate a distance tolerance so that the transports are not commanded to move only short distances, but commands will be issued only when a more significant difference, such as 400 meters for example, is necessary.
  • the hub manager 510 receives GPS signals from the transports indicating the current position of the transports and is therefore capable of both monitoring the location of all of the transports within the respective service zone as well as issuing commands for one or more of the transports to move to different geographic locations.
  • Fig 10 depicts a modification to the coverage area 100 described above.
  • the same central service area 100 around central node 102 still exists.
  • additional coverage areas with three coverage areas 800, 802 and 804 being shown by example, are each formed about separate nodes or hubs such as stations on mass transport lines. It will be understood that separate coverage areas, similar to coverage areas 800, 802 and 804, may be provided around each node or station in the transport area or only about certain hubs or stations.
  • Coverage areas 800, 802 and 804 may be the same size as the coverage area 100 or maybe smaller or larger in coverage areas. Further, the coverage areas 800, 802 and 804 can be separate from or, overlap each other and, in conjunction with the central coverage area 100 can form a single enlarged coverage area.
  • Transports as distributed and described above, in the central coverage area 100 may also serve the additional coverage areas 800, 802 and 804.
  • the distribution of the transports may be treated as a single large transport coverage area, including coverage areas 100, 800, 802 and 804, with transport roaming within the enlarged coverage area formed by the coverage areas 100, 800, 802 and 804 and changing which hub each transport goes to depending upon what is most efficient in terms of customer requests, transport location, customer destinations, customer pick up locations, time of day, etc.
  • the transports may be assigned and roam in the coverage area 100, including any of the overlapped areas of the coverage area 100 and the coverage areas 800, 802, and 804, where the transports may be dedicated to a specific coverage area 800, 802 and 804 for a primary pickup and delivery of customers from a pick-up point to an end destination, such as any of the coverage areas 800, 802 and 804, or from the hubs in the coverage areas 800, 802 and 804 to an end destination within or without of coverage areas 800, 802 and 804 to an end destination within or without the coverage areas 800, 802 and 804.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Human Resources & Organizations (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Educational Administration (AREA)
  • Remote Sensing (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente invention concerne un appareil et un procédé de gestion de distribution de transports d'itinérance. Un contrôleur sélectionne des transports à l'intérieur d'une zone de service définie en réponse à des demandes de transit d'un client en provenance d'emplacements du client ou d'un concentrateur central qui sont capables de satisfaire un temps de transit maximal vers la destination finale dans une direction soit arrivante soit partante à partir du concentrateur. Un gestionnaire de concentrateur varie la position et/ou la taille d'une aire de couverture exclusive de chaque transport à l'intérieur de la totalité de la zone de service afin d'assurer une accumulation dense de transports dans toute la zone de service et modifie la position d'autres transports en réponse au mouvement d'un transport arrivant ou partant à partir du concentrateur avec un passager. Le gestionnaire de concentrateur peut varier la taille de l'aire de couverture exclusive de chaque transport pour tenir compte de la population et des densités des appels de demande et du nombre de transports disponibles.
PCT/US2014/056635 2013-09-19 2014-09-19 Système de gestion de distribution de transports d'itinérance WO2015042452A1 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US201361879737P 2013-09-19 2013-09-19
US61/879,737 2013-09-19
US201461937880P 2014-02-10 2014-02-10
US61/937,880 2014-02-10

Publications (1)

Publication Number Publication Date
WO2015042452A1 true WO2015042452A1 (fr) 2015-03-26

Family

ID=52689467

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2014/056635 WO2015042452A1 (fr) 2013-09-19 2014-09-19 Système de gestion de distribution de transports d'itinérance

Country Status (1)

Country Link
WO (1) WO2015042452A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109325618A (zh) * 2018-09-12 2019-02-12 广东乐心医疗电子股份有限公司 快递、外卖行业的物流系统及方法

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040181326A1 (en) * 2003-03-14 2004-09-16 Adams Thomas Lee Network-Based Home Vehicular Management
US20060259353A1 (en) * 2005-05-31 2006-11-16 Gutmann Steven P Shared vehicle transportation systems and methods for individuals and entities
KR20100053717A (ko) * 2008-10-31 2010-05-24 (주)엠앤소프트 차량합승 시스템 및 그 방법
US20130073327A1 (en) * 2011-09-20 2013-03-21 Benjamin J. Edelberg Urban transportation system and method
US20130158846A1 (en) * 2010-08-26 2013-06-20 Yukang Zhang Intelligent urban public transportation system oriented to passenger travel and implementation method thereof

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040181326A1 (en) * 2003-03-14 2004-09-16 Adams Thomas Lee Network-Based Home Vehicular Management
US20060259353A1 (en) * 2005-05-31 2006-11-16 Gutmann Steven P Shared vehicle transportation systems and methods for individuals and entities
KR20100053717A (ko) * 2008-10-31 2010-05-24 (주)엠앤소프트 차량합승 시스템 및 그 방법
US20130158846A1 (en) * 2010-08-26 2013-06-20 Yukang Zhang Intelligent urban public transportation system oriented to passenger travel and implementation method thereof
US20130073327A1 (en) * 2011-09-20 2013-03-21 Benjamin J. Edelberg Urban transportation system and method

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109325618A (zh) * 2018-09-12 2019-02-12 广东乐心医疗电子股份有限公司 快递、外卖行业的物流系统及方法

Similar Documents

Publication Publication Date Title
US10055804B2 (en) Roaming transport distribution management system
JP7432649B2 (ja) ライドシェアリング（相乗り）を管理するためのシステムと方法
EP3659078B1 (fr) Systèmes et procédés de gestion et d'acheminement de véhicules de covoiturage
US11062415B2 (en) Systems and methods for allocating networked vehicle resources in priority environments
EP3358306B1 (fr) Appareil de commande de véhicule et procédé de commande de véhicule
US20190057479A1 (en) Systems and methods for dispatching vehicles
US20180211541A1 (en) Prepositioning Empty Vehicles Based on Predicted Future Demand
EP3738085A1 (fr) Systèmes et procédés de gestion et de planification de véhicules de covoiturage
EP3101600A1 (fr) Procédé de supervision et de commande de parcours de véhicules permettant d'optimiser l'utilisation de leurs capacités de charge
JP6788454B2 (ja) 配車システム
WO2019225045A1 (fr) Dispositif et procédé d'acheminement de véhicule, programme informatique et support d'enregistrement lisible par ordinateur
US11645918B2 (en) Coordinated dispatching of autonomous vehicle fleet
US10869066B2 (en) Media content delivery system
JP7060398B2 (ja) サーバ装置
TW201926236A (zh) 電池組優化輸送規劃方法
JP6951935B2 (ja) 動態管理サーバ、動態管理方法および動態管理プログラム
JP7154831B2 (ja) 車両管理システムおよび車両管理方法
EP3809360B1 (fr) Système d'exploitation de véhicules utilitaires
CN105679010A (zh) 一种基于ads的城市公交集中调度系统
JP7193936B2 (ja) 配車装置および配車方法
CN107527315B (zh) 提高安排即时响应和预定运输服务时的效率的系统和方法
CN115713868A (zh) 用于为车辆定位停车位的系统和方法
WO2015042452A1 (fr) Système de gestion de distribution de transports d'itinérance
WO2024097449A1 (fr) Procédé et système d'attribution dynamique de véhicules à des flottes
US20220366369A1 (en) Delivery fleet management

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 14845068

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 14845068

Country of ref document: EP

Kind code of ref document: A1