CN112200336A - Method and device for planning vehicle driving path - Google Patents
Method and device for planning vehicle driving path Download PDFInfo
- Publication number
- CN112200336A CN112200336A CN201910538489.0A CN201910538489A CN112200336A CN 112200336 A CN112200336 A CN 112200336A CN 201910538489 A CN201910538489 A CN 201910538489A CN 112200336 A CN112200336 A CN 112200336A
- Authority
- CN
- China
- Prior art keywords
- order
- distribution
- orders
- geographic information
- coordinates
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000013439 planning Methods 0.000 title claims abstract description 50
- 238000000034 method Methods 0.000 title claims abstract description 38
- 238000012384 transportation and delivery Methods 0.000 claims abstract description 34
- 238000012545 processing Methods 0.000 claims abstract description 19
- 239000011159 matrix material Substances 0.000 claims description 53
- 238000004422 calculation algorithm Methods 0.000 claims description 14
- 238000004590 computer program Methods 0.000 claims description 9
- 238000000638 solvent extraction Methods 0.000 claims 1
- 238000010586 diagram Methods 0.000 description 10
- 230000006870 function Effects 0.000 description 8
- 238000004891 communication Methods 0.000 description 7
- 238000005457 optimization Methods 0.000 description 7
- 230000008569 process Effects 0.000 description 7
- 238000004364 calculation method Methods 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 4
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000009467 reduction Effects 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 101100182247 Caenorhabditis elegans lat-1 gene Proteins 0.000 description 1
- 101100182248 Caenorhabditis elegans lat-2 gene Proteins 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000013178 mathematical model Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 230000009466 transformation Effects 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
- G05—CONTROLLING; REGULATING
- G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- G05D1/00—Control of position, course or altitude of land, water, air, or space vehicles, e.g. automatic pilot
- G05D1/02—Control of position or course in two dimensions
- G05D1/021—Control of position or course in two dimensions specially adapted to land vehicles
- G05D1/0212—Control of position or course in two dimensions specially adapted to land vehicles with means for defining a desired trajectory
- G05D1/0217—Control of position or course in two dimensions specially adapted to land vehicles with means for defining a desired trajectory in accordance with energy consumption, time reduction or distance reduction criteria
-
- G06Q50/40—
Abstract
The invention discloses a method and a device for planning a vehicle driving path, and relates to the technical field of computers. A specific implementation manner of the method comprises the steps of receiving a plurality of orders, and obtaining coordinates in a corresponding geographic information system according to the address of each order so as to search a delivery unit corresponding to each order; according to the order address, a plurality of orders are subjected to order combination processing to form a collection list; acquiring a line combination and a distribution sequence of the collection sheet based on the distribution units corresponding to the orders in the collection sheet; and obtaining the route with the shortest path according to the order on the same route. Therefore, the method and the device can solve the problem that the planning efficiency of the distribution vehicle paths of large-scale running quantity is not high.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a method and a device for planning a vehicle driving path.
Background
At present, the route planning of the distribution vehicle is realized by acquiring time and distance matrix data between two points in a map and then optimizing the vehicle driving route through the matrix data.
In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:
currently, the optimization of the vehicle driving path strongly depends on the map data return result, and when the vehicle path problem is large (more than 1000 points), the map data return time is long. For example: the 1000-point return time duration is about 10 hours when the test interface is measured and calculated, the actual time duration is related to contract quotas of users on a map, the cost is higher when the general quotas are larger, if a 1000-point matrix is under the quotas of 500 points/s, the return result can be continuously ensured, and when the quotas are stable, 1000 × 1000/500 is required to be 2000s, only 35min is required for obtaining a time-distance matrix, and the time-distance matrix is far beyond the acceptable range of the users, so that the service requirement cannot be met, namely the user experience is sacrificed, and the necessary data are forcibly waited for returning. In addition, if the time for returning the result is to be shortened, incomplete return of the map data occurs or the accuracy of the data is sacrificed.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for planning a vehicle driving path, which can solve the problem of low efficiency in planning a vehicle path for distribution of large-scale driving quantities.
In order to achieve the above object, according to an aspect of the embodiments of the present invention, a method for planning a driving path of a vehicle is provided, including receiving a plurality of orders, obtaining coordinates in a corresponding geographic information system according to an address of each order, and searching for a delivery unit corresponding to each order; according to the order address, a plurality of orders are subjected to order combination processing to form a collection list; acquiring a line combination and a distribution sequence of the collection sheet based on the distribution units corresponding to the orders in the collection sheet; and obtaining the route with the shortest path according to the order on the same route.
Optionally, obtaining a line combination and a delivery order of the aggregated sheet based on the delivery unit corresponding to the order in the aggregated sheet includes:
and solving the multi-loop transportation problem according to the distribution units corresponding to the orders in the collection list to obtain the line combination and the distribution sequence of the collection list.
Optionally, the method further comprises:
acquiring a historical order, and converting geographic information system coordinates of a historical order address to divide distribution units;
generating a distance and time matrix of any two distribution units according to the divided distribution units;
the solving of the multi-loop transportation problem according to the distribution units corresponding to the orders in the collection list comprises the following steps:
and solving the multi-loop transportation problem according to the central geographic information system coordinates or interest points of the distribution units corresponding to the orders in the collection list and the distance and time matrix of any two distribution units.
Optionally, the dividing of the delivery unit includes:
and classifying the coordinates of the geographic information system with the distance less than or equal to a preset threshold value on the geographic information system into a distribution unit by adopting a clustering algorithm.
Optionally, the generating a distance and time matrix of any two delivery units includes:
calculating the coordinates of a central geographic information system of the distribution unit or obtaining the interest points of the distribution unit;
acquiring coordinates of geographic information systems of centers of any two distribution units or distance and time matrix data between interest points through a map route planning service; or calculating the distance between the coordinates of the geographic information systems of the centers of any two distribution units or the interest points and the time matrix by utilizing a Manhattan matrix.
Optionally, obtaining a route with the shortest path according to an order on the same route includes:
and according to the order on the same line, calculating to obtain the line with the shortest path through the traveler problem.
In addition, according to an aspect of the embodiments of the present invention, there is provided an apparatus for planning a driving path of a vehicle, including a receiving module, configured to receive a plurality of orders, and obtain coordinates in a corresponding geographic information system according to an address of each order, so as to find a delivery unit corresponding to each order;
the processing module is used for carrying out order combination processing on the orders according to the order addresses to form a collection list;
a planning module: the system comprises a distribution unit, a line combination unit and a distribution unit, wherein the distribution unit is used for obtaining the line combination and the distribution sequence of the collection sheet based on the distribution unit corresponding to the order in the collection sheet; and obtaining the route with the shortest path according to the order on the same route.
Optionally, the planning module obtains a line combination and a delivery order of the collection sheet based on the delivery unit corresponding to the order in the collection sheet, and includes:
and solving the multi-loop transportation problem according to the distribution units corresponding to the orders in the collection list to obtain the line combination and the distribution sequence of the collection list.
Optionally, the receiving module is further configured to:
acquiring a historical order, and converting geographic information system coordinates of a historical order address to divide distribution units;
generating a distance and time matrix of any two distribution units according to the divided distribution units;
the planning module solves the multi-loop transportation problem according to the distribution units corresponding to the orders in the collection list, and the method comprises the following steps:
and solving the multi-loop transportation problem according to the central geographic information system coordinates or interest points of the distribution units corresponding to the orders in the collection list and the distance and time matrix of any two distribution units.
Optionally, the dividing of the receiving module delivery unit includes:
and classifying the coordinates of the geographic information system with the distance less than or equal to a preset threshold value on the geographic information system into a distribution unit by adopting a clustering algorithm.
Optionally, the receiving module generates a distance and time matrix of any two delivery units, including:
calculating the coordinates of a central geographic information system of the distribution unit or obtaining the interest points of the distribution unit;
acquiring coordinates of geographic information systems of centers of any two distribution units or distance and time matrix data between interest points through a map route planning service; or calculating the distance between the coordinates of the geographic information systems of the centers of any two distribution units or the interest points and the time matrix by utilizing a Manhattan matrix.
Optionally, the planning module obtains a route with the shortest route according to an order on the same route, including:
and according to the order on the same line, calculating to obtain the line with the shortest path through the traveler problem.
According to another aspect of the embodiments of the present invention, there is also provided an electronic device, including:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any of the above embodiments of vehicle travel path planning.
According to another aspect of the embodiments of the present invention, there is also provided a computer readable medium, on which a computer program is stored, which when executed by a processor, implements the method according to any one of the above embodiments of vehicle travel path planning.
One embodiment of the above invention has the following advantages or benefits: the method comprises the steps of receiving a plurality of orders, obtaining coordinates in a corresponding geographic information system according to the address of each order, and searching a distribution unit corresponding to each order; according to the order address, a plurality of orders are subjected to order combination processing to form a collection list; acquiring a line combination and a distribution sequence of the collection sheet based on the distribution units corresponding to the orders in the collection sheet; and obtaining the route with the shortest path according to the order on the same route. Therefore, the method and the device can improve the accuracy of the route planning of the distribution vehicles with large-scale running numbers under the condition of ensuring the calculation speed, thereby improving the user experience.
Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
fig. 1 is a schematic view of a main flow of a method of vehicle travel path planning according to an embodiment of the present invention;
fig. 2 is a schematic view of a main flow of a method of vehicle travel path planning according to another embodiment of the present invention;
FIG. 3 is a schematic diagram of a main flow of generating a distance and time matrix for any two delivery units according to the present invention;
FIG. 4 is a schematic diagram illustrating exemplary calculation of the coordinates of a geographic information system of a distribution unit center in accordance with the present invention;
FIG. 5 is a schematic diagram of the main modules of an apparatus for vehicle driving path planning according to an embodiment of the present invention;
FIG. 6 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 7 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server of an embodiment of the invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
Fig. 1 is a schematic view of a main flow of a method for vehicle travel path planning according to a first embodiment of the present invention, which may include:
step S101, receiving a plurality of orders, and obtaining coordinates in a corresponding geographic information system according to the address of each order so as to search a delivery unit corresponding to each order.
And step S102, combining a plurality of orders according to the order addresses to form a collection list.
Step S103, acquiring the line combination and the distribution sequence of the collection sheet based on the distribution units corresponding to the orders in the collection sheet.
Preferably, the solution of the multi-loop transportation problem can be performed according to the delivery units corresponding to the orders in the collection list, so as to obtain the line combination and the delivery sequence of the collection list. Among them, the VRP is called Vehicle Routing Problem, which is a Problem of multi-loop transportation.
Further, the multi-loop transportation problem is solved according to the central geographic information system coordinates or interest points of the distribution units corresponding to the orders in the collection list and the distance and time matrix of any two distribution units.
The interest points of the configuration units are landmark buildings of the configuration units and belong to map basic information.
As an example, the distance and time matrix of any two delivery units may be obtained by the following process:
and acquiring a historical order, and converting the geographic information system coordinate of the historical order address to divide the distribution units. Then, a distance and time matrix of any two delivery units is generated based on the divided delivery units. Preferably, a clustering algorithm is adopted to classify the geographic information system coordinates on the geographic information system, which are less than or equal to a preset threshold value apart, into a distribution unit.
Still further, the center geographic information system coordinates of the delivery unit may be calculated or the point of interest of the delivery unit may be obtained. And then, acquiring the coordinates of the geographic information systems of the centers of any two distribution units or distance and time matrix data between the points of interest through a map route planning service.
Wherein the map routing service, such as a Goods, Baidu map, or the like application, may obtain the distance and time matrix data using an interface of the map routing application.
It should be noted that, if the distance and time matrix between the geographic information system coordinates or the points of interest of any two distribution unit centers cannot be obtained by using the map route planning service, the distance and time matrix between the geographic information system coordinates or the points of interest of any two distribution unit centers can be calculated by using the manhattan matrix.
And step S104, obtaining the route with the shortest path according to the order on the same route.
Preferably, the route with the shortest path is obtained by a traveler problem calculation according to orders on the same route. The TSP is called a tracking Salesman Problem and is translated into a traveler Problem, the TSP Problem is a combined optimization Problem, and the selection target of the path is that the required path distance is the minimum value of all paths.
Fig. 2 is a schematic view of a main flow of a method for vehicle driving path planning according to another embodiment of the present invention, which may include:
step S201, obtaining a historical order, and performing dimension reduction classification on the order according to the historical order address.
In an embodiment, the order address may be specific to a block, a cell, or a building. And further, according to the order address, clustering the order to realize dimension reduction and classification. For example: one order is grouped, so 1000 orders are grouped into 1000 groups, and after the 1000 orders are clustered according to the order addresses, the 1000 orders can be divided into 100 groups, so that the algorithm is optimized on the computational level.
And step S202, performing GIS conversion on the historical order address, and dividing distribution units according to GIS points obtained by conversion.
In an embodiment, the GIS refers to a Geographic Information System or Geo-Information System, in which order addresses can be translated into GIS points.
Preferably, a clustering algorithm is adopted to classify GIS points with a distance smaller than or equal to a preset threshold value on a geographic information system into a distribution unit. The clustering algorithm does not need to set the number of the distribution units, and the number of the distribution units can be determined only according to the actual GIS point distance state.
Further, the distribution units are formed into cells by tangency of the GIS points, taking and according to the midperpendicular of the distribution unit.
In step S203, a distance and time matrix of any two delivery units is generated according to the divided delivery units. The specific implementation process comprises the following steps:
step S301: calculating a central GIS point of the distribution unit or obtaining a POI point of the distribution unit.
In an embodiment, the POI (point of interest) of the delivery unit is a landmark building of the configuration unit, belonging to the map basic information. .
In addition, the data of the block or the cell electronic fence in the map route planning service can be acquired as the boundary data of the distribution unit when the central GIS point of the distribution unit is calculated. The center GIS point longitude coordinate is equal to the absolute value of the difference between the maximum and minimum longitudes divided by 2, and the center GIS point latitude coordinate is equal to the absolute value of the difference between the maximum and minimum latitudes divided by 2.
For example, as shown in fig. 4, the central GIS point of the distribution unit is calculated by the following formula:
wherein, latmidAnd lngmidLongitude and latitude coordinates of the center GIS point, (lat1, lng1), (lat2, lng2), (lat3, lng3), and (lat4, lng4) are the longitude and latitude coordinates of the GIS point on the delivery cell boundary.
Step S302: and acquiring distance and time matrix data between GIS points or POI points of any two distribution unit centers through a map route planning service.
Wherein the map routing service, such as a Goods, Baidu map, or the like application, may obtain the distance and time matrix data using an interface of the map routing application.
It should be noted that, if the distance and time matrix between any two distribution unit center GIS points or POI points cannot be obtained by using the map routing service, the distance and time matrix between any two distribution unit center GIS points or POI points can be calculated by using the manhattan matrix, specifically:
manhattan distance:
wherein x and y are longitude and latitude coordinates of a GIS point or a POI point at the center of the distribution unit.
The time matrix is expressed by using Manhattan distance/preset vehicle speed, generally, the urban traffic is limited to 20km/h, and the high-speed traffic is limited to 60 km/h.
In addition, it should be noted that if the distance and time matrix between any two distribution unit center GIS points or POI points cannot be obtained by using the map route planning service, the distance and time matrix data between any two distribution unit center GIS points or POI points in actual operation can also be directly obtained.
And step S204, receiving a plurality of new orders, and acquiring a corresponding GIS point according to each new order address.
Preferably, the new order can be classified by reducing the dimensions, and then the corresponding GIS points are obtained.
And step S205, searching for a distribution unit corresponding to each GIS point of the new order.
And step S206, combining a plurality of new orders according to the addresses of the new orders to form a collection list.
In an embodiment, according to the dimensions of the block or the cell of the address of the new order, a plurality of new orders can be combined to form an aggregate list. For example: new orders with the same street or cell dimensions may be combined to form an aggregated list.
And step S207, solving the VRP problem according to the GIS point or the POI point of the distribution unit center corresponding to the collection list and the distance and time matrix of any two distribution units, and acquiring the line combination and the suggested distribution sequence of the collection list.
Among them, the VRP is called Vehicle Routing Problem, which is a Problem of multi-loop transportation.
In an embodiment, the specific implementation process of step S107 includes:
establishing a mathematical model, respectively optimizing a target to be total cost, wherein the constraint conditions comprise: time window constraint, vehicle load constraint, i.e. the total weight of the total load is less than the total load of the vehicle, load-capacity constraint, etc., the basic model is summarized as follows:
so that
Wherein d isi,jDenotes the distance from point i to point j (which can be obtained from the distance and time matrix of the delivery unit corresponding to point i and point j), where i-0 denotes the starting point, i-1, …, ndRepresents ndThe number of the individual users is increased by the number of the individual users,
is the transport path matrix of the t-th vehicle if
Then it means that t cars go from i user to j user, otherwise 0,
representing the cost per unit distance of the vehicle t from point i to point j (e.g.: per kilometer)The cost of transportation),
a fixed cost of the vehicle (e.g., the fixed cost is a vehicle cost consumption).
wjIs the weight of the jth order, WtThe total load of the t cars.
rjCapacity of jth order, RtIs the total capacity of the t cars.
After the problem is transformed, path optimization is applied to the partitioned subproblems to obtain a final solution:
Vt,t＝1,…,vd
finally, the results of the d zones are spliced together.
Wherein an objective function is set
And set the score function as
Search operator, whereini(V1,…,Vv) Express the current solution
1 when the characteristic i exists, and 0, p when the characteristic i existsiIt is worth mentioning that the reason for penalizing is to enable the algorithm to escape from the locally optimal solution, where feature i is a feature that avoids the local solution, such as the total distance.
And step S208, acquiring new order data on the same line, and optimizing the line through a TSP algorithm.
The TSP is called a tracking Salesman Problem and is translated into a traveler Problem, the TSP Problem is a combined optimization Problem, and the selection target of the path is that the required path distance is the minimum value of all paths.
Thus, according to the various embodiments described above, the vehicle path planning scheme of the present invention: the VRP obtains the line combination and the suggested distribution sequence of the collection list, which is beneficial to reducing the combination mode of the destination point, optimizing the calculation performance of the algorithm and improving the user experience. And then the TSP optimization is carried out on the single line, so that the single line fast optimization is realized, and the algorithm accuracy can be further improved under the condition of ensuring the calculation speed. In addition, through the dimension reduction processing of order data, the dependence of large-scale vehicle path problems on map return data is reduced, the search pressure is reduced, and the accuracy of algorithm results is synchronously guaranteed on the premise of meeting the algorithm time performance. In addition, the distance and time matrix of any two distribution units are standardized and maintained in advance through historical order data, so that the matrix data (such as holiday road condition data, extreme weather road condition data and the like) can be processed preferentially according to the change of business requirements.
Fig. 5 is an apparatus for planning a driving path of a vehicle according to an embodiment of the present invention, and as shown in fig. 5, the apparatus 500 for planning a driving path of a vehicle includes a receiving module 501, a processing module 502, and a planning module 503. The receiving module 501 receives a plurality of orders, and obtains coordinates in the corresponding geographic information system according to an address of each order, so as to search for a delivery unit corresponding to each order. The processing module 502 performs order combination processing on a plurality of orders according to the order addresses to form a collection list. The planning module 503 obtains the line combination and the delivery sequence of the aggregated list based on the delivery units corresponding to the orders in the aggregated list. Then, according to the order on the same route, the route having the shortest route is obtained.
In a preferred embodiment, the planning module 503 obtains the route combination and the delivery sequence of the aggregated list according to the solution of the multi-loop transportation problem for the delivery units corresponding to the orders in the aggregated list. Among them, the VRP is called Vehicle Routing Problem, which is a Problem of multi-loop transportation.
Further, the receiving module 501 may obtain a historical order, and perform coordinate transformation of a geographic information system on an address of the historical order, so as to perform distribution unit division. And generating a distance and time matrix of any two distribution units according to the divided distribution units. Therefore, in the process of solving the multi-loop transportation problem according to the distribution unit corresponding to the order in the collection sheet, the planning module 503 may solve the multi-loop transportation problem according to the central geographic information system coordinate or the interest point of the distribution unit corresponding to the order in the collection sheet and the distance and time matrix of any two distribution units.
Further, the receiving module 501 may use a clustering algorithm to classify the coordinates of the geographic information systems that are less than or equal to a predetermined threshold from each other as a distribution unit.
In addition, when the receiving module 501 generates the distance and time matrix of any two distribution units, the central geographic information system coordinates of the distribution units may be calculated or the points of interest of the distribution units may be obtained, and then the distance and time matrix data between the central geographic information system coordinates or the points of interest of any two distribution units may be obtained through the map route planning service.
It should be noted that, if the distance and time matrix between the geographic information system coordinates or the points of interest of any two distribution unit centers cannot be obtained by using the map route planning service, the distance and time matrix between the geographic information system coordinates or the points of interest of any two distribution unit centers can be calculated by using the manhattan matrix.
Also, the route having the shortest route can be obtained by the traveler problem calculation according to the order on the same route. The TSP is called a tracking Salesman Problem and is translated into a traveler Problem, the TSP Problem is a combined optimization Problem, and the selection target of the path is that the required path distance is the minimum value of all paths.
It should be noted that the method for planning a vehicle driving path and the device for planning a vehicle driving path according to the present invention have corresponding relationships in specific implementation contents, and therefore, repeated contents are not described again.
Fig. 6 shows an exemplary system architecture 600 to which the method for vehicle driving path planning or the apparatus for vehicle driving path planning of the embodiments of the present invention may be applied.
As shown in fig. 6, the system architecture 600 may include terminal devices 601, 602, 603, a network 604, and a server 605. The network 604 serves to provide a medium for communication links between the terminal devices 601, 602, 603 and the server 605. Network 604 may include various types of connections, such as wire, wireless communication links, or fiber optic cables, to name a few.
A user may use the terminal devices 601, 602, 603 to interact with the server 605 via the network 604 to receive or send messages or the like. The terminal devices 601, 602, 603 may have installed thereon various communication client applications, such as shopping applications, web browser applications, search applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only).
The terminal devices 601, 602, 603 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 605 may be a server providing various services, such as a background management server (for example only) providing support for shopping websites browsed by users using the terminal devices 601, 602, 603. The backend management server may analyze and perform other processing on the received data such as the product information query request, and feed back a processing result (for example, target push information, product information — just an example) to the terminal device.
It should be noted that the method for planning the vehicle driving path provided by the embodiment of the present invention is generally executed by the server 605, and accordingly, the device for planning the vehicle driving path is generally disposed in the server 605.
It should be understood that the number of terminal devices, networks, and servers in fig. 6 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 7, shown is a block diagram of a computer system 700 suitable for use with a terminal device implementing an embodiment of the present invention. The terminal device shown in fig. 7 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 7, the computer system 700 includes a Central Processing Unit (CPU)701, which can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)702 or a program loaded from a storage section 608 into a Random Access Memory (RAM) 703. In the RAM703, various programs and data necessary for the operation of the system 700 are also stored. The CPU701, the ROM702, and the RAM703 are connected to each other via a bus 704. An input/output (I/O) interface 705 is also connected to bus 704.
The following components are connected to the I/O interface 705: an input portion 706 including a keyboard, a mouse, and the like; an output section 707 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 708 including a hard disk and the like; and a communication section 709 including a network interface card such as a LAN card, a modem, or the like. The communication section 709 performs communication processing via a network such as the internet. A drive 710 is also connected to the I/O interface 705 as needed. A removable medium 711 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 710 as necessary, so that a computer program read out therefrom is mounted into the storage section 708 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 709, and/or installed from the removable medium 711. The computer program performs the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 701.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having 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. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described as: a processor includes a receiving module, a processing module, and a planning module. Wherein the names of the modules do not in some cases constitute a limitation of the module itself.
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: receiving a plurality of orders, and acquiring coordinates in a corresponding geographic information system according to the address of each order to search a distribution unit corresponding to each order; according to the order address, a plurality of orders are subjected to order combination processing to form a collection list; acquiring a line combination and a distribution sequence of the collection sheet based on the distribution units corresponding to the orders in the collection sheet; and obtaining the route with the shortest path according to the order on the same route.
According to the technical scheme of the embodiment of the invention, the problem of low planning efficiency of the routes of the distribution vehicles with large-scale running quantity can be solved.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (9)
1. A method of vehicle travel path planning, comprising:
receiving a plurality of orders, and acquiring coordinates in a corresponding geographic information system according to the address of each order to search a distribution unit corresponding to each order;
according to the order address, a plurality of orders are subjected to order combination processing to form a collection list;
acquiring a line combination and a distribution sequence of the collection sheet based on the distribution units corresponding to the orders in the collection sheet;
and obtaining the route with the shortest path according to the order on the same route.
2. The method of claim 1, wherein obtaining the line combination and delivery order of the aggregated list based on the delivery units corresponding to the orders in the aggregated list comprises:
and solving the multi-loop transportation problem according to the distribution units corresponding to the orders in the collection list to obtain the line combination and the distribution sequence of the collection list.
3. The method of claim 2, further comprising:
acquiring a historical order, and converting geographic information system coordinates of a historical order address to divide distribution units;
generating a distance and time matrix of any two distribution units according to the divided distribution units;
the solving of the multi-loop transportation problem according to the distribution units corresponding to the orders in the collection list comprises the following steps:
and solving the multi-loop transportation problem according to the central geographic information system coordinates or interest points of the distribution units corresponding to the orders in the collection list and the distance and time matrix of any two distribution units.
4. The method of claim 3, wherein the partitioning of the delivery units comprises:
and classifying the coordinates of the geographic information system with the distance less than or equal to a preset threshold value on the geographic information system into a distribution unit by adopting a clustering algorithm.
5. The method of claim 3 or 4, wherein generating a distance and time matrix for any two delivery units comprises:
calculating the coordinates of a central geographic information system of the distribution unit or obtaining the interest points of the distribution unit;
acquiring coordinates of geographic information systems of centers of any two distribution units or distance and time matrix data between interest points through a map route planning service; or calculating the distance between the coordinates of the geographic information systems of the centers of any two distribution units or the interest points and the time matrix by utilizing a Manhattan matrix.
6. The method of claim 1, wherein obtaining a route having a shortest path from orders on the same route comprises:
and according to the order on the same line, calculating to obtain the line with the shortest path through the traveler problem.
7. An apparatus for vehicle travel path planning, comprising:
the receiving module is used for receiving a plurality of orders, acquiring coordinates in the corresponding geographic information system according to the address of each order, and searching the distribution unit corresponding to each order;
the processing module is used for carrying out order combination processing on the orders according to the order addresses to form a collection list;
a planning module: the system comprises a distribution unit, a line combination unit and a distribution unit, wherein the distribution unit is used for obtaining the line combination and the distribution sequence of the collection sheet based on the distribution unit corresponding to the order in the collection sheet; and obtaining the route with the shortest path according to the order on the same route.
8. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-6.
9. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910538489.0A CN112200336A (en) | 2019-06-20 | 2019-06-20 | Method and device for planning vehicle driving path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910538489.0A CN112200336A (en) | 2019-06-20 | 2019-06-20 | Method and device for planning vehicle driving path |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112200336A true CN112200336A (en) | 2021-01-08 |
Family
ID=74004347
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910538489.0A Pending CN112200336A (en) | 2019-06-20 | 2019-06-20 | Method and device for planning vehicle driving path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112200336A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112801592A (en) * | 2021-02-09 | 2021-05-14 | 北京橙心无限科技发展有限公司 | Method and device for planning distribution path |
| CN116109026A (en) * | 2023-04-11 | 2023-05-12 | 北京新发地农产品网络配送中心有限责任公司 | Fresh distribution route planning method, system, equipment and readable storage medium |
| WO2024067815A1 (en) * | 2022-09-30 | 2024-04-04 | 深圳顺丰泰森控股(集团)有限公司 | Express delivery method and apparatus, and electronic device and computer readable storage medium |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103927643A (en) * | 2014-04-30 | 2014-07-16 | 洪剑 | Optimization method for large-scale order processing and distributing route |
| CN103968854A (en) * | 2014-05-27 | 2014-08-06 | 四川汇源吉迅数码科技有限公司 | Route cluster planning method |
| CN105701273A (en) * | 2015-12-31 | 2016-06-22 | 北京华如科技股份有限公司 | Agent-based modularized logistics system simulation computation method |
| CN106022600A (en) * | 2016-05-18 | 2016-10-12 | 上海鼎数信息技术有限公司 | Method for determining cash supplement strategy of multiple cash flow stations in specific period |
| CN106447121A (en) * | 2016-10-12 | 2017-02-22 | 上海节点供应链管理有限公司 | Intelligent optimization scheduling method based on city delivery |
| CN107392513A (en) * | 2017-01-26 | 2017-11-24 | 北京小度信息科技有限公司 | Order processing method and apparatus |
| CN107844933A (en) * | 2017-09-21 | 2018-03-27 | 北京小度信息科技有限公司 | order processing method and device |
| CN108364146A (en) * | 2017-01-26 | 2018-08-03 | 北京小度信息科技有限公司 | Logistics distribution emulation mode and device |
| CN108805341A (en) * | 2018-05-25 | 2018-11-13 | 夏传友 | Distributed optimization method, apparatus, terminal device and the storage medium of navigation circuit |
| CN108921468A (en) * | 2018-06-19 | 2018-11-30 | 北京云鸟科技有限公司 | A kind of logistic distribution vehicle intelligence wire arranging method |
| CN109816132A (en) * | 2017-11-20 | 2019-05-28 | 北京京东尚科信息技术有限公司 | Information generating method and device |
-
2019
- 2019-06-20 CN CN201910538489.0A patent/CN112200336A/en active Pending
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103927643A (en) * | 2014-04-30 | 2014-07-16 | 洪剑 | Optimization method for large-scale order processing and distributing route |
| CN103968854A (en) * | 2014-05-27 | 2014-08-06 | 四川汇源吉迅数码科技有限公司 | Route cluster planning method |
| CN105701273A (en) * | 2015-12-31 | 2016-06-22 | 北京华如科技股份有限公司 | Agent-based modularized logistics system simulation computation method |
| CN106022600A (en) * | 2016-05-18 | 2016-10-12 | 上海鼎数信息技术有限公司 | Method for determining cash supplement strategy of multiple cash flow stations in specific period |
| CN106447121A (en) * | 2016-10-12 | 2017-02-22 | 上海节点供应链管理有限公司 | Intelligent optimization scheduling method based on city delivery |
| CN107392513A (en) * | 2017-01-26 | 2017-11-24 | 北京小度信息科技有限公司 | Order processing method and apparatus |
| CN108364146A (en) * | 2017-01-26 | 2018-08-03 | 北京小度信息科技有限公司 | Logistics distribution emulation mode and device |
| CN107844933A (en) * | 2017-09-21 | 2018-03-27 | 北京小度信息科技有限公司 | order processing method and device |
| CN109816132A (en) * | 2017-11-20 | 2019-05-28 | 北京京东尚科信息技术有限公司 | Information generating method and device |
| CN108805341A (en) * | 2018-05-25 | 2018-11-13 | 夏传友 | Distributed optimization method, apparatus, terminal device and the storage medium of navigation circuit |
| CN108921468A (en) * | 2018-06-19 | 2018-11-30 | 北京云鸟科技有限公司 | A kind of logistic distribution vehicle intelligence wire arranging method |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112801592A (en) * | 2021-02-09 | 2021-05-14 | 北京橙心无限科技发展有限公司 | Method and device for planning distribution path |
| WO2024067815A1 (en) * | 2022-09-30 | 2024-04-04 | 深圳顺丰泰森控股(集团)有限公司 | Express delivery method and apparatus, and electronic device and computer readable storage medium |
| CN116109026A (en) * | 2023-04-11 | 2023-05-12 | 北京新发地农产品网络配送中心有限责任公司 | Fresh distribution route planning method, system, equipment and readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107624190B (en) | System and method for accelerating route search | |
| CN106875066B (en) | Vehicle travel behavior prediction method, device, server and storage medium | |
| JP6423520B2 (en) | System and method for managing service supply status | |
| CN104683405A (en) | Method and device for distributing map matching task by cluster server in Internet of Vehicles | |
| US20190205813A1 (en) | Method and system for transportation service routing | |
| CN112200336A (en) | Method and device for planning vehicle driving path | |
| CN111553548A (en) | Goods picking method and device | |
| CN111461383A (en) | Method and device for planning distribution path | |
| CN109345166B (en) | Method and apparatus for generating information | |
| CN113128744A (en) | Distribution planning method and device | |
| CN111044062B (en) | Path planning and recommending method and device | |
| CN113240175B (en) | Distribution route generation method, distribution route generation device, storage medium, and program product | |
| CN112988933A (en) | Method and device for managing address information | |
| CN113222205A (en) | Path planning method and device | |
| CN113139258A (en) | Road data processing method, device, equipment and storage medium | |
| CN111461430A (en) | Method and device for generating route information | |
| CN112556707A (en) | Path planning method and device | |
| CN113537680B (en) | Method and device for determining completion time of transportation task | |
| CN111860918A (en) | Distribution method and device, electronic device and computer readable medium | |
| CN116402432B (en) | Route planning method, device, equipment and storage medium | |
| CN111738895B (en) | Multi-station passenger transport line generation method, device, medium and electronic equipment | |
| US11543255B2 (en) | Method to predict travel time by using adjacent travel time | |
| CN113868532B (en) | Location recommendation method and device, electronic equipment and storage medium | |
| CN114440918B (en) | Charging pile navigation method and device, electronic equipment and automatic driving vehicle | |
| CN114579889B (en) | Recommendation method, device, equipment and storage medium for order thermodynamic diagrams |
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 |