CN116307469A - Automatic scheduling and scheduling generation method for public service vehicle - Google Patents

Abstract

The embodiment of the invention relates to the technical field of vehicle scheduling, in particular to an automatic scheduling generation method of a public service vehicle. Comprising the following steps: receiving a work order sent by a user terminal; acquiring available vehicle information, assigning vehicles to the passengers in a preset mode, and sending corresponding vehicle and passenger information to user terminals of the passengers; and generating a vehicle dispatching schedule according to the related information of the vehicle work orders and the vehicle assignment, and outputting a result. The technical scheme is used for solving the problems that in the prior art, the limitation of dispatching the commercial vehicles manually is large, the dispatching using effect of the vehicles cannot reach the optimal solution, and resource waste is caused.

Description

Automatic scheduling and scheduling generation method for public service vehicle

Technical Field

The embodiment of the invention relates to the technical field of vehicle scheduling, in particular to an automatic scheduling generation method of a public service vehicle.

Background

At present, related dispatching is generally carried out on vehicles and drivers of public service vehicles in a manual mode. Although the manual dispatching can solve the dispatching availability problem to a certain extent, the dispatching optimization, such as the secondary dispatching of vehicles, the spelling of different travel personnel, the balanced adjustment of KPIs of drivers and the like, cannot be effectively solved through the manual dispatching. Especially when facing the complex situations of more vehicles, shortage of vehicle demands and destination demands, the limitation of manual dispatching is prominent.

Disclosure of Invention

In view of the above problems, the embodiment of the invention provides an automatic scheduling generation method of a business car, which is used for solving the problems that in the prior art, the limitation of manually scheduling the business car is large, the scheduling use effect of the car cannot reach the optimal solution, and the resource waste is caused.

According to an aspect of the embodiment of the invention, there is provided a method for generating an automatic scheduling of a public service vehicle, the method comprising:

receiving a work order sent by a user terminal;

acquiring available vehicle information, assigning vehicles to the passengers in a preset mode, and sending corresponding vehicle and passenger information to user terminals of the passengers;

and generating a vehicle dispatching schedule according to the related information of the vehicle work orders and the vehicle assignment, and outputting a result.

In an alternative manner, the vehicle worksheet includes a go Cheng Gongshan and return worksheets, and the go Cheng Gongshan and return worksheets each include: department of vehicles, origin of vehicles, destination of vehicles, number of passengers and personnel information, time of vehicles and arrival time.

In an alternative manner, when the request Cheng Gongshan is received and the number of available vehicles meets the carpool number requirement, the manner in which the vehicles are assigned specifically includes:

acquiring a plurality of pieces of Cheng Gongshan information meeting the carpooling requirement;

creating a plurality of carpool paths according to the plurality of pieces of Cheng Gongshan information;

and judging the size relation between the car cost of each car sharing path and the sum of the independent car cost of each travel-going worker in the car sharing requirement, and determining the car sharing path and car sharing vehicle information with the lowest cost.

In an alternative approach, separate vehicles are assigned to the go Cheng Gongshan that do not meet the carpool requirements.

In an alternative manner, when the request Cheng Gongshan is received and the number of available vehicles does not meet the carpool number requirement, the manner in which the vehicles are assigned specifically includes:

screening out a stop Cheng Gongshan waiting for the return of the vehicle to be dispatched according to the time of use, the arrival time and the emergency degree of use;

acquiring the return time of the return vehicle and comparing the return time with the vehicle time and the arrival time in the screened Cheng Gongshan;

if the return time of the returning vehicle meets the requirement of the service time of the vehicle on the departure work order, designating the vehicle to a vehicle operator according to a preset mode;

if the return time of the returning vehicle does not meet the requirement of the service time of the vehicle on the delivery work order, the information that the vehicle arrangement cannot be completed according to the requirement of Cheng Gongshan is fed back to the vehicle staff.

In an alternative way, when assigning a vehicle to a vehicle operator according to said release Cheng Gongshan: the operators of the same department are preferably assigned to the same vehicle.

In an alternative way, the user terminal sending the call Cheng Gongshan has the right to lock the vehicle position when the number of passengers on the same delivery work order is at least 3.

In an optional manner, when receiving a return worksheet sent by the user terminal, the vehicle assignment manner specifically includes:

acquiring the vehicle utilization time information and the vehicle utilization starting place information on the return work orders, and searching other return work order information around the vehicle utilization starting place;

judging whether at least two orders on the periphery meet the carpooling condition or not;

if the carpooling condition is met, assigning the same vehicle to the operators of the multiple return worksheets;

if the carpooling condition is not met, vehicles are solely assigned to the return worksheet.

In an alternative approach, when a vehicle assignment is made:

when the carpooling condition is met, preferentially assigning a return vehicle near the vehicle place;

when the car pooling condition is not met, calculating and comparing the cost of the car from the company, the car utilization starting place, the car utilization destination and the returning company and the cost of the car utilization personnel for directly taking the car to the car utilization destination, selecting a mode with lower cost, and feeding back to the user terminal.

According to another aspect of the embodiment of the present invention, there is also provided an apparatus for automatic scheduling of a public service vehicle, including: the device comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete communication with each other through the communication bus;

the memory is used for storing at least one executable instruction, and the executable instruction enables the processor to execute the operation of the automatic scheduling generation method of the public service vehicle.

According to the embodiment of the invention, firstly, the number of people on the passing worksheets is judged, the number of people of a plurality of people Cheng Gongshan is added up to meet the riding requirement of a vehicle, then at least two worksheets meeting the requirement are mutually arranged and combined, screening is carried out through the time of use and arrival time on the worksheets, the arrangement and combination which do not meet the combined information are deleted, and the time between destinations can be obtained through modes such as hundred-degree map; and planning paths of the destinations among the rest permutation and combination, calculating the cost of each path, assigning the sum of the costs of the independent vehicles to a plurality of pieces Cheng Gongshan, judging the cost, selecting the optimal path with the lowest cost, and then sending the carpool information to the carpool personnel, wherein the carpool information comprises vehicle information and carpool personnel information. The service terminal can automatically splice a plurality of vehicle utilization work orders by receiving the information in the vehicle utilization work orders sent by the user terminal and generate a scheduling schedule of vehicle scheduling, namely, in the technical scheme, the available vehicles can be utilized to the greatest extent, so that the optimal solution of the available vehicles in use and scheduling is realized, not only is the resource waste avoided, but also the vehicle utilization cost is saved.

The foregoing description is only an overview of the technical solutions of the embodiments of the present invention, and may be implemented according to the content of the specification, so that the technical means of the embodiments of the present invention can be more clearly understood, and the following specific embodiments of the present invention are given for clarity and understanding.

Drawings

The drawings are only for purposes of illustrating embodiments and are not to be construed as limiting the invention. Also, like reference numerals are used to designate like parts throughout the figures. In the drawings:

FIG. 1 shows a schematic block diagram of a method for generating an automatic scheduling of a public service vehicle;

fig. 2 is a block diagram of a flow system in a first case in the automatic scheduling method for a public service vehicle provided by the invention;

FIG. 3 is a block diagram of a flow system of a second case in the automatic scheduling and scheduling generation method of the official vehicle;

fig. 4 is a schematic structural view of an embodiment of an automatic scheduling and scheduling generating device for a public service vehicle according to the present invention;

fig. 5 is a schematic structural diagram of an embodiment of an automatic scheduling system for a public service vehicle according to the present invention;

fig. 6 is a schematic structural view of an embodiment of an automatic scheduling and scheduling generating device for a public service vehicle according to the present invention;

fig. 7 is a schematic diagram of a state space S in a non-heuristic algorithm in the automatic scheduling and scheduling generation method of a public service vehicle provided by the invention;

fig. 8 shows an overall architecture diagram of an automatic scheduling and scheduling generation method for a business car.

Detailed Description

