CN114927003B - Method and system for dispatching intelligent vehicles on civil airport apron - Google Patents

Abstract

The invention is applicable to the technical field of vehicle dispatching and provides a method and a system for dispatching intelligent vehicles on a civil airport apron, wherein the method comprises the following steps: receiving service positions in a target time period, service time required by each service position and available time; the vehicle parking position information and the vehicle average speed are called, and the number of the required vehicles is determined according to the vehicle parking position information, the vehicle average speed, the service position, the service time and the available time; obtaining a corresponding number of working routes according to the number of the required vehicles, wherein each working route is different; a vehicle dispatch command is generated, the vehicle dispatch command including a number of vehicles and a work route. According to the invention, the number and the working route of the needed vehicles are determined according to the vehicle parking position information, the vehicle average speed, the service position, the service time and the available time, fewer vehicles are arranged to go to a plurality of service positions to carry out service work, and the efficiency and the resource utilization rate are high.

Description

A method and system for intelligent vehicle dispatching on the apron of a civil airport

technical field

The invention relates to the technical field of vehicle dispatching, in particular to a method and system for intelligent vehicle dispatching on an apron of a civil airport.

Background technique

With the increasing scale and business volume of the airport, the bottleneck problems of low operating efficiency and insufficient collaborative decision-making ability faced by the airport during busy periods have become increasingly prominent. How to quickly respond to basic business and provide decision support for related departments has become a key issue to achieve efficient airport operation. Aircraft punctuality is one of the important indicators for evaluating the quality of aviation services. The punctuality of air transport is affected by many factors, among which the airport vehicle scheduling scheme has a great impact on the punctuality of flights. At present, the dispatching method of special vehicles in most airports still adopts the dispatching method of single-vehicle-single-flight service. This dispatching method is inefficient and does not consider route optimization. Generally high, the airport only provides a limited number of vehicles to complete the service, and the method of one vehicle for one service will also cause a waste of resource costs. Therefore, there is a need to provide a method and system for intelligent vehicle dispatching on the apron of a civil airport, aiming at solving the above-mentioned problems.

Contents of the invention

Aiming at the deficiencies in the prior art, the object of the present invention is to provide a method and system for intelligent vehicle dispatching on the apron of a civil airport, so as to solve the problems in the above-mentioned background technology.

The present invention is achieved in this way, a method for dispatching intelligent vehicles on the apron of a civil airport, said method comprising the following steps:

Receive service locations within the target time period, required service time and available time for each service location;

Retrieve vehicle parking location information and vehicle average speed, and determine the number of required vehicles according to vehicle parking location information, vehicle average speed, service location, service time and available time;

Get the corresponding number of working routes according to the number of vehicles required, and each working route is different;

A vehicle dispatch order is generated, and the vehicle dispatch order includes the number of vehicles and a working route.

As a further solution of the present invention: the step of determining the number of required vehicles according to the vehicle parking position information, vehicle average speed, service location, service time and available time specifically includes:

Obtain the average one-way distance and the total distance between each service position according to the vehicle parking position information and service position;

Set the number of required vehicles as N;

Calculate the minimum value of N when the inequality of (2N*average one-way distance+total distance between each service location)/vehicle average speed+service time≤N*available time is established, and the minimum value of N is the number of vehicles required.

As a further solution of the present invention: the step of obtaining a corresponding number of working routes according to the number of required vehicles specifically includes:

Group all service locations according to the service location and the service time required for each service location, and the number of groups is the same as the number of vehicles required;

A working route is automatically obtained according to the service positions in each group, and the working route is the shortest route that can connect all the service positions and the vehicle parking positions in series in each group.

As a further solution of the present invention: the step of grouping all service locations according to the service locations and the service time required by each service location specifically includes:

All service times are automatically grouped according to the service time and the number of vehicles required, and the variance of the total service time of each group obtained by automatic grouping is the smallest;

Determine whether there is a situation where the service time is the same and the corresponding service locations are different. If yes, determine the final service location grouping according to the service time grouping and service location; if not, determine the final service directly according to the service time grouping Location groupings.

As a further solution of the present invention: the method also includes:

Receive service location increase information or service location cancellation information;

Adjust the service locations within the target time period, the required service time and available time for each service location;

Re-determine the number of required vehicles and work routes, generate vehicle schedule update orders.

Another object of the present invention is to provide a civil airport apron intelligent vehicle dispatching system, said system comprising:

The service information receiving module is used to receive the service location within the target time period, the required service time and available time of each service location;

