CN106779568B - Urban distribution route acquisition method and system - Google Patents

Urban distribution route acquisition method and system Download PDF

Info

Publication number
CN106779568B
CN106779568B CN201710042199.8A CN201710042199A CN106779568B CN 106779568 B CN106779568 B CN 106779568B CN 201710042199 A CN201710042199 A CN 201710042199A CN 106779568 B CN106779568 B CN 106779568B
Authority
CN
China
Prior art keywords
store
value
saving
current
saving value
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
CN201710042199.8A
Other languages
Chinese (zh)
Other versions
CN106779568A (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.)
Guangzhou Traffic Technician College Guangzhou Traffic Senior Technician School
Original Assignee
GUANGZHOU COMMUNICATIONS SENIOR TECHNICAL SCHOOL
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 GUANGZHOU COMMUNICATIONS SENIOR TECHNICAL SCHOOL filed Critical GUANGZHOU COMMUNICATIONS SENIOR TECHNICAL SCHOOL
Priority to CN201710042199.8A priority Critical patent/CN106779568B/en
Publication of CN106779568A publication Critical patent/CN106779568A/en
Application granted granted Critical
Publication of CN106779568B publication Critical patent/CN106779568B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/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

Landscapes

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

Abstract

The invention relates to a method and a system for acquiring urban distribution routes, wherein the method comprises the following steps of reading a store saving value list, the residual demand of each store and an available vehicle queue; when the difference value of the first reference saving value and the current saving value in the shop saving value list is smaller than the fluctuation threshold value, and the sum of the remaining demand of shops associated with the current saving value is smaller than the maximum carrying capacity of the vehicles to be dispatched in the available vehicle queue, adding the shops corresponding to the current saving value into the initial distribution route scheme list; and determining a final distribution path scheme according to the initial path scheme in the initial distribution path scheme list. According to the method, a reference saving value is introduced into a traditional saving algorithm, the difference value between the reference saving value and the saving value in a shop list is controlled not to exceed a specified fluctuation threshold value, the optimal optimization path is obtained through repeated calculation, and the obtained result is more accurate.

Description