Exemplary embodiments of the present invention will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present invention are shown in the drawings, it should be understood that the present invention may be embodied in various forms and should not be limited to the embodiments set forth herein.

It should be noted in advance that in the specific mode of the present invention, the communication connection and the information interaction are performed through the service terminal and the user terminal, and the automatic information acquisition and judgment of the service terminal are performed, specifically, the user terminal may be a mobile terminal, more specifically, may be a user terminal APP set in the mobile terminal, and the service terminal is a server or a computer.

As shown in fig. 1, a flowchart of a first embodiment of a method for generating an automatic dispatch shift of a utility vehicle according to the present invention is executed by a management platform. As shown in fig. 1, the method mainly comprises the following steps:

s1, receiving a work order sent by a user terminal;

in this embodiment, the step of receiving the vehicle worksheet from the user terminal may be refined as follows: first, a driver is required to select to create a go Cheng Gongshan or a return Cheng Gongshan at the user terminal, and when creating a work order, the following necessary contents are required to be input, including: the vehicle department, the vehicle starting place, the vehicle destination, the number of passengers, personnel information, the vehicle time, the arrival time and the like, and then sends the created vehicle work order to the service terminal.

It is to be understood that in this embodiment, the user terminal may be software such as a conventional nail when the user terminal is APP, and the purpose of inputting the necessary information is to facilitate the judgment and information collection of the service terminal, so that the service terminal is more accurate when performing the carpooling judgment, and the time of collecting Cheng Gongshan by the server may be 4 pm per day, and the time of collecting Cheng Gongshan by the vehicle work order needs to be proposed in advance of one day, and after the travel order of the day is collected, the user terminal may be assigned by combining with the available vehicle of the next day, except for the emergency vehicle, and when the emergency vehicle is needed, the user terminal may apply for the emergency vehicle through the channel of the user terminal, or may be directly connected with the department that manages the vehicle.

S2, acquiring available vehicle information, assigning vehicles to the passengers in a preset mode, and sending corresponding vehicle and carpooling personnel information to user terminals of the passengers;

the service terminal enters a current available vehicle resource library, obtains available vehicle information, appoints vehicles to the vehicle operators according to a preset mode according to a plurality of received messages Cheng Gongshan, and sends corresponding vehicle information and other vehicle sharing personnel information to the user terminal of the vehicle operators;

it is easy to understand that when the judgment of the carpooling operation is carried out, firstly, the number of available vehicles in the current vehicle resource library needs to be judged and collected, then the number of available vehicles can be compared and matched with the number of people on a vehicle work order, and whether the number of available vehicles is sufficient is judged, so that the following situations can occur when the server carries out carpooling arrangement;

as shown in fig. 2, in case one, when the request Cheng Gongshan is received and the number of available vehicles meets the requirement of the number of carpools, the manner of assigning the vehicles specifically includes:

acquiring a plurality of pieces of Cheng Gongshan information meeting the carpooling requirement;

creating a plurality of carpool paths according to the plurality of pieces of Cheng Gongshan information;

and judging the size relation between the car cost of each car sharing path and the sum of the independent car cost of each travel-going worker in the car sharing requirement, and determining the car sharing path and car sharing vehicle information with the lowest cost.

It should be noted that, the judging manner of the plurality of going-to-Cheng Gongshan meeting the requirement of the spelling list may be that firstly, the number of people on the passing work orders is judged, the number of people on the plurality of going-to-Cheng Gongshan should meet the riding requirement of the vehicle, then at least two work orders meeting the requirement are mutually arranged and combined, then the arrangement and combination which do not meet the combined information are deleted by screening the time of use and the arrival time on the plurality of work orders, and the time between destinations can be calculated by means of hundred degree map and the like; and planning paths of the destinations among the rest permutation and combination, calculating the cost of each path, assigning the sum of the costs of the independent vehicles to a plurality of pieces Cheng Gongshan, judging the cost, selecting the optimal path with the lowest cost, and then sending the carpool information to the carpool personnel, wherein the carpool information comprises vehicle information and carpool personnel information.

Of course, in the above case, it is easy to understand that the destination should be approximately in one direction, and if the destination is far on the departure worksheet and the carpooling operation cannot be performed, the service terminal may automatically assign the vehicle alone or drive with a vehicle operator.

As shown in fig. 3, in the second case, when the request Cheng Gongshan is received and the number of available vehicles does not meet the requirement of the number of carpools, the manner of assigning vehicles specifically includes:

screening out a stop Cheng Gongshan waiting for the return of the vehicle to be dispatched according to the time of use, the arrival time and the emergency degree of use;

acquiring the return time of the return vehicle and comparing the return time with the vehicle time and the arrival time in the screened Cheng Gongshan;

if the return time of the returning vehicle meets the requirement of the service time of the vehicle on the departure work order, designating the vehicle to a vehicle operator according to a preset mode;

if the return time of the returning vehicle does not meet the requirement of the service time of the vehicle on the delivery work order, the information that the vehicle arrangement cannot be completed according to the requirement of Cheng Gongshan is fed back to the vehicle staff.

It will be understood that if there is insufficient available vehicles, then a part of the departure worksheets are selected to wait for the dispatched vehicles to return, and then the vehicle is arranged for carpooling or independent vehicles, and this is exemplified herein, if one of the orders needs to reach the destination at 9 o 'clock, the return time of the outsourced vehicles is 7 o' clock, and the time required for the initial journey to the destination is within two hours, it can be determined that the order meets the condition of waiting for the outsourced vehicles to return for carpooling, and of course, when screening the order, screening is preferentially performed according to the emergency degree of the event of the personnel. If part of the vehicle orders wait for the vehicles to return to the outside, and the time for reaching the destination is delayed or no vehicles are distributed, the service terminal should feed back the information to the user terminal in advance, so that the subsequent arrangement of vehicle staff is facilitated.

In the arrangement of the carpools in the two cases, the personnel of the same department are preferentially arranged to the same vehicle, so that the personnel taking the vehicle are familiar with the atmosphere of the vehicle, and preferably, the carpool arrangement is preferentially carried out on the emergency vehicle work order, because the special case is generally a relatively urgent matter, if the special case needs to be used, the special case should be arranged on the vehicle, the carpool is not carried out, and further, if the user has a written instruction on the vehicle work order, the service terminal does not carry out the carpool operation on the vehicle work order.

In one embodiment, when the service terminal receives the return worksheet, the service terminal assigns the vehicle as follows:

acquiring the vehicle utilization time information and the vehicle utilization starting place information on the return work orders, and searching other return work order information around the vehicle utilization starting place;

judging whether at least two orders on the periphery meet the carpooling condition or not;

if the carpooling condition is met, assigning the same vehicle to the operators of the multiple return worksheets;

if the carpooling condition is not met, vehicles are solely assigned to the return worksheet.

The return is to judge whether the mode of meeting the carpooling condition is consistent with the mode of judging the return, but preferably, when meeting the carpooling condition, the return vehicles near the vehicle place are preferentially assigned; when the car pooling condition is not met, the cost of the car from the company, the car utilization starting place, the car utilization destination and the cost of the car utilization personnel for directly taking the car to the car utilization destination are calculated and compared, a mode with lower cost is selected and fed back to the user terminal, and if a customer is needed or other special conditions exist, the situation can be described in a return work order when the car of the company is required to be taken, and the service terminal can independently arrange the car. It will be appreciated that such an operational approach also reduces consumption on the premise of reasonably scheduling the vehicle.

Preferably, in this embodiment, when the number of passengers on the same departure worksheet is at least 3, the user terminal that sends the destination call Cheng Gongshan has the authority to lock the vehicle position, because the vehicle is generally a 5-seat car in the morning, except for the riding position of the driver, generally only 4 rest positions are provided, so that when the number of passengers is greater than 3, the probability that the vehicle can perform carpooling is smaller, and similarly, when the vehicle returns, the authority to lock the vehicle position can be provided on the user terminal, so that the vehicle can wait in place after reaching the destination, and is convenient to return to the company, if the vehicle needs to stay at the customer for a plurality of days, the authority to lock the vehicle position can not be provided, namely, the vehicle can return to the company after being delivered, and waiting for arrangement.

As shown in fig. 8, for easy understanding, the above-mentioned manner of performing the automatic carpooling operation by the service terminal may be referred to or implemented by using the following algorithm, and the specific algorithm may be classified into heuristic and non-heuristic;

the heuristic algorithm is specifically as follows,

1. remaining vehicles (platoon):

queue<cr>

2. work order requirements (queues):

queue<cnfd>

3. distributed tasks (queues):

d_ready<job>

4. hundred degree API calculates the current departure to destination distance and route (function)

src2des_baidu

5. Hundred degree API calculates old and new distances representing old and new distance lengths, respectively, after newly joining the destination point

old,new＝compute_badui(need,job)。

6. Calculating cost loss after spelling

cost＝(new.mileage-old.mileage)*bate+(1-bata)*((new.time-old.time))

find_min_cost (vector_old_new < (old, new) >), find the smallest one of all old and new data pairs. The method is divided into two types of inspiring and non-inspiring.

7. Algorithm flow framework:

the # loop iterates through each work order feed in all the used queue < cnfd

The non-heuristic carpooling algorithm is specifically as follows:

the core of the non-heuristic algorithm is to replace find_min_cost (vector_old_new < (old, new) >, which simply depends on cost values, with MCTS algorithm, and to implement computation of optimal spelling with multi-feedback tuning.

1) And (5) training data acquisition. The simulated track of Mcts adopts a train dispatching list generated by system simulation or formed by heuristic allocation schemes of various branch companies as training data.

2) A state space s (leaf or intermediate node) of the monte carlo tree is constructed:

as shown in fig. 7, where car_info= [ { vehicle Id, available number of seats, already used number of seats }, { use Id of department 1, use number of people 1, departure point 1, departure time 1, arrival time 1, destination 1}, { use Id of department 2, use number of people 2, departure time 2, arrival time 2, destination 2} ], one vehicle spells up to 2 departments for common use of passengers from the comfort viewpoint, and if no department uses department Id as-1, the remaining initial value is 0. The map of the public service vehicle operation area is subjected to hexagonal block discretization, and the representative destination and departure place are coded by numbers, so that the size of the search space is reduced.

3) Building a Monte Carlo tree:

and filling the Matix of car_info with the generated work order schedule which is not used yet to obtain root nodes (when reasoning), generating an expansion tree according to actual simulation data or sampling data during training, and performing track generation and backward recording of access node times and keywords. Every time a new work order is required to be added, the decision process is equal to selecting an action to jump to the next layer node at the current node, and the patent takes the completion of the distribution of all the dispatching work orders every day as an end (leaf node), or sets a work order number as the deepest depth to form the last leaf node.

4) Design of a reward function:

in order to better integrate customer experience feedback, the patent designs the review as weighted average of satisfaction score and cost (distance time) of pedestrians, the satisfaction can be reflected in a preference of being in charge of a specific department, a driver is welcome by the specific department, and the weight is adjusted to realize the emphasis selection between line optimization and satisfaction. The reward design is based on the characteristics of strong specificity and strong regional property of the service vehicle, and the model based on the mstc can get rid of dependence on the hundred-degree map after training and feedback for a period of time under the condition that the accumulated samples and the simulation data are enough. Meanwhile, time limit punishment conditions and people exceeding punishment conditions are added in the report, the model does not need rule engines for vehicle personnel number matching and time matching any more, the self-learning capability of the system is improved, and the rule engines are weakened, so that the rule engines are only used for providing training data.

5) Improved use of UCT UCB

The conventional Monte Carlo MCTS chessboard game is not applicable to a vehicle schedule any more and needs to be redefined:

where wi is the total number of times the ith child node arrives, int is the total number of times the parent node accesses, ni is the total number of times the ith child node is accessed, the first term of the UCT represents optimal selection, the second term gives consideration to less occurrence of exploration, and the larger the value, the easier the parent node takes actions to access the node. The state action function of UCB model fitting Q (s, Q) is taken here to replace w/n. In this patent Q (s, a) a is the cart number, here using the onehot vector. Due to s: the state space of car_info is too large and we can train this Q (s, a) using dnn neural network.

In a specific embodiment, fig. 4 shows an automatic dispatch and scheduling generation device 500 for a public service vehicle, including:

the receiving module 510 receives a work order sent by the user terminal;

the determining module 520 enters a current available vehicle resource library, obtains available vehicle information, and designates vehicles to vehicle operators according to a preset mode according to a plurality of received vehicle work orders;

a transmitting module 530; corresponding vehicle information and other carpooling personnel information are sent to a user terminal of a car using personnel;

a generating module 540; and generating a vehicle dispatching schedule for storage and outputting a result according to the information about the carpooling personnel and the vehicle assignment.

In a specific embodiment, fig. 5 shows an automatic dispatch shift generation system 600 for a utility vehicle, comprising:

the user terminal 610 is configured to create a vehicle use work order according to requirements of vehicle operators, send the created vehicle use terminal to the service terminal, and receive vehicle arrangement information fed back by the service terminal;

the service terminal 620 is configured to receive the vehicle use ticket sent by the user terminal, and perform vehicle arrangement on a vehicle operator according to the vehicle use ticket and the available vehicle information, and generate a corresponding vehicle scheduling schedule.

In a specific embodiment, fig. 6 shows a schematic structural diagram of an automatic scheduling and scheduling generating device of a public service vehicle, and a specific embodiment of the present invention does not limit a specific implementation of a feeding rescue device, including: the device comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete communication with each other through the communication bus;

the memory is used for storing at least one executable instruction, and the executable instruction enables the processor to execute the operation of the automatic scheduling generation method of the public service vehicle.

As shown in fig. 6, the feeding rescue apparatus may include: a processor 402, a communication interface (Communications Interface) 404, a memory 406, and a communication bus 408.

Wherein: processor 402, communication interface 404, and memory 406 communicate with each other via communication bus 408. A communication interface 404 for communicating with network elements of other devices, such as clients or other servers. The processor 402 is configured to execute the program 410, and may specifically perform relevant steps in the embodiment of the automatic scheduling method for a public service vehicle.

In particular, program 410 may include program code including computer-executable instructions.

The processor 402 may be a central processing unit CPU, or a specific integrated circuit ASIC (APPlication Specific Integrated Circuit), or one or more integrated circuits configured to implement embodiments of the present invention. The one or more processors comprised by the device may be the same type of processor, such as one or more CPUs; but may also be different types of processors such as one or more CPUs and one or more ASICs.

Memory 406 for storing programs 410. Memory 406 may comprise high-speed RAM memory or may also include non-volatile memory (non-volatile memory), such as at least one disk memory.

The algorithms or displays presented herein are not inherently related to any particular computer, virtual system, or other apparatus. In addition, embodiments of the present invention are not directed to any particular programming language.

In the description provided herein, numerous specific details are set forth. It will be appreciated, however, that embodiments of the invention may be practiced without such specific details. Similarly, in the above description of exemplary embodiments of the invention, various features of embodiments of the invention are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the disclosure and aiding in the understanding of one or more of the various inventive aspects. Wherein the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate embodiment of this invention.

Those skilled in the art will appreciate that the modules in the apparatus of the embodiments may be adaptively changed and disposed in one or more apparatuses different from the embodiments. The modules or units or components of the embodiments may be combined into one module or unit or component and, furthermore, they may be divided into a plurality of sub-modules or sub-units or sub-components. Except that at least some of such features and/or processes or elements are mutually exclusive.

It should be noted that the above-mentioned embodiments illustrate rather than limit the invention, and that those skilled in the art will be able to design alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of elements or steps not listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The invention may be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In the unit claims enumerating several means, several of these means may be embodied by one and the same item of hardware. The use of the words first, second, third, etc. do not denote any order. These words may be interpreted as names. The steps in the above embodiments should not be construed as limiting the order of execution unless specifically stated.

