CN115619063B - Community common distribution method, system, electronic equipment and storage medium - Google Patents

Community common distribution method, system, electronic equipment and storage medium Download PDF

Info

Publication number
CN115619063B
CN115619063B CN202211532485.XA CN202211532485A CN115619063B CN 115619063 B CN115619063 B CN 115619063B CN 202211532485 A CN202211532485 A CN 202211532485A CN 115619063 B CN115619063 B CN 115619063B
Authority
CN
China
Prior art keywords
distribution
delivery
time
information
center
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
CN202211532485.XA
Other languages
Chinese (zh)
Other versions
CN115619063A (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.)
Huaqiao University
Original Assignee
Huaqiao University
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 Huaqiao University filed Critical Huaqiao University
Priority to CN202211532485.XA priority Critical patent/CN115619063B/en
Publication of CN115619063A publication Critical patent/CN115619063A/en
Application granted granted Critical
Publication of CN115619063B publication Critical patent/CN115619063B/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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G06Q10/0835—Relationships between shipper or supplier and carriers
    • G06Q10/08355—Routing methods
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
    • Y02T10/00—Road transport of goods or passengers
    • Y02T10/10—Internal combustion engine [ICE] based vehicles
    • Y02T10/40—Engine management systems

Landscapes

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

Abstract

The invention relates to a community joint distribution method, a community joint distribution system, electronic equipment and a storage medium, and belongs to the field of logistics distribution management. The method comprises the following steps: acquiring distribution data; the distribution data comprises distribution center basic information, distribution point basic information and distribution information; establishing a community common distribution topological structure according to the distribution center basic information, the distribution point basic information and the distribution information; determining a plurality of distribution total paths of each distribution center according to the community common distribution topological structure; screening the distribution information to obtain screened distribution information; generating a timeliness report according to the screened distribution information; determining the sum of the delivery time and the sum of the delivery routes of all delivery vehicles in each delivery total path according to the timeliness report; and determining an optimal distribution path according to the distribution time sum and the distribution path sum, and carrying out community distribution. The invention improves the community distribution efficiency.

Description

Community common distribution method, system, electronic equipment and storage medium
Technical Field
The present invention relates to the field of logistics distribution management, and in particular, to a community co-distribution method, system, electronic device, and storage medium.
Background
The common distribution is to integrate the functions of processing the same kind or different kinds of commodities by a plurality of circulation units so as to promote the common utilization of facilities such as warehouses, vehicles and the like; and small amount of goods are converted into commodity shipment, so that large-batch distribution is formed, and low-cost and high-level logistics service is realized. Therefore, the common distribution is to realize low-cost distribution service by the whole logistics network system including users, owners and distribution resources. In community co-distribution activities, the arrangement of distribution lines not only affects the distance of distribution routes, but also affects urban traffic conditions and resident living environments, and the optimization of distribution routes has important significance. In China's community logistics distribution, the time requirement is not particularly strict except for special materials.
A certain distribution center carries out logistics distribution service on clients in a certain region range, the rated load capacity of each loading vehicle is not exceeded in each distribution, and the total running distance of the vehicles has a certain upper limit.
In order to complete the transportation task, the regional distribution center needs to send out a plurality of vehicles, and all distribution paths consist of one loop or a plurality of loops; each delivery vehicle starts from the delivery center, follows a route covering several customers, and finally returns to the delivery center. However, the current community distribution does not schedule the total distance of the distribution path and the distribution time, thereby resulting in the problem of low distribution efficiency.
Disclosure of Invention
The invention aims to provide a community joint distribution method, a system, electronic equipment and a storage medium, which are used for solving the problem of low distribution efficiency of the current community distribution service.
In order to achieve the above object, the present invention provides the following solutions:
a community co-distribution method, comprising:
acquiring distribution data; the distribution data comprises distribution center basic information, distribution point basic information and distribution information; the distribution information comprises distribution time and distribution paths of the distribution vehicles from the distribution center to each distribution point, and distribution time and distribution paths of the distribution vehicles from the distribution points to each client;
establishing a community common distribution topological structure according to the distribution center basic information, the distribution point basic information and the distribution information;
determining a plurality of distribution total paths of each distribution center according to the community common distribution topological structure;
screening effective information in the distribution information to obtain screened distribution information; the effective information is delivery information that the delivery time of the delivery vehicle from the delivery center to the client is less than the delivery time required by the client; the delivery time of the delivery vehicle from the delivery center to the client is the sum of the delivery time of the delivery vehicle from the delivery center to the delivery point and the delivery time of the delivery vehicle from the delivery point to the client;
generating a timeliness report according to the screened distribution information;
determining the sum of the delivery time and the sum of the delivery routes of all delivery vehicles in each delivery total path according to the timeliness report;
and determining an optimal distribution path according to the distribution time sum and the distribution path sum, and carrying out community distribution.
Optionally, the distribution center basic information includes the number of distribution centers, the location of the distribution centers, the number of distribution vehicles of the distribution centers, the authorized load of the distribution vehicles, and the storage of the distribution centers.
Optionally, the dispensing point basic information includes the number of dispensing points, the positions of the dispensing points and the storage amount of the dispensing points in the dispensing center area.
Optionally, the determining, according to the timeliness report, a total distribution time sum and a total distribution distance sum of all the distribution vehicles in each distribution total path specifically includes:
using the formula
Figure 904316DEST_PATH_IMAGE001
Determining the sum of the delivery time of all delivery vehicles in each delivery total path; wherein,Nfor the number of delivery vehicles;l i is the firstiThe number of delivery points for which the vehicle is responsible for delivery;
Figure 375748DEST_PATH_IMAGE002
represent the firstiVehicle in delivery pathj-1 dispensing point to +.>
Figure 319040DEST_PATH_IMAGE003
Distribution duration of individual customers->
Figure 217726DEST_PATH_IMAGE004
Represent the firstiVehicle in delivery pathl i The distribution time from each distribution point to the distribution center; />
Figure 397035DEST_PATH_IMAGE005
Represent the firstiWhether the vehicle is involved in the delivery, if yes>
Figure 655847DEST_PATH_IMAGE006
；
Using the formula
Figure 971421DEST_PATH_IMAGE007
Determining the sum of the delivery routes of all delivery vehicles in each delivery total route; wherein (1)>
Figure 775429DEST_PATH_IMAGE008
Represent the firstiVehicle in delivery pathj-1 dispensing point to +.>
Figure 989504DEST_PATH_IMAGE003
Distance of individual clients->
Figure 740422DEST_PATH_IMAGE009
Represent the firstiVehicle in delivery routel i Distance from the delivery point to the delivery center.
Optionally, determining an optimal distribution path according to the distribution time sum and the distribution path sum, and performing community distribution, which specifically includes:
and taking the distribution total path with the minimum distribution time sum and the minimum distribution path sum as an optimal distribution path to carry out community distribution.
Optionally, the method further comprises:
judging whether the sum of the delivery time of the optimal delivery path of the current delivery center exceeds the set delivery time;
if the sum of the delivery time of the optimal delivery path of the current delivery center exceeds the set delivery time, adding a delivery vehicle;
calculating the total distribution time length of all distribution centers according to the total distribution time of the optimal distribution path of each distribution center;
judging whether the total distribution time length exceeds the set total distribution time length;
if the total distribution time length exceeds the set total distribution time length, adding a distribution center;
and updating the timeliness report and the community common distribution topology structure according to the added distribution vehicles and the added distribution centers.
A community co-distribution system comprising:
the information acquisition module is used for acquiring distribution data; the distribution data comprises distribution center basic information, distribution point basic information and distribution information; the distribution information comprises distribution time and distribution paths of the distribution vehicles from the distribution center to each distribution point, and distribution time and distribution paths of the distribution vehicles from the distribution points to each client;
the topological structure building module is used for building a community common distribution topological structure according to the distribution center basic information, the distribution point basic information and the distribution information;
the distribution path determining module is used for determining a plurality of distribution total paths of each distribution center according to the community joint distribution topological structure;
the data screening module is used for screening out the effective information in the distribution information to obtain screened distribution information; the effective information is delivery information that the delivery time of the delivery vehicle from the delivery center to the client is less than the delivery time required by the client; the delivery time of the delivery vehicle from the delivery center to the client is the sum of the delivery time of the delivery vehicle from the delivery center to the delivery point and the delivery time of the delivery vehicle from the delivery point to the client;
the report generation module is used for generating a timeliness report according to the screened distribution information;
the calculation module is used for determining the sum of the delivery time and the sum of the delivery routes of all delivery vehicles in each delivery total path according to the timeliness report;
and the optimal path determining module is used for determining an optimal distribution path according to the distribution time sum and the distribution path sum and carrying out community distribution.
An electronic device, comprising: the system comprises a memory and a processor, wherein the memory is used for storing a computer program, and the processor runs the computer program to enable the electronic equipment to execute the community co-distribution method.
A computer readable storage medium storing a computer program which when executed by a processor implements the community co-distribution method described above.
According to the specific embodiment provided by the invention, the invention discloses the following technical effects:
the method comprises the steps of obtaining basic information of a distribution center and basic information of distribution points, and establishing a community common distribution topological structure according to the obtained information; determining a plurality of distribution total paths of each distribution center according to the community common distribution topological structure; screening the acquired information to obtain screened distribution data; and generating a timeliness report according to the screened delivery data, and calculating the total delivery time sum and the total delivery path sum of all delivery vehicles in each delivery total path, thereby determining an optimal delivery path and carrying out community delivery. According to the community distribution method and the community distribution system, the distribution total path with the smallest sum of distribution time and the smallest sum of distribution paths is selected from the plurality of distribution total paths to serve as the optimal distribution path for community distribution, so that distribution efficiency is improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions of the prior art, the drawings that are needed in the embodiments will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of a community co-distribution method provided by the invention;
FIG. 2 is a block diagram of the community co-distribution system provided by the invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The invention aims to provide a community joint distribution method, a system, electronic equipment and a storage medium, so as to improve distribution efficiency of community distribution.
In order that the above-recited objects, features and advantages of the present invention will become more readily apparent, a more particular description of the invention will be rendered by reference to the appended drawings and appended detailed description.
Example 1
FIG. 1 is a flow chart of a community co-distribution method provided by the invention, as shown in FIG. 1, the community co-distribution method comprises the following steps:
step 101: acquiring distribution data; the distribution data includes distribution center basic information, distribution point basic information, and distribution information. The basic information of the distribution centers comprises the number of the distribution centers, the position information of the distribution centers, the number of the distribution vehicles of the distribution centers, the verification and load carrying amount of the distribution vehicles and the storage information of the distribution centers. The distribution point basic information comprises distribution point quantity, distribution point position information and distribution point warehouse storage information in a distribution center area; the delivery information includes a delivery duration and a delivery path of the delivery vehicle from the delivery center to each delivery point and a delivery time and a delivery path of the delivery vehicle from the delivery point to each customer.
In practical application, the distribution data can be provided by a distribution center and distribution points, and information statistics uploading can be performed by using information exchange tools such as WeChat applet and the like; executing data summarization screening by a computer through a software program; the timeliness of each node of the community distribution is conveniently and intuitively judged by collecting data for centralized analysis and outputting a timeliness report, so that the problem of timeliness influencing factors is found.
Step 102: and establishing a community common distribution topological structure according to the distribution center basic information, the distribution point basic information and the distribution information. The topology structure refers to a method for researching the dot and line relation irrelevant to the size and shape in the topology, abstracts a computer and communication equipment in a network into a dot, abstracts a transmission medium into a line, and the geometrical figure consisting of the dot and the line is the topology structure of the computer network. The invention establishes a topological structure and aims at enabling all components (distribution centers, distribution points and clients) of community distribution to be correspondingly arranged on points, lines and surfaces of topological structure design so as to help better realize the function of community common distribution modules.
Step 103: and determining a plurality of distribution total paths of each distribution center according to the community common distribution topological structure.
Step 104: screening effective information in the distribution information to obtain screened distribution information; the effective information is delivery information that the delivery time of the delivery vehicle from the delivery center to the client is less than the delivery time required by the client; the delivery time of the delivery vehicle from the delivery center to the client is the sum of the delivery time of the delivery vehicle from the delivery center to the delivery point and the delivery time of the delivery vehicle from the delivery point to the client;
in practical application, the distribution information in the acquired data is subjected to data screening processing to clean invalid data. The invalid data includes delivery information when the delivery demand is greatly increased, such as a request for a delivery order, and the delivery time and delivery route of the delivery vehicle from the delivery center to each delivery point and the delivery time and delivery route of the delivery vehicle from the delivery point to each customer are invalid data, which are caused by the request for discarding the delivery order due to a certain reason.
Step 105: and generating a timeliness report according to the screened distribution information.
In practical application, the delivery data is summarized to obtain delivery quantity information and delivery time-efficiency information of the delivery center, wherein the delivery time-efficiency information comprises the delivery information remained after screening. And correlating the delivery volume information of the delivery center with the delivery timeliness information to obtain a timeliness report.
Step 106: and determining the sum of the delivery time and the sum of the delivery routes of all the delivery vehicles in each delivery total path according to the timeliness report.
Further, the step 106 specifically includes:
using the formula
Figure 972821DEST_PATH_IMAGE001
Determining the sum of the delivery time of all delivery vehicles in each delivery path; wherein,Nfor the number of delivery vehicles;l i is the firstiThe number of delivery points for which the vehicle is responsible for delivery; />
Figure 665839DEST_PATH_IMAGE002
Represent the firstiVehicle in delivery pathj-1 dispensing point to +.>
Figure 350898DEST_PATH_IMAGE003
Distribution duration of individual customers->
Figure 653310DEST_PATH_IMAGE004
Represent the firstiVehicle in delivery pathl i The distribution time from each distribution point to the distribution center; />
Figure 740215DEST_PATH_IMAGE005
Represent the firstiWhether the vehicle is involved in the delivery, if yes>
Figure 354867DEST_PATH_IMAGE006
。
Using the formula
Figure 776490DEST_PATH_IMAGE007
Determining the sum of the delivery routes of all delivery vehicles in each delivery route; wherein (1)>
Figure 869211DEST_PATH_IMAGE008
Represent the firstiVehicle in delivery pathj-1 dispensing point to +.>
Figure 76201DEST_PATH_IMAGE003
Distance of individual clients->
Figure 612487DEST_PATH_IMAGE009
Represent the firstiVehicle in delivery routel i Distance from the delivery point to the delivery center.
Step 107: and determining an optimal distribution path according to the distribution time sum and the distribution path sum, and carrying out community distribution.
Further, the step 107 specifically includes:
and taking the distribution path with the minimum distribution time sum and the minimum distribution path sum as an optimal distribution path to carry out community distribution.
In practical application, the formula is utilized
Figure 272139DEST_PATH_IMAGE010
And
Figure 417818DEST_PATH_IMAGE011
and determining the minimum distribution time sum and the minimum distribution route sum.
The constraint condition is that
Figure 948157DEST_PATH_IMAGE012
wherein ,
Figure 966928DEST_PATH_IMAGE013
for the number of delivery points in the delivery area, < > for>
Figure 799362DEST_PATH_IMAGE014
；/>
Figure 561781DEST_PATH_IMAGE015
In order to dispense the number of vehicles,
Figure 415468DEST_PATH_IMAGE016
；/>
Figure 588829DEST_PATH_IMAGE017
the corresponding number of the delivery vehicle is given; j is the j-th delivery point, j=0, 1,2, m; the 0 th delivery point represents a delivery center; />
Figure 160756DEST_PATH_IMAGE018
Total number of delivery vehicles for use; />
Figure 461287DEST_PATH_IMAGE019
Rating a vehicle core; />
Figure 185792DEST_PATH_IMAGE020
An upper limit value of the vehicle travel distance; />
Figure 280787DEST_PATH_IMAGE021
Is->
Figure 589277DEST_PATH_IMAGE017
The total number of delivery points for which the vehicle is responsible for delivery; />
Figure 427920DEST_PATH_IMAGE022
Is->
Figure 52936DEST_PATH_IMAGE017
Corresponding +.>
Figure 293335DEST_PATH_IMAGE023
Demand for individual delivery points; />
Figure 636592DEST_PATH_IMAGE024
Is->
Figure 482188DEST_PATH_IMAGE017
A delivery path corresponding to the vehicle; />
Figure 476558DEST_PATH_IMAGE025
Is->
Figure 116618DEST_PATH_IMAGE017
The>
Figure 947171DEST_PATH_IMAGE023
And a distribution point.
As an alternative embodiment, the community co-distribution method of the present invention further includes:
judging whether the sum of the delivery time of the optimal delivery path of the current delivery center exceeds the set delivery time; if yes, the distribution vehicle is increased.
And calculating the total distribution duration of all the distribution centers according to the sum of the distribution time of the optimal distribution path of each distribution center.
Judging whether the total distribution time length exceeds the set total distribution time length; if yes, adding a distribution center.
In practical application, whether the current delivery distance and delivery time of the delivery center exceed the delivery requirements or not is judged, and if the current delivery distance and delivery time exceed the delivery specified time (set delivery time), the delivery vehicles are required to be supplemented by the path. The distribution requirement is determined according to actual commodities, such as cold chain commodities are required to be distributed in advance, and the commodity distribution time is within 1 hour or every other day after an hour.
Judging whether the total distribution time length of each distribution center exceeds the set total distribution time length, if so, determining that the distribution center is to be supplemented in the area.
And updating the timeliness report and the community common distribution topology structure according to the added distribution vehicles and the added distribution centers.
In addition, the new acquired distribution data is summarized, processed and analyzed to obtain aging information from the newly added distribution center to the distribution point, and the aging information is supplemented to the topological structure.
And carrying out piece-by-piece analysis and comparison on the distribution time-efficiency information, and giving a time-efficiency optimization report to a distribution point and a distribution center with abnormal distribution time-efficiency information. The comparison object refers to the requirement of selecting the same community, different distribution centers, different time periods (month, quarter and year), or the requirement of different communities, the same distribution centers and different time periods.
In summary, the invention collects the actual distance and time from each distribution center to the distribution point, and performs summary screening analysis on the data, thereby being beneficial to realizing data visualization, providing an optimization scheme, optimizing distribution timeliness and improving community distribution efficiency.
Example two
In order to perform a corresponding method of the above embodiment to achieve the corresponding functions and technical effects, a community co-distribution system is provided below, as shown in fig. 2, and the system includes:
an information acquisition module 201 for acquiring distribution data; the distribution data comprises distribution center basic information, distribution point basic information and distribution information; the delivery information includes a delivery duration and a delivery path of the delivery vehicle from the delivery center to each delivery point and a delivery time and a delivery path of the delivery vehicle from the delivery point to each customer.
The topology structure establishment module 202 is configured to establish a community joint distribution topology structure according to the distribution center basic information, the distribution point basic information and the distribution information.
The distribution path determining module 203 is configured to determine a plurality of distribution total paths of each distribution center according to the community common distribution topology structure.
The data screening module 204 is configured to screen effective information in the distribution information, and obtain screened distribution information; the effective information is delivery information that the delivery time of the delivery vehicle from the delivery center to the client is less than the delivery time required by the client; the delivery time of the delivery vehicle from the delivery center to the client is the sum of the delivery time of the delivery vehicle from the delivery center to the delivery point and the delivery time of the delivery vehicle from the delivery point to the client.
And the report generating module 205 is configured to generate a timeliness report according to the screened delivery information.
And the calculating module 206 is configured to determine a total distribution time sum and a total distribution distance sum of all the distribution vehicles in each total distribution path according to the timeliness report.
And the optimal path determining module 207 is configured to determine an optimal distribution path according to the distribution time sum and the distribution path sum, and perform community distribution.
Example III
The invention also provides an electronic device, comprising: the community co-distribution method of the first embodiment includes a memory for storing a computer program and a processor that runs the computer program to cause the electronic device to execute the community co-distribution method of the first embodiment.
Example IV
The present invention also provides a computer-readable storage medium storing a computer program which, when executed by a processor, implements the community co-distribution method of the first embodiment.
In the present specification, each embodiment is described in a progressive manner, and each embodiment is mainly described in a different point from other embodiments, and identical and similar parts between the embodiments are all enough to refer to each other. For the system disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant points refer to the description of the method section.
The principles and embodiments of the present invention have been described herein with reference to specific examples, the description of which is intended only to assist in understanding the methods of the present invention and the core ideas thereof; also, it is within the scope of the present invention to be modified by those of ordinary skill in the art in light of the present teachings. In view of the foregoing, this description should not be construed as limiting the invention.

Claims (8)

1. A community co-distribution method, comprising:
acquiring distribution data; the distribution data comprises distribution center basic information, distribution point basic information and distribution information; the distribution information comprises distribution time and distribution paths of the distribution vehicles from the distribution center to each distribution point, and distribution time and distribution paths of the distribution vehicles from the distribution points to each client;
establishing a community common distribution topological structure according to the distribution center basic information, the distribution point basic information and the distribution information;
determining a plurality of distribution total paths of each distribution center according to the community common distribution topological structure;
screening effective information in the distribution information to obtain screened distribution information; the effective information is delivery information that the delivery time of the delivery vehicle from the delivery center to the client is less than the delivery time required by the client; the delivery time of the delivery vehicle from the delivery center to the client is the sum of the delivery time of the delivery vehicle from the delivery center to the delivery point and the delivery time of the delivery vehicle from the delivery point to the client;
generating a timeliness report according to the screened distribution information;
determining the sum of the delivery time and the sum of the delivery routes of all delivery vehicles in each delivery total path according to the timeliness report;
the determining, according to the timeliness report, a total distribution time sum and a total distribution distance sum of all the distribution vehicles in each distribution total path specifically includes:
using the formula
Figure QLYQS_1
Determining the sum of the delivery time of all delivery vehicles in each delivery total path; wherein,Nfor the number of delivery vehicles;l i is the firstiThe number of delivery points for which the vehicle is responsible for delivery;
Figure QLYQS_2
represent the firstiVehicle in delivery pathj-1 dispensing point to +.>
Figure QLYQS_3
Distribution duration of individual customers->
Figure QLYQS_4
Represent the firstiVehicle in delivery pathl i The distribution time from each distribution point to the distribution center; />
Figure QLYQS_5
Represent the firstiWhether the vehicle is involved in the delivery, if yes>
Figure QLYQS_6
；
Using the formula
Figure QLYQS_7
Determining the sum of the delivery routes of all delivery vehicles in each delivery total route; wherein the method comprises the steps of，/>
Figure QLYQS_8
Represent the firstiVehicle in delivery pathj-1 dispensing point to +.>
Figure QLYQS_9
Distance of individual clients->
Figure QLYQS_10
Represent the firstiVehicle in delivery routel i The distance from the distribution point to the distribution center;
and determining an optimal distribution path according to the distribution time sum and the distribution path sum, and carrying out community distribution.
2. The community co-distribution method of claim 1, wherein the distribution center base information includes a distribution center number, a distribution center location, a distribution center number of distribution vehicles, a distribution vehicle verification load, and a distribution center warehouse.
3. The community co-distribution method according to claim 1, wherein the distribution point basic information includes the number of distribution points, the distribution point positions, and the distribution point warehouse contents in the distribution center area.
4. The community co-distribution method according to claim 1, wherein determining an optimal distribution path according to the distribution time sum and the distribution path sum, and performing community distribution specifically comprises:
and taking the distribution total path with the minimum distribution time sum and the minimum distribution path sum as an optimal distribution path to carry out community distribution.
5. The community co-distribution method of claim 1, further comprising:
judging whether the sum of the delivery time of the optimal delivery path of the current delivery center exceeds the set delivery time;
if the sum of the delivery time of the optimal delivery path of the current delivery center exceeds the set delivery time, adding a delivery vehicle;
calculating the total distribution time length of all distribution centers according to the total distribution time of the optimal distribution path of each distribution center;
judging whether the total distribution time length exceeds the set total distribution time length;
if the total distribution time length exceeds the set total distribution time length, adding a distribution center;
and updating the timeliness report and the community common distribution topology structure according to the added distribution vehicles and the added distribution centers.
6. A community co-distribution system, comprising:
the information acquisition module is used for acquiring distribution data; the distribution data comprises distribution center basic information, distribution point basic information and distribution information; the distribution information comprises distribution time and distribution paths of the distribution vehicles from the distribution center to each distribution point, and distribution time and distribution paths of the distribution vehicles from the distribution points to each client;
the topological structure building module is used for building a community common distribution topological structure according to the distribution center basic information, the distribution point basic information and the distribution information;
the distribution path determining module is used for determining a plurality of distribution total paths of each distribution center according to the community joint distribution topological structure;
the data screening module is used for screening out the effective information in the distribution information to obtain screened distribution information; the effective information is delivery information that the delivery time of the delivery vehicle from the delivery center to the client is less than the delivery time required by the client; the delivery time of the delivery vehicle from the delivery center to the client is the sum of the delivery time of the delivery vehicle from the delivery center to the delivery point and the delivery time of the delivery vehicle from the delivery point to the client;
the report generation module is used for generating a timeliness report according to the screened distribution information;
the calculation module is used for determining the sum of the delivery time and the sum of the delivery routes of all delivery vehicles in each delivery total path according to the timeliness report;
the determining, according to the timeliness report, a total distribution time sum and a total distribution distance sum of all the distribution vehicles in each distribution total path specifically includes:
using the formula
Figure QLYQS_11
Determining the sum of the delivery time of all delivery vehicles in each delivery total path; wherein,Nfor the number of delivery vehicles;l i is the firstiThe number of delivery points for which the vehicle is responsible for delivery;
Figure QLYQS_12
represent the firstiVehicle in delivery pathj-1 dispensing point to +.>
Figure QLYQS_13
Distribution duration of individual customers->
Figure QLYQS_14
Represent the firstiVehicle in delivery pathl i The distribution time from each distribution point to the distribution center; />
Figure QLYQS_15
Represent the firstiWhether the vehicle is involved in the delivery, if yes>
Figure QLYQS_16
；
Using the formula
Figure QLYQS_17
Determining a total distribution distance of all distribution vehicles in each total distribution distanceAnd; wherein (1)>
Figure QLYQS_18
Represent the firstiVehicle in delivery pathj-1 dispensing point to +.>
Figure QLYQS_19
Distance of individual clients->
Figure QLYQS_20
Represent the firstiVehicle in delivery routel i The distance from the distribution point to the distribution center;
and the optimal path determining module is used for determining an optimal distribution path according to the distribution time sum and the distribution path sum and carrying out community distribution.
7. An electronic device, comprising: a memory for storing a computer program, and a processor that runs the computer program to cause the electronic device to perform the community co-distribution method of any of claims 1-5.
8. A computer readable storage medium, characterized in that the computer readable storage medium stores a computer program which, when executed by a processor, implements the community co-distribution method of any of claims 1-5.
CN202211532485.XA 2022-12-02 2022-12-02 Community common distribution method, system, electronic equipment and storage medium Active CN115619063B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211532485.XA CN115619063B (en) 2022-12-02 2022-12-02 Community common distribution method, system, electronic equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211532485.XA CN115619063B (en) 2022-12-02 2022-12-02 Community common distribution method, system, electronic equipment and storage medium