The vehicle number determination module is used to retrieve vehicle parking location information and vehicle average speed, and determine the number of required vehicles according to vehicle parking location information, vehicle average speed, service location, service time and available time;

A working route determination module, configured to obtain a corresponding number of working routes according to the number of required vehicles, and each working route is different; and

The vehicle dispatching order generation module is used to generate the vehicle dispatching order, and the vehicle dispatching order includes the number of vehicles and the working route.

As a further solution of the present invention: the vehicle quantity determination module includes:

The distance information calculation unit is used to obtain the average one-way distance and the total distance between each service position according to the vehicle parking position information and the service position;

a required vehicle setting unit for setting the number of required vehicles as N; and

The unit for determining the number of vehicles is used to calculate the minimum value of N when the inequality of (2N*average one-way distance+total distance between each service location)/vehicle average speed+service time≤N*available time is established, the minimum value of N is is the number of vehicles required.

As a further solution of the present invention: the working route determination module includes:

The service location grouping unit is used to group all the service locations according to the service location and the service time required by each service location, and the number of groups is the same as the number of required vehicles; and

The working route determination unit is used to automatically obtain the working route according to the service positions in each group, and the working route is the shortest route that can connect all the service positions and the vehicle parking positions in each group in series.

As a further solution of the present invention: the service location grouping unit includes:

The service time grouping subunit is used to automatically group all service times according to the service time and the number of vehicles required, and the variance of the total service time of each group obtained by automatic grouping is the smallest; and

The grouping situation determination subunit is used to determine whether there is a situation that the service time is the same and the corresponding service location is different. If it exists, determine the final service location grouping situation according to the service time grouping situation and service location; if not, directly according to the service location The time grouping determines the final service location grouping.

Compared with prior art, the beneficial effect of the present invention is:

The invention determines the number of required vehicles and the working route according to the vehicle parking position information, vehicle average speed, service position, service time and available time, arranges fewer vehicles to go to multiple service positions for service work, and has high efficiency and resource utilization High rate.

Description of drawings

Fig. 1 is a flow chart of a method for intelligent vehicle dispatching on the apron of a civil airport.

Fig. 2 is a flow chart of determining the number of required vehicles according to vehicle parking position information, vehicle average speed, service position, service time and available time in a method for intelligent vehicle scheduling on the apron of a civil airport.

Fig. 3 is a flow chart of obtaining a corresponding number of working routes according to the number of required vehicles in a method for intelligent vehicle scheduling on the apron of a civil airport.

Fig. 4 is a flow chart of grouping all service locations according to the service locations and the service time required by each service location in a method for intelligent vehicle dispatching on the apron of a civil airport.

Fig. 5 is a flow chart of re-determining the number of required vehicles and the working route in a method for intelligent vehicle scheduling on the apron of a civil airport.

Fig. 6 is a structural schematic diagram of an intelligent vehicle dispatching system on an apron of a civil airport.

Fig. 7 is a schematic structural diagram of a vehicle quantity determination module in an intelligent vehicle dispatching system on an apron of a civil airport.

Fig. 8 is a schematic structural diagram of a working route determination module in an intelligent vehicle dispatching system on an apron of a civil airport.

Fig. 9 is a schematic structural diagram of a service position grouping unit in an intelligent vehicle dispatching system on an apron of a civil airport.

Detailed ways

In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings and specific embodiments. It should be understood that the specific embodiments described here are only used to explain the present invention, not to limit the present invention.

The specific implementation of the present invention will be described in detail below in conjunction with specific embodiments.

As shown in Figure 1, the embodiment of the present invention provides a method for intelligent vehicle dispatching on the apron of a civil airport, the method comprising the following steps:

S100, receiving service locations within the target time period, required service time and available time for each service location;

S200, retrieve the vehicle parking location information and vehicle average speed, and determine the number of required vehicles according to the vehicle parking location information, vehicle average speed, service location, service time and available time;

S300, obtain a corresponding number of working routes according to the number of required vehicles, and each working route is different;

S400. Generate a vehicle dispatch command, where the vehicle dispatch command includes the number of vehicles and a working route.