Claims (9)

1. The automatic scheduling and scheduling generation method of the official vehicle is characterized by comprising the following steps of:

receiving a work order sent by a user terminal;

acquiring available vehicle information, assigning vehicles to the passengers in a preset mode, and sending corresponding vehicle and passenger information to user terminals of the passengers;

and generating a vehicle dispatching schedule according to the related information of the vehicle work orders and the vehicle assignment, and outputting a result.

2. The automatic scheduling method of a business car according to claim 1, wherein the car worksheet comprises a go-to-Cheng Gongshan worksheet and a return worksheet, and the go-to-Cheng Gongshan worksheet and the return worksheet comprise: department of vehicles, origin of vehicles, destination of vehicles, number of passengers and personnel information, time of vehicles and arrival time.

3. The method for generating an automatic scheduling schedule of a utility vehicle according to claim 2, wherein when the schedule Cheng Gongshan is received and the number of available vehicles meets the requirement for the number of carpools, the manner of assigning the vehicles specifically includes:

acquiring a plurality of pieces of Cheng Gongshan information meeting the carpooling requirement;

creating a plurality of carpool paths according to the plurality of pieces of Cheng Gongshan information;

and judging the size relation between the car cost of each car sharing path and the sum of the independent car cost of each travel-going worker in the car sharing requirement, and determining the car sharing path and car sharing vehicle information with the lowest cost.

4. A method of generating an automatic dispatch shift for a utility vehicle as claimed in claim 3, wherein independent vehicles are assigned to the stops Cheng Gongshan which do not meet the carpool requirement.

5. The method for generating an automatic scheduling schedule of a utility vehicle according to claim 2, wherein when the schedule Cheng Gongshan is received and the number of available vehicles does not meet the demand for the number of vehicles to be shared, the manner of assigning the vehicles specifically includes:

screening out a stop Cheng Gongshan waiting for the return of the vehicle to be dispatched according to the time of use, the arrival time and the emergency degree of use;

acquiring the return time of the return vehicle and comparing the return time with the vehicle time and the arrival time in the screened Cheng Gongshan;

if the return time of the returning vehicle meets the requirement of the service time of the vehicle on the departure work order, designating the vehicle to a vehicle operator according to a preset mode;

if the return time of the returning vehicle does not meet the requirement of the service time of the vehicle on the delivery work order, the information that the vehicle arrangement cannot be completed according to the requirement of Cheng Gongshan is fed back to the vehicle staff.

6. The automatic scheduling method of a utility vehicle according to claim 2, wherein, when assigning vehicles to operators according to the schedule Cheng Gongshan: the operators of the same department are preferably assigned to the same vehicle.

7. The automatic scheduling method of a public service vehicle according to claim 2, wherein the user terminal transmitting the order Cheng Gongshan has authority to lock the vehicle position when the number of passengers on the same order is at least 3.

8. The automatic scheduling method of a public service vehicle according to claim 2, wherein when receiving a return work order sent by a user terminal, the vehicle assignment mode specifically comprises:

acquiring the vehicle utilization time information and the vehicle utilization starting place information on the return work orders, and searching other return work order information around the vehicle utilization starting place;

judging whether at least two orders on the periphery meet the carpooling condition or not;

if the carpooling condition is met, assigning the same vehicle to the operators of the multiple return worksheets;

if the carpooling condition is not met, vehicles are solely assigned to the return worksheet.

9. The automatic dispatch shift generation method of a utility vehicle of claim 8, wherein, when assigning the vehicle:

when the carpooling condition is met, preferentially assigning a return vehicle near the vehicle place;

when the car pooling condition is not met, calculating and comparing the cost of the car from the company, the car utilization starting place, the car utilization destination and the returning company and the cost of the car utilization personnel for directly taking the car to the car utilization destination, selecting a mode with lower cost, and feeding back to the user terminal.

Images