CN117782129A

CN117782129A - Method, device, equipment and storage medium for planning carpooling path

Info

Publication number: CN117782129A
Application number: CN202311818200.3A
Authority: CN
Inventors: 李佩; 宁永恒; 杨陈
Original assignee: Jiangsu Yunmanman Tongcheng Information Technology Co ltd; Jiangsu Manyun Software Technology Co Ltd
Current assignee: Jiangsu Yunmanman Tongcheng Information Technology Co ltd; Jiangsu Manyun Software Technology Co Ltd
Priority date: 2023-12-26
Filing date: 2023-12-26
Publication date: 2024-03-29

Abstract

The invention discloses a carpooling path planning method, a device, equipment and a storage medium, wherein the method comprises the following steps: generating an initial carpooling path according to an order starting place and an order ending place of a driver to be carpooled; the initial carpooling path is composed of at least one order place; the order place is an order start place, an order end place or an order path place; generating a first reference carpooling path according to the driver order income and the path transportation cost among all order places in the initial carpooling path; determining first order benefits corresponding to the initial carpool path and second order benefits corresponding to the first reference carpool path; and determining a target carpooling path of the driver to be carpooled according to the first order gain and the second order gain. The technical scheme of the embodiment of the invention realizes reasonable planning of the carpooling path, and meets the carpooling timeliness requirement while maximizing the income of the carpooling freight car drivers.

Description

Method, device, equipment and storage medium for planning carpooling path

Technical Field

The present invention relates to the field of data processing technologies, and in particular, to a method, an apparatus, a device, and a storage medium for planning a carpool path.

Background

In the same city highway freight scene, one freight is usually pulled only in a single trip by one freight car, and the freight car can be additionally provided with one freight car under the condition that the car body condition of the freight car is met due to higher running cost of the large freight car, which is commonly called as a spare part car sharing. The spare part carpooling not only can increase the single-way income of a driver, but also can reduce the shipping cost of a cargo owner, and can also contribute to energy conservation and emission reduction.

At present, the existing freight platforms are rarely used for sharing the same city of the spare part, and when the goods are shared, a driver can only see information of the goods sources and does not give the optimal sharing plan to the driver, so that benefits of the driver are difficult to maximize, and ageing requirements of the goods owners on the goods sources are difficult to completely meet.

Disclosure of Invention

The invention provides a method, a device, equipment and a storage medium for planning a carpool path, which are used for reasonably planning the carpool path, maximizing the income of a carpool cargo car driver and meeting the carpool timeliness requirement.

According to an aspect of the present invention, there is provided a carpool path planning method, the method including:

generating an initial carpooling path according to an order starting place and an order ending place of a driver to be carpooled; the initial carpooling path consists of at least one order place; the order place is an order starting place, an order ending place or an order path place;

Generating a first reference carpooling path according to the driver order income and the path transportation cost among all order places in the initial carpooling path;

determining a first order gain corresponding to the initial carpool path and a second order gain corresponding to the first reference carpool path;

and determining a target carpooling path of the driver to be carpooled according to the first order gain and the second order gain.

According to another aspect of the present invention, there is provided a carpool path planning apparatus, the apparatus including:

the initial path generation module is used for generating an initial carpooling path according to an order starting place and an order ending place of a driver to be carpooled; the initial carpooling path consists of at least one order place; the order place is an order starting place, an order ending place or an order path place;

the first carpooling path generation module is used for generating a first reference carpooling path according to the driver order income and the path transportation cost among the order places in the initial carpooling path;

the second carpool path generation module is used for determining first order benefits corresponding to the initial carpool path and second order benefits corresponding to the first reference carpool path;

And the target carpooling path determining module is used for determining the target carpooling path of the driver to be carpooled according to the first order gain and the second order gain.

According to another aspect of the present invention, there is provided an electronic apparatus including:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein,

the memory stores a computer program executable by the at least one processor to enable the at least one processor to perform the method of carpool path planning as described in any of the embodiments of the invention.

According to another aspect of the present invention, there is provided a computer readable storage medium storing computer instructions for causing a processor to implement the carpool path planning method of any embodiment of the present invention when executed.

According to the technical scheme, an initial carpooling path is generated according to the order starting place and the order ending place of a driver to be carpooled; generating a first reference carpooling path according to the driver order income and the path transportation cost among all order places in the initial carpooling path; determining first order benefits corresponding to the initial carpool path and second order benefits corresponding to the first reference carpool path; and determining a target carpooling path of the driver to be carpooled according to the first order gain and the second order gain. The technical scheme realizes reasonable planning of the carpooling path of the carpooling driver, maximizes the income of the carpooling cargo car driver and simultaneously meets the efficiency requirement of carpooling; the shipping cost of the shipper is reduced and the one-way carpooling income of a driver is increased.

It should be understood that the description in this section is not intended to identify key or critical features of the embodiments of the invention or to delineate the scope of the invention. Other features of the present invention will become apparent from the description that follows.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.

FIG. 1A is a flow chart of a method for planning a carpool path according to a first embodiment of the invention;

FIG. 1B is a schematic illustration of a presentation of an order initiation location, an order termination location, and an order path location for a driver of a vehicle to be assembled according to one embodiment of the present invention;

FIG. 2 is a flow chart of a method for planning a carpool path according to a second embodiment of the invention;

FIG. 3 is a flowchart of a method for planning a carpool path according to a third embodiment of the invention;

fig. 4 is a schematic structural diagram of a carpool path planning device according to a fourth embodiment of the invention;

Fig. 5 is a schematic structural diagram of an electronic device for implementing the carpool path planning method according to an embodiment of the invention.

Detailed Description

In order that those skilled in the art will better understand the present invention, a technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in which it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present invention without making any inventive effort, shall fall within the scope of the present invention.

It should be noted that the terms "first," "second," and the like in the description and the claims of the present invention and the above figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the invention described herein may be implemented in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.

Example 1

Fig. 1A is a flowchart of a carpool path planning method according to an embodiment of the present invention, where the method may be implemented by a carpool path planning device, and the carpool path planning device may be implemented in hardware and/or software, and the carpool path planning device may be configured in an electronic device. As shown in fig. 1A, the method includes:

s110, generating an initial carpooling path according to an order starting place and an order ending place of a driver to be carpooled; the initial carpooling path is composed of at least one order place; the order location is an order start location, an order end location, or an order path location.

S120, generating a first reference carpooling path according to the driver order income and the path transportation cost among the order places in the initial carpooling path.

S130, determining a first order benefit corresponding to the initial carpool path and a second order benefit corresponding to the first reference carpool path.

And S140, determining a target carpooling path of the driver to be carpooled according to the first order gain and the second order gain.

The driver to be carpooled can be a truck driver with a freight bill requirement and a reasonable path planning to be performed; the order start location may be a start location of a driver of the ride share where a first order share source exists; the order termination location may be the actual termination location of the car to be assembled, i.e. the target location, and may be the destination location of the first single-package source.

The order path place can be a place which can pass or must pass in the process that a driver waiting for a carpool goes from the order starting place to the order ending place; a schematic presentation of an order initiation site, an order termination site, and an order path site for a driver of a waiting car is shown in fig. 1B. Where each of the A, B and C sites may be an order route site from an order initiation site (X county) to an order termination site (Y county) by a driver of the car to be assembled.

For example, at least one order path location may be determined based on the actual order start location and the order end location of the vehicle to be assembled; under the condition that goods sources exist at the order path places, the order path places can be combined, and an initial carpooling path can be randomly generated. For example, assuming that the order start site has a site number of 0, the order end site has a site number of 1, and there are order path sites with numbers 2-99, the randomly generated initial collage path may be 0-2-3-6-1, with the digits representing the site numbers that characterize the meaning of going from order start site 0 to order path site 2, from order path site 2 to order path site 3, from order path site 3 to order path site 6, and from order path site 6 to order path site 1.

The initial carpooling path is composed of at least one order place, wherein the order place can be an order starting place, an order ending place or an order path place.

In the process of creating the spliced path, the order gain and the path transportation cost of a driver need to be considered, and meanwhile, the real factors such as the time-in-transit, the weight and the volume of goods, whether a goods source exists at a certain order path place or not need to be considered. While the randomly generated initial carpooling path is too randomized, it does not incorporate many realistic factors. Thus, a first reference ride share may be generated based on driver revenue and route transportation costs between order sites in the initial ride share.

In an alternative embodiment, generating a first reference ride share based on driver order revenue and the cost of route transportation between order sites in the initial ride share includes: determining an order start location as a reference order location; determining a preferred order location corresponding to the order starting location under the condition of meeting the target constraint according to the driver order income and the path transportation cost between the reference order location and other order locations in each order location; updating the reference order place to be a preferred order place corresponding to the order starting place until the preferred order place corresponding to each order place is obtained; and generating a first reference carpooling path according to the preferred order places corresponding to the order places.

The determination mode of the target constraint condition is as follows: determining the existence condition and the cargo load of an order corresponding to each order place of a driver to be carpooled; determining the arrival time range of a driver to be carpooled at each order place; determining the path duration of a driver waiting for a car to be assembled between every two order places; determining a first constraint condition according to the existence condition of an order and the acquisition load of the order, which correspond to each order place of a driver to be carpooled; determining a second constraint condition according to the arrival time range of the driver to be carpooled at each order place; determining a third constraint condition according to the path duration of the driver waiting for the carpooling between every two order places and the arrival time range of the corresponding order places; determining a fourth constraint condition according to the existence condition of the corresponding orders of the drivers to be carpooled in each order place; generating a target constraint comprising a first constraint, a second constraint, the third constraint, and a fourth constraint.

Illustratively, a source collection c= {1, …, i, …, n }, where i represents an order location i, when i is 1, represents an order initial location, and when i is n, represents an order termination location; definition y _i Whether an order source exists at order location i; definition w _i For cargo load at order site i; defining W as the maximum load of the vehicle of the driver to be carpooled; definition q _i Is the volume of the good at order site i; defining Q as the total capacity of the vehicle of the driver to be carpooled; the source owner defining order location i asks the driver to arrive at a time range of [ a ] _i ,b _i ]The method comprises the steps of carrying out a first treatment on the surface of the Defining the arrival time of a driver waiting for a car to be assembled at an order place i as t _i The method comprises the steps of carrying out a first treatment on the surface of the Defining the total number of places of order places in an initial order-sharing path of a driver waiting for a carpool as N; defining the path time length from the order place i to the order place j of the driver waiting for the carpool as r _ij The method comprises the steps of carrying out a first treatment on the surface of the Definition x _ij Whether the driver of the waiting car can go from the order place i to the order place j.

According to the situation that the driver to be carpooled places corresponding to the order exists and the order acquisition load, the first constraint conditions are determined as follows:

∑ _i∈C W _i y _i ≤W,∑ _i∈C q _i y _i ≤Q；

according to the arrival time range of the driver to be carpooled at each order place, the determined second constraint condition is as follows:

the third constraint condition is determined according to the path duration of the driver waiting for the carpooling between every two order places and the arrival time range of the corresponding order places, wherein the third constraint condition is as follows:

According to the situation that the drivers to be carpooled respectively correspond to the orders in each order place, the fourth constraint condition is determined as follows:

for example, the first reference ride share may be generated using the following model:

wherein E is _ij Driver order revenue for order location i to order location j; c (C) _ij Cost of route transportation for order site i to order site j; e (E) _ij -C _ij The profit margin of the driver can be characterized.

According to the model, a destination order place which corresponds to the order place and is used for maximizing profit of a driver to be carpooled can be determined according to the order place i. Specifically, the order sites include site A, site B, site C, and site D, for site A, F is calculated _A In (C) and calculating profit margins from location a to location B, profit margins from location a to location C and profit margins from location a to location D, respectively, and taking the maximum value of the three profit margins, for example, profit margins from location a to location C are maximized, then the next station relative to location a can be determined to be location C, and so on, and continuing to determine profit margins from location C to location B and profit margins from location C to location D, and taking the maximum value of the two profit margins as the next station location of location C, is traversed or calculated so as not to be repeatedly selected until the full order location is traversed.

Illustratively, determining the order initiation location as a reference order location, determining driver profit gains between the reference order location and other ones of the order locations in turn; wherein the other order places are the remaining order places other than the order start place itself. And taking the determined order place with the maximum profit of the driver as the preferred order place of the order starting point. And taking the preferred order place of the order starting point as a reference order place, repeating the process to determine the profit of the driver until the last order place is traversed, and generating a first reference carpooling path according to the preferred order place respectively corresponding to each order place.

In one embodiment, if the initial ride share is 0-2-4-3-1, where the numerical number indicates the order location. The number 0 indicates the order start location, the number 2, the number 3 and the number 4 indicate the order path location, and the number 1 indicates the order end location. Firstly, determining the profit of a driver between an order place 0 and the order place 1, the order place 2, the order place 3 and the order place 4 respectively, and determining the preferred order place corresponding to the order start place 0 as the order place 3 if the profit of the driver between the order place 0 and the order place 3 is determined to be the largest; secondly, determining the profit of the driver between the order place 3 and the order place 1, the order place 2 and the order place 4 respectively, and determining the preferred order place corresponding to the order start place 3 as the order place 2 if the profit of the driver between the order place 3 and the order place 2 is maximum; then, determining the profit of the driver between the order place 2 and the order place 1 and the order place 4 respectively, and determining the preferred order place corresponding to the order start place 2 as the order place 4 if the profit of the driver between the order place 2 and the order place 4 is determined to be the largest; finally, according to the preferred order places corresponding to the order places, the first reference carpool path can be determined to be 0-3-2-4-1.

It can be appreciated that in the case of a determination of a carpool path, the total revenue of the order for the corresponding carpool path can be determined; the method can be determined according to the order income and the path transportation cost of the driver between two order places of the driver to be carpooled. Thus, a first order benefit corresponding to the initial carpool path and a second order benefit corresponding to the first reference carpool path can be determined respectively; and selecting a carpooling path with the largest order gain from the first order gain and the second order gain as a target carpooling path of a driver to be carpooled.

Example two

Fig. 2 is a flowchart of a carpooling path planning method according to a second embodiment of the present invention. The present embodiment is optimized and improved based on the above embodiments.

As shown in fig. 2, the method comprises the following specific steps:

s210, generating an initial carpooling path according to an order starting place and an order ending place of a driver to be carpooled; the initial carpooling path is composed of at least one order place; the order location is an order start location, an order end location, or an order path location.

S220, generating a first reference carpooling path according to the driver order income and the path transportation cost among the order places in the initial carpooling path.

And S230, updating the order path location in the reference carpooling path by adopting the candidate order path location to obtain at least one random carpooling path under the preset random generation times.

Wherein the candidate order path location is a path location other than the order path location in the initial carpool path. For example, if the driver to be carpooled is going from the order start location to the order end location, there may be a pathway to location 1, location 2, …, location n. If the order path locations in the initial carpool path include location 1 and location 2, the candidate order path locations may be location 3, location 4, …, location n.

For example, if the first reference carpool path is characterized in numerical number form, it may be 0-2-4-3-5-1; wherein, the number numbers 2, 3, 4, 5 are order way places; if 2-99 path places exist between the order starting place 0 and the order ending place 1, the candidate order path places can be 6-99, and then 4 alternative order path places are randomly selected from the 6-99 candidate order path places to randomly replace 2, 3, 4 and 5, so that a random carpooling path is obtained, for example, one of the updated random carpooling paths can be 0-6-4-3-2-1, wherein the number of specific substitutions can be random.

The random generation times represent how many random carpooling paths are specifically generated; the number of random generation times may be preset by a related art person, and for example, the number of random generation times may be 10 times.

Optionally, the determining manner of the random generation times may be: determining a number of places referencing the order path places in the carpool path; and determining the random generation times according to the number of the places.

For example, if the number of places of the order path places in the first reference carpool path is 10, the number of random generation may be 5.

S240, generating a second reference carpool path corresponding to each random carpool path according to the driver order income and the path transportation cost among the order places in the corresponding random carpool path.

It can be understood that the determining and generating manner of the second reference carpool path corresponding to the random carpool path is the same as the determining and generating manner of the first reference carpool path, which is not described in detail in this embodiment.

S250, determining the reference order benefits of each second reference carpool path.

It will be appreciated that when a carpool path is determined, the order benefits corresponding to that path may also be determined accordingly.

S260, determining a first order benefit corresponding to the initial carpool path and a second order benefit corresponding to the first reference carpool path.

S270, determining a target carpooling path of a driver to be carpooled according to the first order gain, the second order gain and each reference order gain.

For example, a carpool path with the largest order benefit can be selected from the first order benefit, the second order benefit and each reference order benefit, and the carpool path is determined to be an actual target carpool path of the carpool.

According to the technical scheme, after a first reference carpooling path is generated, candidate order path places are adopted, order path places in the first reference carpooling path are updated, and at least one random carpooling path under preset random generation times is obtained; generating a second reference carpooling path corresponding to each random carpooling path according to the driver order income and the path transportation cost between each order place in the corresponding random carpooling path; the method and the system have the advantages that the reference order benefits of each second reference carpool path are determined, so that the target carpool path is determined based on the reference order benefits, the accurate determination of the target carpool path is realized by the technical scheme, the situation of sinking into local optimum can be avoided by generating a new carpool path, the new path can be adapted in continuous iteration, the old path is discarded, and the obtained target carpool path is ensured to be optimal.

Example III

Fig. 3 is a flowchart of a carpooling path planning method provided in a third embodiment of the present invention. The present embodiment provides a preferred example based on the above-described embodiments.

The problem of multi-objective VRP (Vehicle Routing Problem, vehicle path problem) is essentially an NP (Nondeterministic Polynomially, non-deterministic polynomial problem) problem, which is to meet the requirements of a cargo owner and to increase the income of a driver, the game problem is difficult to solve an optimal value by an accurate algorithm, and the greedy algorithm can better approach the optimal solution and greatly shorten the operation time on the premise of considering the calculation complexity, so that the greedy algorithm is selected to solve the spare and accessory car sharing problem. As shown in fig. 3, the method comprises the following specific steps:

s301, randomly generating a path code of an initial carpooling path of a driver to be carpooled according to an order starting place and an order ending place;

the embodiment adopts a simple and visual coding method, wherein 0 is used for representing the original departure place (order starting place) of a driver to be carpooled, and 1,2, … and L are used for representing the order path places. In a real co-city freight scenario, L is any invoiceable source location, each path starting at the driver's departure location and ending at the driver's last destination (order termination location). Thus, 1,2, … L natural numbers different from each other constitute a plurality of individuals, corresponding to one path. For example, for a problem with a 3-destination delivery task, the path delivery scheme may be represented by 4 natural numbers of 0,1,2, 3. The initial carpool path as represented by the aggregate 0213 is: 0-2-1-3.

S302, determining each order place in the initial carpooling path as a place individual, and calculating the fitness of each place individual.

After the initial ride share is determined, it is necessary to use the fitness function to determine which individuals at the location in the initial ride share can be inherited further, i.e., the fitness calculation is followed by selection. In a part-load carpool scenario, the fitness of an individual is defined as:

S303, obtaining a reference carpooling path according to the fitness of each place individual;

s304, individual variation is carried out on the order path site individuals except for the order starting site individual and the order ending site individual;

the mutation of the individual gene refers to the replacement of the gene at the first place, after a new gene is obtained, the new fitness and the new path of the mutated individual are recalculated through S302, and the path under the maximum fitness is reserved, so that the genetic mutation can avoid the genetic algorithm from falling into local optimum. If the fitness is improved in a certain iteration, the old individuals are directly discarded, and the new individuals are reserved.

S305, judging whether the variation times of the individual places are smaller than a preset random generation times threshold value; if yes, executing S306; if not, then S309 is performed;

s306, site individual variation;

s307, judging whether the new carpooling path obtained after the individual mutation is better than the reference carpooling path before the parent mutation; if yes, then execution S308A; if not, then S308B is executed;

S308A, updating a parent reference carpooling path by adopting a new carpooling path to serve as a target carpooling path;

S308B, reserving a reference carpooling path of a parent as a target carpooling path;

s309, ending the iteration.

The algorithm introduces the classical multi-target VRP problem into the spare-part carpooling service in the same-city freight scene, and adds a game theory on the basis of the genetic algorithm to adapt to the carpooling scene. The part carpool is difficult to consider from both a cargo owner and a driver, and through changing constraint items and targets in a genetic algorithm, the practical problems in the carpool scene in the same city can be well correlated through a game theory, so that the aging requirement of the cargo owner can be met, and the net gain of the driver can be greatly increased.

Example IV

Fig. 4 is a schematic structural diagram of a carpool path planning device according to a fourth embodiment of the present invention. The device for planning the carpool path provided by the embodiment of the invention can be suitable for the situation of reasonably planning the carpool path of a freight driver in a highway freight scene, and the carpool path planning device can be realized in a hardware and/or software mode, as shown in fig. 4, and specifically comprises the following steps: an initial path generation module 401, a first carpool path generation module 402, a second carpool path generation module 403, and a target carpool path determination module 404. Wherein,

The initial path generation module 401 is configured to generate an initial carpooling path according to an order starting location and an order ending location of a driver waiting for carpooling; the initial carpooling path consists of at least one order place; the order place is an order starting place, an order ending place or an order path place;

a first carpool path generation module 402, configured to generate a first reference carpool path according to driver order revenue and path transportation costs between order sites in the initial carpool path;

a second carpool path generation module 403, configured to determine a first order benefit corresponding to the initial carpool path and a second order benefit corresponding to the first reference carpool path;

the target carpool path determination module 404 is configured to determine a target carpool path of the driver to be carpooled according to the first order benefit and the second order benefit.

Optionally, the first carpool path generation module 402 includes:

a reference location determining unit configured to determine the order start location as a reference order location;

a preferred location determining unit, configured to determine a preferred order location corresponding to the order start location under the condition that the target constraint condition is satisfied, according to the driver order revenue and the path transportation cost between the reference order location and other order locations in each order location;

an order place updating unit, configured to update the reference order place to a preferred order place corresponding to the order start place until a preferred order place corresponding to each order place is obtained;

the first carpool path generation unit is used for generating a first reference carpool path according to the preferred order places corresponding to the order places.

Optionally, the determining manner of the target constraint condition is as follows:

determining the existence condition and the cargo load of an order corresponding to each order place of the driver to be carpooled; the method comprises the steps of,

determining the arrival time range of the driver to be carpooled at each order place; the method comprises the steps of,

determining the path duration of the driver waiting for carpooling between every two order places;

Determining a first constraint condition according to the corresponding order existence condition and order acquisition load of the driver to be carpooled in each order place; the method comprises the steps of,

determining a second constraint condition according to the arrival time range of the driver to be carpooled at each order place; the method comprises the steps of,

determining a third constraint condition according to the path duration of the driver waiting for the carpooling between every two order places and the arrival time range of the corresponding order places; the method comprises the steps of,

determining a fourth constraint condition according to the existence condition of the corresponding order of the driver to be carpooled in each order place;

generating a target constraint comprising the first constraint, the second constraint, the third constraint, and the fourth constraint.

Optionally, the apparatus further includes:

the random carpooling path determining module is used for updating the order path place in the first reference carpooling path by adopting the candidate order path place after the first reference carpooling path is generated according to the driver order income and the path transportation cost among the order places in the initial carpooling path to obtain at least one random carpooling path under the preset random generation times;

The second carpooling path determining module is used for generating a second reference carpooling path corresponding to each random carpooling path according to the driver order income and the path transportation cost among the order places in the corresponding random carpooling path;

the reference order profit determining module is used for determining the reference order profit of each second reference carpool path;

accordingly, the target carpool path determination module 404 includes:

and the target carpooling path determining unit is used for determining the target carpooling path of the driver to be carpooled according to the first order benefit, the second order benefit and each reference order benefit.

Optionally, the determining manner of the random generation times is as follows:

determining a number of places of the order path places in the first reference carpool path;

and determining the random generation times according to the number of the places.

The carpool path planning device provided by the embodiment of the invention can execute the carpool path planning method provided by any embodiment of the invention, and has the corresponding functional modules and beneficial effects of the execution method.

Example five

Fig. 5 shows a schematic diagram of an electronic device 50 that may be used to implement an embodiment of the invention. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. Electronic equipment may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices (e.g., helmets, glasses, watches, etc.), and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the inventions described and/or claimed herein.

As shown in fig. 5, the electronic device 50 includes at least one processor 51, and a memory, such as a Read Only Memory (ROM) 52, a Random Access Memory (RAM) 53, etc., communicatively connected to the at least one processor 51, in which the memory stores a computer program executable by the at least one processor, and the processor 51 may perform various appropriate actions and processes according to the computer program stored in the Read Only Memory (ROM) 52 or the computer program loaded from the storage unit 58 into the Random Access Memory (RAM) 53. In the RAM 53, various programs and data required for the operation of the electronic device 50 can also be stored. The processor 51, the ROM 52 and the RAM 53 are connected to each other via a bus 54. An input/output (I/O) interface 55 is also connected to bus 54.

Various components in the electronic device 50 are connected to the I/O interface 55, including: an input unit 56 such as a keyboard, a mouse, etc.; an output unit 57 such as various types of displays, speakers, and the like; a storage unit 58 such as a magnetic disk, an optical disk, or the like; and a communication unit 59 such as a network card, modem, wireless communication transceiver, etc. The communication unit 59 allows the electronic device 50 to exchange information/data with other devices via a computer network, such as the internet, and/or various telecommunications networks.

The processor 51 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of processor 51 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various specialized Artificial Intelligence (AI) computing chips, various processors running machine learning model algorithms, digital Signal Processors (DSPs), and any suitable processor, controller, microcontroller, etc. The processor 51 performs the various methods and processes described above, such as the ride share planning method.

In some embodiments, the ride share planning method may be implemented as a computer program tangibly embodied on a computer-readable storage medium, such as the storage unit 58. In some embodiments, part or all of the computer program may be loaded and/or installed onto the electronic device 50 via the ROM 52 and/or the communication unit 59. When the computer program is loaded into RAM 53 and executed by processor 51, one or more steps of the carpool path planning method described above may be performed. Alternatively, in other embodiments, the processor 51 may be configured to perform the ride share routing method in any other suitable manner (e.g., by means of firmware).

Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuit systems, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), systems On Chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs, the one or more computer programs may be executed and/or interpreted on a programmable system including at least one programmable processor, which may be a special purpose or general-purpose programmable processor, that may receive data and instructions from, and transmit data and instructions to, a storage system, at least one input device, and at least one output device.

A computer program for carrying out methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the computer programs, when executed by the processor, cause the functions/acts specified in the flowchart and/or block diagram block or blocks to be implemented. The computer program may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.

In the context of the present invention, a computer-readable storage medium may be a tangible medium that can contain, or store a computer program for use by or in connection with an instruction execution system, apparatus, or device. The computer readable storage medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. Alternatively, the computer readable storage medium may be a machine readable signal medium. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

To provide for interaction with a user, the systems and techniques described here can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) through which a user can provide input to the electronic device. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic input, speech input, or tactile input.

The systems and techniques described here can be implemented in a computing system that includes a background component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such background, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), blockchain networks, and the internet.

The computing system may include clients and servers. The client and server are typically remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server can be a cloud server, also called a cloud computing server or a cloud host, and is a host product in a cloud computing service system, so that the defects of high management difficulty and weak service expansibility in the traditional physical hosts and VPS service are overcome.

It should be appreciated that various forms of the flows shown above may be used to reorder, add, or delete steps. For example, the steps described in the present invention may be performed in parallel, sequentially, or in a different order, so long as the desired results of the technical solution of the present invention are achieved, and the present invention is not limited herein.

The above embodiments do not limit the scope of the present invention. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives are possible, depending on design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of the present invention.

Claims

1. The carpool path planning method is characterized by comprising the following steps of:

2. The method of claim 1, wherein the generating a first reference carpool path based on driver order revenue and path transportation costs between order sites in the initial carpool path comprises:

determining the order start location as a reference order location;

determining a preferred order place corresponding to the order starting place under the condition of meeting a target constraint according to the driver order income and the path transportation cost between the reference order place and other order places in each order place;

updating the reference order place to a preferred order place corresponding to the order starting place until the preferred order place corresponding to each order place is obtained;

and generating a first reference carpooling path according to the preferred order places corresponding to the order places.

3. The method according to claim 2, wherein the target constraint is determined in the following manner:

4. The method of claim 1, further comprising, after said generating a first reference ride share based on driver order revenue and route transportation costs between order sites in said initial ride share,:

Updating the order path location in the first reference carpool path by adopting the candidate order path location to obtain at least one random carpool path under the preset random generation times;

generating a second reference carpooling path corresponding to each random carpooling path according to the driver order income and the path transportation cost among the order places in the corresponding random carpooling paths;

determining reference order benefits of each second reference carpool path;

correspondingly, the determining the target carpooling path of the driver waiting for carpooling according to the first order gain and the second order gain comprises the following steps:

and determining a target carpooling path of the driver to be carpooled according to the first order gain, the second order gain and each reference order gain.

5. The method of claim 4, wherein the number of random generations is determined by:

6. A carpool path planning device, the device comprising:

7. The apparatus of claim 6, wherein the first carpool path generation module comprises:

8. The apparatus of claim 7, wherein the target constraint is determined in the following manner:

9. An electronic device, the electronic device comprising:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein,

the memory stores a computer program executable by the at least one processor to enable the at least one processor to perform the carpool path planning method of any one of claims 1-5.

10. A computer readable storage medium storing computer instructions for causing a processor to implement the carpool path planning method of any one of claims 1-5 when executed.