CN118230585A - Method for scheduling vehicles and related device - Google Patents

Method for scheduling vehicles and related device Download PDF

Info

Publication number
CN118230585A
CN118230585A CN202311503762.9A CN202311503762A CN118230585A CN 118230585 A CN118230585 A CN 118230585A CN 202311503762 A CN202311503762 A CN 202311503762A CN 118230585 A CN118230585 A CN 118230585A
Authority
CN
China
Prior art keywords
bus
platform
station
passenger flow
taxi
Prior art date
Legal status (The legal status 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 status listed.)
Pending
Application number
CN202311503762.9A
Other languages
Chinese (zh)
Inventor
孙永花
黄伟
吕凤娇
吴智利
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
BYD Co Ltd
Original Assignee
BYD Co Ltd
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 BYD Co Ltd filed Critical BYD Co Ltd
Priority to CN202311503762.9A priority Critical patent/CN118230585A/en
Publication of CN118230585A publication Critical patent/CN118230585A/en
Pending legal-status Critical Current

Links

Landscapes

  • Traffic Control Systems (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The embodiment of the application provides a method for dispatching vehicles and a related device. The method comprises the following steps: acquiring passenger flow of a platform; and dispatching other vehicles to the platform according to the passenger flow. By adopting the embodiment of the application, other vehicles except the linkage rail vehicle, such as buses, net buses and taxis, can be dispatched to the platform to carry passengers, so that passenger flow on the platform can be timely evacuated, and congestion caused by a large number of passengers staying at the platform can be avoided.

Description

Method for scheduling vehicles and related device
Technical Field
The application relates to the technical field of traffic control, in particular to a method for dispatching vehicles and a related device.
Background
When the number of passengers is exploded, such as holiday rush hour, there is a case where passengers get to the platform of the railway vehicle after they get to the station while taking the railway vehicle. If passengers are not evacuated in time, passengers may be left on the platform of the rail vehicle.
Disclosure of Invention
The embodiment of the application provides a method and a related device for dispatching vehicles, which can timely evacuate passengers detained on a railway vehicle platform by linking other vehicles (such as buses, net buses and taxis) so as to avoid congestion.
In a first aspect, an embodiment of the present application provides a method for scheduling a vehicle, the method including:
Acquiring passenger flow of a platform, wherein the passenger flow of the platform is used for indicating the number of passengers of the platform;
and dispatching other vehicles to the platform according to the passenger flow, wherein the other vehicles are used for passengers carried at the platform.
In the method, other vehicles except the railway vehicle are dispatched to carry passengers on the railway vehicle platform, so that passenger flow of the railway vehicle platform can be timely evacuated, and congestion caused by retention of a large number of passengers is avoided. Meanwhile, other vehicles are scheduled according to the passenger flow of the railway vehicle platform, so that the passenger flow evacuation scheme is more practical and flexible. Scheduling other vehicles can also reuse other vehicles' resources, and can maximize the transportation capacity of vehicles in the city.
In an optional aspect of the first aspect, the scheduling of other vehicles to the station according to the passenger flow includes:
And dispatching one or more of a target bus, a network taxi and a taxi to the platform according to the passenger flow.
In the above method, because the passenger gets off the platform, it may also be necessary to transfer other vehicles to the destination. If the passenger flow of the platform is too large, buses, taxis and net-bound cars near the platform may be difficult to meet the passenger flow of the platform, and one or more of target buses, net-bound cars and taxis may be scheduled to the platform for support.
In an optional aspect of the first aspect, the scheduling one or more of a target bus, a net bus, and a taxi to the platform according to the passenger flow includes:
and dispatching the target bus to the platform under the condition that the passenger flow of the platform is larger than a first threshold value in a preset time.
In the above method, the target bus forward support may be scheduled when the passenger flow increases within a preset time, for example, to be greater than a first threshold. The public transportation resources can be reused, the transportation passenger flow of the buses is improved, and the speed of evacuating and retaining passengers is further improved.
In an optional aspect of the first aspect, the scheduling the target bus to the station includes:
acquiring the congestion condition of a bus related to the platform;
and dispatching the target bus to the platform according to the congestion condition of the bus related to the platform.
In the above method, the target bus may be scheduled according to congestion of the bus related to the station. By analyzing the congestion situation of the buses related to the platform, the accurate congestion situation of the buses can be obtained, and therefore the support scheme of the target buses can be determined.
In an optional aspect of the first aspect, the acquiring a congestion condition of a bus associated with the station includes:
Acquiring one or more bus route data, wherein the bus route is related to the platform;
and determining a congested bus line and a congested bus stop according to the bus line data.
In the method, the congested bus line and the congested bus station are determined, and the bus line and the bus station needing to be supported can be known. The accuracy and the reliability of the passenger flow evacuation in the embodiment of the application are improved.
In an optional aspect of the first aspect, the target bus is a bus on a public line other than the congested bus line.
In the method, the target bus is a bus outside the congested bus route, and the bus is scheduled from other bus routes to support, so that the transportation capacity of the bus can be maximized.
In an alternative aspect of the first aspect, the target bus is determined according to a preset rule, the preset rule including one or more of the following: the distance from the starting station to the congestion bus station of the target bus, the number of stations at which the target bus stops from the starting station to the destination station and the passenger flow of the target bus.
In the method, the target buses are determined according to the preset rules, and the process of selecting the target buses is quantified according to the detailed rules, so that the determined target buses are more in line with actual traffic conditions.
In an optional aspect of the first aspect, the scheduling one or more of a target bus, a net bus, and a taxi to the platform according to the passenger flow includes:
and dispatching the target bus, the network bus and/or the taxi to the platform under the condition that the passenger flow of the platform is larger than a second threshold value in a preset time.
In the method, when the passenger flow of the platform increases in the preset time and is larger than the second threshold value, the passenger flow of the platform cannot be met by only dispatching the target bus. The target bus, net bus, and/or taxi may be dispatched to the platform simultaneously to evacuate passengers.
In a second aspect, an embodiment of the present application provides an apparatus for scheduling a vehicle, the apparatus including:
A communication unit for acquiring passenger flow of a station, wherein the passenger flow of the station is used for indicating the number of passengers of the station;
and the processing unit is used for dispatching other vehicles to the platform according to the passenger flow, wherein the other vehicles are used for passengers carried on the platform.
In an alternative aspect of the second aspect, the processing unit is specifically configured to schedule other vehicles to the station according to the passenger flow, and includes:
And dispatching one or more of a target bus, a network taxi and a taxi to the platform according to the passenger flow.
In an alternative aspect of the second aspect, the processing unit is specifically configured to schedule one or more of a target bus, a network bus, and a taxi to the platform according to the passenger flow, and includes:
and dispatching the target bus to the platform under the condition that the passenger flow of the platform is larger than a first threshold value in a preset time.
In an alternative aspect of the second aspect, the processing unit, in particular for dispatching the target bus to the station, comprises:
acquiring the congestion condition of the bus related to the platform through a communication unit;
and dispatching the target bus to the platform according to the congestion condition of the bus related to the platform.
In an alternative aspect of the second aspect, the communication unit is specifically configured to obtain a congestion situation of a bus associated with the station, and includes:
Acquiring one or more bus route data, wherein the bus route is related to the platform;
And determining the congested bus line and the congested bus stop according to the bus line data by the processing unit.
In an alternative aspect of the second aspect, the target bus is a bus on a public line other than the congested bus line.
In an alternative aspect of the second aspect, the target bus is determined according to a preset rule, the preset rule including one or more of the following: the distance from the starting station to the congestion bus station of the target bus, the number of stations at which the target bus stops from the starting station to the destination station and the passenger flow of the target bus.
In an alternative aspect of the second aspect, the processing unit is specifically configured to schedule one or more of a target bus, a network bus, and a taxi to the platform according to the passenger flow, and includes:
and dispatching the target bus, the network bus and/or the taxi to the platform under the condition that the passenger flow of the platform is larger than a second threshold value in a preset time.
In a third aspect, embodiments of the present application provide a computing device comprising a processor and a memory; the processor is coupled to a memory for storing a computer program for invoking and running the computer program to cause the computing device to perform the method as described in any of the preceding first aspects.
Optionally, the computing device further comprises a communication interface for receiving and/or transmitting data, and/or for providing input and/or output to the processor.
The above embodiment is described taking a processor (or general-purpose processor) for executing a method by calling a computer specification as an example. In particular implementations, the processor may also be a special purpose processor in which the computer instructions are already preloaded in the processor. In the alternative, the processor may include both a special purpose processor and a general purpose processor.
In the alternative, the processor and memory may be integrated in one device, i.e., the processor and memory may be integrated.
In a fourth aspect, embodiments of the present application provide a computer readable storage medium having a computer program stored therein, which when run on a computer or processor, implements a method as described in any of the preceding first aspects.
The advantages of the technical solutions provided in the second to fourth aspects of the present application may refer to the advantages of the technical solutions in the first aspect, and are not described herein.
Drawings
The drawings that are used in the description of the embodiments will be briefly described below.
FIG. 1 is a schematic diagram of a linked shunting system provided by an embodiment of the present application;
FIG. 2 is a schematic diagram of a rail vehicle scheduling system provided by an embodiment of the present application;
fig. 3 is a schematic diagram of a bus dispatching system according to an embodiment of the present application;
FIG. 4 is a schematic flow chart of a method for scheduling vehicles according to an embodiment of the present application;
FIG. 5 is a schematic illustration of a dispatch vehicle provided by an embodiment of the present application;
FIG. 6 is a block diagram of the functional units of a device for dispatching vehicles according to an embodiment of the present application;
Fig. 7 is a schematic structural diagram of a computing device according to an embodiment of the present application.
Detailed Description
Embodiments of the present application will be described in detail below with reference to the accompanying drawings.
The terms "first," "second," "third," and "fourth" and the like in the description and in the claims and drawings are used for distinguishing between different objects and not necessarily for describing a particular sequential or chronological order. Furthermore, the terms "comprise" and "have," as well as any variations thereof, are intended to cover a non-exclusive inclusion. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those listed steps or elements but may include other steps or elements not listed or inherent to such process, method, article, or apparatus.
The following describes a system architecture to which the embodiments of the present application are applied. It should be noted that, the system architecture and the service scenario described in the present application are for more clearly describing the technical solution of the present application, and do not constitute a limitation on the technical solution provided by the present application, and those skilled in the art can know that, with the evolution of the system architecture and the appearance of the new service scenario, the technical solution provided by the present application is applicable to similar technical problems.
Referring to fig. 1, fig. 1 is a schematic diagram of a linked shunting system according to an embodiment of the present application, where, as shown in fig. 1, the linked shunting system includes a rail vehicle dispatching system, a bus dispatching system, and a network taxi dispatching system. The rail vehicle dispatching system comprises a rail vehicle ticketing system, a rail vehicle big data passenger flow analysis system and a rail vehicle platform big data passenger flow analysis system. The bus dispatching system comprises a bus ticketing system, a bus station big data passenger flow analysis system and a bus big data passenger flow analysis system. The network taxi-booking and taxi dispatching system comprises a network taxi-booking and taxi-dispatching platform.
The linked shunting system can be arranged on electronic equipment with data processing capability and data transmission capability, such as a server, a computer, a notebook computer, a desktop computer, an Ultra-mobile Personal Computer (UMPC), a netbook and the like, and the embodiment of the application does not limit the equipment type of the electronic equipment. The linkage shunting system can dispatch target buses, network taxi or taxis to the platform through the bus dispatching system and the network taxi dispatching system according to the passenger flow of the platform so as to evacuate the passenger flow of the platform.
Referring to fig. 2, fig. 2 is a schematic diagram of a rail vehicle dispatching system according to an embodiment of the present application, and as shown in fig. 2, the rail vehicle dispatching system determines passenger flow of a platform through a rail vehicle ticketing system. Illustratively, the number of tickets arriving at each station within a predetermined time is obtained from a rail vehicle ticketing system, and then the number of tickets arriving at each station is compared to a threshold value for the first customer flow identification, resulting in a first customer flow identification for each station.
The rail vehicle dispatch system may also determine the passenger flow of the platform through a rail vehicle big data passenger flow analysis system. The rail vehicle big data traffic analysis system compares threshold values for the second traffic identifications according to the number of passengers getting off, and obtains the second traffic identifications of each platform.
The rail vehicle dispatch system may also determine the passenger flow of a rail vehicle platform through a rail vehicle platform big data passenger flow analysis system. Illustratively, the rail vehicle station big data traffic analysis system compares thresholds for the third traffic identifications based on the number of persons on the stations to obtain the third traffic identification for each station.
Accordingly, the rail vehicle dispatch system comprehensively determines whether to dispatch other vehicles to passengers on the platform based on the first passenger flow identifier, the second passenger flow identifier, and the third passenger flow identifier.
In one implementation, the rail vehicle dispatching system can also send data such as schemes for dispatching other vehicles, passenger flows of platforms, follow-up time information tables of rail vehicles and the like to the bus dispatching system, the network taxi dispatching system and the taxi dispatching system through interfaces among the systems.
Referring to fig. 3, fig. 3 is a schematic diagram of a bus dispatching system according to an embodiment of the present application, where, as shown in fig. 3, the bus dispatching system determines a congested bus line and a congested bus station through a bus ticketing system. Specifically, the passenger flow of the bus can be obtained through the number of people who get on the bus and brush the ticket, and then the congested bus route is determined. Passenger flow of the bus station can be obtained through the number of passengers getting off, and then the congested bus station is determined.
The bus dispatching system can also determine the congested bus stop through a bus stop big data passenger flow analysis system. Illustratively, a bus station big data passenger flow analysis system obtains video data on a bus station associated with a station. And then, determining the passenger flow on the bus station according to the video data, and determining the congested bus station according to the passenger flow on the bus station.
The bus dispatching system can also determine the congested bus route through a bus big data passenger flow analysis system. Illustratively, a bus big data passenger flow analysis system obtains video data on a bus line where a congested bus stop stops. And then, determining the passenger flow on the bus according to the video data on the bus route, and determining the congested bus route according to the passenger flow on the bus.
And finally, the bus dispatching system combines the analysis results of the bus ticketing system, the bus station big data passenger flow analysis system and the bus big data passenger flow analysis system to determine the congested bus route and the congested bus station.
In addition, the network taxi-booking and taxi dispatching system can dispatch the network taxi-booking and the taxi to the platform through the network taxi-booking and taxi-issuing platform. Therefore, the network taxi-taking and taxi dispatching system can receive the boarding point and the destination selected by the passengers through the network taxi-taking and taxi-issuing platform. The network taxi-taking and taxi-dispatching system can dispatch network taxi-taking and taxis to a passenger-selecting boarding point for carrying passengers.
Referring to fig. 4, fig. 4 is a schematic flow chart of a method for dispatching a vehicle according to an embodiment of the present application, where the method is applied to a linked shunting system as shown in fig. 1, and may specifically be an electronic device provided with the linked shunting system. As shown in fig. 4, the method includes, but is not limited to, the steps of:
in step S401, the electronic device obtains passenger flow of the platform.
Specifically, in order to solve the problem of congestion caused by a large number of passengers staying in a platform, it is possible to determine whether to start a scheme for evacuating the passenger flow according to the passenger flow of the platform, that is, the number of passengers in the platform. For obtaining the traffic of the platform, the application provides the following steps of determining the traffic of the platform:
Step one, the electronic equipment determines passenger flow of the platform according to ticket selling data.
The electronic device illustratively determines a first customer flow identification for each station based on the number of tickets sold to each station, which may be used to represent the flow of tickets sold to the station.
In one implementation, the electronic device obtains ticketing data within a preset time from the railway vehicle ticketing system at intervals, and determines the ticketing quantity reaching each station within the preset time according to the ticketing data. The electronic device then compares the number of tickets to each station with a threshold value for the first customer flow identification to obtain the first customer flow identification for each station.
For example, referring to table 1 and table 2, table 1 is ticketing data provided by an embodiment of the present application, and table 2 is a threshold table for the first customer flow identifier provided by an embodiment of the present application. It can be seen that table 1 shows the number of ticketing achieved for each station within one hour of the preset time. The threshold for the first customer flow identification is given in table 2, specifically, the first customer flow identification is 0 when the number of ticketing tickets arriving at the station is less than 500. The first customer flow is identified as 1 when the number of tickets to the station is greater than or equal to 500 and less than 600. The first customer stream is identified as 2 when the number of tickets arriving at the station is 600 or more. The threshold for the first customer flow identification described above: 500 and 600 may be set according to the requirements of different cities, and are not limited herein.
Based on tables 1 and 2, the electronic device may compare the number of tickets to each station with a threshold value for the first customer flow identification. Thus, the number of tickets arriving at station 2, station 3 and station 4 within the preset time is equal to 500, so that the first customer flow identification of station 2, station 3 and station 4 is 1. The number of tickets arriving at station 5 in the preset time is greater than 600 so the first customer flow at station 5 is identified as 2. The number of tickets arriving at stations 6 and 7 within the predetermined time is less than 500, so that the first customer flow identification of stations 6 and 7 is 0.
TABLE 1
TABLE 2
Passenger flow (upward) of railway vehicle ticketing system First customer flow identification
The ticket selling quantity is more than or equal to 600 (which can be set according to different city demands) 2
The ticket selling quantity is more than or equal to 500 and less than 600 (which can be set according to different city demands) 1
The ticket selling quantity is less than 500 (can be set according to different city demands) 0
And step two, the electronic equipment determines passenger flow of the platform according to the number of passengers getting off.
Illustratively, the electronic device obtains stations identified as 2 and 1 by the first stream obtained in step one above, such as station 5. The electronic device determines a second passenger flow identification for the stations having the first passenger flow identification of 2 and 1 based on the number of passengers getting off the stations within the preset time. The second traffic identification may be used to represent traffic arriving at the station.
Table 3 is a running schedule of a rail vehicle provided by an embodiment of the present application, and table 4 is a threshold table for a second passenger flow identifier provided by an embodiment of the present application. Taking station 5 with the first customer flow identification 2 as an example, all rail vehicles arriving at station 5 within a predetermined time period can be determined from table 3. Then, the electronic device acquires the number of passengers getting off the platform 5 from all the rail vehicles that arrive at the platform 5 within the preset time. The electronic device may compare the number of passengers getting off the platform 5 with the threshold value for the second passenger flow identifier in table 4, so as to obtain the second passenger flow identifier of the platform 5.
In one implementation, the electronic device may determine from table 3 that the rail vehicle arriving at platform 5 within the preset time contains 101 and 102 trains. Then, videos on the 101 trains and 102 trains in a preset time can be acquired through a rail vehicle big data passenger flow analysis system, and finally the number of passengers getting off the platform 5 is obtained according to the videos on the 101 trains and 102 trains.
Based on table 4, the electronic device may compare the number of passengers getting off at the station 5 obtained above with the threshold value for the second passenger flow identifier in table 4, to obtain the second passenger flow identifier of the station 5. For example, in the preset time, the number of passengers for a 101-train to get off the platform 5 is 80, and the number of passengers for a 102-train to get off the platform 5 is 60. The average number of passengers getting off the platform 5 for the two trains is 70 in the preset time. The electronic device compares the resulting average passenger number to the threshold value for the second passenger flow identification in table 4, since 70 is greater than threshold value for the second passenger flow identification 60. The second traffic identification of station 5 is therefore 1. Wherein the threshold for the second passenger flow identification in table 4: 60 can be set according to the requirements of different cities, and are not limited herein.
TABLE 3 Table 3
TABLE 4 Table 4
Passenger flow of railway vehicles Second passenger flow identification
The number of passengers is more than or equal to 60 (which can be set according to different city demands) 1
The number of people with the passenger flow is less than 60 (can be set according to different city demands) 0
And thirdly, the electronic equipment determines the passenger flow of the platform according to the number of people on the platform.
Illustratively, the electronic device obtains stations identified as 2 and 1 by the first stream obtained in step one above, such as station 5. The electronic device determines a third traffic identification for stations with first traffic identifications 2 and 1 based on the number of people at these stations for a predetermined time. A third traffic identification may be used to represent traffic for the station.
For example, table 5 is a threshold table for the third passenger flow identifier provided by an embodiment of the present application. As can be seen from table 5, when the number of persons on the platform is greater than or equal to 1000, the third passenger flow identification of the platform is 2. When the number of people on the platform is more than or equal to 600 and less than 1000, the third passenger flow mark of the platform is 1. When the number of persons on the station is less than 600, the third traffic sign of the station is 0. Wherein the threshold for the third passenger flow identification in table 5: 1000 and 600 may be set according to the needs of different cities, and are not limited herein.
TABLE 5
Platform passenger flow Third passenger flow identification
The number of people with passenger flow is more than or equal to 1000 (which can be set according to different city demands) 2
The number of passengers is 600 or more and less than 1000 (which can be set according to different city demands) 1
The number of people with passenger flow is less than 600 (which can be set according to different city demands) 0
The electronic device may acquire the video on the platform within a preset time, for example, the video on the platform 5 within 1 hour, through the rail vehicle station big data passenger flow analysis system. The electronics then derive the number of people on the station 5 in 1 hour from the video on the station 5. The electronic device may compare the resulting number of persons on station 5 with the threshold value in table 5 for the third passenger flow identification, e.g. 1100 for station 5, since 1100 is greater than 1000, then the third passenger flow identification for station 5 is 2.
Step S402, other vehicles are scheduled to the platform according to the passenger flow.
Specifically, the electronic device may determine whether to schedule one or more of the target bus, the net bus, and the taxi to the station according to the passenger flow of the station determined by step S401. Further, the electronic device may comprehensively determine whether to schedule other vehicles to passengers on the platform based on the first passenger flow identifier, the second passenger flow identifier, and the third passenger flow identifier obtained by the passenger flow of the platform. If it is determined that other vehicles need to be dispatched to the platform, the electronic device may further determine whether to dispatch the bus to the platform or to dispatch the bus, the network bus and/or the taxi to the platform simultaneously according to the first customer flow identifier, the second customer flow identifier and the third customer flow identifier of the platform.
In one possible implementation, the electronic device schedules the target bus to a bus stop near the stop according to the passenger flow of the stop, and carries passengers on the stop. Further, the electronic device determines that another vehicle is required to evacuate passengers from the platform in the case that the passenger flow of the platform is greater than the first threshold value within the preset time. Specifically, the electronic device may schedule the target bus to a bus stop near the stop to pick up passengers.
The situation that the passenger flow of the platform is greater than the first threshold value in the preset time can be understood as that the passenger flow of the platform is excessive, and if the passenger needs to transfer the bus to the destination after arriving at the platform, the capacity of the bus route near the platform is difficult to meet the passenger flow of the platform. The electronic device may schedule the target bus to travel to a bus stop near the stop for support.
Table 6 is a rule for scheduling vehicles provided by an embodiment of the present application. The embodiment of the application further quantifies the first threshold through the first customer flow identifier, the second customer flow identifier and the third customer flow identifier in step S401. As can be seen from table 6, the electronic device can schedule the destination bus to the station both with the first customer flow identification 1, the second customer flow identification 1, and the third customer flow identification 1, and with the first customer flow identification 2, the second customer flow identification 1, and the third customer flow identification 2.
TABLE 6
In one possible implementation, the electronic device obtains congestion conditions of buses associated with the station and then dispatches the target bus to a bus station in the vicinity of the station according to the congestion conditions. The electronic device obtains the congestion condition of the bus, namely, obtains the congestion bus line and the congestion bus stop, so that the electronic device can conveniently schedule the target bus to go to the congestion bus stop to support the congestion bus line.
In one possible implementation, the electronic device obtains one or more bus route data related to the platform through the bus ticketing system, and then determines a congested bus route and a congested bus platform according to the bus route data. Bus lines associated with a stop may also be understood as bus lines having a bus stop near the stop.
Referring to table 7, table 7 is bus route data provided in the embodiment of the present application. As can be seen from table 7, the bus routes associated with the platform include 963 buses, 964 buses, and 965 buses. Wherein, 963 buses include bus station 963_1 and bus station 963_2 near the platform, 964 buses include bus station 964_1 and bus station 964_2 near the platform, 965 buses include bus station 965_1 and bus station 965_2 near the platform. The passenger flow of the buses can be obtained by the number of people who get on the buses to brush the tickets, and then the congested bus route is determined. The passenger flow of the bus station can be obtained by the number of passengers getting off, and then the congested bus station is determined.
TABLE 7
Specifically, taking 963 buses, 964 buses and 965 buses in table 7 as examples, if the number of tickets sold by 963 buses is 200, the number of tickets sold by 964 buses is 80 and the number of tickets sold by 965 buses is 98 in a preset time, for example, in one hour. The electronic device may determine a congested bus route based on a bus congestion threshold. The bus congestion threshold value provided by the embodiment of the application can be set according to actual conditions as follows:
Bus congestion threshold = number of bus nuclear traffic x number of bus trips x percentage
For example, the number of bus nuclear carriers provided by the embodiment of the application is 50, the number of bus passes in one hour is 4, and the percentage is 90% of the total bus population. Therefore, the bus congestion threshold is 180. Because 963 buses sell ticket number greater than the bus congestion threshold value, the electronic device can initially determine 963 buses as congested bus routes.
In one possible embodiment, as can be seen from table 7, the bus line is provided with two bus stops, an up-going bus stop and a down-going bus stop, near the stops. The electronic equipment can also determine the congestion bus stop needing to be supported from the two uplink bus stops and the two downlink bus stops according to bus line data.
Taking 963 buses determined as the congested bus route as an example, the number of times of upward and downward going of 963 buses in one hour is 4. And the number of people getting off the bus station 963_1 by 963 buses within this hour is 10, 12, 10 and 11, and the number of people getting off the bus station 963_2 by 40, 35, 42 and 43.
The electronic device may obtain the average number of passengers off bus stops 963_1 and 963_2 according to the following formula:
N Flat plate =(N1+N2+N3+N4) number of passes
Wherein N Flat plate is the average number of passengers getting off the bus stop, and N 1、N2、N3 and N 4 correspond to the number of passengers getting off the bus stop for each bus.
From the above formula, the average number of passengers off bus stop 963_1 is 11, and the average number of passengers off bus stop 963_2 is 40. Therefore, the electronic device may determine that bus station 963_2 is a congested bus station.
In one possible implementation manner, in addition to determining the congested bus line and the congested bus station according to the bus line data, the embodiment of the present application may verify whether the obtained result of the congested bus line and the congested bus station is correct according to the video data on the bus and the video data on the bus station. The method comprises the following specific steps:
Step one, the electronic equipment determines a congested bus stop through a bus stop big data passenger flow analysis system. Specifically, the electronic device acquires video data on a bus stop related to the stop through a bus stop big data passenger flow analysis system. And then, the electronic equipment determines the passenger flow on the bus station according to the video data, and determines the congested bus station according to the passenger flow on the bus station.
Step two, the electronic equipment acquires all bus routes stopped at the congested bus station according to the congested bus station obtained in the step one. The electronic equipment acquires video data on a public traffic line where a congested bus stop stops through a bus big data passenger flow analysis system. Then, the electronic equipment determines passenger flow on the bus according to the video data on the bus route, and determines the congested bus route according to the passenger flow on the bus.
For example, if the electronic device analyzes that the number of people collected on the bus stop 963_2 is the largest among the bus stops related to the stops, the number of passengers on the bus 963 is the largest before the bus 963_2 is reached. And the electronic device determines 963 that the passenger flow of the bus is increased within 1 hour according to the bus ticketing system. Therefore, the electronic device needs to schedule the destination bus to go to the bus stop 963_2 for support.
Table 8 shows a bus schedule provided by an embodiment of the present application, and as can be seen from Table 8, the departure interval of 963 buses is 20 minutes. In order to meet the passenger flow of the platform, the electronic equipment can shorten the departure interval of 963 buses, and generate a new bus schedule to schedule the buses.
TABLE 8
In one possible implementation, the electronic device may schedule the target bus to a congested station to support a congested bus line. The target bus is a bus on a public line other than the congested bus line, and the electronic device can determine the target bus according to a preset rule.
Specifically, the electronic device scores buses except for the congested bus route according to a preset rule, and selects the optimal bus as the target bus according to the scoring result. The preset rules are specifically as follows:
And (3) according to a rule I, scoring according to the distance from the starting station to the congestion station of the target bus. Since the time required for the target bus to reach the congested station is as short as possible, scoring can be done on a nearby basis. For example, the electronic device may score 1 for the bus closest to the congested station at the start station, 2 for the bus second closest to the congested station at the start station, and so on, with the largest score for the bus furthest from the congested station at the start station.
And secondly, scoring according to the number of bus stops where the target bus stops from the starting station to the destination station. The electronic equipment obtains the number of bus stops at the starting station to the destination station of all the bus lines except the congested bus line. The bus with the least number of bus stops can be scored as 1, the bus with the second least number of bus stops can be scored as 2, and the score of the bus with the most number of bus stops is highest.
And thirdly, scoring according to passenger flow of the target bus. Because the target bus is called to support other bus lines, the influence on the transportation passengers on the bus line of the target bus needs to be reduced. Therefore, the electronic device can acquire the passenger flows of all buses except the congested bus route in the preset time. The bus with the least passenger flow is scored as 1, the bus with the second least passenger flow is scored as 2, and the score of the bus with the largest passenger flow is highest.
And the electronic equipment integrates scoring results obtained by the rule I, the rule II and the rule III, and selects the bus with the lowest score as the target bus.
For example, the 101 st bus in the bus route 325 is determined as the target bus. The electronic equipment obtains that the target bus still reaches the destination station of the target bus for 10 minutes through the bus dispatching system, and the time from the destination station to the congested bus station of the target bus is 5 minutes. Therefore, the time for the target bus to reach the congested bus stop from the current time is 15 minutes. The electronic device generates a new bus schedule for bus 101 in bus line 325. For example, the current time is 9:10, the electronic device modifies the bus route of the 101 st bus to be a congested bus route (e.g. 963), and the target bus is at 9:25 from a start station (e.g., bus station 963_2).
In one possible implementation, the electronic device sends the bus schedule of the target bus to the bus dispatch system, and displays the current route with the support condition to other buses with a bus route 325, so as to prompt the passengers to pay attention. And displaying the route to the jammed platform and the route map of the jammed bus route on the target bus navigation interface. After receiving the route, the driver of the target bus can reply a signal for executing the support task to the electronic equipment.
In one possible implementation, the electronic device schedules a target bus, network bus, and/or taxi to the platform based on the passenger flow at the platform. Further, in the case where the passenger flow of the platform is greater than the second threshold value within the preset time, the embodiment of the schedule target bus described above cannot satisfy the passenger flow of the platform because the second threshold value is greater than the first threshold value. The electronic equipment can dispatch the target buses and meanwhile dispatch the network to the platform for the passengers on the platform by the taxi or both, so that the passenger flow pressure is relieved.
The traffic at the station greater than the second threshold for the preset time may correspond to the situation in table 6 where the first traffic is identified as 2, the second traffic is identified as 1, and the third traffic is identified as 2. In this case, the electronic device needs to schedule buses, net jockey cars and/or taxis simultaneously to meet the passenger flow at the platform.
For example, the electronic device may schedule network reservations and/or taxis to the platform through a network reservation, taxi scheduling system.
For example, the electronic device may also obtain the phone number of the passenger getting off the platform through the rail vehicle dispatching system, and send the passenger "current bus station 963_2 is congested, whether the user needs to directly call the internet for a taxi or not, if so, click on the" no negligible "information is needed to the passenger's mobile phone. If the passenger chooses to call the network taxi or the taxi, the click is yes. The electronic equipment can receive a request that a passenger needs to call a network taxi or a taxi, and displays a taxi booking interface of the network taxi or the taxi to the passenger through the network taxi booking and taxi dispatching system. And dispatching the network to get on the bus or taxi to carry the passengers to the get-on place according to the get-on place and the destination selected by the passengers at the bus-on interface.
In the case where the traffic at the station does not satisfy the first traffic identifier 2, the second traffic identifier 1, and the third traffic identifier 2, that is, the traffic at the station drops, the electronic device may not schedule the other vehicles to the station, and the other vehicles may resume normal operation. For example, if the electronic device schedules the target bus to the platform, the electronic device may restore the bus schedule of the target bus to the normal condition, so that the target bus returns to the original line operation. If the electronic device shortens the shift of the congested bus route, for example, the shift of 963 buses can be restored to the original shift. If the electronic equipment schedules the network taxi passing through the taxi and/or the taxi to the platform, the electronic equipment can restore the operation of the network taxi and/or the taxi through an interface of the network taxi scheduling system.
Referring to fig. 5, fig. 5 is a schematic diagram of a dispatching vehicle according to an embodiment of the application. As shown in fig. 5, the specific steps for scheduling vehicles are as follows:
S501, passenger flow of the platform is acquired. Specifically, the electronic equipment acquires uplink and downlink ticketing data of the railway vehicle ticketing system within 1 hour every 20 minutes through the railway vehicle scheduling system, and analyzes passenger flows of a platform and passenger flows of railway vehicle carriages.
S502, if the passenger flow reaches the scene of the linked bus dispatching system, entering S503, and if not, returning to S501.
S503, linking the bus dispatching system to determine the congested bus line and the congested bus stop. The electronic equipment linkage bus dispatching system determines a congested bus line and a congested bus station by analyzing ticket selling data of a bus line related to the station, passenger getting-off data and passenger flow on the bus and the bus station.
S504, scoring the buses according to preset rules. And the electronic equipment scores buses except the congested bus line according to preset rules. The preset rules include one or more of the following: the distance from the start station to the congested bus station of the target bus, the number of bus stations at which the target bus stops from the start station to the destination station, and the passenger flow of the target bus.
S505, determining the target bus according to the scoring result. And the electronic equipment compiles the target bus into the congested bus route according to the scoring result.
S506, the electronic equipment dispatches the target bus to the congested bus stop to evacuate the passenger flow.
S507, if the passenger flow reaches the scene of the linkage network taxi-taking and taxi scheduling system, entering S508 if yes, and returning to S501 if not.
S508, sending a vehicle use request to the passenger. The electronic equipment acquires the telephone number of the passenger getting off the platform through the railway vehicle ticketing system, and sends the current bus platform congestion to the passenger, and a request for calling a network to order a car and/or a taxi is required.
S509, displaying a car-restraining interface. When the electronic equipment receives a request for calling the network taxi and/or the network taxi from the passenger, the electronic equipment can display a taxi-booking interface to the passenger through the network taxi-booking and taxi-dispatching system. The passenger selects a get-on point and a destination on the taxi-engaging interface, and calls a net taxi and/or a taxi.
S510, the electronic equipment schedules the network taxi to the taxi taking point selected by the passenger to take the passenger, so as to relieve the passenger flow of the platform.
The foregoing details of the method according to the embodiments of the present application and the apparatus according to the embodiments of the present application are provided below.
Referring to fig. 6, fig. 6 is a block diagram illustrating a functional unit of a device for dispatching a vehicle according to an embodiment of the present application. The apparatus 60 for scheduling vehicles may include a communication unit 601 and a processing unit 602. The vehicle dispatching device 60 is used for implementing the vehicle dispatching method described above, such as the vehicle dispatching method shown in fig. 4.
The division of the plurality of units is merely a logical division according to functions, and is not limited to a specific configuration of the device 60 for modulating the vehicle. In a specific implementation, some of the functional modules may be subdivided into more tiny functional modules, and some of the functional modules may be combined into one functional module.
In a possible embodiment, the communication unit 601 is configured to obtain passenger flow of the station, where the passenger flow of the station is used to indicate the number of passengers at the station;
the processing unit 602 is configured to schedule other vehicles to the platform according to the passenger flow, where the other vehicles are used for passengers carried at the platform.
In another possible implementation, the processing unit 602 is specifically configured to:
And dispatching one or more of a target bus, a network taxi and a taxi to the platform according to the passenger flow.
In another possible implementation, the processing unit 602 is specifically configured to:
and dispatching the target bus to the platform under the condition that the passenger flow of the platform is larger than a first threshold value in a preset time.
In another possible implementation, the processing unit 602 is specifically configured to:
acquiring the congestion condition of the bus related to the platform through a communication unit 601;
and dispatching the target bus to the platform according to the congestion condition of the bus related to the platform.
In another possible implementation, the communication unit 601 is specifically configured to:
acquiring one or more bus route data, wherein the bus route is a bus route related to a platform;
The congested bus line and the congested bus stop are determined by the processing unit 602 from the bus line data.
In another possible implementation, the target bus is a bus on a bus line outside the congested bus line.
In another possible embodiment, the target bus is determined according to a preset rule including one or more of the following: the distance from the starting station to the congested bus station of the target bus, the number of stations at which the target bus stops from the starting station to the destination station, and the passenger flow of the target bus.
In another possible implementation, the processing unit 602 is specifically configured to:
and dispatching the target bus, the network bus and/or the taxi to the platform under the condition that the passenger flow of the platform is larger than a second threshold value in a preset time.
It should be noted that, in the embodiment of the present application, the specific implementation and the technical effect of each unit may also correspond to the corresponding description of the method embodiment shown in fig. 4.
Referring to fig. 7, fig. 7 is a schematic structural diagram of a computing device according to an embodiment of the application. As shown in fig. 7, the computing device 70 may include: one or more processors 701, one or more memories 702, and one or more communication interfaces 703. These components may be connected by a bus 704 or otherwise, fig. 7 being an example of a connection via bus 704. Wherein:
The communication interface 703 may be used for the computing device 70 to communicate with other communication devices, such as other computing devices. In particular, the communication interface 703 may be a wired interface.
Memory 702 may be coupled to processor 701 through bus 704 or an input/output port, or memory 702 may be integrated with processor 701. Memory 702 is used to store various software programs and/or sets of instructions or data. In particular, memory 702 may be, but is not limited to, read-only memory (ROM) or other type of static storage device that may store static information and instructions, random access memory (random access memory, RAM) or other type of dynamic storage device that may store information and instructions, or electrically erasable programmable read-only memory (ELECTRICALLY ERASABLE PROGRAMMABLE READ-only memory, EEPROM), compact disc read-only memory (compact disc read-only memory) or other optical disk storage, optical disk storage (including compact disc, laser disc, optical disc, digital versatile disc, blu-ray disc, etc.), magnetic disk storage media or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. The memory 702 may include high-speed random access memory and may also include non-volatile memory, such as one or more magnetic disk storage devices, flash memory devices, or other non-volatile solid state storage devices. The memory 702 may store an operating system (hereinafter referred to as a system), such as an embedded operating system uCOS, vxWorks, RTLinux. The memory 702 may also store network communication programs that may be used to communicate with one or more additional devices, one or more user devices, and one or more terminals. The memory 702 may be implemented separately and coupled to the processor 701 via bus 704. Memory 702 may also be integrated with processor 701.
The memory 702 is used for storing application program codes for executing the above schemes, and the execution is controlled by the processor 701. The processor 701 is configured to execute application code stored in the memory 702.
The processor 701 may be a central processor unit, a general purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. Which may implement or perform the various exemplary logic blocks, modules and circuits described in connection with this disclosure. The processor 701 may also be a combination that performs certain functions, such as a combination comprising one or more microprocessors, a combination of a digital signal processor and a microprocessor, or the like.
In an embodiment of the application, the processor 701 may be configured to read and execute computer readable instructions. In particular, the processor 701 may be configured to invoke a program stored in the memory 702 for performing the following operations:
the communication interface 703 acquires passenger flow of the station, wherein the passenger flow of the station is used for indicating the number of passengers of the station;
and dispatching other vehicles to the platform according to the passenger flow, wherein the other vehicles are used for passengers carried at the platform.
In one possible implementation, the processor 701 is specifically configured to:
And dispatching one or more of a target bus, a network taxi and a taxi to the platform according to the passenger flow.
In one possible implementation, the processor 701 is specifically configured to:
and dispatching the target bus to the platform under the condition that the passenger flow of the platform is larger than a first threshold value in a preset time.
In one possible implementation, the processor 701 is specifically configured to:
acquiring the congestion condition of the bus related to the station through a communication interface 703;
and dispatching the target bus to the platform according to the congestion condition of the bus related to the platform.
In one possible implementation, the processor 701 is specifically configured to:
Acquiring one or more bus route data through a communication interface 703, wherein the bus route is a bus route related to the platform;
and determining a congested bus line and a congested bus stop according to the bus line data.
In one possible implementation, the target bus is a bus on a bus route outside of the congested bus route.
In one possible embodiment, the target bus is determined according to a preset rule including one or more of the following: the distance from the starting station to the congested bus station of the target bus, the number of stations at which the target bus stops from the starting station to the destination station, and the passenger flow of the target bus.
In one possible implementation, the processor 701 is specifically configured to:
and dispatching the target bus, the network bus and/or the taxi to the platform under the condition that the passenger flow of the platform is larger than a second threshold value in a preset time.
It should be noted that, in the embodiment of the present application, the specific implementation and the technical effect of each unit may also correspond to the corresponding description of the method embodiment shown in fig. 4.
The present application also provides a computer readable storage medium having instructions stored therein which, when executed on at least one processor, implement the aforementioned method of scheduling vehicles, such as the method of fig. 4.
The present application also provides a computer program product comprising computer instructions which, when executed by a computing device, implement the aforementioned method of scheduling vehicles, such as the method of fig. 4.
In embodiments of the application, words such as "for example" or "such as" are used to mean serving as examples, illustrations, or descriptions. Any embodiment or design described herein as "for example" or "such as" should not be construed as preferred or advantageous over other embodiments or designs. Rather, the use of words such as "for example" or "such as" is intended to present related concepts in a concrete fashion.
Reference to "at least one" in embodiments of the application means one or more, and "a plurality" means two or more. "at least one of" or the like means any combination of these items, including any combination of single item(s) or plural items(s). For example, at least one (one) of a, b, or c may represent: a. b, c, (a and b), (a and c), (b and c), or (a and b and c), wherein a, b, c may be single or plural. "and/or", describes an association relationship of an association object, and indicates that there may be three relationships, for example, a and/or B, and may indicate: three cases of A alone, A and B together, and B alone, wherein A, B may be singular or plural. The character "/" generally indicates that the context-dependent object is an "or" relationship.
And, unless otherwise indicated, the use of ordinal numbers such as "first," "second," etc., by embodiments of the present application is used for distinguishing between multiple objects and is not used for limiting a sequence, timing, priority, or importance of the multiple objects. For example, the first device and the second device are for ease of description only and are not meant to be a representation of differences in the structure, importance, etc. of the first device and the second device, and in some embodiments, the first device and the second device may also be the same device.
As used in the above embodiments, the term "when … …" may be interpreted to mean "if … …" or "after … …" or "in response to determination … …" or "in response to detection … …" depending on the context. The foregoing description of the preferred embodiments of the present application is provided for the purpose of illustration only, and is not intended to limit the application to the particular embodiments disclosed, but on the contrary, the intention is to cover all modifications, equivalents, alternatives, and alternatives falling within the spirit and scope of the application.
It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program for instructing relevant hardware, and the program may be stored in a computer readable storage medium, where the storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.
The present application is not limited to the above embodiments, and various equivalent modifications and substitutions can be easily made by those skilled in the art within the technical scope of the present application, and these modifications and substitutions are intended to be included in the scope of the present application. Therefore, the protection scope of the application is subject to the protection scope of the claims.

Claims (10)

1. A method of scheduling a vehicle, the method comprising:
Acquiring passenger flow of a platform, wherein the passenger flow of the platform is used for indicating the number of passengers of the platform;
and dispatching other vehicles to the platform according to the passenger flow, wherein the other vehicles are used for passengers carried at the platform.
2. The method of claim 1, wherein said scheduling other vehicles to said station based on said passenger flow comprises:
And dispatching one or more of a target bus, a network taxi and a taxi to the platform according to the passenger flow.
3. The method of claim 2, wherein said scheduling one or more of a target bus, a net taxi, and a taxi to the station according to the passenger flow comprises:
and dispatching the target bus to the platform under the condition that the passenger flow of the platform is larger than a first threshold value in a preset time.
4. A method according to claim 3, wherein said scheduling said target bus to said station comprises:
acquiring the congestion condition of a bus related to the platform;
and dispatching the target bus to the platform according to the congestion condition of the bus related to the platform.
5. The method of claim 4, wherein the obtaining a congestion condition of a bus associated with the station comprises:
Acquiring one or more bus route data, wherein the bus route is related to the platform;
and determining a congested bus line and a congested bus stop according to the bus line data.
6. The method of claim 5, wherein the target bus is a bus on a bus line other than the congested bus line.
7. The method of claim 6, wherein the target bus is determined according to a preset rule comprising one or more of: the distance from the starting station to the congestion bus station of the target bus, the number of stations at which the target bus stops from the starting station to the destination station and the passenger flow of the target bus.
8. The method of claim 2, wherein said scheduling one or more of a target bus, a net taxi, and a taxi to the station according to the passenger flow comprises:
and dispatching the target bus, the network bus and/or the taxi to the platform under the condition that the passenger flow of the platform is larger than a second threshold value in a preset time.
9. A computing device comprising a processor coupled to a memory for storing a computer program, the processor for invoking and running the computer program to cause the computing device to perform the method of any of claims 1-8.
10. A computer readable storage medium, characterized in that the computer readable storage medium has stored therein a computer program comprising instructions for executing the method according to any of claims 1-8.
CN202311503762.9A 2023-11-10 2023-11-10 Method for scheduling vehicles and related device Pending CN118230585A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311503762.9A CN118230585A (en) 2023-11-10 2023-11-10 Method for scheduling vehicles and related device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311503762.9A CN118230585A (en) 2023-11-10 2023-11-10 Method for scheduling vehicles and related device

Publications (1)

Publication Number Publication Date
CN118230585A true CN118230585A (en) 2024-06-21

Family

ID=91505526

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311503762.9A Pending CN118230585A (en) 2023-11-10 2023-11-10 Method for scheduling vehicles and related device

Country Status (1)

Country Link
CN (1) CN118230585A (en)

Similar Documents

Publication Publication Date Title
CN108765933B (en) Method, device, equipment and storage medium for recommending boarding points
CN110189006B (en) Scheduling method and device for vehicle, computer equipment and storage medium thereof
US10628758B2 (en) Transportation service reservation method, transportation service reservation apparatus, and computer-readable storage medium
JP2020074179A (en) Ridesharing management device, ridesharing management method, and program
RU2595551C1 (en) Navigator for public transport
US20150254581A1 (en) Rideshare system and method to facilitate instant carpooling
US10021243B2 (en) Telephone call placement
CN111144684B (en) Vehicle dispatching system, server and information processing method
US11270232B2 (en) Method for transporting a plurality of objects between object-specific locations
CN111461485A (en) Task allocation method, device, equipment and computer readable storage medium
US9372086B2 (en) Control system for indicating if people can reach locations that satisfy a predetermined set of conditions and requirements
KR102504273B1 (en) DRT request information clustering method for allocating DRT cars and system thereof
CN118230585A (en) Method for scheduling vehicles and related device
KR102474296B1 (en) A recording medium in which a method for managing dispatch of a vehicle running to a destination, a management server used therein, and a program executing the method for managing dispatch of a vehicle running at a destination are recorded.
CN113808381B (en) Public transport scheduling method, server and storage medium
CN111882912B (en) Riding information processing method, device and system
CN114493236A (en) Service vehicle assignment method, service vehicle assignment device, service vehicle assignment apparatus, service vehicle assignment medium, and program product
CN111915043A (en) Service data processing method, device, server and storage medium
CN114037260A (en) Method and device for dispatching and guiding bus junction station
CN113536128A (en) Recommendation method for transportation hub transfer mode and electronic equipment
CN113284362A (en) Bus scheduling method, device, equipment and storage medium
TW202129558A (en) Vehicle scheduling method, device, computer device and storage medium
JP2020149144A (en) Vehicle allocation device, vehicle allocation system, and vehicle allocation method
KR20150052917A (en) System and method for providing taxi reservation service
JP7334805B2 (en) INFORMATION GENERATING DEVICE, INFORMATION GENERATING METHOD, AND PROGRAM

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination