CN112529297A - Method, device and equipment for determining target path and storage medium - Google Patents
Method, device and equipment for determining target path and storage medium Download PDFInfo
- Publication number
- CN112529297A CN112529297A CN202011454461.8A CN202011454461A CN112529297A CN 112529297 A CN112529297 A CN 112529297A CN 202011454461 A CN202011454461 A CN 202011454461A CN 112529297 A CN112529297 A CN 112529297A
- Authority
- CN
- China
- Prior art keywords
- path
- candidate
- time
- target
- determining
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Quality & Reliability (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The embodiment of the invention discloses a method, a device, equipment and a storage medium for determining a target path. Wherein, the method comprises the following steps: determining a first candidate path and a first path time which meet a first target time requirement according to a current place, a destination, an intermediate station between the current place and the destination and a preset first target time; determining a second path time of the first candidate path according to the transit time of the intermediate station and the first path time; determining whether at least one second candidate path exists in the first candidate paths, wherein the second path time of the second candidate path is less than the first path time of at least one first candidate path except the second candidate path; and if so, selecting a target path meeting the preset time requirement from the second candidate paths. The method realizes the comprehensive consideration of the path time, is beneficial to finding out the optimal target path and improves the determination precision of the target path.
Description
Technical Field
The present invention relates to computer technologies, and in particular, to a method, an apparatus, a device, and a storage medium for determining a target path.
Background
With the rapid development of the e-commerce, the cross-border trade shows a rapid development trend in recent years, and the cross-border logistics is more and more frequent and important.
The traditional cross-border logistics is mainly operated by manpower, and the logistics path and the port passing in the path are determined by staff. When the working staff passes through each port, the working staff may need to stay for different time, and a lot of information is lost and delayed when the working staff determines path information such as stay time, so that the optimal path cannot be determined in time, and even relevant information of the port is not considered when the optimal path is determined, so that the path planning precision and logistics timeliness are low, and the ever-increasing trade requirements cannot be fully met.
Disclosure of Invention
The embodiment of the invention provides a method, a device and equipment for determining a target path and a storage medium, which are used for improving the path determination precision.
In a first aspect, an embodiment of the present invention provides a method for determining a target path, where the method includes:
determining a first candidate path and a first path time which meet a first target time requirement according to a current place, a destination, an intermediate station between the current place and the destination and a preset first target time;
determining a second path time of the first candidate path according to the transit time of the intermediate station and the first path time;
determining whether at least one second candidate path exists in the first candidate paths, wherein the second path time of the second candidate path is less than the first path time of at least one first candidate path except the second candidate path;
and if so, selecting a target path meeting the preset time requirement from the second candidate paths.
In a second aspect, an embodiment of the present invention further provides an apparatus for determining a target path, where the apparatus includes:
the first path determining module is used for determining a first candidate path and a first path time which meet a first target time requirement according to a current place, a destination, an intermediate station between the current place and the destination and a preset first target time;
a second time determination module, configured to determine a second path time of the first candidate path according to the transit time of the intermediate station and the first path time;
a second path determining module, configured to determine whether there is at least one second candidate path in the first candidate paths, where a second path time of the second candidate path is less than a first path time of at least one first candidate path except the second candidate path;
and the target path determining module is used for selecting a target path meeting the preset time requirement from the second candidate paths if the target path exists.
In a third aspect, an embodiment of the present invention further provides a device for determining a target path, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor, when executing the program, implements a method for determining a target path according to any embodiment of the present invention.
In a fourth aspect, embodiments of the present invention further provide a storage medium containing computer-executable instructions, which when executed by a computer processor, are configured to perform the method for determining a target path according to any of the embodiments of the present invention.
The embodiment of the invention obtains the overall required time of the path by determining the first path time and the transit time from the current position to the target position in real time, judges whether at least one path exists, and if the overall required time is shorter than the first path time of other paths, the path can be a target path. The problem of among the prior art, neglect harbour transit time easily when carrying out the route by the manual work and confirm is solved, improved the precision of route planning, practice thrift manpower and time, and then improve the commodity circulation ageing, satisfy growing trade demand.
Drawings
Fig. 1 is a flowchart illustrating a method for determining a target path according to a first embodiment of the present invention;
fig. 2 is a flowchart illustrating a method for determining a target path according to a second embodiment of the present invention;
fig. 3 is a block diagram of a target path determining apparatus according to a third embodiment of the present invention;
fig. 4 is a schematic structural diagram of a computer device in the fourth embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting of the invention. It should be further noted that, for the convenience of description, only some of the structures related to the present invention are shown in the drawings, not all of the structures.
Example one
Fig. 1 is a schematic flow chart of a method for determining a target path according to an embodiment of the present invention, which is applicable to a situation where a path is determined for logistics in real time, and the method can be executed by a device for determining a target path. As shown in fig. 1, the method specifically includes the following steps:
The current position of the transportation equipment is obtained in real time, the current position can be obtained according to the positioning device, and the transportation equipment can be air transportation equipment, railway transportation equipment or water transportation equipment. The location of the destination and the locations of all intermediate stations in the area between the starting point and the destination are stored in advance, and the intermediate stations can be transfer stations such as ports of the transportation equipment during the logistics transportation process, for example, the starting point is A, the destination is B, the transfer from A to B needs to be performed from C, and C is the intermediate station. From the current location and the location of the destination, all intermediate stations between the current location and the destination can be determined. All intermediate stations between the current location and the destination may be intermediate stations within a preset range, for example, the intermediate stations within a preset radius range may be determined as all intermediate stations between the current location and the destination with an arbitrary point on a line connecting the current location and the destination as a center.
The path from the current location to the destination is determined based on the current location, the destination and the location of the intermediate station, and the path may be determined based on a preset path planning algorithm, for example, a KSP (K-Shortest path) algorithm. The path time required to travel these paths is determined from the lengths of these paths and the transport speed of the transport equipment. The path time is determined by the path length and the transport speed, independently of the dwell time of the transport device at the intermediate station. The method comprises the steps of presetting first target time, determining whether path time required by the paths meets the requirement of the first target time, determining the paths meeting the requirement as first candidate paths, and taking the path time required by the transportation equipment to travel according to the first candidate paths as the first path time.
In this embodiment, optionally, determining a first candidate path and a first path time that meet a first target time requirement according to the current location, the destination, an intermediate station between the current location and the destination, and a preset first target time includes: determining a candidate path from the current location to the destination according to the current location, the destination and an intermediate station between the current location and the destination; determining the path time of the candidate path according to the length of the candidate path; and determining a first path time meeting a preset first target time requirement and a first candidate path corresponding to the first path time from the path times of the candidate paths.
In particular, all candidate paths from the current location to the destination are determined based on the current location, the destination, and the location of intermediate stations between the current location and the destination, and the resulting candidate paths may pass through at least one intermediate station. The lengths of these candidate paths may be determined based on the current location, destination and intermediate station position, and the path time for each candidate path may be derived based on the length of the candidate path and the transport speed of the transport device. Presetting a first target time, comparing the path time of the candidate path with the first target time, and determining the first path time meeting the requirement of the first target time from the path time, wherein the candidate path corresponding to the first path time is the first candidate path. For example, if the preset first target time is required to be the first path time smaller than the first target time, the candidate path with the path time smaller than the first target time is taken as the first candidate path, and the first path time is the path time smaller than the first target time, that is, the path time of the first candidate path. The method has the advantages that the candidate paths are determined in real time, the path time without considering the transit time is determined according to the path length, the candidate paths are primarily screened, the complexity of calculation is reduced, the first target time can be set according to needs, the efficiency and the precision of path determination are improved, and the flexibility of path planning is realized.
And step 120, determining a second path time of the first candidate path according to the transit time of the intermediate station and the first path time.
Wherein, the transit time of different intermediate stations can be different, and the transit time can be the residence time of the transportation equipment at the intermediate stations. The transfer time can be determined according to the current situation of the intermediate station, and if the transportation equipment of the intermediate station is congested, the transfer time is longer. The transportation device may receive the current situation of each intermediate station in real time, and the current situation may be the number of transportation devices currently staying at the intermediate station. The transit time may be determined according to the number of transport devices, for example, a number threshold may be set, and if the number of transport devices exceeds the number threshold, the corresponding transit time is determined. Through the transit time of confirming the intermediate station in real time, can avoid artifical judgement error to the transit time, reduce artificial work load, improve computational efficiency.
Determining all intermediate stations passing through the first candidate path to obtain transit time of the passing intermediate stations, and determining second path time of the first candidate path according to the transit time and the first path time, wherein the second path time of each first candidate path is equal to or greater than the first path time of the first candidate path.
In this embodiment, optionally, determining the second path time of the first candidate path according to the transit time of the intermediate station and the first path time includes: determining intermediate stations passed by the first candidate path according to the route of the first candidate path; and adding the transit time of the intermediate station passed by the first candidate path with the first path time to obtain the second path time of the first candidate path.
Specifically, according to the route of the first candidate path, the intermediate stations passing through the first candidate path are determined. And acquiring transit time of the passed intermediate station, and adding the first path time of the first candidate path and the transit time of the passed intermediate station to obtain second path time of the first candidate path. For example, a first candidate route having a first route time of 5 hours, which passes through intermediate stations a and B, a transit time of 0.5 hours, and B transit time of 1 hour, has a second route time of 6.5 hours. The method has the advantages that the first path time and the transit time are added, so that more accurate and complete path time can be obtained, the accuracy of path planning is improved, and an object flow path with higher timeliness is found.
And after the second path time of the first candidate path is obtained, selecting a second candidate path from the first candidate path according to the second path time, and screening the paths again. And comparing the second path time of any first candidate path with the first path times of other first candidate paths except the first candidate path, and determining whether at least one other first candidate path exists in the other first candidate paths except the first candidate path, wherein the first path time is greater than the second path time of the first candidate path. I.e. determining whether the second path time of the first candidate path is less than the first path time of at least one other first candidate path. And if the second path time of the first candidate path is determined to be less than the first path time of at least one other first candidate path, determining the first candidate path as a second candidate path.
In this embodiment, optionally, determining whether there is at least one second candidate path in the first candidate paths, where a second path time that satisfies the second candidate path is less than a first path time of at least one first candidate path except the second candidate path, includes: comparing the second path time of the first candidate path with the first path time of other first candidate paths except the first candidate path; determining whether at least one second candidate path exists according to the comparison result, wherein the second path time of the second candidate path satisfying the second candidate path is shorter than the first path time of at least one other first candidate path; the second candidate path is any path in the first candidate path.
Specifically, a first path time and a second path time of each first candidate path are determined, and the second path time of one first candidate path is sequentially compared with the first path times of other first candidate paths except the first candidate path. And if the first path time of at least one other first candidate path is greater than the second path time of the first candidate path in other first candidate paths, determining that the first candidate path is a second candidate path. I.e. determining whether there is at least one second candidate path, the second path time satisfying which second candidate path is shorter than the first path time of at least one other first candidate path. The second candidate path is a path of the first candidate paths. For example, the first candidate route is route 1, route 2 and route 3, the first route time of route 1 is 2.5 hours, and the second route time is 2.9 hours; the first path time of the path 2 is 3 hours, and the second path time is 4 hours; the first path time of path 3 is 3 hours and the second path time is 4.5 hours. Since the second path time of path 1 is less than the first path times of path 2 and path 3, it may be determined that path 1 is the second candidate path. The beneficial effect of the arrangement is that the accuracy of path determination can be improved by screening the candidate paths again, so that a logistics path with higher timeliness is obtained.
And 140, if the target route exists, selecting a target route meeting the preset time requirement from the second candidate routes.
If at least one second candidate path exists, the target path may be determined from the second candidate paths based on a preset time requirement. For example, if the preset time requirement is 3 hours, the second candidate path with the second path time less than 3 hours is determined as the target path. And if only one second candidate path exists, the second candidate path is the target path.
In this embodiment, optionally, if the target route meets the preset time requirement, selecting a target route from the second candidate routes includes: and if at least one second candidate path exists, selecting the path with the minimum second path time from the second candidate paths as the target path.
Specifically, if there is a second candidate route in the first candidate routes, the second candidate route is the target route. And if at least two second candidate paths exist in the first candidate paths, selecting a target path from the second candidate paths according to a preset time requirement. The preset time requirement may be to select the path with the smallest second path time. For example, if there are two second candidate paths 001 and 002, and the second path times are 3 hours and 4 hours, respectively, 001 is selected as the target path. The method has the advantages that the final target path is determined according to the path time, a path result with higher timeliness is obtained, and the logistics arrival efficiency is improved.
According to the technical scheme of the embodiment, the overall required time of the path is obtained by determining the first path time from the current position to the target position and the transit time in real time, whether at least one path exists is judged, and the overall required time is shorter than the first path time of other paths, so that the path can be the target path. The problem of among the prior art, neglect harbour transit time easily when carrying out the route by the manual work and confirm is solved, practice thrift manpower and time, improved the precision of route planning, and then improve the commodity circulation ageing, satisfy growing trade demand.
Example two
Fig. 2 is a flowchart illustrating a method for determining a target path according to a second embodiment of the present invention, which is further optimized based on the second embodiment. As shown in fig. 2, the method specifically includes the following steps:
And step 220, determining second path time of the first candidate path according to the transit time of the intermediate station and the first path time.
And determining whether at least one second candidate path exists in the first candidate paths, wherein the judgment basis is to determine whether the second path time of any path in the first candidate paths is less than the first path time of other first candidate paths, and the other first candidate paths are the first candidate paths except the path. If so, the path is a second candidate path.
In this embodiment, optionally, after determining whether there is at least one second candidate path in the first candidate paths, and that a second path time of the second candidate path is less than a first path time of at least one first candidate path except the second candidate path, the method further includes: if the second candidate path exists, determining the path cost of the second candidate path according to the transit cost of the second candidate path passing through the intermediate station; and selecting a target path meeting the preset cost requirement from the second candidate paths.
Specifically, if there are at least two second candidate paths, the path cost of each second candidate path is determined. The determination may be made in dependence on the intermediate station traversed by the second candidate path. The transit costs to be paid for passing through different intermediate stations may be different, and all transit costs for all intermediate stations through which the second candidate route passes may be determined according to the specifications of the intermediate stations. For example, if a second candidate route passes through two intermediate stations, intermediate station 10 and intermediate station 20, respectively, the transit cost for intermediate station 10 is 10 yuan, and the transit cost for intermediate station 20 is 15 yuan, then the transit cost required for the second candidate route is 25 yuan. The driving cost required by the second candidate route, except the transit cost, can be determined according to the route length, for example, a certain cost is required for every kilometer of the transportation equipment. And obtaining the path cost of the second candidate path according to the driving cost and the transfer cost. The cost requirement for selecting the target path may be preset, for example, the preset cost requirement is a second candidate path with the lowest cost for selecting the path. And comparing the path cost of each second candidate path, and selecting the second candidate path with the lowest path cost as the target path. The path cost and the second path time may also be considered in combination, for example, a certain weight is configured for the path cost and the second path time, and a path with a smaller path cost and a smaller second path time is selected as the target path. The beneficial effect that sets up like this lies in, can select the target route from the angle of time and cost, reduces the transportation cost of target route, improves logistics efficiency.
And step 240, if the route does not exist, determining a third candidate route from the current location to the destination and a third route time of the third candidate route according to a preset second target time.
If the first candidate paths do not have the second candidate paths, that is, the second path time of each first candidate path is greater than or equal to the first path time of any first candidate path, then according to a preset second target time, a third candidate path is selected from all paths from the current place to the destination again. The second target time is greater than the first target time, for example, the first target time requires that a path with a time less than 3 hours among all paths is selected as the first candidate path, and the second target time requires that a path with a time less than 4 hours among all paths is selected as the third candidate path. The first target time and the second target time are required for the transport device to travel a route without including a transit time. And selecting third path time meeting the requirement of the second target time from the time required by all paths according to the second target time, wherein the path corresponding to the third path time is a third candidate path.
And step 250, determining fourth path time of the third candidate path according to the intermediate station transit time and the third path time in the third candidate path.
In which the intermediate station passed through in the third candidate route is determined, the transit time of the transportation device may be determined according to the number of transportation devices currently staying at the intermediate station, for example, the transit time may be increased by one hour for every transportation device. The transportation device can receive the transfer information of each intermediate station during the driving process, and the transfer information can comprise the transfer time or the number of the transportation devices. And obtaining the fourth path time of the third candidate path according to the transit time of the intermediate station and the third path time of each third candidate path. For example, the sum of transit times of intermediate stations traversed by a third candidate path may be added to the third path time of the third candidate path to obtain a fourth path time.
And if the fourth path time of the path is less than the third path time of at least one other third candidate path, determining the path as the fourth candidate path. And sequentially confirming the third candidate paths and determining whether at least one fourth candidate path exists.
And 270, if the target route exists, selecting a target route meeting the preset time requirement from the fourth candidate routes.
And if a fourth candidate path exists, the path is the target path. If at least two fourth candidate paths exist, the path with the minimum fourth path time or the lowest path cost can be selected as the target path according to the preset time requirement or cost requirement. If the fourth candidate path does not exist, a target time larger than the second target time is preset, the candidate paths are searched again, and path time comparison is carried out until the target path is found.
The embodiment of the invention determines the first path time and the transit time from the current position to the target position in real time through the first target time to obtain the overall required time of the path, and judges whether at least one path exists, wherein the overall required time is shorter than the first path time of other paths, and the path can be a target path. If no path meeting the requirement exists, a new target time is preset, and the target path is searched again until the target path is found. The problem of among the prior art, neglect harbour transit time easily when carrying out the route by the manual work and confirm is solved, can circulate and carry out the route and seek until the target path meets the requirements, reduce the manual computation process, improved the precision of route planning, and then improve the commodity circulation ageing, satisfy growing trade demand.
EXAMPLE III
Fig. 3 is a block diagram of a target path determining apparatus according to a third embodiment of the present invention, which is capable of executing a target path determining method according to any embodiment of the present invention, and has functional modules and beneficial effects corresponding to the executing method. As shown in fig. 3, the apparatus specifically includes:
a first path determining module 301, configured to determine, according to a current location, a destination, an intermediate station between the current location and the destination, and a preset first target time, a first candidate path and a first path time that meet a first target time requirement;
a second time determination module 302, configured to determine a second path time of the first candidate path according to the transit time of the intermediate station and the first path time;
a second path determining module 303, configured to determine whether there is at least one second candidate path in the first candidate paths, where a second path time of the second candidate path is less than a first path time of at least one first candidate path except the second candidate path;
and a target path determining module 304, configured to select a target path meeting a preset time requirement from the second candidate paths, if the target path exists.
Optionally, the first path determining module 301 is specifically configured to:
determining a candidate path from the current location to the destination according to the current location, the destination and an intermediate station between the current location and the destination;
determining the path time of the candidate path according to the length of the candidate path;
and determining a first path time meeting a preset first target time requirement and a first candidate path corresponding to the first path time from the path times of the candidate paths.
Optionally, the second time determining module 302 is specifically configured to:
determining intermediate stations passed by the first candidate path according to the route of the first candidate path;
and adding the transit time of the intermediate station passed by the first candidate path with the first path time to obtain the second path time of the first candidate path.
Optionally, the second path determining module 303 is specifically configured to:
comparing the second path time of the first candidate path with the first path time of other first candidate paths except the first candidate path;
determining whether at least one second candidate path exists according to the comparison result, wherein the second path time of the second candidate path satisfying the second candidate path is shorter than the first path time of at least one other first candidate path; and the second candidate path is any path in the first candidate paths.
Optionally, the target path determining module 304 is specifically configured to:
and if at least one second candidate path exists, selecting the path with the minimum second path time from the second candidate paths as the target path.
Optionally, the apparatus further comprises:
a third path determining module, configured to determine whether at least one second candidate path exists in the first candidate paths, and if the second path time of the second candidate path is less than the first path time of at least one first candidate path other than the second candidate path, determine, according to a preset second target time, a third candidate path from the current location to the destination and a third path time of the third candidate path;
a fourth time determination module, configured to determine a fourth path time of the third candidate path according to the transit time of the intermediate station in the third candidate path and the third path time;
a fourth path determining module, configured to determine whether at least one fourth candidate path exists in the third candidate paths, where a fourth path time that satisfies the fourth candidate path is less than a third path time of at least one third candidate path other than the fourth candidate path;
and the target path selection module is used for selecting a target path meeting the preset time requirement from the fourth candidate paths if the target path exists.
Optionally, the apparatus further comprises:
the path cost determination module is used for determining whether at least one second candidate path exists in the first candidate paths, and determining the path cost of the second candidate path according to the transit cost of the second candidate path passing through the intermediate station if the second candidate path exists after the second path time of the second candidate path is less than the first path time of at least one first candidate path except the second candidate path;
and the path selection module is used for selecting a target path meeting the preset cost requirement from the second candidate paths.
The embodiment of the invention obtains the overall required time of the path by determining the first path time and the transit time from the current position to the target position in real time, judges whether at least one path exists, and if the overall required time is shorter than the first path time of other paths, the path can be a target path. The problem of among the prior art, neglect harbour transit time easily when carrying out the route by the manual work and confirm is solved, improved the precision of route planning, and then improve the commodity circulation ageing, satisfy growing trade demand.
Example four
Fig. 4 is a schematic structural diagram of a target path determining apparatus according to a fourth embodiment of the present invention. The target path determination device is a computer device and fig. 4 shows a block diagram of an exemplary computer device 400 suitable for use in implementing embodiments of the present invention. The computer device 400 shown in fig. 4 is only an example and should not bring any limitations to the functionality or scope of use of the embodiments of the present invention.
As shown in fig. 4, computer device 400 is in the form of a general purpose computing device. The components of computer device 400 may include, but are not limited to: one or more processors or processing units 401, a system memory 402, and a bus 403 that couples the various system components (including the system memory 402 and the processing unit 401).
The system memory 402 may include computer system readable media in the form of volatile memory, such as Random Access Memory (RAM)404 and/or cache memory 405. The computer device 400 may further include other removable/non-removable, volatile/nonvolatile computer system storage media. By way of example only, storage system 406 may be used to read from and write to non-removable, nonvolatile magnetic media (not shown in FIG. 4, and commonly referred to as a "hard drive"). Although not shown in FIG. 4, a magnetic disk drive for reading from and writing to a removable, nonvolatile magnetic disk (e.g., a "floppy disk") and an optical disk drive for reading from or writing to a removable, nonvolatile optical disk (e.g., a CD-ROM, DVD-ROM, or other optical media) may be provided. In these cases, each drive may be connected to the bus 403 by one or more data media interfaces. Memory 402 may include at least one program product having a set (e.g., at least one) of program modules that are configured to carry out the functions of embodiments of the invention.
A program/utility 408 having a set (at least one) of program modules 407 may be stored, for example, in memory 402, such program modules 407 including, but not limited to, an operating system, one or more application programs, other program modules, and program data, each of which examples or some combination thereof may comprise an implementation of a network environment. Program modules 407 generally perform the functions and/or methods of the described embodiments of the invention.
The computer device 400 may also communicate with one or more external devices 409 (e.g., keyboard, pointing device, display 410, etc.), with one or more devices that enable a user to interact with the computer device 400, and/or with any devices (e.g., network card, modem, etc.) that enable the computer device 400 to communicate with one or more other computing devices. Such communication may be through input/output (I/O) interface 411. Moreover, computer device 400 may also communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network such as the Internet) via network adapter 412. As shown, network adapter 412 communicates with the other modules of computer device 400 over bus 403. It should be appreciated that although not shown in the figures, other hardware and/or software modules may be used in conjunction with computer device 400, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.
The processing unit 401 executes various functional applications and data processing by executing programs stored in the system memory 402, for example, to implement a method for determining a target path according to an embodiment of the present invention, including:
determining a first candidate path and a first path time which meet the requirement of a first target time according to the current place, the destination, an intermediate station between the current place and the destination and the preset first target time;
determining second path time of the first candidate path according to the transit time of the intermediate station and the first path time;
determining whether at least one second candidate path exists in the first candidate paths, wherein the second path time of the second candidate path is less than the first path time of at least one first candidate path except the second candidate path;
and if so, selecting a target path meeting the preset time requirement from the second candidate paths.
EXAMPLE five
The fifth embodiment of the present invention further provides a storage medium containing computer-executable instructions, where the storage medium stores a computer program, and when the computer program is executed by a processor, the method for determining a target path according to the fifth embodiment of the present invention is implemented, where the method includes:
determining a first candidate path and a first path time which meet the requirement of a first target time according to the current place, the destination, an intermediate station between the current place and the destination and the preset first target time;
determining second path time of the first candidate path according to the transit time of the intermediate station and the first path time;
determining whether at least one second candidate path exists in the first candidate paths, wherein the second path time of the second candidate path is less than the first path time of at least one first candidate path except the second candidate path;
and if so, selecting a target path meeting the preset time requirement from the second candidate paths.
Computer storage media for embodiments of the invention may employ any combination of one or more computer-readable media. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. The computer-readable storage medium may be, for example, but is not limited to: an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: 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 context of this document, 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.
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, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
It is to be noted that the foregoing is only illustrative of the preferred embodiments of the present invention and the technical principles employed. It will be understood by those skilled in the art that the present invention is not limited to the particular embodiments described herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the invention. Therefore, although the present invention has been described in greater detail by the above embodiments, the present invention is not limited to the above embodiments, and may include other equivalent embodiments without departing from the spirit of the present invention, and the scope of the present invention is determined by the scope of the appended claims.
Claims (10)
1. A method for determining a target path, comprising:
determining a first candidate path and a first path time which meet a first target time requirement according to a current place, a destination, an intermediate station between the current place and the destination and a preset first target time;
determining a second path time of the first candidate path according to the transit time of the intermediate station and the first path time;
determining whether at least one second candidate path exists in the first candidate paths, wherein the second path time of the second candidate path is less than the first path time of at least one first candidate path except the second candidate path;
and if so, selecting a target path meeting the preset time requirement from the second candidate paths.
2. The method of claim 1, wherein determining a first candidate path and a first path time satisfying a first target time requirement according to a current location, a destination, an intermediate station between the current location and the destination, and a preset first target time comprises:
determining a candidate path from a current location to a destination according to the current location, the destination and an intermediate station between the current location and the destination;
determining the path time of the candidate path according to the length of the candidate path;
and determining a first path time meeting a preset first target time requirement and a first candidate path corresponding to the first path time from the path times of the candidate paths.
3. The method of claim 1, wherein determining a second path time for the first candidate path based on the transit time for the intermediate station and the first path time comprises:
determining intermediate stations passed by the first candidate path according to the route of the first candidate path;
and adding the transit time of the intermediate station passed by the first candidate path with the first path time to obtain a second path time of the first candidate path.
4. The method of claim 1, wherein determining whether there is at least one second candidate path among the first candidate paths, wherein a second path time satisfying the second candidate path is less than a first path time of at least one first candidate path other than the second candidate path, comprises:
comparing the second path time of the first candidate path with the first path time of other first candidate paths except the first candidate path;
determining whether at least one second candidate path exists according to the comparison result, wherein the second path time of the second candidate path satisfying the second candidate path is less than the first path time of at least one other first candidate path; wherein the second candidate path is any path in the first candidate paths.
5. The method of claim 1, wherein selecting a target route from the second candidate routes that meets a predetermined time requirement, if any, comprises:
and if at least one second candidate path exists, selecting the path with the minimum second path time from the second candidate paths as a target path.
6. The method of claim 1, after determining whether there is at least one second candidate path among the first candidate paths, wherein a second path time of the second candidate path is less than a first path time of at least one first candidate path other than the second candidate path, further comprising:
if the current route does not exist, determining a third candidate route from the current place to the destination and third route time of the third candidate route according to preset second target time;
determining fourth path time of the third candidate path according to the transit time of the intermediate station in the third candidate path and the third path time;
determining whether at least one fourth candidate path exists in the third candidate paths, wherein the fourth path time of the fourth candidate path is less than the third path time of at least one third candidate path except the fourth candidate path;
and if so, selecting a target path meeting the preset time requirement from the fourth candidate paths.
7. The method of claim 1, after determining whether there is at least one second candidate path among the first candidate paths, wherein a second path time of the second candidate path is less than a first path time of at least one first candidate path other than the second candidate path, further comprising:
if the second candidate path exists, determining the path cost of the second candidate path according to the transit cost of the second candidate path passing through the intermediate station;
and selecting a target path meeting a preset cost requirement from the second candidate paths.
8. An apparatus for determining a target path, comprising:
the first path determining module is used for determining a first candidate path and a first path time which meet a first target time requirement according to a current place, a destination, an intermediate station between the current place and the destination and a preset first target time;
a second time determination module, configured to determine a second path time of the first candidate path according to the transit time of the intermediate station and the first path time;
a second path determining module, configured to determine whether there is at least one second candidate path in the first candidate paths, where a second path time of the second candidate path is less than a first path time of at least one first candidate path except the second candidate path;
and the target path determining module is used for selecting a target path meeting the preset time requirement from the second candidate paths if the target path exists.
9. A target path determination apparatus comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the target path determination method according to any one of claims 1 to 7 when executing the program.
10. A storage medium containing computer-executable instructions for performing the method of determining a target path of any one of claims 1-7 when executed by a computer processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011454461.8A CN112529297A (en) | 2020-12-10 | 2020-12-10 | Method, device and equipment for determining target path and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011454461.8A CN112529297A (en) | 2020-12-10 | 2020-12-10 | Method, device and equipment for determining target path and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112529297A true CN112529297A (en) | 2021-03-19 |
Family
ID=74998867
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011454461.8A Pending CN112529297A (en) | 2020-12-10 | 2020-12-10 | Method, device and equipment for determining target path and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112529297A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105551244A (en) * | 2015-12-08 | 2016-05-04 | 重庆云途交通科技有限公司 | Dynamic path planning method |
| CN107871179A (en) * | 2017-09-26 | 2018-04-03 | 西南交通大学 | It is a kind of based on the goods train service chart preparation method for transporting to the time limit |
| CN107869995A (en) * | 2016-09-28 | 2018-04-03 | 阿里巴巴集团控股有限公司 | A kind of generation method, system and the mobile terminal of path duration |
| CN108151756A (en) * | 2017-12-21 | 2018-06-12 | 深圳市综合交通运行指挥中心 | The travel time computation method and device of a kind of urban public tranlport system |
| CN108764511A (en) * | 2018-03-30 | 2018-11-06 | 东莞产权交易中心 | A kind of long-distance train ticket segmentation purchase path planning system and method |
| CN111754052A (en) * | 2020-07-31 | 2020-10-09 | 叶阗瑞 | Optimal route optimization method for goods arrival time limit |
-
2020
- 2020-12-10 CN CN202011454461.8A patent/CN112529297A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105551244A (en) * | 2015-12-08 | 2016-05-04 | 重庆云途交通科技有限公司 | Dynamic path planning method |
| CN107869995A (en) * | 2016-09-28 | 2018-04-03 | 阿里巴巴集团控股有限公司 | A kind of generation method, system and the mobile terminal of path duration |
| CN107871179A (en) * | 2017-09-26 | 2018-04-03 | 西南交通大学 | It is a kind of based on the goods train service chart preparation method for transporting to the time limit |
| CN108151756A (en) * | 2017-12-21 | 2018-06-12 | 深圳市综合交通运行指挥中心 | The travel time computation method and device of a kind of urban public tranlport system |
| CN108764511A (en) * | 2018-03-30 | 2018-11-06 | 东莞产权交易中心 | A kind of long-distance train ticket segmentation purchase path planning system and method |
| CN111754052A (en) * | 2020-07-31 | 2020-10-09 | 叶阗瑞 | Optimal route optimization method for goods arrival time limit |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109974718B (en) | Map matching method, apparatus, device and medium | |
| CN110426050B (en) | Map matching correction method, device, equipment and storage medium | |
| CN104683405B (en) | The method and apparatus of cluster server distribution map matching task in car networking | |
| CN110260870A (en) | Map-matching method, device, equipment and medium based on hidden Markov model | |
| CN110006439B (en) | Map track data matching method, map track data matching device, server and storage medium | |
| CN109916414B (en) | Map matching method, apparatus, device and medium | |
| CN111006682A (en) | Navigation route planning method and device, electronic equipment and storage medium | |
| CN105225510A (en) | For verifying the method and system of the road network of map | |
| CN109781132B (en) | Experience route replacing method and device, electronic equipment and storage medium | |
| CN111737377B (en) | Method and device for identifying drift trajectory, computing equipment and storage medium | |
| CN107883974B (en) | Navigation path planning method, navigation server and computer readable medium | |
| CN104121916A (en) | Method and system for map matching | |
| CN112068544B (en) | Scheduling method, device, equipment and storage medium of autonomous mobile device | |
| CN114036253A (en) | High-precision map data processing method and device, electronic equipment and medium | |
| CN112347316A (en) | GraphSAGE-based bad preference behavior detection method and device and electronic equipment | |
| CN113222205A (en) | Path planning method and device | |
| CN112862183A (en) | Prediction method of charging difficulty, training method of model, training device of model and equipment | |
| CN109934496B (en) | Method, device, equipment and medium for determining inter-area traffic influence | |
| CN112529297A (en) | Method, device and equipment for determining target path and storage medium | |
| CN113624245B (en) | Navigation method and device, computer storage medium and electronic equipment | |
| CN114485670B (en) | Path planning method and device for mobile unit, electronic equipment and medium | |
| CN112379692B (en) | Method, device and equipment for determining unmanned aerial vehicle air route and storage medium | |
| CN113011672B (en) | Logistics aging prediction method and device, electronic equipment and storage medium | |
| CN115206102A (en) | Method, apparatus, electronic device, and medium for determining traffic path | |
| CN113449798A (en) | Port unmanned driving map generation method and device, electronic equipment and storage medium |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210319 |