Publications (2)

Publication Number Publication Date
CN115619063A CN115619063A (en) 2023-01-17
CN115619063B true CN115619063B (en) 2023-06-02

Family

ID=84880978

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211532485.XA Active CN115619063B (en) 2022-12-02 2022-12-02 Community common distribution method, system, electronic equipment and storage medium

Country Status (1)

Country Link
CN (1) CN115619063B (en)

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170278064A1 (en) * 2016-03-25 2017-09-28 Jusda International Logistics (TAIWAN) CO.,LTD Method, system, and device for distribution network
CN110046749B (en) * 2019-03-22 2021-05-11 杭州师范大学 E-commerce package and co-city o2o package co-distribution system based on real-time road conditions
CN111445186B (en) * 2020-03-27 2021-08-24 陕西科技大学 Petri network theory-based vehicle path optimization method with time window
CN114493386A (en) * 2020-10-23 2022-05-13 苏州中情货运有限公司 Logistics distribution management method and system
CN114548772A (en) * 2022-02-23 2022-05-27 北京三快在线科技有限公司 Distribution task scheduling method and device, storage medium and electronic equipment
CN114723248A (en) * 2022-03-23 2022-07-08 厦门荆艺软件股份有限公司 Intelligent scheduling and distribution method

Also Published As

Publication number Publication date
CN115619063A (en) 2023-01-17

Similar Documents

Publication Publication Date Title
CN107256443B (en) Line loss real-time computing technique based on business and data integration
Bayram et al. Electric power allocation in a network of fast charging stations
CN108346010B (en) Shared automobile scheduling method based on user demand analysis
Vogel et al. Strategic and operational planning of bike-sharing systems by data mining–a case study
CN108052634B (en) Integration method of multi-information system of power grid production control large area and asset management large area
US20070088594A1 (en) Method and apparatus for inter-pharmacy workload balancing
US6058370A (en) Method of forecasting ambulance service demand
CN113037877B (en) Optimization method for time-space data and resource scheduling under cloud edge architecture
CN102938790A (en) Resource allocation method of cloud computing system
CN116663854B (en) Resource scheduling management method, system and storage medium based on intelligent park
CN108256969A (en) A kind of public bicycles lease point dispatcher-controlled territory division methods
CN111882171A (en) Intelligent scheduling system and method for scenic spot sightseeing vehicle based on demand prediction
Cich et al. Modeling demand responsive transport using SARL and MATSim
CN109257422B (en) Method for reconstructing perception network information
AU2014324087A1 (en) Determining network maps of transport networks
CN115862823B (en) Intelligent scheduling method and system for equipment based on mobile network
Karsten et al. Analysis of resource pooling games via a new extension of the Erlang loss function
CN114757797B (en) Power grid resource service central platform architecture method based on data model drive
Cesarano et al. A real-time energy-saving mechanism in Internet of Vehicles systems
CN104735481A (en) Video content distribution scheduling method, servers and system
CN101997701A (en) Data processing method and a device thereof
CN105335900A (en) Integrated data processing method based on power equipment state monitoring system
CN115619063B (en) Community common distribution method, system, electronic equipment and storage medium
CN102081624A (en) Data inquiring method and data inquiring server
CN105469164A (en) Topic mode based cross-business calculation and analysis system for power system

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