CN111105095B - Distribution route determining method and device and electronic equipment - Google Patents

Distribution route determining method and device and electronic equipment Download PDF

Info

Publication number
CN111105095B
CN111105095B CN201911351459.5A CN201911351459A CN111105095B CN 111105095 B CN111105095 B CN 111105095B CN 201911351459 A CN201911351459 A CN 201911351459A CN 111105095 B CN111105095 B CN 111105095B
Authority
CN
China
Prior art keywords
delivery
distribution
points
route
point
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.)
Active
Application number
CN201911351459.5A
Other languages
Chinese (zh)
Other versions
CN111105095A (en
Inventor
朱兆军
周超
杨秋源
陈玮
徐明泉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing SF Intra City Technology Co Ltd
Original Assignee
Beijing SF Intra City Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing SF Intra City Technology Co Ltd filed Critical Beijing SF Intra City Technology Co Ltd
Priority to CN201911351459.5A priority Critical patent/CN111105095B/en
Publication of CN111105095A publication Critical patent/CN111105095A/en
Application granted granted Critical
Publication of CN111105095B publication Critical patent/CN111105095B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047Optimisation of routes or paths, e.g. travelling salesman problem
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083Shipping
    • G06Q10/0835Relationships between shipper or supplier and carriers
    • G06Q10/08355Routing methods
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02TCLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
    • Y02T10/00Road transport of goods or passengers
    • Y02T10/10Internal combustion engine [ICE] based vehicles
    • Y02T10/40Engine management systems

Abstract

The application provides a distribution route determining method, a distribution route determining device and electronic equipment, wherein the distribution route determining method comprises the following steps: acquiring the azimuth of the delivery point relative to the supply point; generating an initial distribution route according to the azimuth sequence of the distribution points; and optimizing the initial distribution route by adopting an optimal solution algorithm to determine a preferred distribution route. According to the method and the device for optimizing the distribution points, the initial distribution route is generated through the azimuth sequence of the distribution points, optimization is conducted on the basis of the initial distribution route, the time for searching the optimal solution is shortened, and the efficiency for determining the optimal distribution route is improved to a certain extent.

Description

Distribution route determining method and device and electronic equipment
Technical Field
The present disclosure relates to the field of logistics transportation technologies, and in particular, to a method and an apparatus for determining a delivery route, and an electronic device.
Background
With the rapid development of Chinese economy and the gradual perfection of infrastructure, the logistics transportation industry grows rapidly. The logistics industry typically reduces the number of delivery vehicles and the travel distance of delivery vehicles by planning the delivery route of the vehicles.
In the actual distribution process, the distribution scene is complex and diversified, and when the distribution points are more or the distribution requirements of the distribution points are more, the optimal distribution route cannot be determined within an acceptable time range in the method for planning the vehicle distribution route in a related manner.
Disclosure of Invention
In view of the foregoing, an object of the present application is to provide a method, an apparatus and an electronic device for determining a delivery route, so as to improve the efficiency of determining the delivery route.
In a first aspect, an embodiment of the present application provides a method for determining a delivery route, including:
acquiring the azimuth of the delivery point relative to the supply point;
generating an initial distribution route according to the azimuth sequence of the distribution points;
and optimizing the initial distribution route by adopting an optimal solution algorithm to determine a preferred distribution route.
With reference to the first aspect, an embodiment of the present application provides a first possible implementation manner of the first aspect, wherein the generating an initial delivery route according to the azimuth sequence of the delivery points includes:
determining an included angle between the direction of the delivery point and a reference direction according to the position of the delivery point relative to the supply point; the included angle is formed when the ray in which the reference direction is located rotates along a preset direction to be overlapped with the ray in which the direction of the distribution point is located; the direction of the delivery point is the direction from the delivery point to the delivery point;
arranging according to the included angles to obtain the distribution sequence of the distribution points;
and generating an initial distribution route according to the distribution sequence of the distribution points.
With reference to the first aspect, an embodiment of the present application provides a second possible implementation manner of the first aspect, where the generating an initial delivery route according to the azimuth sequence of the delivery points further includes:
grouping the distribution points according to the azimuth of the distribution points relative to the supply points to obtain a plurality of groups;
an initial delivery route is generated for the delivery conditions of each delivery point in each group.
With reference to the first aspect, an embodiment of the present application provides a third possible implementation manner of the first aspect, where the generating an initial delivery route according to the azimuth sequence of the delivery points further includes:
grouping the distribution points according to the azimuth of the distribution points relative to the supply points to obtain a plurality of groups;
and determining an initial distribution route according to the number of the groups.
With reference to the third possible implementation manner of the first aspect, the embodiment of the present application provides a fourth possible implementation manner of the first aspect, wherein the generating an initial delivery route according to the azimuth order of the delivery points further includes:
for each of the groups, determining an initial delivery route based on the number of delivery points in the group.
With reference to the first aspect, an embodiment of the present application provides a fifth possible implementation manner of the first aspect, wherein the optimizing the initial delivery route by using an optimal solution algorithm to determine a preferred delivery route includes:
determining a search range of the delivery points for each of the delivery points in the initial delivery route; the searching range is determined by taking the distribution point as a center point and the preset distance as a radius;
and respectively replacing the distribution points with other distribution points in the search range to generate a plurality of first distribution routes, and determining the first distribution route with the lowest distribution cost as the preferred distribution route.
With reference to the second possible implementation manner of the first aspect, the present embodiment provides a sixth possible implementation manner of the first aspect, wherein the dispensing condition includes at least one of the following: the delivery time of the goods to be delivered, the quantity of the goods to be delivered, the temperature layer of the goods to be delivered and the loading capacity of the delivery vehicle.
With reference to the first aspect, an embodiment of the present application provides a seventh possible implementation manner of the first aspect, where the optimizing the initial delivery route by using an optimal solution algorithm to determine a preferred delivery route further includes:
judging whether an optimization termination condition is reached; the optimization termination condition comprises optimization time length and optimization times;
if not, the searching range is redetermined for each delivery point in the initial delivery route, and the steps of replacing the delivery points with other delivery points in the searching range respectively to generate a plurality of first delivery routes and determining the first delivery route with the lowest delivery cost as the preferred delivery route are re-executed until the optimal termination condition is reached.
In a second aspect, an embodiment of the present application further provides a delivery route determining apparatus, including:
the acquisition module is used for acquiring the azimuth of the distribution point relative to the supply point;
the generating module is used for generating an initial distribution route according to the azimuth sequence of the distribution points;
and the optimizing module is used for optimizing the initial distribution route by adopting an optimal solution solving algorithm so as to determine a preferable distribution route.
In a third aspect, embodiments of the present application further provide an electronic device, including: a processor, a memory and a bus, the memory storing machine-readable instructions executable by the processor, the processor and the memory in communication via the bus when the electronic device is running, the machine-readable instructions when executed by the processor performing the steps of any one of the possible implementations of the first aspect.
In a fourth aspect, the present embodiments also provide a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of any of the possible implementations of the first aspect described above.
The embodiment of the application provides a delivery route determining method, a device and electronic equipment, wherein the delivery route determining method comprises the following steps: acquiring the azimuth of the delivery point relative to the supply point; generating an initial distribution route according to the azimuth sequence of the distribution points; and optimizing the initial distribution route by adopting an optimal solution algorithm to determine a preferred distribution route. According to the method and the device for optimizing the distribution points, the initial distribution route is generated through the azimuth sequence of the distribution points, optimization is conducted on the basis of the initial distribution route, the time for searching the optimal solution is shortened, and the efficiency for determining the optimal distribution route is improved to a certain extent.
In order to make the above objects, features and advantages of the present application more comprehensible, preferred embodiments accompanied with figures are described in detail below.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the embodiments will be briefly described below, it being understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered limiting the scope, and that other related drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic flow chart of a first delivery route determining method according to an embodiment of the present application;
FIG. 2 is a flow chart of a second method for determining a delivery route according to an embodiment of the present application;
FIG. 3 is a flow chart illustrating a third method for determining a delivery route according to an embodiment of the present application;
FIG. 4 is a flowchart illustrating a fourth method for determining a delivery route according to an embodiment of the present disclosure;
fig. 5 is a schematic structural view of a delivery route determining device according to an embodiment of the present application;
fig. 6 shows a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the embodiments of the present application more clear, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is apparent that the described embodiments are only some embodiments of the present application, but not all embodiments. The components of the embodiments of the present application, which are generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present application, as provided in the accompanying drawings, is not intended to limit the scope of the application, as claimed, but is merely representative of selected embodiments of the application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present application without making any inventive effort, are intended to be within the scope of the present application.
The embodiment of the application provides a distribution route determining method, and the description is given below through the embodiment.
The flow chart of a delivery route determining method shown in fig. 1 includes the following steps:
s101: the orientation of the delivery point relative to the delivery point is obtained.
S102: and generating an initial distribution route according to the azimuth sequence of the distribution points.
S103: and optimizing the initial distribution route by adopting an optimal solution algorithm to determine a preferred distribution route.
In step S101, the delivery point refers to a place where the delivery vehicle is required to deliver the cargo. A delivery point refers to a location where goods are provided to a delivery point. In a particular embodiment, the delivery point and the delivery point may be located within the same shipping area, with the delivery point within the same shipping area delivering the cargo to the delivery point. Typically, there are multiple delivery points and at least one supply point within the same shipping area. The distribution points can be supermarkets, convenience stores, restaurants, express points and the like; the point of supply may be a warehouse, a transfer in goods, etc.
When the position of the delivery point relative to the supply point is acquired, the position of the delivery point relative to the supply point can be acquired through the first position information of the delivery point and the second position information of the supply point, for example, the addresses of the delivery point and the supply point can be acquired respectively, and the position of the delivery point relative to the supply point is determined according to the addresses; for another example, the longitude and latitude of the delivery point and the delivery point may be obtained respectively, and the azimuth of the delivery point relative to the delivery point may be determined according to the longitude and latitude.
In step S102, the initial delivery route includes an initial delivery vehicle and an initial delivery route.
In particular embodiments, the initial delivery vehicle and the initial delivery route may be determined in this step based on the order of the orientations of the delivery points, taking into account that the delivery route of the delivery vehicle may be affected by the delivery points and the relative positions between the delivery points and the delivery points.
Therefore, when the step of generating the initial distribution route according to the azimuth order of the distribution points is performed, the steps in the flow chart of the second distribution route determining method shown in fig. 2 may be specifically performed:
s201: and determining the included angle between the direction of the delivery point and the reference direction according to the position of the delivery point relative to the supply point.
S202: and arranging according to the size of the included angle to obtain the distribution sequence of the distribution points.
S203: and generating an initial delivery route according to the delivery sequence of the delivery points.
In step S201, the direction of the delivery point refers to the direction from the delivery point to the delivery point. The included angle between the direction of the dispensing point and the reference direction refers to an included angle formed when the ray in which the reference direction is located rotates along the preset direction to be overlapped with the ray in which the direction of the dispensing point is located.
When determining the included angle between the direction of the delivery point and the reference direction, the azimuth of the delivery point relative to the delivery point can be determined in a rectangular coordinate system, and a certain direction of the coordinate axis is taken as the reference direction, so that the included angle between the direction of the delivery point and the reference direction is determined.
Specifically, the point of supply may be the origin, the east-west direction, the forward direction of the transverse axis, the north-south direction, the forward direction of the longitudinal axis, and the forward direction of the longitudinal axis.
In the rectangular coordinate system, the feeding point is taken as an end point, and the direction from the feeding point to the delivery point is the direction of the delivery point.
In a specific implementation, the reference direction may rotate in a counterclockwise direction, and the included angle formed when the reference direction coincides with the direction of the dispensing point is the included angle between the reference direction and the direction of the dispensing point. In other embodiments, the reference direction may also be rotated in a clockwise direction.
In step S202, the distribution points may be ordered according to the size of the included angle, and in step S203, an initial distribution route may be generated according to the distribution order of the distribution points.
It is also contemplated that when the orientation of the delivery point is far, the same delivery vehicle may not be delivered within a prescribed time or range of allowable mileage, at which time the number of delivery vehicles may need to be adjusted, and the delivery route may be determined by the number of delivery vehicles.
Specifically, when the step of generating the initial delivery route according to the azimuth order of the delivery points is performed, the steps in the flowchart of the third delivery route determination method shown in fig. 3 may also be performed:
s301: the distribution points are grouped according to the orientation of the distribution points relative to the delivery points, and a plurality of groups are obtained.
S302: an initial delivery route is generated for the delivery conditions of each delivery point in each group.
In step S301, the distribution points may be clustered according to their orientations with respect to the supply points, for example, distribution points having a close orientation may be grouped, or distribution points in the same quadrant may be grouped according to their orientations in a rectangular coordinate system, so that the distribution points may be grouped into a plurality of groups.
In step S302, the delivery condition refers to a condition of the goods at the time of delivery for each delivery point pair in each group. The dispensing conditions may include: the delivery time of the goods to be delivered, the quantity of the goods to be delivered, the temperature layer of the goods to be delivered and the loading capacity of the delivery vehicle.
The delivery time of the to-be-delivered goods refers to the time of delivering the to-be-delivered goods to the delivery point. When the delivery time of the goods to be delivered is not large but the distance is far, the same delivery vehicle may not be delivered in time, so that the quantity of the delivery vehicles needs to be adjusted according to the delivery condition of each delivery point; or when the delivery time difference of the goods to be delivered is larger, the delivery route of the delivery vehicle can be generated according to the sequence of the delivery time.
The amount of the goods to be delivered refers to the amount of the goods required for the delivery point. In a specific implementation, when more goods are needed at the delivery point, delivery vehicles with larger loading capacity can be configured or the number of delivery vehicles can be increased; when less goods are needed at the delivery points, the delivery vehicles with smaller loading capacity can be configured, the number of the delivery vehicles is reduced, or the same delivery vehicle loads goods at a plurality of delivery points, and then the delivery route of the delivery vehicle is generated according to the orientations of the plurality of delivery points.
The temperature layer of the goods to be distributed refers to the storage temperature range of the goods to be distributed, and can be divided into normal temperature, fresh-keeping (0 to 3 ℃), cold storage (0 to minus 8 ℃) and freezing (minus 18 ℃), for example. In a specific implementation, due to the limitation of storage temperature, different delivery vehicles can be configured according to the temperature layer requirements of different goods to be delivered.
The load of the delivery vehicle refers to the weight of the delivery vehicle that can be loaded with cargo. The load of the delivery vehicle may affect how many delivery points the delivery vehicle may load, and thus the delivery route of the delivery vehicle between the delivery points may be determined based on the load of the delivery vehicle.
When the distribution conditions include the above-described plurality of conditions, it is necessary to generate an initial distribution route on the premise that all the distribution conditions are satisfied.
When the step of generating the initial distribution route according to the azimuth sequence of the distribution points is performed after the distribution points are grouped according to the azimuth of the distribution points relative to the supply points, the initial distribution route may be determined according to the number of groups. When the groups are more, determining an initial distribution route according to the number of the groups.
More specifically, the initial delivery route may also be determined for each group based on the number of delivery points in each group. In addition to determining the number of delivery vehicles based on the number of delivery points in each group, an initial delivery route is determined based on the orientation of the delivery points in each group.
In step S103, the distribution route set may be determined using a neighborhood search algorithm, a variable neighborhood search algorithm, a large neighborhood search algorithm, and the like. Wherein the delivery route set is a set of feasibility solutions based on the initial delivery route.
In determining the delivery route set, the steps in the flowchart of the fourth delivery route determination method shown in fig. 4 may be performed:
s401: for each delivery point in the initial delivery route, a search range for the delivery point is determined.
S402: and replacing the distribution points with other distribution points in the search range respectively to generate a plurality of first distribution routes, and determining the first distribution route with the lowest distribution cost as the preferred distribution route.
In step S401, the search range is a search range within a predetermined distance with the distribution point as the center point, and the search range is referred to as a neighborhood of the distribution point.
In step S402, a plurality of first delivery routes are generated by replacing the delivery points with other delivery points in the search range, respectively, and the generated first delivery routes are delivery route sets.
Then, a meta heuristic algorithm may be adopted, which may specifically include a tabu search algorithm, a simulated annealing algorithm, and the like, and a first delivery route with the lowest delivery cost is searched in the delivery route set as a preferred delivery route.
In a specific implementation, the optimization termination condition may be set according to actual requirements, and specifically, the optimization duration and the optimization times may be set. And then judging whether the optimal termination condition is reached currently.
If the optimization termination condition has not been reached, the search range may be redetermined for each delivery point in the initial delivery route, for example, the search range may be enlarged, and the delivery route set corresponding to the search range may be regenerated. And searching the first delivery route with the lowest delivery cost in the regenerated delivery route set as a preferred delivery route until the optimal termination condition is reached.
The following describes in detail a delivery route determining method provided in the embodiment of the present application, taking a warehouse to deliver goods daily as a convenience store chain as an example.
Step 1: and obtaining constraint conditions of the chain convenience store.
Here, the constraint condition refers to a condition such as a volume, a weight, a temperature level, a delivery time of the delivery vehicle, and the like of the required goods for each chain convenience store.
Step 2: the orientation of the chain of convenience stores relative to the warehouse is obtained.
And establishing a rectangular coordinate system by taking the warehouse as an origin, taking the east-west direction as a transverse axis and taking the north-south direction as a longitudinal axis, wherein the east is the positive direction of the transverse axis, and the north is the positive direction of the longitudinal axis.
And determining the position coordinates of the chain convenience stores in the rectangular coordinate system according to the address of each chain convenience store and the address of the warehouse.
Step 3: and determining the included angle between the direction of the chain of convenience stores and the reference direction according to the direction of the chain of convenience stores relative to the warehouse.
The reference direction is the positive direction of the horizontal axis. The direction of the chain of convenience stores is the direction from the warehouse to the chain of convenience stores. The reference direction rotates in the anticlockwise direction, and the included angle formed when the reference direction is overlapped with the direction of the chain convenience store is the included angle between the direction of the chain convenience store and the reference direction.
Step 4: and (5) arranging according to the size of the included angle to obtain the distribution sequence of the chain convenience stores.
And generating the distribution sequence of the chain convenience stores by taking the warehouse as a starting point according to the sequence that the included angles between the direction of the chain convenience stores and the reference direction are from small to large.
Step 5: and generating an initial distribution route according to the distribution sequence of the chain convenience stores.
Step 6: and generating a distribution route set by adopting a variable neighborhood searching algorithm.
On the premise of meeting constraint conditions of chain convenience stores, the distribution cost (the number of distribution vehicles and the vehicle driving distance) is reduced as much as possible, a variable neighborhood search algorithm is adopted to determine the search range of an initial distribution route, more possible distribution routes are generated, and a distribution route set is formed.
Step 7: and optimizing the initial distribution route by using a simulated annealing algorithm, and determining a preferred distribution route.
And comparing the distribution cost of the first distribution route in the distribution route set, and screening out the first distribution route with lower distribution cost.
Step 8: judging whether an optimization termination condition is met, if not, returning to the step 6; if yes, go to step 9.
The optimization termination conditions, which specifically may include an optimization time period and an optimization frequency, may be set according to actual requirements.
Step 9: and taking the current first delivery route as an optimal delivery route.
According to the distribution route determining method, the optimal distribution route can be determined according to the complex business scene, the number of distribution vehicles and the running distance of the vehicles can be reduced, the distribution cost is reduced to a certain extent, and the distribution route determining efficiency is improved.
Based on the same technical concept, the embodiments of the present application also provide a delivery route determining device, an electronic device, a computer readable storage medium, and the like, and particularly, reference may be made to the following embodiments.
Fig. 5 is a block diagram illustrating a delivery route determination device according to some embodiments of the present application, where the functions performed by the delivery route determination device correspond to the steps of the delivery route determination method performed on a terminal device as described above. The apparatus may be understood as a component of a server including a processor, which is capable of implementing the above-described delivery route determination method, and as shown in fig. 5, the delivery route determination apparatus may include:
an obtaining module 501, configured to obtain a position of a delivery point relative to a delivery point;
a generating module 502, configured to generate an initial delivery route according to the azimuth sequence of the delivery points;
and the optimizing module 503 is configured to optimize the initial delivery route by using an optimal solution algorithm to determine a preferred delivery route.
The generation module 502 further includes:
the first determining module is used for determining an included angle between the direction of the delivery point and the reference direction according to the position of the delivery point relative to the supply point; wherein the included angle is formed when the reference direction rotates along a preset direction to be coincident with the direction of the distribution point; the direction of the delivery point is the direction from the delivery point to the delivery point;
the arrangement module is used for arranging according to the size of the included angle so as to obtain the distribution sequence of the distribution points;
and the first sub-generation module is used for generating an initial distribution route according to the distribution sequence of the distribution points.
The generation module 502 further includes:
the first grouping module is used for grouping the distribution points according to the azimuth of the distribution points relative to the supply points to obtain a plurality of groups;
and the second sub-generation module is used for generating an initial distribution route according to the distribution condition of each distribution point in each group.
The generation module 502 further includes:
the second grouping module is used for grouping the distribution points according to the azimuth of the distribution points relative to the supply points to obtain a plurality of groups;
and the second determining module is used for determining an initial distribution route according to the number of the groups.
The generation module 502 further includes:
and a third determining module, configured to determine, for each of the groups, an initial delivery route according to the number of delivery points in the group.
The optimization module 503 includes:
a fourth determining module, configured to determine, for each of the delivery points in the initial delivery route, a search range of the delivery point;
and a fifth determining module, configured to replace the delivery points with other delivery points in the search range, so as to generate a plurality of first delivery routes, and determine that the first delivery route with the lowest delivery cost is the preferred delivery route.
The optimization module 503 includes:
the judging module is used for judging whether the optimized termination condition is reached; the optimization termination condition comprises optimization time length and optimization times;
and if not, re-determining a search range for each delivery point in the initial delivery route, and re-executing the steps of replacing the delivery points with other delivery points in the search range to generate a plurality of first delivery routes, and determining the first delivery route with the lowest delivery cost as the preferred delivery route until the optimal termination condition is reached.
In a specific implementation, the dispensing conditions include at least one of: the delivery time of the goods to be delivered, the quantity of the goods to be delivered, the temperature layer of the goods to be delivered and the loading capacity of the delivery vehicle.
As shown in fig. 6, a schematic structural diagram of an electronic device 600 according to an embodiment of the present application is provided, where the electronic device 600 includes: at least one processor 601, at least one network interface 604 and at least one user interface 603, a memory 605, at least one communication bus 602. The communication bus 602 is used to enable connected communications between these components. The user interface 603 includes a display (e.g., a touch screen), a keyboard, or a pointing device (e.g., a touch pad or touch screen, etc.).
Memory 605 may include read-only memory and random access memory and provide instructions and data to processor 601. A portion of the memory 605 may also include non-volatile random access memory (NVRAM).
In some implementations, the memory 605 stores the following elements, executable modules or data structures, or a subset thereof, or an extended set thereof:
an operating system 6051 containing various system programs for implementing various basic services and handling hardware-based tasks;
application 6052 contains various applications for implementing various application services.
In the present embodiment, the processor 601 is configured to, by calling a program or instructions stored in the memory 605:
acquiring the azimuth of the delivery point relative to the supply point;
generating an initial distribution route according to the azimuth sequence of the distribution points;
and optimizing the initial distribution route by adopting an optimal solution algorithm to determine a preferred distribution route.
Processor 601, when executing the step of generating an initial delivery route according to the order of orientations of the delivery points, is configured to:
determining an included angle between the direction of the delivery point and a reference direction according to the position of the delivery point relative to the supply point; the included angle is formed when the ray in which the reference direction is located rotates along a preset direction to be overlapped with the ray in which the direction of the distribution point is located; the direction of the delivery point is the direction from the delivery point to the delivery point;
arranging according to the included angles to obtain the distribution sequence of the distribution points;
and generating an initial distribution route according to the distribution sequence of the distribution points.
Processor 601, when executing the step of generating an initial delivery route according to the order of orientations of the delivery points, is configured to:
grouping the distribution points according to the azimuth of the distribution points relative to the supply points to obtain a plurality of groups;
an initial delivery route is generated for the delivery conditions of each delivery point in each group.
In a specific implementation, the dispensing conditions include at least one of: the delivery time of the goods to be delivered, the quantity of the goods to be delivered, the temperature layer of the goods to be delivered and the loading capacity of the delivery vehicle.
Processor 601, when executing the step of generating an initial delivery route according to the order of orientations of the delivery points, is configured to:
grouping the distribution points according to the azimuth of the distribution points relative to the supply points to obtain a plurality of groups;
and determining an initial distribution route according to the number of the groups.
Processor 601, when executing the step of generating an initial delivery route according to the order of orientations of the delivery points, is configured to:
for each of the groups, determining an initial delivery route based on the number of delivery points in the group.
The processor 601, when executing the step of optimizing the initial delivery route using an optimal solution algorithm to determine a preferred delivery route, is configured to:
determining a search range of the delivery points for each of the delivery points in the initial delivery route; the searching range is determined by taking the distribution point as a center point and the preset distance as a radius;
and respectively replacing the distribution points with other distribution points in the search range to generate a plurality of first distribution routes, and determining the first distribution route with the lowest distribution cost as the preferred distribution route.
The processor 601, when executing the step of optimizing the initial delivery route using an optimal solution algorithm to determine a preferred delivery route, is configured to:
judging whether an optimization termination condition is reached; the optimization termination condition comprises optimization time length and optimization times;
if not, the searching range is redetermined for each delivery point in the initial delivery route, and the steps of replacing the delivery points with other delivery points in the searching range respectively to generate a plurality of first delivery routes and determining the first delivery route with the lowest delivery cost as the preferred delivery route are re-executed until the optimal termination condition is reached.
The computer program product for performing the delivery route determining method according to the embodiment of the present application includes a computer readable storage medium storing a non-volatile program code executable by a processor, where the program code includes instructions for performing the method described in the foregoing method embodiment, and specific implementation may refer to the method embodiment and will not be described herein.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, and are not repeated herein.
In the several embodiments provided in this application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. The above-described apparatus embodiments are merely illustrative, for example, the division of the units is merely a logical function division, and there may be other manners of division in actual implementation, and for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some communication interface, device or unit indirect coupling or communication connection, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a non-volatile computer readable storage medium executable by a processor. Based on such understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
Finally, it should be noted that: the foregoing examples are merely specific embodiments of the present application, and are not intended to limit the scope of the present application, but the present application is not limited thereto, and those skilled in the art will appreciate that while the foregoing examples are described in detail, the present application is not limited thereto. Any person skilled in the art may modify or easily conceive of the technical solution described in the foregoing embodiments, or make equivalent substitutions for some of the technical features within the technical scope of the disclosure of the present application; such modifications, changes or substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present application, and are intended to be included in the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims (9)

1. A delivery route determining method, which is characterized by being applied to a target delivery scene, wherein the target delivery scene comprises a plurality of delivery points, and each delivery point has a plurality of delivery requirements; the method comprises the following steps:
acquiring the azimuth of the delivery point relative to the supply point; the azimuth characterizes the relative position of the delivery point and the delivery point under the same coordinate system;
generating an initial distribution route according to the azimuth sequence of the distribution points;
optimizing the initial distribution route by adopting an optimal solution algorithm to determine a preferred distribution route;
the generating an initial delivery route according to the azimuth sequence of the delivery points comprises the following steps:
if the current delivery vehicle cannot meet the delivery requirements of all delivery points, the current delivery vehicle is adjusted to obtain an adjusted delivery vehicle;
generating initial delivery routes of all the adjusted delivery vehicles according to the azimuth sequence of the delivery points and the delivery requirements;
the generating an initial delivery route according to the azimuth sequence of the delivery points comprises the following steps:
determining an included angle between the direction of the delivery point and a reference direction according to the position of the delivery point relative to the supply point; wherein the included angle is formed when the reference direction rotates along a preset direction to be coincident with the direction of the distribution point; the direction of the delivery point is the direction from the delivery point to the delivery point;
arranging according to the included angles to obtain the distribution sequence of the distribution points;
and generating an initial distribution route according to the distribution sequence of the distribution points.
2. The delivery route determination method according to claim 1, wherein the generating an initial delivery route according to the azimuth order of the delivery points further comprises:
grouping the distribution points according to the azimuth of the distribution points relative to the supply points to obtain a plurality of groups;
an initial delivery route is generated for the delivery conditions of each delivery point in each group.
3. The delivery route determination method according to claim 1, wherein the generating an initial delivery route according to the azimuth order of the delivery points further comprises:
grouping the distribution points according to the azimuth of the distribution points relative to the supply points to obtain a plurality of groups;
and determining an initial distribution route according to the number of the groups.
4. The delivery route determination method according to claim 3, wherein the generating an initial delivery route according to the azimuth order of the delivery points further comprises:
for each of the groups, determining an initial delivery route based on the number of delivery points in the group.
5. The delivery route determination method of claim 1 wherein said optimizing said initial delivery route using an optimal solution algorithm to determine a preferred delivery route comprises:
determining a search range of the delivery points for each of the delivery points in the initial delivery route;
and respectively replacing the distribution points with other distribution points in the search range to generate a plurality of first distribution routes, and determining the first distribution route with the lowest distribution cost as the preferred distribution route.
6. The delivery route determination method according to claim 2, wherein the delivery condition includes at least one of: the delivery time of the goods to be delivered, the quantity of the goods to be delivered, the temperature layer of the goods to be delivered and the loading capacity of the delivery vehicle.
7. The delivery route determination method of claim 1 wherein said optimizing said initial delivery route using an optimal solution algorithm to determine a preferred delivery route further comprises:
judging whether an optimization termination condition is reached; the optimization termination condition comprises optimization time length and optimization times;
if not, the searching range is redetermined for each delivery point in the initial delivery route, and the steps of replacing the delivery points with other delivery points in the searching range respectively to generate a plurality of first delivery routes and determining the first delivery route with the lowest delivery cost as the preferred delivery route are re-executed until the optimal termination condition is reached.
8. A delivery route determination device, characterized by being applied to a target delivery scene, wherein the target delivery scene comprises a plurality of delivery points, and each delivery point has a plurality of delivery requirements; the device comprises:
the acquisition module is used for acquiring the azimuth of the distribution point relative to the supply point; the azimuth characterizes the relative position of the delivery point and the delivery point under the same coordinate system;
the generating module is used for generating an initial distribution route according to the azimuth sequence of the distribution points;
the optimizing module is used for optimizing the initial distribution route by adopting an optimal solution solving algorithm so as to determine a preferable distribution route;
the generating module, when used for generating the initial delivery route according to the azimuth sequence of the delivery points, comprises the following steps:
if the current delivery vehicle cannot meet the delivery requirements of all delivery points, adjusting the current delivery vehicle to obtain an adjusted delivery vehicle;
generating initial delivery routes of all the adjusted delivery vehicles according to the azimuth sequence of the delivery points and the delivery requirements;
the generating module, when used for generating an initial delivery route according to the azimuth sequence of the delivery points, comprises:
determining an included angle between the direction of the delivery point and a reference direction according to the position of the delivery point relative to the supply point; wherein the included angle is formed when the reference direction rotates along a preset direction to be coincident with the direction of the distribution point; the direction of the delivery point is the direction from the delivery point to the delivery point;
arranging according to the included angles to obtain the distribution sequence of the distribution points;
and generating an initial distribution route according to the distribution sequence of the distribution points.
9. An electronic device, comprising: a processor, a memory and a bus, said memory storing machine readable instructions executable by said processor, said processor and said memory communicating over the bus when the electronic device is running, said machine readable instructions when executed by said processor performing the steps of the delivery route determination method according to any of claims 1 to 7.
CN201911351459.5A 2019-12-24 2019-12-24 Distribution route determining method and device and electronic equipment Active CN111105095B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911351459.5A CN111105095B (en) 2019-12-24 2019-12-24 Distribution route determining method and device and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911351459.5A CN111105095B (en) 2019-12-24 2019-12-24 Distribution route determining method and device and electronic equipment

Publications (2)

Publication Number Publication Date
CN111105095A CN111105095A (en) 2020-05-05
CN111105095B true CN111105095B (en) 2023-06-02

Family

ID=70424556

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911351459.5A Active CN111105095B (en) 2019-12-24 2019-12-24 Distribution route determining method and device and electronic equipment

Country Status (1)

Country Link
CN (1) CN111105095B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113723721B (en) * 2020-05-20 2024-04-09 百度在线网络技术(北京)有限公司 Intelligent scheduling method, device, equipment and storage medium based on logistics transportation

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6904421B2 (en) * 2001-04-26 2005-06-07 Honeywell International Inc. Methods for solving the traveling salesman problem
CN105868843A (en) * 2016-03-22 2016-08-17 南京邮电大学 Route planning method oriented to goods delivery
CN106980912B (en) * 2017-04-07 2021-01-08 广东电网有限责任公司佛山供电局 Multipoint distribution line planning method and system
CN109697523A (en) * 2017-10-23 2019-04-30 顺丰科技有限公司 The method, system and equipment for sending part path are received in optimization
US10990911B2 (en) * 2018-01-18 2021-04-27 Target Brands, Inc. Delivery route management and optimization
CN110555580B (en) * 2018-06-04 2021-11-12 北京三快在线科技有限公司 Order processing method, device, storage medium and server
CN108776880A (en) * 2018-06-04 2018-11-09 浪潮软件股份有限公司 A kind of discrete point angle grouping allocator based on GIS
CN110378639A (en) * 2018-09-06 2019-10-25 北京京东尚科信息技术有限公司 Distribution route method and system for planning
CN109726863A (en) * 2018-12-26 2019-05-07 深圳市北斗智能科技有限公司 A kind of material-flow method and system of multiple-objection optimization
CN110490510A (en) * 2019-07-08 2019-11-22 北京三快在线科技有限公司 A kind of logistics distribution route generation method and device

Also Published As

Publication number Publication date
CN111105095A (en) 2020-05-05

Similar Documents

Publication Publication Date Title
CN111126688B (en) Distribution route determining method, distribution route determining device, electronic equipment and readable storage medium
CN107977739B (en) Method, device and equipment for optimizing logistics distribution path
CN108492068B (en) Method and device for path planning
CN113678476A (en) Dynamically determining routing during transit
CN111062658B (en) Distribution range generation method and device, computer equipment and storage medium
CN110069579A (en) Fence method of partition and device
CN109558986A (en) A kind of sort method and device of same city website dispatching sequence
CN107123012B (en) Method and system for automatically selecting delivery address
CN102306165A (en) Ship electronic chart data multi-platform shared service device and construction method thereof
CN111105095B (en) Distribution route determining method and device and electronic equipment
CN108154245A (en) The method and device of Order splitting
Kim et al. Ant colony optimisation with random selection for block transportation scheduling with heterogeneous transporters in a shipyard
CN116167245B (en) Multi-attribute transfer decision model-based multi-modal grain transportation method and system
CN111044062B (en) Path planning and recommending method and device
CN113128743A (en) Goods picking path planning method and device
US20130304544A1 (en) Fuel price activation and management system
CN115705593A (en) Logistics transportation method and device, computer equipment and storage medium
US20200372462A1 (en) Order display method and apparatus
CN116596429A (en) Material transportation path determining method and material transportation path determining device
CN107180281B (en) Path planning optimization method, device and equipment for electric automobile
CN110378835A (en) A kind of palletizing method and device
CN110750602A (en) Method and device for determining site to which order address belongs
CN110866380A (en) Method and terminal for filling in information field content
CN114418482A (en) Order information processing method and device, electronic equipment and computer readable medium
CN115727861A (en) Vehicle path planning method and device, computer 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
GR01 Patent grant
GR01 Patent grant