It should be noted that with the increasing scale and business volume of the airport, the bottleneck problems of low operating efficiency and insufficient collaborative decision-making ability faced by the airport during busy periods have become increasingly prominent. How to quickly respond to basic business and provide decision support for related departments has become a key issue to achieve efficient airport operation. Aircraft punctuality is one of the important indicators for evaluating the quality of aviation services. The punctuality of air transport is affected by many factors, among which the airport vehicle scheduling scheme has a great impact on the punctuality of flights. At present, the dispatching method of special vehicles in most airports still adopts the dispatching method of single-vehicle-single-flight service. This dispatching method is inefficient and does not consider route optimization. Generally high, the airport only provides a limited number of vehicles to complete the service, and the method of one vehicle for one service will also cause waste of resource costs. The embodiments of the present invention aim to solve the above problems.

In the embodiment of the present invention, at first input the service location in the target time period, the required service time and available time of each service location, the target time period can be separate, such as 10:00 to 12:00; The segments can also be continuous, for example, a target time segment is formed every two hours, of course, the service location, service time and available time in each target time segment are not the same, and the service location refers to the location to which the vehicle needs to drive. Service location, there are several service locations. The service time refers to the time that the vehicle needs to stay at the corresponding service location for work. The service time can be predicted according to the model and parameters. The available time refers to how long Complete the service work to avoid impact on the punctuality of the aircraft. After inputting these basic service information, the embodiment of the present invention automatically retrieves the vehicle parking position information and the average vehicle speed. The vehicle parking position and the average vehicle speed are relatively fixed, and need to be uploaded in advance and Storage, determine the number of vehicles required according to the vehicle parking location information, vehicle average speed, service location, service time and available time, that is to say, arrange these number of vehicles to complete the service work within the available time, and a vehicle can go to Multiple service locations provide services with high efficiency and high resource utilization. Then, according to the number of required vehicles, a corresponding number of work routes are obtained. Each work route is different. The work routes pass through the service locations, and finally generate vehicle scheduling commands. The above-mentioned vehicle scheduling command includes the number of vehicles and the working route, so that several vehicles can be quickly arranged for service at the same time.

As shown in Figure 2, as a preferred embodiment of the present invention, the step of determining the number of required vehicles according to vehicle parking position information, vehicle average speed, service location, service time and available time specifically includes:

S201. Obtain the average one-way distance and the total distance between each service position according to the vehicle parking position information and the service position;

S202, setting the number of required vehicles as N;

S203, calculate the minimum value of N when the inequality of (2N*average one-way distance+total distance between each service location)/vehicle average speed+service time≤N*available time is established, and the minimum value of N is the required vehicle quantity.

In the embodiment of the present invention, in order to determine the quantity of required vehicles, it is necessary to obtain the average one-way distance and the total distance between each service position according to the vehicle parking position information and the service position. For example, the vehicle parking position information is point P, and the service position is A, Points B, C, and D, the distance from point P to point A is 700 meters, the distance from point P to point B is 1000 meters, the distance from point P to point C is 1000 meters, and the distance from point P to point D is 1200 meters , the distance between A and B is 400 meters, the distance between A and C is 420 meters, and the distance between C and D is 300 meters, then the average one-way distance = (700+1000+1000+1200)/4=975 meters, the total distance between each service location is the shortest distance after the service locations are connected in series, the total distance between each service location here=400+420+300=1120 meters, and then the number of vehicles required is set as N, and the calculation (2N* average one-way distance + total distance between each service location) / average vehicle speed + service time ≤ N * available time, the minimum value of N when this inequality is established, the minimum value of N is the number of vehicles required, so A minimum number of vehicles can be dispatched to multiple service locations for service.

As shown in Figure 3, as a preferred embodiment of the present invention, the step of obtaining a corresponding number of working routes according to the number of vehicles required specifically includes:

S301, group all service locations according to the service location and the service time required by each service location, and the number of groups is the same as the number of required vehicles;

S302. Automatically obtain a working route according to the service locations in each group, where the working route is the shortest route that can connect all the service locations and vehicle parking locations in series in each group.

In the embodiment of the present invention, after the number of vehicles is determined, it is necessary to ensure that the time for each vehicle to complete the task is about the same, so all service locations are grouped according to the service location and the service time required by each service location, and the number of groups is the same as the required service time. The same number of vehicles is required, one vehicle goes to the service location of one group for service, and finally the working route is automatically obtained according to the service location in each group, and the working route is able to connect all the service locations in each group with the vehicle parking location The shortest route of , for example, the working route of a vehicle is: P-B-A-P.

As shown in Figure 4, as a preferred embodiment of the present invention, the step of grouping all service locations according to the service locations and the service time required by each service location specifically includes:

S3011, automatically group all service times according to the service time and the number of required vehicles, and the variance of the total service time of each group obtained by automatic grouping is the smallest;

S3012, determine whether there is a situation that the service time is the same and the corresponding service locations are different, if yes, determine the final service location grouping situation according to the service time grouping situation and service location; if not, directly determine the final service location grouping situation according to the service time grouping situation The grouping of service locations.

In the embodiment of the present invention, under normal circumstances, the service time is much longer than the driving time of the vehicle on the road. In order to ensure that the time for each vehicle to complete the task is almost the same, all the service time is automatically grouped according to the service time and the number of vehicles required. That is, for example, the condition is: the parking location information of the vehicle is point P, the service locations are points A, B, C, and D, and the service times of points A, B, C, and D are respectively: 42 minutes, 35 minutes, 35 minutes, and 50 minutes, the number of vehicles is two, at this time, 42 minutes and 35 minutes are divided into one group, the total service time of this group is 77 minutes, 35 minutes and 50 minutes are divided into one group, and then it is determined whether there is a same service time And the corresponding service location is different, if it exists, determine the final service location grouping according to the service time grouping and service location. Here, there are two 35 minutes corresponding to point B and point C, because point B is closer to A, Point C is closer to D, so the final service location grouping is that points A and B are in one group, and points C and D are in one group.

As shown in Figure 5, as a preferred embodiment of the present invention, the method also includes:

S501. Receive service location addition information or service location cancellation information;

S502, adjusting the service location within the target time period, the required service time and available time of each service location;

S503, re-determining the number of required vehicles and the working route, and generating a vehicle scheduling update command.

In the embodiment of the present invention, when a temporary service job is canceled or added, input the service location increase information or service location cancellation information, the service location increase information and the service location cancellation information include the corresponding service time, and then re-determine the required vehicle The number and work route, generate a vehicle schedule update command.

As shown in Figure 6, the embodiment of the present invention also provides a civil airport apron intelligent vehicle dispatching system, the system includes:

The service information receiving module 100 is used to receive the service location within the target time period, the service time required by each service location and the available time;

The vehicle number determination module 200 is used to retrieve vehicle parking position information and vehicle average speed, and determine the number of required vehicles according to the vehicle parking position information, vehicle average speed, service position, service time and available time;

The working route determination module 300 is used to obtain a corresponding number of working routes according to the number of required vehicles, and each working route is different; and

The vehicle dispatch order generating module 400 is configured to generate a vehicle dispatch order, and the vehicle dispatch order includes the number of vehicles and a working route.

In the embodiment of the present invention, at first input the service location in the target time period, the required service time and available time of each service location, the target time period can be separate, such as 10:00 to 12:00; The segments can also be continuous, for example, a target time segment is formed every two hours, of course, the service location, service time and available time in each target time segment are not the same, and the service location refers to the location to which the vehicle needs to drive. Service location, there are several service locations. The service time refers to the time that the vehicle needs to stay at the corresponding service location for work. The service time can be predicted according to the model and parameters. The available time refers to how long Complete the service work to avoid impact on the punctuality of the aircraft. After inputting these basic service information, the embodiment of the present invention automatically retrieves the vehicle parking position information and the average vehicle speed. The vehicle parking position and the average vehicle speed are relatively fixed, and need to be uploaded in advance and Storage, determine the number of vehicles required according to the vehicle parking location information, vehicle average speed, service location, service time and available time, that is to say, arrange these number of vehicles to complete the service work within the available time, and a vehicle can go to Multiple service locations provide services with high efficiency and high resource utilization. Then, according to the number of required vehicles, a corresponding number of work routes are obtained. Each work route is different. The work routes pass through the service locations, and finally generate vehicle scheduling commands. The above-mentioned vehicle scheduling command includes the number of vehicles and the working route, so that several vehicles can be quickly arranged for service at the same time.

As shown in Figure 7, as a preferred embodiment of the present invention, the vehicle quantity determination module 200 includes:

The distance information calculation unit 201 is used to obtain the average one-way distance and the total distance between each service position according to the vehicle parking position information and the service position;

The required vehicle setting unit 202 is used to set the number of required vehicles as N; and

The vehicle number determination unit 203 is used to calculate the minimum value of N when the inequality of (2N*average one-way distance+total distance between each service location)/vehicle average speed+service time≤N*available time holds, and the minimum value of N That is the number of vehicles required.

In the embodiment of the present invention, in order to determine the quantity of required vehicles, it is necessary to obtain the average one-way distance and the total distance between each service position according to the vehicle parking position information and the service position. For example, the vehicle parking position information is point P, and the service position is A, Points B, C, and D, the distance from point P to point A is 700 meters, the distance from point P to point B is 1000 meters, the distance from point P to point C is 1000 meters, and the distance from point P to point D is 1200 meters , the distance between A and B is 400 meters, the distance between A and C is 420 meters, and the distance between C and D is 300 meters, then the average one-way distance = (700+1000+1000+1200)/4=975 meters, the total distance between each service location is the shortest distance after the service locations are connected in series, the total distance between each service location here=400+420+300=1120 meters, and then the number of vehicles required is set as N, and the calculation (2N* average one-way distance + total distance between each service location) / average vehicle speed + service time ≤ N * available time, the minimum value of N when this inequality is established, the minimum value of N is the number of vehicles required, so A minimum number of vehicles can be dispatched to multiple service locations for service.

As shown in Figure 8, as a preferred embodiment of the present invention, the working route determination module 300 includes:

The service position grouping unit 301 is used to group all service positions according to the service position and the service time required by each service position, and the number of groups is the same as the number of required vehicles; and

The working route determination unit 302 is configured to automatically obtain a working route according to the service locations in each group, and the working route is the shortest route that can connect all the service locations and the vehicle parking locations in series in each group.

In the embodiment of the present invention, after the number of vehicles is determined, it is necessary to ensure that the time for each vehicle to complete the task is about the same, so all service locations are grouped according to the service location and the service time required by each service location, and the number of groups is the same as the required service time. The same number of vehicles is required, one vehicle goes to the service location of one group for service, and finally the working route is automatically obtained according to the service location in each group, and the working route is able to connect all the service locations in each group with the vehicle parking location The shortest route of , for example, the working route of a vehicle is: P-B-A-P.

As shown in Figure 9, as a preferred embodiment of the present invention, the service location grouping unit 301 includes:

The service time grouping subunit 3011 is used to automatically group all service times according to the service time and the number of required vehicles, and the variance of the total service time of each group obtained by automatic grouping is the smallest; and

The grouping situation determination subunit 3012 is used to determine whether there is a situation that the service time is the same and the corresponding service location is different, if it exists, determine the final service location grouping situation according to the service time grouping situation and service location; if not, directly according to The grouping of service time determines the final service location grouping.

In the embodiment of the present invention, under normal circumstances, the service time is much longer than the driving time of the vehicle on the road. In order to ensure that the time for each vehicle to complete the task is almost the same, all the service time is automatically grouped according to the service time and the number of vehicles required. That is, for example, the condition is: the parking location information of the vehicle is point P, the service locations are points A, B, C, and D, and the service times of points A, B, C, and D are respectively: 42 minutes, 35 minutes, 35 minutes, and 50 minutes, the number of vehicles is two, at this time, 42 minutes and 35 minutes are divided into one group, the total service time of this group is 77 minutes, 35 minutes and 50 minutes are divided into one group, and then it is determined whether there is a same service time And the corresponding service location is different, if it exists, determine the final service location grouping according to the service time grouping and service location. Here, there are two 35 minutes corresponding to point B and point C, because point B is closer to A, Point C is closer to D, so the final service location grouping is that points A and B are in one group, and points C and D are in one group.

The above is only a detailed description of the preferred embodiments of the present invention, and is not intended to limit the present invention. Any modifications, equivalent replacements and improvements made within the spirit and principles of the present invention should be included in the protection of the present invention. within range.

It should be understood that although the various steps in the flow charts of the embodiments of the present invention are shown sequentially according to the arrows, these steps are not necessarily executed sequentially in the order indicated by the arrows. Unless otherwise specified herein, there is no strict order restriction on the execution of these steps, and these steps can be executed in other orders. Moreover, at least some of the steps in each embodiment may include multiple sub-steps or multiple stages, these sub-steps or stages are not necessarily executed at the same time, but may be executed at different times, the sub-steps or stages The order of execution is not necessarily performed sequentially, but may be performed alternately or alternately with at least a part of other steps or sub-steps or stages of other steps.

Those of ordinary skill in the art can understand that all or part of the processes in the methods of the above embodiments can be realized through computer programs to instruct related hardware, and the programs can be stored in a non-volatile computer-readable storage medium When the program is executed, it may include the processes of the embodiments of the above-mentioned methods. Wherein, any references to memory, storage, database or other media used in the various embodiments provided in the present application may include non-volatile and/or volatile memory. Nonvolatile memory can include read only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory. Volatile memory can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in many forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Chain Synchlink DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

Other embodiments of the present disclosure will readily occur to those skilled in the art from consideration of the disclosure at the specification and examples. This application is intended to cover any modification, use or adaptation of the present disclosure, and these modifications, uses or adaptations follow the general principles of the present disclosure and include common knowledge or conventional technical means in the technical field not disclosed in the present disclosure . The specification and examples are to be considered exemplary only, with the true scope and spirit of the disclosure indicated by the appended claims.

Claims (5)

1. a civil airport apron intelligent vehicle dispatching method, is characterized in that, described method comprises the following steps: Receive service locations within the target time period, required service time and available time for each service location; Retrieve vehicle parking location information and vehicle average speed, and determine the number of required vehicles according to vehicle parking location information, vehicle average speed, service location, service time and available time; Get the corresponding number of working routes according to the number of vehicles required, and each working route is different; Generate a vehicle dispatch order, the vehicle dispatch order includes the number of vehicles and the working route; Wherein, the step of determining the number of required vehicles according to vehicle parking position information, vehicle average speed, service location, service time and available time specifically includes: obtaining the average one-way distance and each service The total distance between locations; set the number of vehicles required as N; calculate (2N*average one-way distance+total distance between each service location)/vehicle average speed+service time≤N*available time when this inequality holds true The minimum value, the minimum value of N is the number of vehicles required; Wherein, the step of obtaining a corresponding number of working routes according to the number of required vehicles specifically includes: grouping all service locations according to the service locations and the service time required by each service location, the number of groups and the required The number of vehicles is the same; the working route is automatically obtained according to the service positions in each group, and the working route is the shortest route that can connect all the service positions and vehicle parking positions in series in each group. 2. according to claim 1, a kind of civil airport apron intelligent vehicle dispatching method is characterized in that, the step of grouping all service locations according to the service location and the required service time of each service location specifically includes : All service times are automatically grouped according to the service time and the number of vehicles required, and the variance of the total service time of each group obtained by automatic grouping is the smallest; Determine whether there is a situation where the service time is the same and the corresponding service locations are different. If yes, determine the final service location grouping according to the service time grouping and service location; if not, determine the final service directly according to the service time grouping Location groupings. 3. according to claim 1, a kind of intelligent vehicle dispatching method on the apron of civil airport, is characterized in that, described method also comprises: Receive service location increase information or service location cancellation information; Adjust the service locations within the target time period, the required service time and available time for each service location; Re-determine the number of required vehicles and work routes, generate vehicle schedule update orders. 4. A civil airport apron intelligent vehicle dispatching system, characterized in that the system comprises: The service information receiving module is used to receive the service location within the target time period, the required service time and available time of each service location; The vehicle number determination module is used to retrieve vehicle parking location information and vehicle average speed, and determine the number of required vehicles according to vehicle parking location information, vehicle average speed, service location, service time and available time; A working route determination module, configured to obtain a corresponding number of working routes according to the number of required vehicles, and each working route is different; and Vehicle scheduling order generating module, used to generate vehicle scheduling order, said vehicle scheduling order includes vehicle quantity and working route; Wherein, the module for determining the number of vehicles includes: a distance information calculation unit, which is used to obtain the average one-way distance and the total distance between each service position according to the vehicle parking position information and the service position; the required vehicle setting unit, which is used to set the required The number of vehicles required is N; and the unit for determining the number of vehicles is used to calculate (2N*average one-way distance+total distance between each service location)/vehicle average speed+service time≤N*available time when the inequality holds. The minimum value, the minimum value of N is the number of vehicles required; Wherein, the working route determination module includes: a service location grouping unit, which is used to group all service locations according to the service location and the service time required by each service location, and the number of groups is the same as the number of required vehicles; And a working route determination unit, configured to automatically obtain a working route according to the service locations in each group, the working route being the shortest route that can connect all the service locations and vehicle parking locations in series in each group. 5. according to claim 4, a kind of civil airport apron intelligent vehicle dispatching system, is characterized in that, described service location grouping unit comprises: The service time grouping subunit is used to automatically group all service times according to the service time and the number of vehicles required, and the variance of the total service time of each group obtained by automatic grouping is the smallest; and The grouping situation determination subunit is used to determine whether there is a situation that the service time is the same and the corresponding service location is different. If it exists, determine the final service location grouping situation according to the service time grouping situation and service location; if not, directly according to the service location The time grouping determines the final service location grouping.