Urban distribution route acquisition method and system
Technical Field
The invention relates to the technical field of logistics distribution, in particular to a method and a system for acquiring urban distribution routes.
Background
Distribution is a key step in the logistics industry, and the quality of distribution directly affects the efficiency of the whole logistics system and the satisfaction degree of customers. As the logistics industry moves toward globalization, informatization and integration, distribution becomes more and more important throughout the logistics system. However, in logistics distribution, whether the selection of distribution route reasonably and directly affects distribution speed, cost and benefit is a very complicated system project. The optimization of the distribution path is to rapidly and economically transport the goods to the hands of the users by establishing a reasonable distribution path. Currently, most distribution enterprises adopt manual scheduling, so that the efficiency is low and the distribution cost is high; some distribution enterprises have a scheduling (distribution path) system, but the scheduling scheme in the system is also arranged by enterprise personnel through experience without the support of related algorithms. In the society, many studies on distribution routes are still in the theoretical stage, and studies by scholars have achieved a series of results.
The saving algorithm is proposed by Clarke and Wright in 1964, the algorithm is simple in concept, the algorithm mainly calculates the shortest distance between a distribution point and each user and between the users, then calculates the saved mileage value between the users according to the shortest distance, and then the path with the largest saved mileage value is the optimal path. For example, a route optimization recommendation method based on a base class and an economizing algorithm mainly divides retail customers into different areas by using a K-means clustering method, calculates destination economizing values in a large scale by using the economizing algorithm, optimizes the route by considering the route economizing values, and selects the route with the largest route economizing value as the optimal visit route of the customers. However, in a real task, the conventional saving algorithm is prone to generate errors in calculation of the distribution route, for example, when several saving values are very close to each other, a route corresponding to a non-maximum saving value is an optimal distribution route, and sometimes a result is better instead when a smaller saving value is adopted.
Disclosure of Invention
Based on this, it is necessary to provide an urban distribution route acquisition method for solving the problem that the conventional saving algorithm is prone to generate errors in the distribution acquisition route.
A city distribution route obtaining method comprises the following steps:
acquiring a store saving value list, the residual demand of each store and an available vehicle queue;
when the difference value between the first reference saving value and the current saving value in the store saving value list is smaller than the fluctuation threshold value, and the sum of the remaining demand of the stores associated with the current saving value is smaller than the maximum carrying capacity of the vehicles to be dispatched in the available vehicle queue, adding the stores corresponding to the current saving value into the initial distribution route scheme list; the first reference saving value is the largest saving value in all saving values meeting a first condition in the shop saving value list, and the first condition is that the sum of the shop demand amounts associated with the saving values is smaller than the largest bearing capacity of the vehicles to be dispatched in the available vehicle queue;
and determining a final distribution path scheme according to the initial path scheme in the initial distribution path scheme list.
A city delivery route acquisition system, comprising:
the information acquisition module is used for reading the store saving value list, the residual demand of each store and the available vehicle queue;
the initial distribution route scheme generation module is used for adding the stores corresponding to the current saving values into the initial distribution route scheme list when the difference value between the first reference saving value and the current saving value in the store saving value list is smaller than a fluctuation threshold value and the sum of the remaining demand of the stores associated with the current saving values is smaller than the maximum carrying capacity of the vehicles to be dispatched in the available vehicle queue; the first reference saving value is a saving value in a store saving value list, and the sum of store demand quantities associated with the saving values in the store saving value list is smaller than the maximum carrying capacity of the vehicles to be dispatched in the available vehicle queue and is the maximum saving value;
and the final distribution path determining module is used for determining a final distribution path scheme according to the initial path scheme in the initial distribution path scheme list.
The urban distribution route optimization method and the application system provided by the embodiment of the invention utilize the basic idea of the saving algorithm, introduce the concept of the reference saving value into the traditional saving algorithm, obtain the optimal distribution route through repeated calculation by controlling the difference value between the reference saving value and the saving value of each store to be smaller than the specified fluctuation threshold value, have high efficiency and accurate result in the calculation process, and avoid blindly selecting the route corresponding to the maximum saving value as the optimal distribution route.
Drawings
Fig. 1 is a schematic flow chart of a city distribution route acquisition method according to an embodiment of the present invention;
fig. 2 is a schematic flow chart illustrating a process of determining a final distribution route plan according to an initial route plan in an initial distribution route plan list according to an embodiment of the present invention;
FIG. 3 is a schematic flow chart illustrating the process of determining the final distribution route according to the initial route solutions in the initial distribution route solution list according to the embodiment of the present invention;
fig. 4 is a schematic flow chart illustrating a process of determining a final distribution route plan according to a route plan in the final distribution route plan list according to an embodiment of the present invention;
fig. 5 is another schematic flow chart illustrating the process of determining the final distribution route plan according to the route plans in the final distribution route plan list according to the embodiment of the present invention;
fig. 6 is a schematic flow chart of a city distribution route acquisition method according to another embodiment of the present invention;
FIG. 7 is a schematic diagram of a city distribution route acquisition system according to an embodiment of the present invention;
FIG. 8 is a schematic structural diagram of a final determination module in the urban distribution route acquisition system according to the present invention;
fig. 9 is a schematic structural diagram of a city distribution route acquisition system according to another embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to preferred embodiments and the accompanying drawings. It is to be understood that the following examples are illustrative only and are not intended to limit the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention. It should be noted that, for the convenience of description, only some but not all of the matters related to the present invention are shown in the drawings.
Fig. 1 is a schematic flow chart of an embodiment of the urban distribution route acquisition method of the present invention, and as shown in fig. 1, the urban distribution route acquisition method in the present embodiment includes the following steps:
step S110, a store saving value list, the remaining demand of each store and an available vehicle queue are obtained.
In this embodiment, the store saving value list stores a series of saving values of each store. The method comprises the steps of calculating the saving value of each store according to the position of each store and the position of a distribution center, firstly calculating the shortest distance between each store and the distribution center to obtain a distance matrix, then calculating the saving mileage between each store according to the distance matrix, namely the saving value, and storing the saving value into a saving value list of each store.
To describe the saving value calculation process in detail, it is assumed that P is a distribution center, a and B are two stores, respectively, where a is a distance between the distribution center P and the store a (i.e., PA ═ a), B is a distance between the distribution center P and the store B (i.e., PB ═ B), and c is a distance between the store a and the store B (i.e., AB ═ c). If two vehicles are used for respectively delivering goods from P to A and B, the driving mileage of the vehicle is 2a + 2B; if only one vehicle is dispatched from P to A, B, the total mileage of the vehicle is a + b + c, and the saving value is (2a +2b) - (a + b + c) ═ a + b-c.
The initial demand of the stores is the quantity of the goods required by each store, and the residual demand of the stores is the quantity of the goods distributed by the initial demand of the stores after certain operation, and the residual quantity is the residual demand of the stores. The available vehicle queue includes the maximum capacity of available vehicles, the number of vehicles. In addition, the available vehicle queue can also comprise the serial number, driver information and the like of each vehicle, so that the goods are conveniently dispatched. The fluctuation threshold is user settable, typically expressed as a percentage (e.g., 3%), and may be different in different path acquisition schemes.
Step S120, when the difference value between the first reference saving value and the current saving value in the shop saving value list is smaller than a fluctuation threshold value, and the sum of the remaining demand of the shops associated with the current saving value is smaller than the maximum carrying capacity of the vehicles to be dispatched in the available vehicle queue, adding the shop corresponding to the current saving value into the initial distribution route scheme list; the first reference saving value is the largest saving value in all the saving values meeting the first condition in the shop saving value list, and the first condition is that the sum of the shop demand quantities associated with the saving values is smaller than the maximum carrying capacity of the vehicles to be dispatched in the available vehicle queue.
In this implementation, a first reference savings value is first determined. And calculating the sum of the store demands associated with the saving values in the store saving value list, and when the sum of the store demands associated with the saving values is smaller than the maximum bearing capacity of the vehicles to be dispatched in the available vehicle queue and the saving value is the maximum value in the store saving value list, making the saving value be the first reference saving value. For example, the shop saving value list stores saving values S1, S2, S3, S4 and the like, wherein the sum of the shop demand amounts associated with S1> S2> S3> S4, and S1, S2, S3 and S4 is less than the maximum load amount of the vehicle to be dispatched in the available vehicle queue, and then S1 is set as the first reference saving value. Next, calculating a difference value between the next saving value in the store saving value list and the first reference saving value, and when the difference value is smaller than a fluctuation threshold (for example, 1) and the sum of the demand quantities of the stores associated with the saving values is smaller than the maximum carrying capacity of the vehicles to be dispatched in the available vehicle queue, adding the stores corresponding to the saving values into the initial distribution route scheme list; through repeated calculation, a series of initial path schemes are stored in the initial distribution path scheme list.
Step S130, determining a final distribution route scheme according to the initial route scheme in the initial distribution route scheme list.
In the process of determining the final delivery path placement according to the initial path solutions in the initial delivery path solution list, the final delivery path solution may be determined according to the prior art. Adding the 3 rd store, the 4 th store and the like to the initial path scheme in the initial distribution path scheme list to form a new path scheme, and so on, the final distribution path scheme can be determined.
The urban distribution route optimization method provided by the embodiment of the invention utilizes the basic idea of the saving algorithm, improves the traditional saving algorithm, introduces the concept of the reference saving value into the traditional algorithm, can effectively reduce the errors of the traditional algorithm in calculating the route by controlling the difference value between the reference saving value and the saving value of each store to be smaller than the fluctuation threshold value, obtains the optimal optimized route through repeated calculation, and avoids blindly selecting the route corresponding to the maximum saving value as the optimal distribution route.
As a preferred implementation manner, as shown in fig. 2, in the urban distribution route obtaining method in this embodiment, a fluctuation-saving algorithm may also be adopted to determine a final distribution route scheme according to an initial route scheme in an initial distribution route scheme list, and specifically includes the following steps:
step S210, when the store associated with the current initial path scheme in the initial distribution path scheme list is the same as any one of the stores associated with the current saving value in the store saving value list, and the difference between the current saving value and the second reference saving value is smaller than the fluctuation threshold value, calculating the sum of the store demand associated with the current initial path scheme and the store residual demand associated with the current saving value; the second reference saving value is the maximum saving value in all the saving values meeting the second condition in the shop saving value list, the second condition is that the sum of the remaining demand of the shops associated with the saving values is less than the maximum bearing capacity of the vehicles to be dispatched in the available vehicle queue, and the shops associated with the saving values are the same as any one of the shops associated with the current initial path scheme;
step S220, when the sum of the total demand of the stores associated with the current initial path scheme and the residual demand of the stores associated with the current saving value is less than the maximum load capacity of the vehicle to be dispatched in the available vehicle queue, adding the stores corresponding to the current saving value to the current initial path scheme and updating the initial path scheme until the absolute value of the difference between the sum of the demand of the stores associated with the current initial path scheme and the maximum load capacity of the vehicle to be dispatched in the available vehicle queue is less than the residual demand of any one of the stores;
step S230, adding all updated initial routing solutions in the initial routing solution list to the final routing solution list;
for ease of understanding, a detailed embodiment is given. The initial distribution path scheme list TL stores N initial path schemes L1, L2, and … … Ln, respectively, and the current initial path scheme is Li (i is greater than or equal to 1 and less than or equal to N), which contains a store A, B (which may be denoted as Li ═ AB), with savings values S1, S2, … … Sn in the store savings value list S, wherein the sum of the demands of the shops associated with S1 and S2 … … Sn is less than the maximum carrying capacity of the vehicle to be dispatched, and S1> S2 … … > Sn, if the store associated with S1, S2 … … Sn is the same as either store a or B associated with the current initial path plan Li (Li ═ AB), and when the sum of the total demand of the initial path schemes A and B associated by Li and the store demand associated by S1 is less than the maximum load capacity of the car to be dispatched, setting S1 as a second reference saving value, and adding the store associated with S1 to Li to form a new path scheme Li 1. And when the difference values of S1 and S2, and S1 and S3.. S1 and Sn are smaller than the fluctuation threshold value, and the sum of the demand quantity of the initial path schemes A and B associated with Li and the demand quantity of stores associated with S2 … … and Sn is smaller than the maximum carrying quantity of the traffic to be dispatched, adding the stores associated with S2.. and Sn into Li to form a new path scheme Li2.. An Lin. And taking the new path schemes Li1, Li2.. and Lin, and updating the path schemes again according to the method until the absolute value of the difference between the sum of the demand quantities of the stores associated with Li1, Li2.. and Lin and the maximum load capacity of the vehicle to be dispatched is less than the residual demand quantity of any store, and adding the current initial path scheme into the final distribution path scheme list.
For ease of understanding, a more detailed embodiment is given. Let the current initial path scenario BE TLi (1 ≦ i ≦ n), and let TLi BE denoted as Li, which contains store A, B (which may BE denoted as Li ═ AB), store savings values S1, S2, S3, (S1> S2> S3) where the store associated with S1 is AC, the store associated with S2 is BE, and the store associated with S3 is CD. The maximum carrying capacity of the vehicle to be dispatched is N, the fluctuation threshold value is 2, and the residual demand of A, B, C, D, E stores is N1, N2, N3, N4 and N5 respectively. When the sum of the demand amounts of the shops AB, AC, BE and CD is less than N, because the shop AC associated with S1 is the same as a in the current initial route scheme Li (Li ═ AB), and the sum of the remaining demand amounts of the three shops A, B, C is less than the maximum load amount to BE dispatched, i.e., N1+ N2+ N3< N, and the S1 is set as the second reference saving value, the shop A, C associated with S1 is added to Li to form the ABC route scheme.
Since the store BE associated with S2 is the same as B in the current initial path scheme Li (Li ═ AB), the BE may BE added to the Li path, constituting the ABC path scheme. Since the S3 associated store CD is not the same as either store, i.e., A, B, in the current initial path plan Li (Li ═ AB), then the S3 associated store will not be able to add to the Li path. When the difference value of the S2 and the second reference saving value S1 is smaller than the fluctuation threshold value 2(S1-S2<2), and the sum of the demanded quantities of the three door surfaces A, B, E is smaller than the maximum carrying capacity of the car to be dispatched, namely N1+ N2+ N5< N, the ABE path scheme can be formed, and otherwise, the ABE path scheme cannot be formed. The fluctuation threshold 2 in the present embodiment may be the same as or different from the fluctuation threshold 1 in calculating the initial distribution route, that is, 2 ≠ 1 or 2 ≠ 1.
Adding 4 th and 5 th equal stores (such as a composition path ABCD, an ABDE, an ABCDE, an ABCEF and the like) to the path schemes ABC and ABE in sequence according to the method until the path scheme reaches a maximum value (such as the ABCEF), wherein no store can be added to the initial path scheme, namely the absolute value of the difference of the total demand of all stores in the current path scheme to the maximum load capacity of the vehicle to be dispatched is smaller than the residual demand of any store in the rest stores, and adding the path scheme to the final distribution path scheme list.
In step S240, a final distribution route plan is determined according to the route plans in the final distribution route plan list.
In the urban distribution route acquisition method, when the final distribution route is determined according to the initial distribution route scheme, a fluctuation saving algorithm is adopted, so that the method is more accurate than the traditional calculation method, and the obtained result is more optimized.
Optionally, referring to fig. 3, in the urban distribution route obtaining method in this embodiment, the step of determining the final distribution route scheme according to the initial route scheme in the initial distribution route scheme list further includes the following steps:
step S2201, when step S210 is executed, when the sum of the total demand of the stores associated with the current initial path plan and the store remaining demand associated with the current savings value is greater than the maximum load capacity to be allocated in the available vehicle queue, and the absolute value of the difference between the sum of the total demand of the stores associated with the current initial path plan and the maximum load capacity to be allocated in the available vehicle queue is greater than the division threshold, dividing the store remaining demand associated with the current savings value, adding the store corresponding to the current savings value to the current initial path plan, and updating the initial path plan.
To facilitate understanding, a detailed embodiment is provided, and under the condition that step S210 is satisfied,
the initial delivery route plan list TL stores N initial route plans, which are L1, L2, and … … TLn, respectively, the current initial route plan is Li (i is not less than 1 and not more than N), Li is denoted as Li, and includes a store A, B, C, D (which may be represented as Li — ABCD), the store saving value list S includes saving values S1, S2, and … … Sn, the current saving value is set as Si (i is not less than 1 and not more than N), the demanded quantities of the A, B, C, D stores are N1, N2, N3, and N4, the stores associated with the current saving value are DE, and the demanded quantities are N4 and N5, respectively. The maximum carrying capacity of the vehicles to be dispatched is N, the segmentation threshold value is theta, the sum of the demands of the stores A, B, C, D corresponding to the current path scheme Li and the demand of the store D, E associated with the current saving value Si is greater than the maximum carrying capacity N of the vehicles to be dispatched, and when the absolute value of the difference between the sum of the demands of the stores A, B, C, D corresponding to the current path scheme Li and the maximum carrying capacity N of the vehicles to be dispatched is smaller than the segmentation threshold value theta, namely N1+ N2+ N3+ N4+ N5> N and | N1+ N2+ N3+ N4-N < theta, the demands of the stores D, E corresponding to the current saving value Si are segmented and form a new path scheme ABCDE.
For example, the current initial route plan is that the total demand for ABCD is 350, the maximum load capacity of the vehicle is 400, the demands for the remaining stores E, F are 60 and 100, respectively, the division threshold θ is 10, and the sum of the demands for ABCDE and ABCDF is greater than the maximum load capacity of 400. When the absolute value of the difference between the sum of the ABCD demand amounts and the maximum vehicle carrying capacity is greater than the split threshold (for example, |350-400| ═ 50>10), E, F store demand amounts are split and E, F is added to the ABCD path, constituting an ABCDE, ABCDF path scheme. The division threshold θ in this embodiment may be set, and is not a constant value.
In this embodiment, when the final distribution route scheme is determined according to the initial distribution route, a partitioning method is adopted, so that the vehicles can be effectively guaranteed to be distributed with the maximum carrying capacity, and resources can be effectively saved.
In another embodiment, referring to fig. 4, the method for obtaining an urban distribution route in this embodiment further includes:
and step S250, acquiring initial demand of each store, adding the current store to a final distribution route scheme when the initial demand of the current store is larger than the maximum vehicle capacity of the vehicles to be dispatched in the available vehicle queue, and calculating the residual demand of the current store according to the initial demand of the current store and the maximum load capacity of the vehicles to be dispatched in the available vehicle queue.
Preferably, before the initial distribution route is calculated, whether a route scheme needing separate distribution exists is judged, when the initial demand of a certain store is larger than the maximum capacity of the vehicles to be distributed in the available vehicle queue, the store is added into the final distribution route scheme, and the residual demand of the current store is calculated according to the demand of the current store and the maximum capacity of the vehicles to be distributed in the available vehicle queue. For example, there are a number of stores a, b.. K, the demand of the stores a, b.. K is N1, N2 … Nk, the maximum load of the vehicle is N, the K store demand Nk is greater than N, N is added to the priority delivery route plan, and the remaining demand of the store K is calculated as Nk-N.
Preferably, the urban distribution route obtaining method in this embodiment determines the final distribution route scheme according to the route scheme in the final distribution route scheme list, as shown in fig. 5, further includes the following steps,
step S2401, calculating the total route of each distribution route scheme in the final distribution route scheme list, and finding out the optimal route scheme.
The final distribution path scheme calculated by using the fluctuation saving algorithm comprises a plurality of distribution modes, namely a plurality of distribution path schemes, each distribution path scheme is subjected to secondary calculation to obtain the actual total route of each distribution path scheme, and the distribution path scheme with the minimum actual total route is the final distribution path scheme.
In the urban distribution route acquisition method in this embodiment, a series of calculated distribution route schemes are subjected to secondary calculation optimization, an optimized route scheme is found, and the optimized route scheme is determined as a final distribution route scheme.
In another embodiment, referring to fig. 6, a method for acquiring a city distribution route includes the following steps:
step 1: a store savings value list S, store initial demand, available vehicle queues, and a volatility threshold are read.
Step 2: a store savings value list S is initialized (with savings values arranged from large to small) and a list F is defined for storing the final overall delivery path plan.
And step 3: and when detecting whether the demand of each store is larger than the maximum vehicle load of the vehicles to be dispatched in the available vehicle queue, if so, adding the store into the list Q, and calculating the residual demand of the store. If not, the list Q is empty.
And 4, step 4: initializing index value Qindex0. Extracting the residue at Q from QindexAnd the dispatching scheme of the position is recorded as Qi. The available vehicle queue has various types of vehicles to be dispatched, and the available vehicle queue corresponds to various dispatching schemes.
And 5: and calculating the residual quantity of the demands of the stores and the available vehicle queues, and calculating an initial distribution path scheme by combining the saving values in the saving value list S and storing the scheme into the TL list.
The method comprises the following specific steps:
step 5.1: from the list Qi information, a remaining store demand list RP is calculated, as well as an available vehicle queue list RC.
Step 5.2: determining a first reference saving value according to the saving value list S; searching the next saving value in the saving value list S as Snext, and when two shops related to the Snext are both in the RP;
step 5.3: calculating whether the difference value of the Snext and the first reference saving value is smaller than a fluctuation threshold value;
step 5.4: if so, judging whether the sum of the residual demand of the two shops related to the Snext is less than the maximum bearing value of the vehicles to be dispatched in the available vehicle queue list RC; if yes, the step 5.5 is operated.
Step 5.5: two stores corresponding to the Snext are added to the initial delivery path plan list TL.
Step 5.6: and increasing the Snext by 1, and continuously repeating the step 5.2 to the step 5.5.
Step 5.7: return to original delivery Path solution List TL
Step 6: initializing TLindexExtracting TL from TL list at 0indexInitial distribution route of positionRecord as Li.
And 7: calculating a store list which can be added into Li according to store information, the demand of the remaining stores and the available vehicle queue included in Li and by combining an S saving value in the store saving value list, wherein the store list is the AP;
the specific method comprises the following steps:
step 7.1: from the list Li information, a remaining store demand list RP, and an available vehicle queue list RC are calculated.
Step 7.2: determining a second reference saving value according to the saving value list S; finding the next saving value level in the saving value list S is Snext, when two stores associated with Snext have one in RP and the other store PxCan be merged into the distribution path corresponding to Li;
step 7.3: calculating whether the difference value of the Snext and the second reference saving value is smaller than a fluctuation threshold value;
step 7.4: if yes, judging whether the sum of store demand quantity related to Snext and store demand quantity related to Li is smaller than the maximum bearing value of the vehicles to be dispatched in the available vehicle queue list RC or not; if yes, go to step 7.5. If not, continuing to return to the step 7.2 for searching;
step 7.5: store PxAddition may be added to the Li middle storefront scheme AP list.
Step 7.6: and increasing the Snext by 1, and continuously repeating the operation from the step 7.2 to the step 7.5.
Step 7.7: returning to the AP list;
and 8: judging whether the AP is empty or not; if not, operating the step 10; if not, the step 9 is operated.
And step 9: initializing index value APindex0, extracting the location AP from the APindexThe store of the location, i.e. APi, adds APi to Li.
Step 10: it is determined whether or not the division of the store remaining demand is allowed. If yes, operating step 11; if not, step 12 is executed.
Step 11: calculating whether the absolute value of the difference value between the sum of the demand of stores related to Li and the maximum carrying capacity of the vehicles to be dispatched in the available vehicle queue is greater than a segmentation threshold value or not; if yes, operating step 12; if not, the step 13 is operated.
Step 12: according to the saving value in the saving value list S, stores which can be associated with Li are searched, and a part of the demand is divided and added to Li.
Step 13: and arranging proper vehicle models according to the Li demand, forming a primary dispatch path, and adding the Li path into Qi.
Step 14: judging whether Qi contains all store information; if yes, operating step 16; if not, the step 15 is operated.
Step 15: and continuously calculating the distribution path scheme of the rest stores according to the Qi value.
Step 16: qi is added to the most central delivery path scenario list F.
And step 17: it is determined whether any APs remain available for addition to the Li stores. If yes, go to step 18; if not, go to step 19.
Step 18: AP (Access Point)indexIncreasing by 1 and circularly operating the step 7.
Step 19: judging whether other initial distribution path schemes exist in the initial distribution path list TL and need to be further calculated; if yes, operating step 20; if not, go to step 21.
Step 20: TLindexIncrement by 1 and loop through step 4.
Step 21: there are other schemes for determining the list Q that require further computation. If yes, go to step 22; if not, go to step 23.
Step 22: qindexAnd increasing by 1 and circularly operating the step 6.
Step 23: and storing all the schemes into a final distribution path scheme list F.
Step 24: and performing secondary calculation optimization on each final distribution path scheme in the F, calculating the total route of each final distribution path scheme, and recording the distribution path scheme with the minimum route as Fbest。
Step 25: output Fbest. Wherein FbestThe final delivery route scenario.
Wherein steps 5 and 7 are a process of repeated cycles.
According to the method for optimizing the urban distribution route, the invention also provides a system for acquiring the urban distribution route, and the system for optimizing the urban distribution route is described in detail below with reference to the accompanying drawings and the preferred embodiments.
Fig. 7 is a schematic structural diagram of a system of the city distribution route optimization method according to an embodiment of the present invention. As shown in fig. 7, the urban distribution route acquisition system in this embodiment includes:
the information acquisition module 10 is used for reading the store saving value list, the residual demand of each store and the available vehicle queue;
an initial routing scheme generating module 20, configured to add an store corresponding to the current saving value to the initial distribution routing scheme list when a difference between the first reference saving value and the current saving value in the store saving value list is smaller than a fluctuation threshold, and a sum of remaining demand amounts of stores associated with the current saving value is smaller than a maximum carrying capacity of a vehicle to be dispatched in the available vehicle queue; the first reference saving value is a saving value in a store saving value list, and the sum of store demand quantities related to the saving values in the store saving value list is smaller than the maximum bearing capacity of the vehicles to be dispatched in the available vehicle queue and is the maximum saving value;
and a final distribution path determining module 30, configured to determine a final distribution path scheme according to the initial path scheme in the initial distribution path scheme list.
Fig. 8 is a schematic structural diagram of a system of the city distribution route optimization method in another embodiment of the invention. As shown in fig. 8, the final distribution path determining module includes:
a store demand amount calculation module 301, configured to calculate a sum of a store demand associated with the current initial path plan and a store remaining demand amount associated with the current saving value when a store associated with the current initial path plan in the initial distribution path plan list is the same as any one of stores associated with the current saving value in the store saving value list, and a difference between a second reference saving value and the current saving value is smaller than a fluctuation threshold; the second reference saving value is a saving value in the shop saving value list, the sum of the remaining demand amounts of the shops associated with the saving value in the shop saving value list is less than the maximum bearing capacity of the vehicle to be dispatched in the available vehicle queue and any one of the shops associated with the saving value in the shop saving value list and associated with the current initial path scheme is the same and is the maximum saving value;
an initial path plan updating module 302, configured to, when a sum of a total demand of stores associated with a current initial path plan and a remaining demand of stores associated with a current savings value is less than a maximum load capacity of vehicles to be dispatched in an available vehicle queue, add stores corresponding to the current savings value to the current initial path plan and update the initial path plan until an absolute value of a difference between the sum of the demand of stores associated with the current initial path plan and the maximum load capacity of vehicles to be dispatched in the available vehicle queue is less than the remaining demand of any one of the remaining stores, add the current initial path plan to a final distribution path plan list; updating all initial path schemes in the initial distribution path scheme list, and adding the updated initial path schemes to the final distribution path scheme list;
and a final path scheme calculating module 303, configured to determine a final distribution path scheme according to the path scheme in the final distribution path scheme list.
Still referring to fig. 8, in another embodiment of the urban distribution route acquiring system, the initial route scheme updating module further includes:
the store demand splitting module 3021 is configured to, when the sum of the total store demand associated with the current initial path scheme and the store remaining demand associated with the current savings value is greater than the maximum load capacity of the vehicle to be dispatched in the available vehicle queue, and an absolute value of a difference between the sum of the total store demand associated with the current initial path scheme and the maximum load capacity of the vehicle to be dispatched in the available vehicle queue is greater than a splitting threshold, split the store remaining demand associated with the current savings value, add the store corresponding to the current savings value to the current initial path scheme, and update the initial path scheme.
Still referring to fig. 9, the city distribution route acquisition system in another embodiment further includes:
a store demand obtaining module 40 for obtaining initial demands of stores,
and the individual distribution path generating module 50 is configured to add the current store to the final distribution path scheme when the initial demand of the current store is greater than the maximum vehicle capacity of the vehicles to be dispatched in the available vehicle queue, and calculate the remaining demand of the current store according to the initial demand of the current store and the maximum load capacity of the vehicles to be dispatched in the available vehicle queue.
Still referring to fig. 8, in another embodiment, the city distribution route obtaining system, the final route solution calculating module, further includes
The path optimization module 3031 is configured to calculate a total distance of each distribution path scheme in the final distribution path scheme list, and find a final distribution path scheme.
The urban distribution route optimization system can execute the urban distribution route optimization method provided by the embodiment of the invention, and has corresponding functional modules and beneficial effects of the execution method. As for the processing methods executed by the functional modules, for example, the processing methods of the information obtaining module 10 and the path optimizing module 3031, reference may be made to the description in the foregoing method embodiments, and details are not repeated here.
Still referring to fig. 9, the city distribution route acquisition system in another embodiment further includes:
the saving value calculating module 60 is configured to obtain a path distance between stores on the electronic map, calculate a saving value of each store according to the path distance between the stores, and store the saving value of each store in the store saving value list;
and a display module 70 for displaying the final distribution path scheme.
The electronic map can be a Baidu map, a Gade map, a Google map and the like.
In the urban distribution route acquisition system in the embodiment, the electronic map is added in the system, the distances among all stores are directly acquired on the electronic map, the obtained mileage value is closer to reality, and the calculated saving value and the like are more accurate.
The technical features of the embodiments described above may be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the embodiments described above are not described, but should be considered as being within the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present invention, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the inventive concept, which falls within the scope of the present invention. Therefore, the protection scope of the present patent shall be subject to the appended claims.

