CN116862358A - Multi-warehouse path planning method, device, computer equipment, medium and product - Google Patents

Multi-warehouse path planning method, device, computer equipment, medium and product Download PDF

Info

Publication number
CN116862358A
CN116862358A CN202310610210.1A CN202310610210A CN116862358A CN 116862358 A CN116862358 A CN 116862358A CN 202310610210 A CN202310610210 A CN 202310610210A CN 116862358 A CN116862358 A CN 116862358A
Authority
CN
China
Prior art keywords
user
warehouse
users
boundary
distance
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
Application number
CN202310610210.1A
Other languages
Chinese (zh)
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.)
Bank of China Ltd
Original Assignee
Bank of China 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 Bank of China Ltd filed Critical Bank of China Ltd
Priority to CN202310610210.1A priority Critical patent/CN116862358A/en
Publication of CN116862358A publication Critical patent/CN116862358A/en
Pending legal-status Critical Current

Links

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/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
    • 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/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The application relates to a multi-warehouse path planning method, a device, computer equipment, a storage medium and a computer program product, wherein the user information and the warehouse coordinate information are acquired, the degree of urgency of a user is calculated according to the user information and the warehouse coordinate information, the boundary users are determined from all users based on the specified number of boundary users and the degree of urgency of corresponding goods of each user, the users except the boundary users in all users are used as common users, the users are divided into the boundary users and the common users, a second distribution group corresponding to the boundary users is optimized, and a better distribution combination is selected, so that the finally obtained multi-warehouse planning path can meet the logistics distribution demands of multiple warehouses, and the logistics distribution efficiency is improved.

Description

Multi-warehouse path planning method, device, computer equipment, medium and product
Technical Field
The present application relates to the field of multi-warehouse vehicle path planning technology, and in particular, to a multi-warehouse path planning method, apparatus, computer device, storage medium, and computer program product.
Background
In carrying out logistics distribution, the time of delivery is often a factor that must be considered, in the face of time window limited multi-warehouse path planning with time windows, users must be accessed by vehicles within specified time intervals, and vehicles need to spend specific service time on those users.
In the traditional method, aiming at the problem of multi-warehouse path planning with time windows, when a vehicle accesses, if the time windows of customers are violated, the vehicle returns to the corresponding warehouse to reconstruct the path.
However, in the conventional method, the route planning is often required to be repeated, and the logistics distribution efficiency is low due to the excessive workload of logistics distribution.
Disclosure of Invention
In view of the foregoing, it is desirable to provide a multi-warehouse path planning method, apparatus, computer device, computer readable storage medium, and computer program product that can improve logistics distribution efficiency.
In a first aspect, the present application provides a multi-warehouse path planning method, the method comprising:
acquiring user information and warehouse coordinate information, and calculating to obtain the user urgency degree according to the user information and the warehouse coordinate information;
Determining boundary users from all users based on the specified quantity of the boundary users and the emergency degree of corresponding goods of each user, and taking the users except the boundary users as common users;
combining the common users with the warehouses with the closest distances corresponding to the corresponding common users to obtain corresponding first distribution groups, and obtaining corresponding second distribution groups based on the distances between the boundary users and the corresponding boundary users and the warehouses;
and selecting the second delivery group based on the first delivery group and the emergency degree of the corresponding goods of each user so as to obtain a corresponding optimized multi-warehouse planning path.
In one embodiment, the user information includes user location coordinates; the warehouse coordinate information comprises warehouse position coordinates; according to the user information and the warehouse coordinate information, calculating the emergency degree of each user, including:
determining a first distance between a user and a warehouse with the nearest distance corresponding to the user according to the user position coordinates and the warehouse position coordinates;
determining a second distance between the user and the warehouse with the next closest distance corresponding to the user according to the user position coordinates and the warehouse position coordinates;
A distance difference between the first distance and the second distance is determined, and the degree of urgency of each user is determined based on the distance difference.
In one embodiment, the step of determining boundary users from all users based on the urgency level of the respective goods of each user comprises:
sequencing the numerical values of the emergency degree according to the ascending order to obtain a sequencing result;
and selecting a preset number of users from the sequencing result backwards to serve as boundary users.
In one embodiment, the step of obtaining the respective second distribution group based on the distance between the border user and the respective border user and the warehouse comprises:
combining the boundary user with the warehouse with the closest distance between the corresponding boundary user and the warehouse to obtain a first combination;
combining the boundary users with the warehouse with the next closest distance between the corresponding boundary users and the warehouse to obtain a second combination;
based on the first combination and the second combination, a corresponding second delivery group is obtained.
In one embodiment, the step of selecting the second delivery group based on the first delivery group and the urgency of the corresponding goods of each user to obtain the corresponding optimized multi-warehouse planning path includes:
Determining all delivery group nodes of the path route according to the first delivery group and the second delivery group;
based on the node selection scheme and the emergency degree of the corresponding goods of each user, accessing all the distribution group nodes one by one; the next distribution group node to be accessed in the node selection scheme is selected by the corresponding access probability of each remaining non-accessed distribution node;
and acquiring the optimized multi-warehouse planning path according to the access result.
In one embodiment, after obtaining the optimized multi-warehouse planning path according to the access result, the method further includes:
under the condition that the optimized accumulated times corresponding to the optimization do not reach the preset times and the optimized multi-warehouse planning path does not meet the optimization conditions, changing the node selection scheme, returning to the step of accessing all the distribution group nodes one by one based on the node selection scheme and the emergency degree of the corresponding goods of each user, and continuing to execute until the optimized accumulated times reach the preset times;
and under the condition that the multi-warehouse planning path meeting the optimization condition is not obtained, updating the appointed number of the boundary users, returning to determining the boundary users from all the users based on the appointed number of the boundary users and the emergency degree of corresponding goods of each user, and continuing to execute until the multi-warehouse planning path meeting the optimization condition is obtained.
In a second aspect, the present application also provides a multi-warehouse path planning apparatus, including:
the coordinate acquisition module is used for acquiring the user information and the warehouse coordinate information and calculating to obtain the user emergency degree according to the user information and the warehouse coordinate information;
the user determining module is used for determining boundary users from all users based on the specified quantity of the boundary users and the emergency degree of corresponding goods of each user, and taking the users except the boundary users from all users as common users;
the distribution group acquisition module is used for combining the common user with the warehouse with the nearest distance corresponding to the corresponding common user to obtain a corresponding first distribution group, and acquiring a corresponding second distribution group based on the distance between the boundary user and the corresponding boundary user and the warehouse;
and the path acquisition module is used for selecting the second delivery group based on the emergency degree of the corresponding goods of the first delivery group and each user so as to acquire a corresponding optimized multi-warehouse planning path.
In a third aspect, the application also provides a computer device comprising a memory storing a computer program and a processor implementing the method steps of any of the first aspects when the processor executes the computer program.
In a fourth aspect, the present application also provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the method steps of any of the above.
In a fifth aspect, the application also provides a computer program product comprising a computer program which, when executed by a processor, implements the method steps of any of the claims.
According to the multi-warehouse path planning method, the device, the computer equipment, the storage medium and the computer program product, the user information and the warehouse coordinate information are acquired, the degree of urgency of the user is calculated according to the user information and the warehouse coordinate information, the boundary users are determined from all users based on the specified number of boundary users and the degree of urgency of corresponding goods of each user, the users except the boundary users in all users are used as common users, the closest warehouses corresponding to the common users are combined with the common users to obtain corresponding first distribution groups, the corresponding second distribution groups are acquired based on the distances between the boundary users and the corresponding boundary users and the warehouses, the second distribution groups are selected to obtain the corresponding optimized multi-warehouse planning path, the second distribution groups corresponding to the boundary users are optimized by dividing the users into the boundary users and the common users, and the optimal distribution combination is selected to ensure that the finally obtained multi-warehouse planning path can meet the logistics distribution requirements of the multi-warehouse, and the logistics distribution efficiency is improved.
Drawings
FIG. 1 is an application environment diagram of a multi-warehouse path planning method in one embodiment;
FIG. 2 is a flow diagram of a multi-warehouse path planning method in one embodiment;
FIG. 3 is a flow diagram of the steps for obtaining a multi-warehouse planned path in one embodiment;
FIG. 4 is a flow diagram of a multi-warehouse path planning method in one embodiment;
FIG. 5 is a block diagram of a multi-warehouse path planning device in one embodiment;
fig. 6 is an internal structural diagram of a computer device in one embodiment.
Detailed Description
The present application will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present application more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the application.
The multi-warehouse path planning method provided by the embodiment of the application can be applied to an application environment shown in fig. 1. Wherein the terminal 102 communicates with the server 104 via a network. The data storage system may store data that the server 104 needs to process. The data storage system may be integrated on the server 104 or may be located on a cloud or other network server. The terminal 102 is configured to obtain user information and warehouse coordinate information from the server 104, calculate a user urgency degree according to the user information and the warehouse coordinate information, determine boundary users from all users based on the specified number of boundary users and the urgency degree of corresponding goods of each user, use the remaining users except the boundary users in all users as common users, combine the common users with the closest warehouse corresponding to the corresponding common users to obtain a corresponding first distribution group, obtain a corresponding second distribution group based on the distance between the boundary users and the corresponding boundary users and warehouses, and select the second distribution group based on the urgency degree of corresponding goods of the first distribution group and each user to obtain a correspondingly optimized multi-warehouse planning path. The terminal 102 may be, but is not limited to, various personal computers, notebook computers, and the like. The server 104 may be implemented as a stand-alone server or as a server cluster of multiple servers.
In one embodiment, as shown in fig. 2, a multi-warehouse path planning method is provided, and the method is applied to the terminal 102 in fig. 1 for illustration, and includes the following steps:
s202: and acquiring the user information and the warehouse coordinate information, and calculating to obtain the user urgency degree according to the user information and the warehouse coordinate information.
The user information comprises user coordinates, the warehouse coordinate information comprises warehouse position coordinates, the user coordinates carry cargo quantity, time window information and the like, wherein the cargo quantity represents cargoes which the user needs to be distributed, and the time window information represents a cargo delivery time period expected by the user. The terminal calculates the urgency degree of each user according to the user coordinates and the warehouse coordinate information, wherein the urgency degree is used for representing the influence degree of the delivery path of the user on the path planning optimization process, the user with lower urgency degree has little difference after being allocated to the nearest warehouse group and the next nearest warehouse group, the user with higher urgency degree is better in optimizing effect when being allocated to the warehouse group closest to the user, the time spent for planning the path is longer when being allocated to the next nearest warehouse group, and the time window requirement of the user cannot be met, so that the user with lower urgency degree is more suitable for being repeatedly grouped to the nearest and next nearest warehouse to perform further optimization so as to obtain a better planning path.
S204: and determining boundary users from all users based on the specified quantity of the boundary users and the emergency degree of corresponding goods of each user, and taking the users except the boundary users as common users.
The terminal selects a specified number of users from the users as boundary users according to the urgency degree of the users, and the rest users are common users, because the users with lower urgency degree are more suitable for optimization processing. The boundary users represent users at the boundary of the optimization range, the users have little influence on the path planning, the users can be arbitrarily allocated to the nearest warehouse group or the next nearest warehouse group according to the requirement of the path planning, and the influence degree of the common users on the path planning is larger, so that the effect of being allocated to the nearest warehouse group is better.
S206: and combining the common users with the warehouses with the closest distances corresponding to the corresponding common users to obtain corresponding first distribution groups, and obtaining corresponding second distribution groups based on the distances between the boundary users and the corresponding boundary users and the warehouses.
The terminal combines the common user with the warehouse closest to the common user to obtain a corresponding first distribution group, wherein the first distribution group represents logistics distribution for the common user through the warehouse closest to the common user. Aiming at boundary users, the terminal groups boundary users repeatedly based on the distances between the boundary users and corresponding boundary users and warehouses, specifically, the terminal combines the boundary users with warehouses with the nearest distances corresponding to the corresponding boundary users, and the terminal combines the boundary users with warehouses with the next nearest distances corresponding to the corresponding boundary users, so as to obtain corresponding second distribution groups.
S208: and selecting the second delivery group based on the first delivery group and the emergency degree of the corresponding goods of each user so as to obtain a corresponding optimized multi-warehouse planning path.
The terminal selects a second delivery group based on the emergency degree of the corresponding goods of the first delivery group and each user, specifically, the terminal performs path planning on the emergency degree of the corresponding goods of the first delivery group and each user, iterates through an ant colony algorithm, selects a better delivery group for each boundary user, evaluates the planned path obtained through each iteration according to evaluation criteria such as the overall distance of a vehicle access user until the preset iteration times are met, and obtains a multi-warehouse planned path after corresponding optimization.
In the multi-warehouse path planning method, the user urgency degree is obtained through obtaining the user information and the warehouse coordinate information and calculating according to the user information and the warehouse coordinate information, the boundary users are determined from all users based on the specified quantity of the boundary users and the urgency degree of corresponding goods of each user, the rest users except the boundary users in all users are taken as common users, the closest warehouses corresponding to the common users are combined with the common users to obtain corresponding first distribution groups, the corresponding second distribution groups are obtained based on the distances between the boundary users and the corresponding boundary users and the warehouses, the second distribution groups are selected based on the urgency degree of the corresponding goods of the first distribution groups and each user to obtain the corresponding optimized multi-warehouse planning path, the second distribution groups corresponding to the boundary users are divided into the common users, and the better distribution combination is selected to ensure that the finally obtained multi-warehouse planning path can meet the logistics distribution demands of the multi-warehouse, and therefore the logistics distribution efficiency is improved.
In one embodiment, the user information includes user location coordinates; the warehouse coordinate information comprises warehouse position coordinates; according to the user information and the warehouse coordinate information, the emergency degree of each user is calculated, which comprises the following steps: determining a first distance between a user and a warehouse with the nearest distance corresponding to the user according to the user position coordinates and the warehouse position coordinates; determining a second distance between the user and the warehouse with the next closest distance corresponding to the user according to the user position coordinates and the warehouse position coordinates; a distance difference between the first distance and the second distance is determined, and the degree of urgency of each user is determined based on the distance difference.
The terminal determines a first distance between the user and the warehouse with the nearest distance corresponding to the user according to the user position coordinates and the warehouse position coordinates, determines a second distance between the user and the warehouse with the next nearest distance corresponding to the user according to the user position coordinates and the warehouse position coordinates, and determines the urgency degree of each user through a distance difference value between the first distance and the second distance. The larger the difference between the first distance and the second distance, the better the optimizing effect that the user is allocated to the warehouse group closest to the user, the higher the degree of urgency, the smaller the difference between the first distance and the second distance, the smaller the optimizing effect that the user is allocated to the warehouse group closest to the user and the warehouse group next closest to the user, and the lower the degree of urgency.
In this embodiment, according to the user position coordinates and the warehouse position coordinates, a first distance between the user and the warehouse with the closest distance corresponding to the user is determined, and according to the user position coordinates and the warehouse position coordinates, a second distance between the user and the warehouse with the next closest distance corresponding to the user is determined, and based on a distance difference value between the first distance and the second distance, the urgency degree of each user is determined, so that boundary users with lower urgency degree can be accurately divided, and the second distribution group corresponding to the boundary users is optimized, and a better distribution combination is selected, so as to ensure that the finally obtained multi-warehouse planning path can meet the logistics distribution demands of multiple warehouses, thereby improving the logistics distribution efficiency.
In one embodiment, determining boundary users from all users based on the urgency of their respective goods includes: sequencing the numerical values of the emergency degree according to the ascending order to obtain a sequencing result; and selecting a preset number of users from the sequencing result backwards to serve as boundary users.
The terminal sorts the values of the urgency degree according to an increasing sequence, and selects a preset number of users backwards from the sorting result to serve as boundary users, wherein the urgency degree of the users is low, and the users are suitable for being repeatedly grouped into nearest and next-nearest warehouses to be further optimized.
In this embodiment, the numerical values of the urgency degree are sorted according to the ascending order, so as to obtain a sorting result; and selecting a preset number of users backwards from the sorting result to serve as boundary users, accurately dividing boundary users with lower urgency, optimizing a second distribution group corresponding to the boundary users, and selecting a better distribution combination to ensure that the finally obtained multi-warehouse planning path can meet the logistics distribution demands of multiple warehouses, thereby improving logistics distribution efficiency.
In one embodiment, obtaining the respective second distribution group based on the distance between the boundary user and the respective boundary user and the warehouse comprises: combining the boundary user with the warehouse with the closest distance between the corresponding boundary user and the warehouse to obtain a first combination; combining the boundary users with the warehouse with the next closest distance between the corresponding boundary users and the warehouse to obtain a second combination; based on the first combination and the second combination, a corresponding second delivery group is obtained.
The terminal firstly combines the boundary user with the warehouse with the closest distance between the corresponding boundary user and the warehouse to obtain a first combination, then combines the boundary user with the warehouse with the next closest distance between the corresponding boundary user and the warehouse to obtain a second combination, and realizes repeated grouping of the boundary user to obtain a second distribution group.
In this embodiment, the boundary users are combined with the warehouse with the closest distance between the corresponding boundary users and the warehouse to obtain the first combination, and the boundary users are combined with the warehouse with the next closest distance between the corresponding boundary users and the warehouse to obtain the second combination, and the corresponding second distribution groups are obtained based on the first combination and the second combination, so that the boundary users can be repeatedly grouped, the second distribution groups corresponding to the boundary users are further optimized, and the better distribution combination is selected, so that the finally obtained multi-warehouse planning path can meet the logistics distribution demands of multiple warehouses, and the logistics distribution efficiency is improved.
In one embodiment, as shown in fig. 3, the step of selecting the second delivery group based on the emergency degree of the first delivery group and the corresponding goods of each user to obtain the corresponding optimized multi-warehouse planning path includes:
s302: all of the dispatch group nodes of the path route are determined based on the first dispatch group and the second dispatch group.
The terminal selects a first distribution group as a distribution group node for a common user, and selects one combination of a second distribution group as a distribution group node for a boundary user.
S304: based on the node selection scheme and the emergency degree of the corresponding goods of each user, accessing all the distribution group nodes one by one; the next node to be accessed in the node selection scheme is selected by the corresponding access probability of each remaining unaccessed node.
The terminal accesses all the delivery group nodes one by one based on a node selection scheme and the emergency degree of corresponding goods of each user to obtain a planning path, wherein the next delivery group node to be accessed in the node selection scheme is selected by the corresponding access probability of each remaining non-accessed delivery node, specifically, after the terminal selects an initial access node, the terminal calculates the corresponding access probability of the node relative to each remaining non-accessed delivery node, and the next access node is selected according to the access probability, generally, the node with the highest access probability is selected.
S306: and acquiring the optimized multi-warehouse planning path according to the access result.
The terminal generates the optimized multi-warehouse planning path according to the access result, averages the path through an evaluation formula aiming at the multi-warehouse planning path obtained after each optimization, and specifically, the evaluation formula comprises the whole distance of a vehicle access client, the numerical value of a violation user time window, the numerical value of overload and the like, and the smaller the obtained value is, the better the multi-warehouse planning path at the moment is.
In this embodiment, all the delivery group nodes of the path route are determined according to the first delivery group and the second delivery group, all the delivery group nodes are accessed one by one based on the node selection scheme and the emergency degree of the corresponding goods of each user, and the optimized multi-warehouse planning path is obtained according to the access result, so that a better multi-warehouse planning path can be obtained, the finally obtained multi-warehouse planning path can be ensured to meet the logistics distribution demands of multiple warehouses, and the logistics distribution efficiency is improved.
In one embodiment, after obtaining the optimized multi-warehouse planning path according to the access result, the method further comprises: under the condition that the optimized accumulated times corresponding to the optimization do not reach the preset times and the optimized multi-warehouse planning path does not meet the optimization conditions, changing the node selection scheme, returning to the step of accessing all the distribution group nodes one by one based on the node selection scheme and the emergency degree of the corresponding goods of each user, and continuing to execute until the optimized accumulated times reach the preset times; and under the condition that the multi-warehouse planning path meeting the optimization condition is not obtained, updating the appointed number of the boundary users, returning to determining the boundary users from all the users based on the appointed number of the boundary users and the emergency degree of corresponding goods of each user, and continuing to execute until the multi-warehouse planning path meeting the optimization condition is obtained.
When the optimization is finished, the terminal counts the optimization times, under the condition that the optimization times do not reach the preset times and the optimized multi-warehouse planning path does not meet the optimization conditions, the node selection scheme is changed, the steps of accessing all the distribution group nodes one by one are returned based on the node selection scheme and the urgency degree of corresponding goods of each user and continue to be executed until the optimization accumulation times reach the preset times, if the optimization accumulation times reach the preset times, the optimized multi-warehouse planning path still does not meet the optimization conditions, the boundary users are determined from all the users and continue to be executed until the multi-warehouse planning path meeting the optimization conditions is obtained. The optimization condition refers to the value of the solution obtained by the evaluation formula reaching the optimal solution.
In this embodiment, when the number of times of optimization accumulation corresponding to the current optimization does not reach the preset number of times and the multi-warehouse planning path after the current optimization does not meet the optimization condition, the node selection scheme is changed, the steps of accessing all the delivery group nodes one by one based on the node selection scheme and the urgency degree of the corresponding goods of each user are returned, and the steps are continuously executed until the number of times of optimization accumulation reaches the preset number of times, and when the multi-warehouse planning path meeting the optimization condition is not obtained, the designated number of boundary users is updated, the urgency degree of the corresponding goods of each user is returned, the boundary users are determined from all the users and continuously executed until the multi-warehouse planning path meeting the optimization condition is obtained, so that the optimal multi-warehouse planning path can be obtained, the logistics distribution requirement of the multi-warehouse can be met, and the logistics distribution efficiency is improved.
In one embodiment, as shown in fig. 4, a multi-warehouse path planning method is provided, the method comprising the steps of:
s402: determining a first distance between a user and a warehouse with the nearest distance corresponding to the user according to the user position coordinates and the warehouse position coordinates; determining a second distance between the user and the warehouse with the next closest distance corresponding to the user according to the user position coordinates and the warehouse position coordinates; a distance difference between the first distance and the second distance is determined, and the degree of urgency of each user is determined based on the distance difference.
S404: sequencing the numerical values of the emergency degree according to the ascending order to obtain a sequencing result; and selecting a preset number of users from the sequencing result backwards to serve as boundary users.
S406: and combining the common users with the warehouse which is closest to the corresponding common users to obtain the corresponding first distribution group.
S408: combining the boundary user with the warehouse with the closest distance between the corresponding boundary user and the warehouse to obtain a first combination; combining the boundary users with the warehouse with the next closest distance between the corresponding boundary users and the warehouse to obtain a second combination; based on the first combination and the second combination, a corresponding second delivery group is obtained.
S410: determining all delivery group nodes of the path route according to the first delivery group and the second delivery group; based on the node selection scheme and the emergency degree of the corresponding goods of each user, accessing all the distribution group nodes one by one; the next distribution group node to be accessed in the node selection scheme is selected by the corresponding access probability of each remaining non-accessed distribution node; and acquiring the optimized multi-warehouse planning path according to the access result.
S412: under the condition that the optimized accumulated times corresponding to the optimization do not reach the preset times and the optimized multi-warehouse planning path does not meet the optimization conditions, changing the node selection scheme, returning to the step of accessing all the distribution group nodes one by one based on the node selection scheme and the emergency degree of the corresponding goods of each user, and continuing to execute until the optimized accumulated times reach the preset times; and under the condition that the multi-warehouse planning path meeting the optimization condition is not obtained, updating the appointed number of the boundary users, returning to determining the boundary users from all the users based on the appointed number of the boundary users and the emergency degree of corresponding goods of each user, and continuing to execute until the multi-warehouse planning path meeting the optimization condition is obtained.
In this embodiment, the degree of urgency of the user is obtained by obtaining the user information and the warehouse coordinate information, and according to the user information and the warehouse coordinate information, the boundary users are determined from all users based on the specified number of boundary users and the degree of urgency of the corresponding goods of each user, the remaining users except the boundary users in all users are used as common users, the closest warehouses corresponding to the common users are combined with the common users to obtain corresponding first distribution groups, the corresponding second distribution groups are obtained based on the distances between the boundary users and the corresponding boundary users and the warehouses, the second distribution groups are selected based on the degree of urgency of the corresponding goods of the first distribution groups and each user to obtain a corresponding optimized multi-warehouse planning path, the second distribution groups corresponding to the boundary users are divided into the common users, and the better distribution combination is selected to ensure that the finally obtained multi-warehouse planning path can meet the logistics distribution demands of the multi-warehouse, thereby improving the logistics distribution efficiency.
It should be understood that, although the steps in the flowcharts related to the above embodiments are sequentially shown as indicated by arrows, these steps are not necessarily sequentially performed in the order indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least some of the steps in the flowcharts described in the above embodiments may include a plurality of steps or a plurality of stages, which are not necessarily performed at the same time, but may be performed at different times, and the order of the steps or stages is not necessarily performed sequentially, but may be performed alternately or alternately with at least some of the other steps or stages.
Based on the same inventive concept, the embodiment of the application also provides a multi-warehouse path planning device for realizing the multi-warehouse path planning method. The implementation of the solution provided by the apparatus is similar to the implementation described in the above method, so the specific limitation in the embodiments of the multi-warehouse path planning apparatus provided below may be referred to the limitation of the multi-warehouse path planning method hereinabove, and will not be repeated herein.
In one embodiment, as shown in fig. 5, there is provided a multi-warehouse path planning apparatus, comprising: a coordinate acquisition module 10, a user determination module 20, a delivery group acquisition module 30, and a path acquisition module 40, wherein:
the coordinate acquisition module 10 is configured to acquire user information and warehouse coordinate information, and calculate a degree of urgency of the user according to the user information and the warehouse coordinate information.
The user determining module 20 is configured to determine the boundary users from all users based on the specified number of boundary users and the urgency level of the corresponding goods of each user, and take the users remaining by the boundary users out of all users as normal users.
And the delivery group obtaining module 30 is configured to combine the common user with the warehouse closest to the common user to obtain the corresponding first delivery group, and obtain the corresponding second delivery group based on the distance between the boundary user and the corresponding boundary user and the warehouse.
The path obtaining module 40 is configured to select the second delivery group based on the first delivery group and the urgency degree of the corresponding goods of each user, so as to obtain a correspondingly optimized multi-warehouse planning path.
In one embodiment, the user information includes user location coordinates; the warehouse coordinate information comprises warehouse position coordinates; the coordinate acquisition module 10 includes: a first distance determination unit, a second distance determination unit, and an emergency determination unit, wherein:
and the first distance determining unit is used for determining a first distance between the user and the warehouse with the nearest distance corresponding to the user according to the user position coordinates and the warehouse position coordinates.
And the second distance determining unit is used for determining a second distance between the user and the warehouse with the next closest distance corresponding to the user according to the user position coordinates and the warehouse position coordinates.
And the urgency determining unit is used for determining a distance difference value between the first distance and the second distance and determining the urgency degree of each user based on the distance difference value.
In one embodiment, the user determination module 20 includes: an incremental ordering unit and a boundary user selection unit, wherein:
the incremental sequencing unit is used for sequencing the numerical values of the emergency degree according to the incremental sequence to obtain a sequencing result.
And the boundary user selection unit is used for selecting a preset number of users backwards from the sequencing result to serve as boundary users.
In one embodiment, the delivery group acquisition module 30 includes: a first combination acquisition unit, a second combination acquisition unit, and a second delivery group acquisition unit, wherein:
and the first combination acquisition unit is used for combining the boundary user with the warehouse with the closest distance between the corresponding boundary user and the warehouse to obtain a first combination.
And the second combination acquisition unit is used for combining the boundary user with the warehouse with the next closest distance between the corresponding boundary user and the warehouse to obtain a second combination.
And the second delivery group acquisition unit is used for acquiring the corresponding second delivery group based on the first combination and the second combination.
In one embodiment, the path acquisition module 40 includes: the system comprises a distribution group node determining unit, a distribution group node accessing unit and a planned path obtaining unit, wherein:
and the distribution group node determining unit is used for determining all distribution group nodes of the path route according to the first distribution group and the second distribution group.
The distribution group node access unit is used for accessing all distribution group nodes one by one based on the node selection scheme and the emergency degree of the corresponding goods of each user; the next node to be accessed in the node selection scheme is selected by the corresponding access probability of each remaining unaccessed node.
And the planning path acquisition unit is used for acquiring the multi-warehouse planning path after the optimization according to the access result.
In one embodiment, the path obtaining module 40 is further configured to change the node selection scheme, return to the step of accessing all the delivery group nodes one by one based on the node selection scheme and the urgency degree of the corresponding goods of each user, and continue to execute until the optimized cumulative number reaches the preset number, when the optimized cumulative number does not reach the preset number and the optimized multi-warehouse planning path after the optimization does not meet the optimization condition; and under the condition that the multi-warehouse planning path meeting the optimization condition is not obtained, updating the appointed number of the boundary users, returning to determining the boundary users from all the users based on the appointed number of the boundary users and the emergency degree of corresponding goods of each user, and continuing to execute until the multi-warehouse planning path meeting the optimization condition is obtained.
The various modules in the multi-warehouse path planning device described above may be implemented in whole or in part by software, hardware, or a combination thereof. The above modules may be embedded in hardware or may be independent of a processor in the computer device, or may be stored in software in a memory in the computer device, so that the processor may call and execute operations corresponding to the above modules.
In one embodiment, a computer device is provided, which may be a terminal, and the internal structure of which may be as shown in fig. 6. The computer device includes a processor, a memory, an input/output interface, a communication interface, a display unit, and an input means. The processor, the memory and the input/output interface are connected through a system bus, and the communication interface, the display unit and the input device are connected to the system bus through the input/output interface. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The input/output interface of the computer device is used to exchange information between the processor and the external device. The communication interface of the computer device is used for carrying out wired or wireless communication with an external terminal, and the wireless mode can be realized through WIFI, a mobile cellular network, NFC (near field communication) or other technologies. The computer program is executed by a processor to implement a multi-warehouse path planning method. The display unit of the computer device is used for forming a visual picture, and can be a display screen, a projection device or a virtual reality imaging device. The display screen can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, can also be a key, a track ball or a touch pad arranged on the shell of the computer equipment, and can also be an external keyboard, a touch pad or a mouse and the like.
It will be appreciated by those skilled in the art that the structure shown in FIG. 6 is merely a block diagram of some of the structures associated with the present inventive arrangements and is not limiting of the computer device to which the present inventive arrangements may be applied, and that a particular computer device may include more or fewer components than shown, or may combine some of the components, or have a different arrangement of components.
In one embodiment, a computer device is provided comprising a memory and a processor, the memory having stored therein a computer program, the processor when executing the computer program performing the steps of: acquiring user information and warehouse coordinate information, and calculating to obtain the user urgency degree according to the user information and the warehouse coordinate information; determining boundary users from all users based on the specified quantity of the boundary users and the emergency degree of corresponding goods of each user, and taking the users except the boundary users as common users; combining the common users with the warehouses with the closest distances corresponding to the corresponding common users to obtain corresponding first distribution groups, and obtaining corresponding second distribution groups based on the distances between the boundary users and the corresponding boundary users and the warehouses; and selecting the second delivery group based on the first delivery group and the emergency degree of the corresponding goods of each user so as to obtain a corresponding optimized multi-warehouse planning path.
In one embodiment, the user information involved in executing the computer program by the processor includes user location coordinates; the warehouse coordinate information comprises warehouse position coordinates; according to the user information and the warehouse coordinate information, the emergency degree of each user is calculated, which comprises the following steps: determining a first distance between a user and a warehouse with the nearest distance corresponding to the user according to the user position coordinates and the warehouse position coordinates; determining a second distance between the user and the warehouse with the next closest distance corresponding to the user according to the user position coordinates and the warehouse position coordinates; a distance difference between the first distance and the second distance is determined, and the degree of urgency of each user is determined based on the distance difference.
In one embodiment, determining boundary users from all users based on the degree of urgency of the respective goods of each user involved in executing the computer program comprises: sequencing the numerical values of the emergency degree according to the ascending order to obtain a sequencing result; and selecting a preset number of users from the sequencing result backwards to serve as boundary users.
In one embodiment, the processor, when executing the computer program, obtains the respective second distribution group based on the distance between the boundary user and the respective boundary user and the warehouse, comprising: combining the boundary user with the warehouse with the closest distance between the corresponding boundary user and the warehouse to obtain a first combination; combining the boundary users with the warehouse with the next closest distance between the corresponding boundary users and the warehouse to obtain a second combination; based on the first combination and the second combination, a corresponding second delivery group is obtained.
In one embodiment, the processor, when executing the computer program, is configured to select a second delivery group based on the first delivery group and the urgency of the corresponding goods of each user, to obtain a correspondingly optimized multi-warehouse planning path, including: determining all delivery group nodes of the path route according to the first delivery group and the second delivery group; based on the node selection scheme and the emergency degree of the corresponding goods of each user, accessing all the distribution group nodes one by one; the next distribution group node to be accessed in the node selection scheme is selected by the corresponding access probability of each remaining non-accessed distribution node; and acquiring the optimized multi-warehouse planning path according to the access result.
In one embodiment, after obtaining the optimized multi-warehouse planning path according to the access result, the processor executes the computer program, the method further comprises: under the condition that the optimized accumulated times corresponding to the optimization do not reach the preset times and the optimized multi-warehouse planning path does not meet the optimization conditions, changing the node selection scheme, returning to the step of accessing all the distribution group nodes one by one based on the node selection scheme and the emergency degree of the corresponding goods of each user, and continuing to execute until the optimized accumulated times reach the preset times; and under the condition that the multi-warehouse planning path meeting the optimization condition is not obtained, updating the appointed number of the boundary users, returning to determining the boundary users from all the users based on the appointed number of the boundary users and the emergency degree of corresponding goods of each user, and continuing to execute until the multi-warehouse planning path meeting the optimization condition is obtained.
In one embodiment, a computer readable storage medium is provided having a computer program stored thereon, which when executed by a processor, performs the steps of: acquiring user information and warehouse coordinate information, and calculating to obtain the user urgency degree according to the user information and the warehouse coordinate information; determining boundary users from all users based on the specified quantity of the boundary users and the emergency degree of corresponding goods of each user, and taking the users except the boundary users as common users; combining the common users with the warehouses with the closest distances corresponding to the corresponding common users to obtain corresponding first distribution groups, and obtaining corresponding second distribution groups based on the distances between the boundary users and the corresponding boundary users and the warehouses; and selecting the second delivery group based on the first delivery group and the emergency degree of the corresponding goods of each user so as to obtain a corresponding optimized multi-warehouse planning path.
In one embodiment, the user information involved in the execution of the computer program by the processor includes user location coordinates; the warehouse coordinate information comprises warehouse position coordinates; according to the user information and the warehouse coordinate information, the emergency degree of each user is calculated, which comprises the following steps: determining a first distance between a user and a warehouse with the nearest distance corresponding to the user according to the user position coordinates and the warehouse position coordinates; determining a second distance between the user and the warehouse with the next closest distance corresponding to the user according to the user position coordinates and the warehouse position coordinates; a distance difference between the first distance and the second distance is determined, and the degree of urgency of each user is determined based on the distance difference.
In one embodiment, a computer program, when executed by a processor, determines boundary users from all users based on the degree of urgency of the respective goods of each user, comprising: sequencing the numerical values of the emergency degree according to the ascending order to obtain a sequencing result; and selecting a preset number of users from the sequencing result backwards to serve as boundary users.
In one embodiment, the computer program, when executed by the processor, is directed to obtaining a respective second distribution group based on a distance between the boundary user and the respective boundary user and the warehouse, comprising: combining the boundary user with the warehouse with the closest distance between the corresponding boundary user and the warehouse to obtain a first combination; combining the boundary users with the warehouse with the next closest distance between the corresponding boundary users and the warehouse to obtain a second combination; based on the first combination and the second combination, a corresponding second delivery group is obtained.
In one embodiment, the computer program, when executed by the processor, is directed to selecting a second dispatch group based on the first dispatch group and the urgency of the respective goods of each user to obtain a respective optimized multi-warehouse planning path, comprising: determining all delivery group nodes of the path route according to the first delivery group and the second delivery group; based on the node selection scheme and the emergency degree of the corresponding goods of each user, accessing all the distribution group nodes one by one; the next distribution group node to be accessed in the node selection scheme is selected by the corresponding access probability of each remaining non-accessed distribution node; and acquiring the optimized multi-warehouse planning path according to the access result.
In one embodiment, after obtaining the optimized multi-warehouse planned path according to the access result, the computer program when executed by the processor further comprises: under the condition that the optimized accumulated times corresponding to the optimization do not reach the preset times and the optimized multi-warehouse planning path does not meet the optimization conditions, changing the node selection scheme, returning to the step of accessing all the distribution group nodes one by one based on the node selection scheme and the emergency degree of the corresponding goods of each user, and continuing to execute until the optimized accumulated times reach the preset times; and under the condition that the multi-warehouse planning path meeting the optimization condition is not obtained, updating the appointed number of the boundary users, returning to determining the boundary users from all the users based on the appointed number of the boundary users and the emergency degree of corresponding goods of each user, and continuing to execute until the multi-warehouse planning path meeting the optimization condition is obtained.
In one embodiment, a computer program product is provided comprising a computer program which, when executed by a processor, performs the steps of: acquiring user information and warehouse coordinate information, and calculating to obtain the user urgency degree according to the user information and the warehouse coordinate information; determining boundary users from all users based on the specified quantity of the boundary users and the emergency degree of corresponding goods of each user, and taking the users except the boundary users as common users; combining the common users with the warehouses with the closest distances corresponding to the corresponding common users to obtain corresponding first distribution groups, and obtaining corresponding second distribution groups based on the distances between the boundary users and the corresponding boundary users and the warehouses; and selecting the second delivery group based on the first delivery group and the emergency degree of the corresponding goods of each user so as to obtain a corresponding optimized multi-warehouse planning path.
In one embodiment, the user information involved in the execution of the computer program by the processor includes user location coordinates; the warehouse coordinate information comprises warehouse position coordinates; according to the user information and the warehouse coordinate information, the emergency degree of each user is calculated, which comprises the following steps: determining a first distance between a user and a warehouse with the nearest distance corresponding to the user according to the user position coordinates and the warehouse position coordinates; determining a second distance between the user and the warehouse with the next closest distance corresponding to the user according to the user position coordinates and the warehouse position coordinates; a distance difference between the first distance and the second distance is determined, and the degree of urgency of each user is determined based on the distance difference.
In one embodiment, a computer program, when executed by a processor, determines boundary users from all users based on the degree of urgency of the respective goods of each user, comprising: sequencing the numerical values of the emergency degree according to the ascending order to obtain a sequencing result; and selecting a preset number of users from the sequencing result backwards to serve as boundary users.
In one embodiment, the computer program, when executed by the processor, is directed to obtaining a respective second distribution group based on a distance between the boundary user and the respective boundary user and the warehouse, comprising: combining the boundary user with the warehouse with the closest distance between the corresponding boundary user and the warehouse to obtain a first combination; combining the boundary users with the warehouse with the next closest distance between the corresponding boundary users and the warehouse to obtain a second combination; based on the first combination and the second combination, a corresponding second delivery group is obtained.
In one embodiment, the computer program, when executed by the processor, is directed to selecting a second dispatch group based on the first dispatch group and the urgency of the respective goods of each user to obtain a respective optimized multi-warehouse planning path, comprising: determining all delivery group nodes of the path route according to the first delivery group and the second delivery group; based on the node selection scheme and the emergency degree of the corresponding goods of each user, accessing all the distribution group nodes one by one; the next distribution group node to be accessed in the node selection scheme is selected by the corresponding access probability of each remaining non-accessed distribution node; and acquiring the optimized multi-warehouse planning path according to the access result.
In one embodiment, after obtaining the optimized multi-warehouse planned path according to the access result, the computer program when executed by the processor further comprises: under the condition that the optimized accumulated times corresponding to the optimization do not reach the preset times and the optimized multi-warehouse planning path does not meet the optimization conditions, changing the node selection scheme, returning to the step of accessing all the distribution group nodes one by one based on the node selection scheme and the emergency degree of the corresponding goods of each user, and continuing to execute until the optimized accumulated times reach the preset times; and under the condition that the multi-warehouse planning path meeting the optimization condition is not obtained, updating the appointed number of the boundary users, returning to determining the boundary users from all the users based on the appointed number of the boundary users and the emergency degree of corresponding goods of each user, and continuing to execute until the multi-warehouse planning path meeting the optimization condition is obtained.
It should be noted that, the user information (including, but not limited to, user coordinate information, user cargo information, etc.) and the data (including, but not limited to, data for analysis, stored data, presented data, etc.) related to the present application are information and data authorized by the user or sufficiently authorized by each party, and the collection, use and processing of the related data need to comply with the related laws and regulations and standards of the related countries and regions.
Those skilled in the art will appreciate that implementing all or part of the above-described methods in accordance with the embodiments may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed may comprise the steps of the embodiments of the methods described above. Any reference to memory, database, or other medium used in embodiments provided herein may include at least one of non-volatile and volatile memory. The nonvolatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical Memory, high density embedded nonvolatile Memory, resistive random access Memory (ReRAM), magnetic random access Memory (Magnetoresistive Random Access Memory, MRAM), ferroelectric Memory (Ferroelectric Random Access Memory, FRAM), phase change Memory (Phase Change Memory, PCM), graphene Memory, and the like. Volatile memory can include random access memory (Random Access Memory, RAM) or external cache memory, and the like. By way of illustration, and not limitation, RAM can be in the form of a variety of forms, such as static random access memory (Static Random Access Memory, SRAM) or dynamic random access memory (Dynamic Random Access Memory, DRAM), and the like. The databases referred to in the embodiments provided herein may include at least one of a relational database and a non-relational database. The non-relational database may include, but is not limited to, a blockchain-based distributed database, and the like. The processor referred to in the embodiments provided in the present application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic unit, a data processing logic unit based on quantum computing, or the like, but is not limited thereto.
The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.
The foregoing examples illustrate only a few embodiments of the application, which are described in detail and are not to be construed as limiting the scope of the application. It should be noted that it will be apparent to those skilled in the art that several variations and modifications can be made without departing from the spirit of the application, which are all within the scope of the application. Accordingly, the scope of the application should be assessed as that of the appended claims.

Claims (10)

1. A multi-warehouse path planning method, the method comprising:
acquiring user information and warehouse coordinate information, and calculating to obtain the user emergency degree according to the user information and the warehouse coordinate information;
determining boundary users from all users based on the specified quantity of the boundary users and the emergency degree of corresponding goods of each user, and taking the users except the boundary users as common users;
Combining the common users with the warehouses with the nearest distances corresponding to the corresponding common users to obtain corresponding first distribution groups, and obtaining corresponding second distribution groups based on the distances between the boundary users and the corresponding boundary users and the warehouses;
and selecting the second delivery group based on the emergency degree of the first delivery group and the corresponding goods of each user so as to obtain a corresponding optimized multi-warehouse planning path.
2. The method of claim 1, wherein the user information comprises user location coordinates; the warehouse coordinate information comprises warehouse position coordinates; the calculating to obtain the urgency degree of each user according to the user information and the warehouse coordinate information comprises the following steps:
determining a first distance between the user and a warehouse with the nearest distance corresponding to the user according to the user position coordinates and the warehouse position coordinates;
determining a second distance between the user and the warehouse with the next closest distance corresponding to the user according to the user position coordinates and the warehouse position coordinates;
and determining a distance difference between the first distance and the second distance, and determining the urgency degree of each user based on the distance difference.
3. The method of claim 1, wherein determining boundary users from all users based on the urgency level of the respective goods of each user comprises:
sequencing the numerical values of the emergency degree according to an increasing sequence to obtain a sequencing result;
and selecting a preset number of users from the sequencing result backwards to serve as boundary users.
4. The method of claim 1, wherein the obtaining the respective second distribution group based on the distance between the border user and the respective border user and the warehouse comprises:
combining the boundary user with a warehouse with the closest distance between the corresponding boundary user and the warehouse to obtain a first combination;
combining the boundary users with the warehouse with the next closest distance between the corresponding boundary users and the warehouse to obtain a second combination;
based on the first combination and the second combination, a corresponding second delivery group is obtained.
5. The method of claim 1, wherein the selecting the second distribution group to obtain the respective optimized multi-warehouse planned path includes:
Determining all delivery group nodes of a path route according to the first delivery group and the second delivery group;
based on the node selection scheme and the emergency degree of the corresponding goods of each user, accessing all the distribution group nodes one by one; the next distribution group node to be accessed in the node selection scheme is selected by the corresponding access probability of each remaining non-accessed distribution node;
and acquiring the optimized multi-warehouse planning path according to the access result.
6. The method according to claim 5, wherein after obtaining the optimized multi-warehouse planned path according to the access result, further comprises:
under the condition that the optimized accumulated times corresponding to the optimization do not reach the preset times and the optimized multi-warehouse planning path does not meet the optimization conditions, changing the node selection scheme, returning to the step of accessing all the distribution group nodes one by one based on the node selection scheme and the emergency degree of the corresponding goods of each user, and continuing to execute until the optimized accumulated times reach the preset times;
and under the condition that the multi-warehouse planning path meeting the optimization condition is not obtained, updating the specified quantity of the boundary users, returning to determining the boundary users from all the users based on the specified quantity of the boundary users and the emergency degree of corresponding goods of each user, and continuing to execute until the multi-warehouse planning path meeting the optimization condition is obtained.
7. A multi-warehouse path planning apparatus, the apparatus comprising:
the coordinate acquisition module is used for acquiring user information and warehouse coordinate information and calculating to obtain the user emergency degree according to the user information and the warehouse coordinate information;
the user determining module is used for determining boundary users from all users based on the specified quantity of the boundary users and the emergency degree of corresponding goods of each user, and taking the users except the boundary users in all users as common users;
the distribution group acquisition module is used for combining the common user with the warehouse with the nearest distance corresponding to the corresponding common user to obtain a corresponding first distribution group, and acquiring a corresponding second distribution group based on the distance between the boundary user and the corresponding boundary user and the warehouse;
and the path acquisition module is used for selecting the second distribution group based on the emergency degree of the corresponding goods of the first distribution group and each user so as to obtain a corresponding optimized multi-warehouse planning path.
8. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the steps of the method of any of claims 1 to 6 when the computer program is executed.
9. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 6.
10. A computer program product comprising a computer program, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 6.
CN202310610210.1A 2023-05-26 2023-05-26 Multi-warehouse path planning method, device, computer equipment, medium and product Pending CN116862358A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310610210.1A CN116862358A (en) 2023-05-26 2023-05-26 Multi-warehouse path planning method, device, computer equipment, medium and product

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310610210.1A CN116862358A (en) 2023-05-26 2023-05-26 Multi-warehouse path planning method, device, computer equipment, medium and product

Publications (1)

Publication Number Publication Date
CN116862358A true CN116862358A (en) 2023-10-10

Family

ID=88225689

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310610210.1A Pending CN116862358A (en) 2023-05-26 2023-05-26 Multi-warehouse path planning method, device, computer equipment, medium and product

Country Status (1)

Country Link
CN (1) CN116862358A (en)

Similar Documents

Publication Publication Date Title
CN107402955B (en) Method and apparatus for determining index grid of geo-fence
JP2017509043A (en) Graph data query method and apparatus
CN114781966B (en) Logistics distribution path planning method, device, equipment and storage medium
CN112380302A (en) Thermodynamic diagram generation method and device based on track data, electronic equipment and storage medium
CN115687517A (en) Method and device for storing spatio-temporal data, database engine and storage medium
CN116186571B (en) Vehicle clustering method, device, computer equipment and storage medium
CN117172450A (en) Service sequence processing method, device, equipment, medium and product
CN116862358A (en) Multi-warehouse path planning method, device, computer equipment, medium and product
CN116415957A (en) Abnormal transaction object identification method, device, computer equipment and storage medium
CN115759574A (en) Material storage method and device, computer equipment and storage medium
CN117290741B (en) Vehicle clustering method, device, computer equipment and storage medium
CN117113732B (en) Latin hypercube design method suitable for non-hypercube constraint space
CN113537859B (en) Bin net construction method, device, computer equipment and storage medium
CN117787669B (en) Vehicle management method, device, computer equipment and storage medium
CN117609412B (en) Spatial object association method and device based on network structure information
CN116089076B (en) Data processing method, device, computer equipment and storage medium
CN116821530A (en) Vehicle warranty amount calculating method, device, computer equipment and storage medium
CN117876027A (en) Data processing method, device, computer equipment and storage medium
CN116775247A (en) Task allocation method, device, computer equipment and storage medium
CN114676675A (en) Data processing method, data processing device, computer equipment and storage medium
CN118114947A (en) Price difference-based power cross-provincial and cross-regional iterative collaborative scheduling method and device
CN116821518A (en) Service processing method, device, computer equipment and storage medium
CN117312653A (en) Service policy determination method, device, computer equipment and storage medium
CN114077915A (en) Logistics distribution method and device for predicting shift, and computer equipment
CN116562403A (en) Method, device, computer equipment and storage medium for determining network points

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