KR-20260065391-A - METHOD FOR DISPATCHING A VEHICLE IN DEMAND RESPONSE TRANSPORT AND APPARATUS THEREOF

Abstract

The present invention relates to a vehicle dispatching method in demand-responsive public transportation (DRT), comprising: a step of obtaining origin and destination information of a customer when a new customer requests a vehicle; a step of obtaining route information of vehicles currently in operation based on the time of the vehicle request; a step of modifying the routes of the vehicles to pass through the origin and destination of the new customer and extracting a route between the origin and destination from the modified routes of the vehicles; and a step of detecting two transferable routes among the vehicles based on the extracted route information of the vehicles and dispatching the detected vehicles to the new customer.

Inventors

• 이유현
• 홍성록

Assignees

• 주식회사 케이티

Dates

Publication Date

20260508

Application Date

20241101

Claims (20)

1. In a vehicle dispatching method performed by a computing device, A step of obtaining the customer's starting point and destination information when a new customer calls for a vehicle; A step of obtaining route information of vehicles currently in operation based on the time of the vehicle call mentioned above; A step of modifying the routes of the vehicles to pass through the starting and ending points of the new customer, and extracting a route between the starting and ending points from the modified routes of the vehicles; and A vehicle dispatch method comprising the step of detecting two transferable routes among the vehicles based on route information of the extracted vehicles, and dispatching the detected vehicles to the new customer.
2. In paragraph 1, A vehicle dispatch method further comprising the step of determining whether one of the vehicles can be dispatched to the new customer based on the new customer's starting and ending point information and the route information of the vehicles.
3. In paragraph 1, the extraction step is, A vehicle dispatch method characterized by modifying the routes of the vehicles using a predetermined optimal route algorithm.
4. In paragraph 1, the dispatch step is, A step of detecting a plurality of spatial proximity points based on route information of the extracted vehicles; and A vehicle dispatch method characterized by including a step of checking whether at least one of the detected spatial proximity points satisfies predetermined distance and time conditions.
5. In paragraph 4, A vehicle dispatch method characterized in that the above-mentioned spatial proximity point is a pair of vehicle stopping points that are closest in distance among the vehicle stopping points of two routes.
6. In paragraph 4, The above distance condition is the distance of the above spatial proximity point ( ) is a condition corresponding to being within walking distance (r), and A vehicle dispatch method characterized by the above time condition being a condition in which the difference in vehicle arrival time at the spatial proximity point corresponds to a condition within the average travel time (T r ) of the walkable distance (r).
7. In paragraph 4, the above dispatch step is, A vehicle dispatch method characterized by further including the step of selecting one or more spatial proximity points satisfying the distance and time conditions as transfer candidate points when at least one of the detected spatial proximity points satisfies the predetermined distance and time conditions.
8. In Clause 7, the above dispatch step is, If there is only one selected transfer candidate point, a step of detecting that transfer candidate point as the final transfer point; If there are multiple selected transfer candidate points, the distance between a pair of stopping points among the multiple transfer candidate points ( A step of detecting the transfer candidate point with the minimum value as the final transfer point; and A vehicle dispatch method characterized by further including the step of detecting vehicles of two routes passing through the above-mentioned final transfer point as final transfer vehicles.
9. In paragraph 4, the above dispatch step is, A vehicle dispatch method characterized by further including the step of detecting a point that divides the distance of each spatial proximity point when all of the detected spatial proximity points do not satisfy predetermined distance and time conditions, and modifying the route of the extracted vehicles to pass through the detected point that divides the distance.
10. In Paragraph 9, A vehicle dispatch method characterized in that the above internal division point is determined based on the number of boarding/alighting customers of the two routes relative to the above spatial proximity point.
11. In Clause 9, the above dispatching step is, A vehicle dispatch method characterized by further including the step of selecting the internal division point as a transfer candidate point when the difference in vehicle arrival times at the internal division point is within a predetermined time.
12. In Clause 11, the above dispatch step is, If there is only one selected transfer candidate point, a step of detecting that transfer candidate point as the final transfer point; If there are multiple selected transfer candidate points, a step of detecting the transfer candidate point among the multiple transfer candidate points that has the minimum distance added due to route modification as the final transfer point; and A vehicle dispatch method characterized by further including the step of detecting vehicles of two routes passing through the above-mentioned final transfer point as final transfer vehicles.
13. A computer program stored on a computer-readable recording medium so that a method according to any one of claims 1 to 12 can be executed on a computer.
14. In a vehicle dispatching device comprising one or more processors, The above one or more processors are: An action of obtaining the customer's starting point and ending point information when a new customer calls a vehicle; An operation to obtain route information of vehicles currently in operation based on the time of the vehicle call mentioned above; The operation of modifying the routes of the vehicles to pass through the starting and ending points of the new customer, and extracting the route between the starting and ending points from the modified routes of the vehicles; and A vehicle dispatch device that, based on the route information of the extracted vehicles, detects vehicles of two transferable routes among the vehicles and performs the operation of dispatching the detected vehicles to the new customer.
15. In Paragraph 14, The above one or more processors are, A vehicle dispatching device that further performs the operation of determining whether one of the vehicles can be dispatched to the new customer based on the new customer's starting and ending point information and the route information of the vehicles.
16. In Clause 14, the above dispatch operation is, An operation to detect multiple spatial proximity points based on route information of the extracted vehicles; and A vehicle dispatch device characterized by including an operation to check whether at least one of the detected spatial proximity points satisfies predetermined distance and time conditions.
17. In Clause 16, the above dispatch operation is, A vehicle dispatching device characterized by further including the operation of selecting one or more spatial proximity points satisfying the distance and time conditions as transfer candidate points when at least one of the detected spatial proximity points satisfies the predetermined distance and time conditions.
18. In Clause 17, the above dispatch operation is, If there is only one selected transfer candidate point, the operation of detecting that transfer candidate point as the final transfer point; If there are multiple selected transfer candidate points, the distance between a pair of stopping points among the multiple transfer candidate points ( An operation to detect the transfer candidate point with the minimum value as the final transfer point; and A vehicle dispatching device characterized by further including an operation of detecting vehicles of two routes passing through the above-mentioned final transfer point as final transfer vehicles.
19. In Clause 16, the above dispatch operation is, If all of the detected spatial proximity points do not satisfy predetermined distance and time conditions, the operation of detecting a point that divides the distance of each spatial proximity point internally, and modifying the route of the extracted vehicles to pass through the detected internal division point; and A vehicle dispatch device characterized by further including the operation of selecting the internal division point as a transfer candidate point when the difference in vehicle arrival times at the aforementioned internal division point is within a predetermined time.
20. In Clause 19, the above dispatch operation is, If there is only one selected transfer candidate point, the operation of detecting that transfer candidate point as the final transfer point; If there are multiple selected transfer candidate points, the operation of detecting the transfer candidate point among the multiple transfer candidate points that has the minimum distance added due to route modification as the final transfer point; and A vehicle dispatching device characterized by further including an operation of detecting vehicles of two routes passing through the above-mentioned final transfer point as final transfer vehicles.

Description

Method for Dispatching a Vehicle in Demand-Responsive Public Transportation and Apparatus Thereof The present invention relates to a demand-responsive public transportation system, and more specifically, to a method and apparatus for efficiently dispatching a vehicle to a customer when a new customer requests a vehicle. Demand Response Transport (DRT) is a type of demand-responsive bus that optimally modifies its route in response to real-time customer requests. After collecting customer origin and destination information, it sequentially selects operating points using an algorithm that finds the most efficient route based on given conditions. For example, the Dijkstra algorithm selects the destination with the least loss as the next stop. Since DRT operates on fixed routes and generates boarding and alighting demand even while in operation, and routes are modified to reflect additional origin and destination information, customers assigned to existing routes face the problem of reduced service levels (boarding time/distance, waiting time, etc.) due to the route changes. In addition, when a new customer requests a vehicle, if it is difficult to assign all currently operating vehicles to the new customer, a new vehicle must be assigned. In this case, it places a heavy burden on areas with a shortage of vehicles, and there is a problem where the customer is unable to use the service. FIG. 1 is a flowchart illustrating a DRT dispatch method according to an embodiment of the present invention; FIGS. 2 to 9 are drawings referenced to explain the DRT dispatch method of FIG. 1; FIG. 10 is a block diagram of a computing device according to one embodiment of the present invention. Hereinafter, embodiments disclosed in this specification will be described in detail with reference to the attached drawings. Identical or similar components regardless of drawing symbols will be assigned the same reference number, and redundant descriptions thereof will be omitted. The suffixes "module" and "part" for components used in the following description are assigned or used interchangeably solely for the ease of drafting the specification and do not inherently possess distinct meanings or roles. That is, the term "part" used in this invention refers to a hardware component such as software, FPGA, or ASIC, and the "part" performs certain roles. However, the meaning of "part" is not limited to software or hardware. The "part" may be configured to reside in an addressable storage medium or may be configured to run one or more processors. Accordingly, as an example, a 'part' includes components such as software components, object-oriented software components, class components, and task components, as well as processes, functions, attributes, procedures, subroutines, segments of program code, drivers, firmware, microcode, circuits, data, databases, data structures, tables, arrays, and variables. The functionality provided within the components and 'parts' may be combined into a smaller number of components and 'parts' or further separated into additional components and 'parts'. In addition, when describing the embodiments disclosed in this specification, if it is determined that a detailed description of related prior art may obscure the essence of the embodiments disclosed in this specification, such detailed description is omitted. Furthermore, the attached drawings are intended only to facilitate understanding of the embodiments disclosed in this specification, and the technical concept disclosed in this specification is not limited by the attached drawings; it should be understood that they include all modifications, equivalents, and substitutions that fall within the spirit and technical scope of the present invention. The present invention proposes a method and apparatus for detecting vehicles on two transferable routes among currently operating vehicles when a new customer requests a vehicle, and for dispatching the detected vehicles to the new customer. Furthermore, the present invention proposes a method and apparatus for detecting a transfer vehicle and a transfer point to be dispatched to a new customer by utilizing the new customer's origin and destination information and the route information of currently operating vehicles when a new customer requests a vehicle. Hereinafter, various embodiments of the present invention will be described in detail with reference to the drawings. FIG. 1 is a flowchart illustrating a DRT dispatch method according to an embodiment of the present invention. The DRT dispatch method may be performed by a DRT dispatch device. The DRT dispatch device may be implemented through a computing device (1000). Although the illustrated flowchart describes the DRT dispatch method by dividing it into a plurality of steps, at least some of the steps may be performed in a different order, combined with other steps and performed together, omitted, divided into detailed steps, or performed with one or more ste