Claims (10)

1. A city distribution route obtaining method is characterized by comprising the following steps: acquiring a store saving value list, the residual demand of each store and an available vehicle queue;
determining a first reference savings value: calculating the sum of store demands associated with the saving values in the store saving value list, and when the sum of the store demands associated with the saving values is smaller than the maximum bearing capacity of the vehicles to be dispatched in the available vehicle queue and the saving value is the maximum value in the store saving value list, making the saving value be a first reference saving value; when the difference value between the first reference saving value and the current saving value in the store saving value list is smaller than the fluctuation threshold value, and the sum of the remaining demand of the stores associated with the current saving value is smaller than the maximum carrying capacity of the vehicles to be dispatched in the available vehicle queue, adding the stores corresponding to the current saving value into the initial distribution route scheme list; the first reference saving value is the largest saving value in all saving values meeting a first condition in the shop saving value list, and the first condition is that the sum of the shop demand amounts associated with the saving values is smaller than the largest bearing capacity of the vehicles to be dispatched in the available vehicle queue;
when the store associated with the current initial path scheme in the initial distribution path scheme list is the same as any one of the stores associated with the current saving value in the store saving value list, and the difference value between the current saving value and the second reference saving value is smaller than the fluctuation threshold value, calculating the sum of the store demand associated with the current initial path scheme and the store residual demand associated with the current saving value; the second reference saving value is the maximum saving value in all the saving values meeting a second condition in the shop saving value list, and the second condition is that the sum of the remaining demand of the shops associated with the saving values is less than the maximum bearing capacity of the vehicles to be dispatched in the available vehicle queue and the shops associated with the saving values are the same as any one of the shops associated with the current initial path scheme;
when the sum of the total demand of the stores associated with the current initial path scheme and the residual demand of the stores associated with the current saving value is less than the maximum load capacity of the vehicle to be dispatched in the available vehicle queue, adding the stores corresponding to the current saving value to the current initial path scheme and updating the initial path scheme until the absolute value of the difference between the sum of the demand of the stores associated with the current initial path scheme and the maximum load capacity of the vehicle to be dispatched in the available vehicle queue is less than the residual demand of any one of the remaining stores;
adding all updated initial path schemes in the initial distribution path scheme list to a final distribution path scheme list;
determining a final distribution path scheme according to the path scheme in the final distribution path scheme list;
before the store saving value list is obtained, the method further comprises the following steps: and acquiring the path distance between the stores from an electronic map, calculating the saving value of each store according to the path distance, and storing the saving value of each store into the store saving value list.
2. The urban distribution route acquisition method according to claim 1, further comprising: when the sum of the total demand of the stores associated with the current initial path scheme and the residual demand of the stores associated with the current saving value is greater than the maximum carrying capacity of the vehicles to be dispatched in the available vehicle queue, and the absolute value of the difference between the sum of the total demand of the stores associated with the current initial path scheme and the maximum carrying capacity of the vehicles to be dispatched in the available vehicle queue is greater than a segmentation threshold, segmenting the residual demand of the stores associated with the current saving value, adding the stores corresponding to the current saving value to the current initial path scheme, and updating the initial path scheme.
3. The urban distribution route acquisition method according to any one of claims 1 to 2, further comprising: and obtaining the initial demand of each store, adding the current store into the final distribution route scheme when the initial demand of the current store is larger than the maximum vehicle capacity of the vehicles to be dispatched in the available vehicle queue, and calculating the residual demand of the current store according to the initial demand of the current store and the maximum load capacity of the vehicles to be dispatched in the available vehicle queue.
4. The urban distribution route acquisition method according to claim 1 or 2, wherein determining the final distribution route plan according to the route plan in the final distribution route plan list comprises the steps of: and calculating the total distance of each distribution path scheme in the final distribution path scheme list, and finding out the final distribution path scheme.
5. A city delivery route acquisition system, comprising: the system comprises a saving value calculation module, a saving value list storage module and a saving value display module, wherein the saving value calculation module is used for acquiring the path distance between stores on an electronic map, calculating the saving value of each store according to the path distance between the stores and storing the saving value of each store into the saving value list of the stores;
the information acquisition module is used for reading the store saving value list, the residual demand of each store and the available vehicle queue;
an initial path scenario generation module to determine a first reference savings value: calculating the sum of store demands associated with the saving values in the store saving value list, and when the sum of the store demands associated with the saving values is smaller than the maximum bearing capacity of the vehicles to be dispatched in the available vehicle queue and the saving value is the maximum value in the store saving value list, making the saving value be a first reference saving value; when the difference value between the first reference saving value and the current saving value in the store saving value list is smaller than the fluctuation threshold value, and the sum of the remaining demand of the stores associated with the current saving value is smaller than the maximum carrying capacity of the vehicles to be dispatched in the available vehicle queue, adding the stores corresponding to the current saving value into the initial distribution route scheme list; the first reference saving value is a saving value in a store saving value list, and the sum of store demand quantities associated with the saving values in the store saving value list is smaller than the maximum carrying capacity of the vehicles to be dispatched in the available vehicle queue and is the maximum saving value;
a final distribution path determining module, configured to determine a final distribution path scheme according to the initial path scheme in the initial distribution path scheme list;
the final delivery path determining module includes: the store demand calculation module is used for calculating the sum of the store demand associated with the current initial path scheme and the store residual demand associated with the current saving value when the store associated with the current initial path scheme in the initial distribution path scheme list is the same as any one of the stores associated with the current saving value in the store saving value list, and the difference value between the second reference saving value and the current saving value is smaller than the fluctuation threshold value; the second reference saving value is a saving value in a store saving value list, and the sum of the remaining demand amounts of stores associated with the saving values in the store saving value list is smaller than the maximum carrying capacity of the vehicles to be dispatched in the available vehicle queue and any one of the stores associated with the saving values in the store saving value list, which is the same as any one of the stores associated with the current initial path scheme, and is the maximum saving value;
an initial path scheme updating module, configured to, when a sum of a total demand of stores associated with the current initial path scheme and a remaining demand of stores associated with the current savings value is less than a maximum load capacity of vehicles to be dispatched in an available vehicle queue, add the stores corresponding to the current savings value to the current initial path scheme and update the initial path scheme until an absolute value of a difference between the sum of the demand of stores associated with the current initial path scheme and the maximum load capacity of vehicles to be dispatched in the available vehicle queue is less than a remaining demand of any one of the remaining stores, and add the current initial path scheme to a final distribution path scheme list; updating all initial path schemes in the initial distribution path scheme list, and adding the updated initial path schemes to the final distribution path scheme list;
a final path scheme calculation module, configured to determine a final distribution path scheme according to a path scheme in the final distribution path scheme list;
and the display module is used for displaying the final distribution path scheme.
6. The city distribution route acquisition system of claim 5, wherein the initial route plan update module further comprises: and the store demand dividing module is used for dividing the store residual demand associated with the current saving value when the sum of the store total demand associated with the current initial path scheme and the store residual demand associated with the current saving value is greater than the maximum load capacity of the vehicles to be dispatched in the available vehicle queue, and the absolute value of the difference between the sum of the store total demand associated with the current initial path scheme and the maximum load capacity of the vehicles to be dispatched in the available vehicle queue is greater than a dividing threshold, adding the stores corresponding to the current saving value to the current initial path scheme, and updating the initial path scheme.
7. The urban distribution route acquisition system according to claim 5, further comprising: the system comprises a store demand acquisition module used for acquiring initial demand of each store, and an independent distribution path generation module used for adding the current store into a final distribution path scheme when the initial demand of the current store is larger than the maximum vehicle capacity of the vehicles to be dispatched in the available vehicle queue, and calculating the residual demand of the current store according to the initial demand of the current store and the maximum vehicle capacity of the vehicles to be dispatched in the available vehicle queue.
8. The urban distribution route acquisition system according to claim 5, wherein the final route solution calculation module further comprises a route optimization module configured to calculate a total route of each distribution route solution in the final distribution route solution list, and find the final distribution route solution.
9. A storage medium on which a computer program is stored, wherein the program, when executed by a processor, is adapted to implement the city distribution route acquisition method according to any one of claims 1 to 4.
10. A computer device comprising a storage medium, a processor and a computer program stored on the storage medium and executable on the processor, the processor implementing the city distribution path acquisition method according to any one of claims 1 to 4 when executing the program.
CN201710042199.8A 2017-01-20 2017-01-20 Urban distribution route acquisition method and system Active CN106779568B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710042199.8A CN106779568B (en) 2017-01-20 2017-01-20 Urban distribution route acquisition method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710042199.8A CN106779568B (en) 2017-01-20 2017-01-20 Urban distribution route acquisition method and system

Publications (2)

Publication Number Publication Date
CN106779568A CN106779568A (en) 2017-05-31
CN106779568B true CN106779568B (en) 2020-11-13

Family

ID=58945163

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710042199.8A Active CN106779568B (en) 2017-01-20 2017-01-20 Urban distribution route acquisition method and system

Country Status (1)

Country Link
CN (1) CN106779568B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107506964A (en) * 2017-08-23 2017-12-22 北京惠赢天下网络技术有限公司 A kind of Distribution logistics network share method, system and terminal based on standard container

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102542395A (en) * 2010-12-31 2012-07-04 北京师范大学 Emergency material dispatching system and calculating method
CN103745021A (en) * 2013-11-05 2014-04-23 陕西科技大学 Comprehensive planning method for paths of vehicles for picking up goods
CN105528649A (en) * 2015-11-30 2016-04-27 山东烟草研究院有限公司 Route optimization recommendation method based on clustering and saving algorithms
CN106355291A (en) * 2016-09-23 2017-01-25 湖南科技大学 Method for planning logistics paths on basis of bisectors of store point groups

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170091710A1 (en) * 2015-09-28 2017-03-30 Jesse Van Dyke Unattended Delivery Drop Box

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102542395A (en) * 2010-12-31 2012-07-04 北京师范大学 Emergency material dispatching system and calculating method
CN103745021A (en) * 2013-11-05 2014-04-23 陕西科技大学 Comprehensive planning method for paths of vehicles for picking up goods
CN105528649A (en) * 2015-11-30 2016-04-27 山东烟草研究院有限公司 Route optimization recommendation method based on clustering and saving algorithms
CN106355291A (en) * 2016-09-23 2017-01-25 湖南科技大学 Method for planning logistics paths on basis of bisectors of store point groups

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
C-W节约算法的改进研究;曾玉霞;《中国职协2015年度优秀科研成果获奖论文集（中册）》;20151201;第1-8页 *

Also Published As

Publication number Publication date
CN106779568A (en) 2017-05-31

Similar Documents

Publication Publication Date Title
US9679246B2 (en) Solving vehicle routing problems using evolutionary computing techniques
CN111366160B (en) Path planning method, path planning device and terminal equipment
Drummond et al. An asynchronous parallel metaheuristic for the period vehicle routing problem
AU2019279920A1 (en) Method and system for estimating time of arrival
US20170336219A1 (en) System and method for accelerating route search
US20150170094A1 (en) System and Method of Vessel Scheduling for Product Distribution
US10060753B2 (en) On-demand shortcut computation for routing
US20200349509A1 (en) Determining an optimal route for logistics delivery
US10223649B2 (en) System and method of multi-objective optimization for transportation arrangement
Jiang et al. A scheme for determining vehicle routes based on Arc-based service network design
CN113204712A (en) Information pushing method, device, medium and program product based on community service
JP2016537693A (en) Hierarchical hidden variable model estimation device, hierarchical hidden variable model estimation method, payout amount prediction device, payout amount prediction method, and recording medium
CN111861178A (en) Service matching model training method, service matching method, device and medium
CN106779568B (en) Urban distribution route acquisition method and system
US20240176657A1 (en) Task processing method and apparatus, electronic device, storage medium and program product
US20190147071A1 (en) Methods and systems for algorithmically comparing geographical areas using artificial intelligence techniques
CN111476389A (en) Method and device for pre-estimating order receiving waiting time
CN112767032A (en) Information processing method and device, electronic equipment and storage medium
US20210241227A1 (en) Automatically planning delivery routes using clustering
CN107391728B (en) Data mining method and data mining device
CN111833119A (en) Order allocation method and device, electronic equipment and storage medium
WO2020106211A1 (en) Communications server apparatus, method and communications system for managing request for transport-related services
Rojas et al. A conceptual framework to develop mobile recommender systems of points of interest
CN114862065A (en) Social work task planning method and device, electronic equipment and storage medium
CN114169488A (en) Hybrid meta-heuristic algorithm-based vehicle path acquisition method with capacity constraint

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
CP03 Change of name, title or address

Address after: No. 56 Taihe Dayuan South Road, Baiyun District, Guangzhou City, Guangdong Province, 510080

Patentee after: Guangzhou traffic Technician College (Guangzhou traffic senior technician school)

Country or region after: China

Address before: No. 56, Dayuan South Road, Baiyun District, Guangzhou, Guangdong 510540

Patentee before: GUANGZHOU COMMUNICATIONS SENIOR TECHNICAL SCHOOL

Country or region before: China