CN111178597A - Car pooling order line generation method and device - Google Patents
Car pooling order line generation method and device Download PDFInfo
- Publication number
- CN111178597A CN111178597A CN201911290584.XA CN201911290584A CN111178597A CN 111178597 A CN111178597 A CN 111178597A CN 201911290584 A CN201911290584 A CN 201911290584A CN 111178597 A CN111178597 A CN 111178597A
- Authority
- CN
- China
- Prior art keywords
- order
- route
- line
- departure
- started
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 52
- 238000011176 pooling Methods 0.000 title abstract description 19
- 238000005457 optimization Methods 0.000 claims abstract description 44
- 238000007781 pre-processing Methods 0.000 claims description 5
- 238000004590 computer program Methods 0.000 claims description 4
- 238000004422 calculation algorithm Methods 0.000 description 11
- 238000010586 diagram Methods 0.000 description 7
- 238000004364 calculation method Methods 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000010187 selection method Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
- G06Q30/0635—Processing of requisition or of purchase orders
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
- Y02T10/00—Road transport of goods or passengers
- Y02T10/10—Internal combustion engine [ICE] based vehicles
- Y02T10/40—Engine management systems
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Game Theory and Decision Science (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention discloses a method and a device for generating a carpool order line. The method comprises the steps of obtaining a car pooling order in a first time period, generating an initial line according to a departure order, updating the initial line according to an optimization target to generate a line to be started, inserting a departure order meeting matching conditions into the line to be started, updating the line to be started, and updating the line to be started according to the optimization target; and when the departure condition is met, the vehicle is operated according to the route to be departed, the route to be departed is changed into the running route, the port entering order meeting the waiting time threshold value condition and the optimization target is inserted into the running route, and the running route is updated until the vehicle finishes the pick-up and delivery task. The service order number of the single carpooling line is improved, the carpooling line is dynamically optimized, dynamic adjustment is carried out according to the change of the follow-up line, and the carpooling efficiency is improved.
Description
Technical Field
The invention relates to the field of software, in particular to a method and a device for generating a route of a car pooling order.
Background
With the further popularization of a positioning system and a smart phone, the network taxi booking trip capable of meeting the demand of passengers in real time gradually replaces the traditional taxi trip, but in some current taxi-pooling algorithms, one taxi service only can be one to two passengers, the taxi-pooling rate is low, real-time adjustment can not be carried out, route optimization is not carried out by combining taxi-pooling scenes, management constraints on the taxi are loose, after a taxi-pooling task is completed, the taxi usually runs according to the intention of a driver, the resource of the taxi cannot be fully utilized, the problem of 'difficulty in taking the taxi' in a rush hour is not effectively solved by the network taxi booking, and the problems of pollution and congestion cannot be improved. Therefore, a method for generating a car pooling order line, which can meet the requirements of passengers, save cost and time and dynamically optimize the car pooling order line according to road conditions, is needed.
Disclosure of Invention
The present invention is directed to solving at least one of the problems of the prior art. Therefore, the invention provides a method for generating a carpool order route, which can simultaneously meet the requirements of passengers, save cost and time and dynamically optimize the route according to the road conditions.
In a first aspect, an embodiment of the present invention provides a: a method for generating a route of a car pool order comprises the following steps:
obtaining a carpooling order in a first time period, wherein the carpooling order comprises an exit order and an entry order;
generating an initial line according to the departure order, updating the initial line according to an optimization target, and generating a line to be departed, wherein the line to be departed only comprises the departure order;
inserting the inbound order meeting the matching condition into the route to be started, updating the route to be started, and updating the route to be started according to the optimization target;
when the departure condition is met, vehicle operation is carried out according to the route to be departed, the route to be departed is changed into the running route, and the departure condition comprises the following steps: available vehicles when arriving at departure time;
and adjusting the port entering orders meeting the waiting time threshold condition and the optimization goal in the running route, and updating the running route until the vehicles finish the pick-up task.
Further, the generating an initial route according to the departure order includes: and selecting the departure orders with the least added routes one by one to generate the initial routes.
Further, the optimization objective refers to a profit objective, including: and generating a new line through an order in the exchange line and/or an order between the exchange lines, calculating the profit of the new line, and selecting the line with the highest profit.
Further, the inserting the inbound order meeting the matching condition into the route to be departed includes:
judging whether the boarding time of the inbound order meets the time requirement of the line to be started or not, if so, performing line matching on the inbound order and the line to be started according to the matching condition, if so, inserting the line, and otherwise, forming a new line to arrange other vehicles to serve the inbound order;
the matching conditions include: the method comprises the following steps of running time window matching, car sharing time optimization matching, vehicle passenger number matching and receiving and sending strategy matching.
Further, when the running line exists, the inbound order is matched with the running line in priority.
Further, the step of preprocessing the order after the obtaining of the carpool order in the first time period comprises expanding the getting-on time in the carpool order into a getting-on time window.
Further, the latency threshold condition includes: and after the line adjustment is carried out, if the waiting time of the vehicles in the line is greater than the waiting time threshold value, rejecting the line adjustment.
In a second aspect, an embodiment of the present invention provides B, a car pool order line generation apparatus, including:
an acquisition module: the taxi sharing method comprises the steps of obtaining taxi sharing orders in a first time period, wherein the taxi sharing orders comprise departure orders and arrival orders;
an initial line generation module: the system comprises a receiving unit, a generating unit and a processing unit, wherein the receiving unit is used for generating an initial route according to the departure order and updating the initial route according to an optimization target to generate a route to be departed, and the route to be departed only comprises the departure order;
a to-be-started line generation module: the system is used for inserting the inbound order meeting the matching condition into the route to be started, updating the route to be started and updating the route to be started according to the optimization target;
the running route generation module: the departure condition comprises that: available vehicles when arriving at departure time;
updating the line module: and the method is used for adjusting the port entering orders meeting the waiting time threshold condition and the optimization goal in the running route and updating the running route until the vehicles finish the pick-up task.
In a third aspect, the present invention provides a car pooling order line generating device, including:
at least one processor, and a memory communicatively coupled to the at least one processor;
wherein the processor is adapted to perform the method of any of the first aspects by invoking a computer program stored in the memory.
In a fourth aspect, the present invention provides a computer-readable storage medium having stored thereon computer-executable instructions for causing a computer to perform the method of any of the first aspects.
The invention has the beneficial effects that:
the method comprises the steps of obtaining a car pooling order in a first time period, generating an initial line according to a departure order, updating the initial line according to an optimization target to generate a line to be started, inserting a departure order meeting matching conditions into the line to be started, updating the line to be started, and updating the line to be started according to the optimization target; and when the departure condition is met, the vehicle is operated according to the route to be departed, the route to be departed is changed into the running route, the port entering order meeting the waiting time threshold value condition and the optimization target is inserted into the running route, and the running route is updated until the vehicle finishes the pick-up and delivery task. The carpooling route is generated aiming at the entrance and exit scenes, the service order number of a single carpooling route is improved, the carpooling route is dynamically optimized, dynamic adjustment is carried out according to the change of the subsequent route, the transportation constraint of the existing algorithm to the vehicle is changed into strict constraint, the order distribution rule provided by the carpooling data is fully utilized to effectively dispatch the vehicle, the possibly-appearing demand-intensive area is arranged in advance, and the carpooling efficiency is improved.
The method can be widely applied to the field of car pooling algorithms.
Drawings
FIG. 1 is a flowchart illustrating an implementation of a method for generating a route of a carpool order according to an embodiment of the present invention;
FIGS. 2a to 2b are schematic circuit switching diagrams of an embodiment of a car pool order line generation method according to the present invention;
FIG. 3 is a flowchart illustrating a method for generating a route of a car pool order according to an embodiment of the present invention;
fig. 4 is a block diagram of a car pool order line generating apparatus according to an embodiment of the present invention.
Detailed Description
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following description will be made with reference to the accompanying drawings. It is obvious that the drawings in the following description are only some examples of the invention, and that for a person skilled in the art, other drawings and embodiments can be derived from them without inventive effort.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. The terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention.
The first embodiment is as follows:
the embodiment is applied to an order intensive scene, such as an optional airport and the like, the airport is selected for illustration, all passengers getting in and out of the airport are target carpooling passengers, and carpooling orders are divided into departure orders from the airport and arrival orders arriving at the airport. For example, for the passengers entering and leaving the airport in a certain time period, the passengers leaving the airport are arranged to take corresponding vehicles, the routes are determined to send the passengers back to the respective destinations, meanwhile, the passengers entering the airport matching with the current route are picked up in the process and finally return to the airport, and the process is repeated to realize the receiving and sending tasks.
Fig. 1 is a flowchart illustrating an implementation of a method for generating a car pool order route according to an embodiment of the present invention, and as shown in fig. 1, the method includes the following steps:
s1: and obtaining the carpooling orders in the first time period, wherein the carpooling orders comprise departure orders and entry orders.
Since the car pool algorithm is time-efficient and must be specific to some passengers, the target passengers of the car pool order route are set as passengers who submit new orders in the first time period and passengers who do not find a suitable route to wait before, and the first time period can be set according to actual requirements, for example, the first time period is set as [ T, T + Δ T ] time period in the embodiment, and meanwhile, the value of Δ T can be set, for example, as 5 minutes, and T is a multiple of five from zero.
The method comprises the steps that a car sharing order in a first time period is received, orders of passengers entering a port and passengers leaving the port need to be processed respectively, the boarding place of the passengers leaving the port is an airport, and therefore vehicles also start from the airport, car sharing information only needs to check boarding time without checking the boarding place, the boarding place of the passengers entering the port is different from person to person, and the boarding time and the boarding place need to be checked simultaneously through the car sharing information, so that the workload can be reduced, and the car sharing efficiency can be improved.
S2: the method for preprocessing the carpool order specifically comprises the following steps: and expanding the boarding time in the carpool order into a boarding time window, for example, optionally setting the left boundary of the boarding time window as the boarding time minus the preset waiting time, and setting the right boundary as the boarding time.
In this embodiment, during the time period [ T, T + Δ T ], the system will receive a car pool order from a passenger, and the passenger's order generally includes the following information: the boarding place, the boarding time, the alighting place and the number of passengers. Since the departure time of the order submitted by the passenger is usually a time point, if only checking whether the line is right to receive the passenger at the time point is performed when the subsequent carpooling line is generated, the conditions are harsh and not in accordance with the actual situation. Therefore, the present embodiment performs order preprocessing to expand the getting-on time in the carpool order forward, and converts the getting-on time into the getting-on time window, for example, the left boundary of the getting-on time window is set to be the getting-on time minus a preset waiting time (for example, five minutes), and the right boundary is the getting-on time.
S3: the method includes the steps of generating an initial route according to a departure order, updating the initial route according to an optimization target, and generating a route to be departed, wherein the route to be departed only contains the departure order, and it can be understood that the initial route comprises one or more routes to form an initial solution, and the number of the routes is not limited herein.
S4: inserting the entering order meeting the matching conditions into the route to be started, updating the route to be started, and updating the route to be started according to the optimization target.
S5: when the departure condition is met, vehicle operation is carried out according to the route to be departed, the route to be departed is changed into the running route, and the departure condition comprises the following steps: when the departure time is reached and the vehicle is available, namely the route is determined well and the route reaches the departure time and the vehicle available can operate the route to be departed, the route can be operated, namely the route to be departed is changed into the route which is in operation.
S6: inserting the entering order meeting the waiting time threshold condition and the optimization target into the running line, and updating the running line until the vehicle finishes the pick-up task.
Specifically, in step S3, the initial route is generated for all the passengers leaving the port, specifically, the order that has the shortest route is selected one by using the Solomon algorithm to generate the initial route. For example, in the known airport position and the get-off point position of all passengers leaving the airport, the sequence of accessing the get-off points is determined according to the Solomon algorithm based on the minimum increment of each driving distance, namely, firstly, the driver is supposed to send only one passenger leaving the airport, the point with the minimum driving distance from the airport among all the passengers is selected as the first access point of the route, because the minimum driving distance from the airport means that the route of the loop formed by the vehicle after sending the passenger and returning to the airport is shortest, and then the selection method of the second point on the route is as follows: and inserting a certain point in the remaining orders into the loop line formed before, wherein the point which leads the shortest increased route in the points is the second point, and determining the access point by analogy, namely selecting the outbound orders with the least increased route one by one to generate the initial route.
And meanwhile, adjusting and updating the initial route according to the optimization target to generate a route to be started, wherein the route to be started only comprises the departure order. In this embodiment, the optimization objective refers to a profit objective, that is, the generated profit of the line is the maximum, when the line is adjusted, a new line is generated through an order in the exchange line and/or an order between the exchange lines, the profit of the new line is calculated, and the line with the highest profit is selected as the adjusted line.
As shown in fig. 2a to 2b, which are schematic diagrams of circuit switching in the present embodiment, the processes of circuit switching and circuit switching are described with reference to fig. 2a to 2b, and it is assumed that 0 represents the location of an airport, and the locations 1, 2, 3, 4, 5, 6, etc. where each circuit starts and ends represent access points on the circuit. Wherein, FIG. 2a is a schematic diagram of the process of in-circuit switching, i.e., switching the sequence of points in the circuit, the circuit 0-1-2-3-4-0 becomes the circuit 0-1-3-2-4-0; FIG. 2b is a schematic diagram of the process of the circuit switching, wherein the circuit 0-1-2-3-4-0 and the circuit 0-5-6-0 are two circuits, and the circuit switching becomes the circuit 0-1-2-5-0 and the circuit 0-6-3-4-0. And in the same way, multiple route adjustment attempts are carried out within feasible time, whether the optimized route has increased profit compared with the previous route is judged, and the route with the maximum profit is obtained as far as possible.
In this embodiment, the profit is obtained by subtracting the cost from the profit, which is the sum of the fees paid by all the passengers in the line. The calculation of the cost of each passenger can adopt a taxi calculation mode, the starting price is added with the mileage price, and the mileage price is the cost of unit distance multiplied by the total distance; and the cost is calculated based on the mileage and the waiting time of the line, and is obtained by multiplying the cost per mileage by the total mileage plus the cost per waiting time by the total waiting time. And operating for 24h, and accumulating the profits generated by each line in the period to obtain the total profit of one day.
In step S4, inserting a port entry order meeting the matching condition into the route to be started, which includes the following steps: judging whether the boarding time of the inbound order meets the time requirement of the line to be departed, namely whether the boarding time is in the line running time window of the line to be departed, if so, performing line matching on the inbound order and the line to be departed according to matching conditions, if so, inserting the line, otherwise, arranging other vehicles to serve the inbound order.
The line to be started is matched with the order with the smallest distance increase in the inbound orders meeting the matching conditions corresponding to the line. The specific matching conditions include: 1) matching the running time window: the vehicle to be placed in the order must reach its boarding point within the time window of the inbound order so that passengers can board on time; 2) car sharing time optimization matching: in order to prevent the time taken by the inbound passengers to select the carpool from far exceeding the time taken by the inbound passengers not to select the carpool, the embodiment sets a ratio threshold of the two, for example, the threshold may be set to 1.5, that is, the time taken by the inbound passengers to select the carpool cannot exceed 1.5 times of the time taken by the inbound passengers to directly take the car; 3) matching the number of passengers carried by the vehicle: that is, the number of passengers in a vehicle may not exceed the capacity of the vehicle, regardless of how passengers get on or off the vehicle; 4) matching receiving and sending strategies: selecting according to different receiving and sending strategies which can be set according to actual conditions; different pick-up strategies may affect the route generation process of the car pool order, such as whether all departure passengers are required to pick up the passengers at the arrival after arriving at the destination, or whether the passengers at the arrival can get on the car at any time.
At this time, the lines to be departed include both the departure passengers and the arrival passengers, and the lines can be further updated according to the optimization goals, that is, the lines are further optimized through inter-line order exchange and/or intra-line order exchange.
In step S5, when the arrival/departure time is reached and there is a car at the airport, the car departs along the route to be departed and the route is the running route, and if the arrival/departure time is reached but there is no car at the airport, the information is notified to the passenger in time, and the passenger autonomously selects whether or not to share the car.
Furthermore, when the inbound orders are matched, if a running route exists, the inbound orders are preferentially matched with the running route, so that the inbound passenger waiting time is reduced, and the carpooling efficiency is improved.
In step S6, for the on-going route, further optimization can be performed for the non-boarding passengers therein. The static algorithm is changed into a dynamic algorithm, and when the route is optimized, not only the information when the order is received is considered, but also other information brought by the change of the subsequent route in the operation process is combined for dynamic adjustment.
Since the position of these inbound passengers has just been determined taking into account only the route information at the time of their order receipt, but now the real-time route information has changed due to vehicle operation, there may still be a more suitable position for the inbound passengers, and orders that can bring greater revenue to the system, there is still room for optimization between the time points when the initial position and the time of boarding have been found, but the optimization is more limited because the vehicle is already on the road, the result of the optimization cannot violate the relevant constraints of the inbound passengers, nor can the inbound passengers who have been scheduled to miss the vehicle, but merely adjust the scheduled order to different positions between different routes and within the same route.
In this embodiment, a waiting time threshold condition is introduced, and after the line adjustment is performed, if the waiting time of the vehicle in the line is greater than the waiting time threshold, the line adjustment is rejected. That is, if the adjustment caused by the follow-up order information causes a significant increase in the line-related vehicle waiting time (e.g., the time to arrive at the boarding location within the boarding time window for the passenger to board) beyond the waiting time threshold, the adjustment will be rejected; otherwise, the adjustment is accepted, and meanwhile, according to the optimization objective, the profit of the adjusted line is higher than the profit before the adjustment. Similar optimization of the on-going route continues until the vehicle has completed all passenger pick-up tasks on the corresponding route, back to the airport.
Fig. 3 is a schematic flow chart of the method for generating a route of a car pool order in this embodiment. With reference to fig. 3, first, order data is read to perform order preprocessing, the order data is divided into departure data and arrival data, an initial solution is formed for all departure orders of the departure data, and a line to be departed is generated by intra-line order exchange and/or inter-line order exchange updating the line.
And meanwhile, processing the inbound data, namely firstly judging whether the boarding time of the inbound order meets the time requirement of the line to be started, if not, rejecting the order, otherwise, performing line matching on the inbound order and the running line, if the matching is successful, inserting the inbound order into the running line, otherwise, matching the inbound order with the line to be started, if the matching is successful, inserting the inbound order into the line to be started, otherwise, arranging a new line, and arranging other vehicles to serve the inbound order.
And performing in-line order exchange and/or inter-line order exchange to update the line for the order to be started according to the optimization target, judging whether the departure time is reached, judging whether available vehicles exist or not if the departure time is reached, operating the line to be started if the available vehicles exist, changing the line to be started into the line which is in operation, and informing the state of passengers if the available vehicles do not exist.
Further, adjusting the running line according to the real-time information, and judging whether the line adjusted according to the real-time information meets related constraints, wherein the related constraints comprise: and optimizing the target and waiting threshold time conditions, namely adjusting the route under the condition that relevant constraints are met or keeping the route unchanged until the vehicle finishes the pick-up task.
The car pooling order is centralized at one or more order intensive points, order information of different passengers is effectively analyzed based on data, a line which can meet requirements of the passengers simultaneously is generated according to an analysis result, cost and time are saved, dynamic optimization can be carried out along with road conditions, reference is provided for a car pooling algorithm of an order intensive scene, and management departments can manage the key areas conveniently.
Example two:
the present embodiment provides a car pooling order line generating device, as shown in fig. 4, which is a block diagram of the car pooling order line generating device of the present embodiment, and the block diagram includes:
the acquisition module 100: the system comprises a terminal, a terminal and a server, wherein the terminal is used for acquiring taxi sharing orders in a first time period, and the taxi sharing orders comprise departure orders and entry orders;
initial route generation module 200: the system comprises a route generation module, a route selection module and a route selection module, wherein the route generation module is used for generating an initial route according to a departure order and updating the initial route according to an optimization target to generate a route to be departed, and the route to be departed only comprises the departure order;
to-be-sent line generation module 300: the method comprises the steps of inserting a port entering order meeting matching conditions into a route to be started, updating the route to be started, and updating the route to be started according to an optimization target;
running route generation module 400: when the departure condition is met, the method is used for carrying out vehicle operation according to a line to be departed, the line to be departed is changed into a running line, and the departure condition comprises the following steps: available vehicles when arriving at departure time;
update line module 500: and the method is used for adjusting the entering orders meeting the waiting time threshold condition and the optimization goal in the running route and updating the running route until the vehicles finish the pick-up task.
The specific details of the car pool order line generation device module in the above description have been described in detail in the car pool order line generation method corresponding to the embodiment, and therefore are not described herein again.
In addition, the invention also provides a carpool order line generating device, which comprises:
at least one processor, and a memory communicatively coupled to the at least one processor;
wherein the processor is configured to perform the method according to embodiment one by calling the computer program stored in the memory. A computer program, i.e. a program code for causing a car pool order line generating device to perform the steps of the car pool order line generating method as described in the above section of the embodiments of this description, when the program code is run on the car pool order line generating device.
In addition, the present invention also provides a computer-readable storage medium, which stores computer-executable instructions for causing a computer to perform the method according to the first embodiment.
The method comprises the steps of obtaining a car pooling order in a first time period, generating an initial line according to a departure order, updating the initial line according to an optimization target to generate a line to be started, inserting a departure order meeting matching conditions into the line to be started, updating the line to be started, and updating the line to be started according to the optimization target; and when the departure condition is met, the vehicle is operated according to the route to be departed, the route to be departed is changed into the running route, the port entering order meeting the waiting time threshold value condition and the optimization target is inserted into the running route, and the running route is updated until the vehicle finishes the pick-up and delivery task. The carpooling route is generated aiming at the entrance and exit scenes, the service order number of a single carpooling route is improved, the carpooling route is dynamically optimized, dynamic adjustment is carried out according to the change of the subsequent route, the transportation constraint of the existing algorithm to the vehicle is changed into strict constraint, the order distribution rule provided by the carpooling data is fully utilized to effectively dispatch the vehicle, the possibly-appearing demand-intensive area is arranged in advance, and the carpooling efficiency is improved. The method can be widely applied to the field of car pooling algorithms.
The above embodiments are only used for illustrating the technical solutions of the present invention, and not for limiting the same, although the present invention is described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; such modifications and substitutions do not depart from the spirit and scope of the present invention, and they should be construed as being included in the following claims and description.
Claims (10)
1. A method for generating a route of a car pool order is characterized by comprising the following steps:
obtaining a carpooling order in a first time period, wherein the carpooling order comprises an exit order and an entry order;
generating an initial line according to the departure order, updating the initial line according to an optimization target, and generating a line to be departed, wherein the line to be departed only comprises the departure order;
inserting the inbound order meeting the matching condition into the route to be started, updating the route to be started, and updating the route to be started according to the optimization target;
when the departure condition is met, vehicle operation is carried out according to the route to be departed, the route to be departed is changed into the running route, and the departure condition comprises the following steps: available vehicles when arriving at departure time;
and adjusting the port entering orders meeting the waiting time threshold condition and the optimization goal in the running route, and updating the running route until the vehicles finish the pick-up task.
2. The method for generating a route of a car pool order according to claim 1, wherein said generating an initial route according to said departure order comprises: and selecting the departure orders with the least added routes one by one to generate the initial routes.
3. The method according to claim 1, wherein the optimization goal is profit goal, comprising: and generating a new line through an order in the exchange line and/or an order between the exchange lines, calculating the profit of the new line, and selecting the line with the highest profit.
4. The method for generating a carpool order route according to claim 1, wherein the inserting the inbound order satisfying a matching condition in the route to be departed comprises:
judging whether the boarding time of the inbound order meets the time requirement of the line to be started or not, if so, performing line matching on the inbound order and the line to be started according to the matching condition, if so, inserting the line, and otherwise, forming a new line to arrange other vehicles to serve the inbound order;
the matching conditions include: the method comprises the following steps of running time window matching, car sharing time optimization matching, vehicle passenger number matching and receiving and sending strategy matching.
5. The method according to claim 4, wherein when the running route exists, the inbound order is preferentially matched with the running route.
6. The method according to claim 1, wherein the step of obtaining the car pool order in the first time period further comprises performing order preprocessing to expand the getting-on time in the car pool order to a getting-on time window.
7. The method according to any one of claims 1 to 6, wherein the waiting time threshold condition comprises: and after the line adjustment is carried out, if the waiting time of the vehicles in the line is greater than the waiting time threshold value, rejecting the line adjustment.
8. A carpool order line generation apparatus, comprising:
an acquisition module: the taxi sharing method comprises the steps of obtaining taxi sharing orders in a first time period, wherein the taxi sharing orders comprise departure orders and arrival orders;
an initial line generation module: the system comprises a receiving unit, a generating unit and a processing unit, wherein the receiving unit is used for generating an initial route according to the departure order and updating the initial route according to an optimization target to generate a route to be departed, and the route to be departed only comprises the departure order;
a to-be-started line generation module: the system is used for inserting the inbound order meeting the matching condition into the route to be started, updating the route to be started and updating the route to be started according to the optimization target;
the running route generation module: the departure condition comprises that: available vehicles when arriving at departure time;
updating the line module: and the method is used for adjusting the port entering orders meeting the waiting time threshold condition and the optimization goal in the running route and updating the running route until the vehicles finish the pick-up task.
9. A carpool order line generation apparatus, comprising:
at least one processor; and a memory communicatively coupled to the at least one processor;
wherein the processor is operable to perform the method of any one of claims 1 to 7 by invoking a computer program stored in the memory.
10. A computer-readable storage medium having stored thereon computer-executable instructions for causing a computer to perform the method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911290584.XA CN111178597B (en) | 2019-12-16 | 2019-12-16 | Car pooling order line generation method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911290584.XA CN111178597B (en) | 2019-12-16 | 2019-12-16 | Car pooling order line generation method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111178597A true CN111178597A (en) | 2020-05-19 |
| CN111178597B CN111178597B (en) | 2022-11-08 |
Family
ID=70657217
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911290584.XA Active CN111178597B (en) | 2019-12-16 | 2019-12-16 | Car pooling order line generation method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111178597B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111681083A (en) * | 2020-06-09 | 2020-09-18 | 上海汽车集团股份有限公司 | Carpooling scheduling method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150324718A1 (en) * | 2014-05-06 | 2015-11-12 | Elwha Llc | Real-time carpooling coordinating systems and methods |
| CN105070044A (en) * | 2015-08-17 | 2015-11-18 | 南通大学 | Dynamic scheduling method for customized buses and car pooling based on passenger appointments |
| CN106803197A (en) * | 2015-11-26 | 2017-06-06 | 滴滴（中国）科技有限公司 | Spell single method and apparatus |
| CN106886836A (en) * | 2017-02-21 | 2017-06-23 | 戴姆勒股份公司 | Method for realizing rideshare in the car |
| CN108876156A (en) * | 2018-06-25 | 2018-11-23 | 清华大学 | Share-car and user's order processing method, system and the equipment being applicable in |
-
2019
- 2019-12-16 CN CN201911290584.XA patent/CN111178597B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150324718A1 (en) * | 2014-05-06 | 2015-11-12 | Elwha Llc | Real-time carpooling coordinating systems and methods |
| CN105070044A (en) * | 2015-08-17 | 2015-11-18 | 南通大学 | Dynamic scheduling method for customized buses and car pooling based on passenger appointments |
| CN106803197A (en) * | 2015-11-26 | 2017-06-06 | 滴滴（中国）科技有限公司 | Spell single method and apparatus |
| CN106886836A (en) * | 2017-02-21 | 2017-06-23 | 戴姆勒股份公司 | Method for realizing rideshare in the car |
| CN108876156A (en) * | 2018-06-25 | 2018-11-23 | 清华大学 | Share-car and user's order processing method, system and the equipment being applicable in |
Non-Patent Citations (1)
| Title |
|---|
| 罗杭等: "基于多智能体的城市群政策协调建模与仿真", 《中国管理科学》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111681083A (en) * | 2020-06-09 | 2020-09-18 | 上海汽车集团股份有限公司 | Carpooling scheduling method and device |
| CN111681083B (en) * | 2020-06-09 | 2023-04-18 | 上海汽车集团股份有限公司 | Carpooling scheduling method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111178597B (en) | 2022-11-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109034481B (en) | Constraint programming-based vehicle path problem modeling and optimizing method with time window | |
| WO2021031638A1 (en) | Dispatching method and device | |
| CN107103383B (en) | Dynamic taxi sharing scheduling method based on taxi-taking hotspot | |
| CN110110903B (en) | Neural evolution-based distribution vehicle path planning method | |
| US11270232B2 (en) | Method for transporting a plurality of objects between object-specific locations | |
| CN110544142A (en) | Taxi taking method and equipment and terminal equipment | |
| CN108921762B (en) | Vehicle hybrid scheduling method, device and equipment | |
| CN110853349A (en) | Vehicle scheduling method, device and equipment | |
| CN112906980B (en) | Order processing method, device and system and readable storage medium | |
| CN113393137B (en) | Scheduling sharing system based on Internet of vehicles | |
| CN111695842A (en) | Distribution scheme determination method and device, electronic equipment and computer storage medium | |
| CN111178597B (en) | Car pooling order line generation method and device | |
| CN112308312B (en) | Warehouse-leaving package transfer method, model training method and related equipment | |
| CN113627858A (en) | Method and device for determining cache location of warehouse | |
| CN114169813A (en) | Transportation scheduling method and device, electronic equipment and storage medium | |
| CN111476389A (en) | Method and device for pre-estimating order receiving waiting time | |
| CN112106021A (en) | Method and device for providing vehicle navigation simulation environment | |
| CN112541685A (en) | Order allocation method, system, platform and storage medium | |
| CN116307580A (en) | Method and device for scheduling capacity, electronic equipment and storage medium | |
| CN110400004A (en) | The time limit method for early warning and device of railway goods | |
| CN108549959A (en) | Automatic send a car method and device, computer readable storage medium, terminal | |
| CN114463102A (en) | Order in-route matching degree calculation method and device | |
| Van Son et al. | Prediction-based optimization for online People and Parcels share a ride taxis | |
| CN112053087A (en) | Complaint work order processing method, device, equipment and storage medium | |
| CN111985859A (en) | Method, computing device and computer-readable storage medium for order scheduling |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |