CN117078150A - Agricultural product conveying path optimization method - Google Patents

Agricultural product conveying path optimization method Download PDF

Info

Publication number
CN117078150A
CN117078150A CN202311342034.4A CN202311342034A CN117078150A CN 117078150 A CN117078150 A CN 117078150A CN 202311342034 A CN202311342034 A CN 202311342034A CN 117078150 A CN117078150 A CN 117078150A
Authority
CN
China
Prior art keywords
target
distribution
delivery
energy consumption
centers
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.)
Granted
Application number
CN202311342034.4A
Other languages
Chinese (zh)
Other versions
CN117078150B (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.)
Shenzhen Zhongnong Yixun Information Technology Co ltd
Original Assignee
Shenzhen Zhongnong Yixun Information Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen Zhongnong Yixun Information Technology Co ltd filed Critical Shenzhen Zhongnong Yixun Information Technology Co ltd
Priority to CN202311342034.4A priority Critical patent/CN117078150B/en
Publication of CN117078150A publication Critical patent/CN117078150A/en
Application granted granted Critical
Publication of CN117078150B publication Critical patent/CN117078150B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083Shipping
    • G06Q10/0835Relationships between shipper or supplier and carriers
    • G06Q10/08355Routing methods
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047Optimisation of routes or paths, e.g. travelling salesman problem

Landscapes

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

Abstract

The invention relates to the technical field of path optimization, and discloses a path optimization method for agricultural product transportation, which comprises the following steps: receiving a customer order, acquiring a target address serving as a delivery terminal point and the types and the quantities of fruits and vegetables corresponding to the customer order based on the customer order, confirming delivery environments, screening a plurality of delivery centers to obtain a plurality of target delivery centers, acquiring a plurality of first target delivery centers and one or more second target delivery centers by using the plurality of target delivery centers, setting up three delivery schemes by using the plurality of first target delivery centers and the target address, acquiring joint energy consumption by using a first energy consumption relational expression, a pre-built second energy consumption relational expression and the three delivery schemes, acquiring delivery energy consumption by using ideal energy consumption and joint energy consumption, acquiring delivery paths corresponding to the delivery energy consumption, and obtaining target paths to drive vehicles for delivery to finish delivery according to the target paths. The invention mainly aims to solve the problem of resource waste caused by joint distribution of multiple distribution centers.

Description

Agricultural product conveying path optimization method
Technical Field
The invention relates to a path optimization method for agricultural product transportation, and belongs to the technical field of path optimization.
Background
With the rise of the e-commerce market, more and more agricultural products are added into the e-commerce industry, and correspondingly, how to optimize the distribution path of the agricultural products is particularly important.
Currently, the optimization method for the delivery path includes: the distribution center for distribution is formulated to meet the requirements of customers, the distribution route is optimized based on the distribution center and the addresses of remarks when the customers place orders, and the route with the shortest route distance is selected for distribution.
Although the route optimization can be realized by the method, the distribution centers under the actual condition are not considered when the route is optimized, and the distribution can not meet the requirements of customers and is carried out according to the combination of a plurality of distribution centers, so that the problem of resource waste caused by the combination distribution of a plurality of distribution centers is solved.
Disclosure of Invention
The invention provides a path optimization method and device for agricultural product transportation and a computer readable storage medium, and mainly aims to solve the problem of resource waste caused by joint distribution of multiple distribution centers.
In order to achieve the above object, the present invention provides a path optimization method for agricultural product transportation, comprising:
receiving a customer order, acquiring a target address serving as a delivery terminal point and the types and the numbers of fruits and vegetables corresponding to the customer order based on the customer order, and confirming a delivery environment, wherein the delivery environment comprises: a plurality of distribution centers as distribution start points, each of the plurality of distribution centers including a plurality of vehicles for distribution;
Screening a plurality of delivery centers to obtain a plurality of target delivery centers, and obtaining a plurality of first target delivery centers and one or a plurality of second target delivery centers by using the plurality of target delivery centers, wherein the plurality of first target delivery centers comprise fruit and vegetable types corresponding to customer orders, the first target delivery centers cannot meet the requirements of the customer orders, and at least one target delivery center exists in any one of the plurality of first target delivery centers, so that the fruit and vegetable types and the fruit and vegetable numbers contained in the two target delivery centers can meet the requirements of the customer orders, and the fruit and vegetable types and the fruit and vegetable numbers contained in the second target delivery centers can meet the requirements of the customer orders;
utilizing the fruit and vegetable types and the fruit and vegetable quantity corresponding to the customer orders to confirm a target delivery vehicle for delivery from the plurality of delivery vehicles;
extracting second target distribution centers from the one or more second target distribution centers, and performing the following operations on each extracted second target distribution center:
planning a path with the shortest delivery distance based on the extracted second target delivery center and delivery destination to obtain a delivery path, and calculating target energy consumption of the delivery path by utilizing a pre-constructed first energy consumption relation and a target delivery vehicle;
Summarizing the target energy consumption to obtain a target energy consumption set, and acquiring ideal energy consumption by using the target energy consumption set;
three distribution schemes are drawn by utilizing a plurality of first target distribution centers and target addresses, and the combined energy consumption is obtained by utilizing a first energy consumption relational expression, a pre-constructed second energy consumption relational expression and the three distribution schemes;
and acquiring the distribution energy consumption based on the ideal energy consumption and the combined energy consumption, acquiring a target path by using the distribution energy consumption, and driving the vehicle for distribution to finish distribution according to the target path.
Optionally, the screening the multiple distribution centers to obtain multiple target distribution centers includes:
sequentially extracting distribution centers from the plurality of distribution centers, and performing the following operations on each of the extracted distribution centers:
the fruit and vegetable types and the corresponding quantity of each fruit and vegetable contained in the distribution center are regulated to obtain a reference fruit and vegetable set;
judging whether the extracted distribution center is a target distribution center or not based on the reference fruit and vegetable set and the fruit and vegetable types and the fruit and vegetable numbers corresponding to the customer orders;
if the reference fruit and vegetable set does not contain any fruit and vegetable in the customer order or contains one or more fruits and vegetables in the customer order, and the number corresponding to the one or more fruits and vegetables in the customer order is zero, eliminating the extracted distribution center;
Otherwise, reserving the extracted distribution center;
and summarizing the reserved distribution centers to obtain a plurality of target distribution centers.
Optionally, the acquiring, by using the plurality of target distribution centers, the plurality of first target distribution centers and the one or more second target distribution centers includes:
dividing the plurality of target distribution centers by using a pre-constructed constraint condition to obtain a plurality of first target distribution centers and one or more second target distribution centers, wherein the constraint condition is as follows:
wherein,for the->The number of fruits and vegetables corresponds to the number of the fruits and vegetables>Representing +.>The target distribution center includes the first +.>The number of seeds and fruits;
if the number of fruits and vegetables corresponding to the types of fruits and vegetables contained in the target distribution center can meet the constraint condition, confirming that the target distribution center is a second reference distribution center;
otherwise, confirming the target distribution center as a first reference distribution center;
summarizing the first reference distribution center and the second reference distribution center respectively to obtain a first reference distribution center set and a second reference distribution center set;
a plurality of first target distribution centers and one or more second target distribution centers are acquired based on the first reference distribution center set and the second reference distribution center set.
Optionally, the acquiring the plurality of first target distribution centers and the one or more second target distribution centers based on the first reference distribution center set and the second reference distribution center set includes:
sequentially extracting second reference distribution centers from the second reference distribution center set, and performing the following operations on the extracted second reference distribution centers:
acquiring a second reference path of the second reference distribution center for distribution based on the extracted second reference distribution center and target address, wherein the second reference path is the path with the shortest distance when the second reference distribution center distributes the fruit and vegetable types and the fruit and vegetable numbers corresponding to the customer orders, and acquiring the distance required by the second reference path to acquire a second reference distance;
summarizing the second reference distances, and sequencing the second reference distances according to the sequence from small to large to obtain a second reference distance sequence, and obtaining a first second reference distance in the second reference distance sequence to obtain a first screening distance;
acquiring the longitude and the latitude of the target address, obtaining the target longitude and the target latitude, sequentially extracting a first reference distribution center from the first reference distribution center set, and executing the following operations on the extracted first reference distribution centers:
The method comprises the steps of obtaining the extracted reference longitude and reference latitude of a first reference distribution center, and calculating the linear distance between the target distribution center and a target address based on a pre-constructed linear distance calculation formula, a target longitude, a target latitude, the reference longitude and the reference latitude, wherein the linear distance calculation formula is as follows:
wherein,representing the straight line distance between the extracted first reference distribution center and the target address, +.>、/>Respectively representing the equatorial radius of the earth and the bipolar radius of the earth, < ->Representing the target latitude +.>Representing the reference latitude>For target longitude +.>Representing a reference longitude;
summarizing the linear distances to obtain a linear distance set, and sequencing the linear distance set according to the sequence from small to large to obtain a linear distance sequence;
acquiring an e-th linear distance in a linear distance sequence based on the number of f preset first target distribution centers, wherein f=e, and comparing the e-th linear distance with the first screening distance;
if the first screening distance is greater than or equal to the e-th linear distance, setting the first screening distance as a distance threshold, comparing the linear distance in the linear distance sequence with the distance threshold, if the linear distance is less than or equal to the distance threshold, reserving a first reference distribution center corresponding to the linear distance, otherwise, eliminating the first reference distribution center corresponding to the linear distance, and summarizing the reserved first reference distribution center and one or more second reference distribution centers to obtain a plurality of first target distribution centers and one or more second target distribution centers;
And if the first screening distance is smaller than the e-th linear distance, acquiring a second reference distance in the second reference distance sequence based on the second reference distance sequence to obtain a second screening distance, and screening the first reference distribution center set and the second reference distribution center set based on the second screening distance after confirming that the second screening distance is larger than or equal to the e-th linear distance to obtain a plurality of first target distribution centers and one or more second target distribution centers.
Optionally, the identifying the target delivery vehicle for delivery by using the fruit and vegetable types and the fruit and vegetable amounts corresponding to the customer orders includes:
calculating the distribution volume of fruits and vegetables by using the types and the quantities of the fruits and vegetables corresponding to the customer orders, wherein the calculation formula is as follows:
wherein,for the dispensing volume of fruits and vegetables, <' > is->Representing the +.o corresponding to the customer order>Dispensing volume of seed fruit and vegetable, ->Representing common +.>Planting fruits and vegetables;
and acquiring a target delivery vehicle based on the delivery volume of the fruits and vegetables.
Optionally, the first energy consumption relation is as follows:
wherein,representing the energy consumption consumed when dispensing by the dispensing center,/->Indicating +. >Fixed cost of the seed vehicle,/->Indicate->Unit cost of the seed vehicle while driving, < >>Indicate->Cost consumed per unit time when seed vehicles store fruits and vegetables, < >>Distance travelled for delivery of the vehicle, +.>The representation is based on +.>Average speed of the vehicle when dispensing is performed, +.>Representing +.>The damage coefficient of fruits and vegetables, wherein the damage coefficient is related to the time required for distribution,/and/or>Representing +.>The number of fruits and vegetables and the number of fruits and vegetables are increased>Representing the delivery of the productWhen the core is used for delivery, the delivery center contains the number of fruit and vegetable types corresponding to the customer orders.
Optionally, the second energy consumption relation is as follows:
wherein,represents the energy consumption generated by the second delivery center when delivering fruits and vegetables based on the two delivery centers,/->Representing the fixed cost of delegation of the target delivery vehicle, < >>Representing unit cost of the target delivery vehicle while driving, < > for>Representing the cost consumed per unit time when the target delivery vehicle stores the fruit and vegetable, < >>Distance travelled for the target delivery vehicle, +.>Representing the average speed of the target delivery vehicle when delivery is performed,/->Representing the second loading of fruit and vegetable, the first distribution center is at the first + >Breaking coefficient of seed fruits and vegetables, < >>Indicating the kind of fruits and vegetables loaded based on the second distribution center, < > or->Indicating the loading of the second distribution center based on the +.>The number of fruits and vegetables and the number of fruits and vegetables are increased>Indicate->The breakage coefficient of fruits and vegetables.
Optionally, the planning three delivery schemes by using the plurality of first target delivery centers and the target addresses includes:
sequentially extracting first target distribution centers from the plurality of first target distribution centers, and performing the following operations on all the extracted first target distribution centers:
acquiring a supplementary fruit and vegetable set based on the fruit and vegetable types and the fruit and vegetable quantity corresponding to the customer orders and the fruit and vegetable types and the fruit and vegetable quantity corresponding to the called first target distribution center;
confirming a supplementary vehicle and one or more supplementary delivery centers by using a supplementary fruit and vegetable set, wherein the supplementary delivery center is a first target delivery center or a second target delivery center which meets the demand of a customer order with the first target delivery center, and acquiring a supplementary path according to the one or more supplementary delivery centers and the extracted first target delivery center, wherein the supplementary path is the shortest path between the one or more supplementary delivery centers and the extracted first target delivery center, and three delivery schemes are planned based on the supplementary delivery center corresponding to the supplementary path and the extracted first target delivery center, wherein the three delivery schemes are as follows:
The first distribution scheme is as follows: the supplementary distribution center and the first target distribution center distribute to the target addresses respectively;
and a second distribution scheme: the method comprises the steps that after a supplementary distribution center distributes supplementary fruit and vegetable sets to a first target distribution center, the supplementary fruit and vegetable sets are distributed to target addresses based on the first target distribution center;
and a delivery scheme III: the first target distribution center distributes the types and the quantity of fruits and vegetables contained in the first target distribution center to the supplementary distribution center, and then the supplementary distribution center distributes the fruits and vegetables to the target address;
and acquiring the combined energy consumption based on the first energy consumption relation, the second energy consumption relation, the supplementary path and the three distribution schemes.
Optionally, the acquiring the joint energy consumption based on the first energy consumption relation, the second energy consumption relation, the supplementary path and the three distribution schemes includes:
extracting a first distribution scheme from the three distribution schemes, and calculating first scheme energy consumption based on the first distribution scheme and a first energy consumption relational expression;
extracting a second distribution scheme from the three distribution schemes, and calculating second scheme energy consumption based on the second distribution scheme, the supplementary path, the first energy consumption relational expression and the second energy consumption relational expression;
extracting a third distribution scheme from the three distribution schemes, and calculating the energy consumption of a third scheme based on the third distribution scheme, the supplementary path, the first energy consumption relational expression and the second energy consumption relational expression;
And acquiring combined energy consumption based on the first scheme energy consumption, the second scheme energy consumption and the third scheme energy consumption, wherein the combined energy consumption is the minimum energy consumption among the first scheme energy consumption, the second scheme energy consumption and the third scheme energy consumption corresponding to the plurality of first target distribution centers.
Optionally, the calculating the first scheme energy consumption based on the first distribution scheme and the first energy consumption relation includes:
calculating the delivery volume of the concentrated supplementary fruits and vegetables based on the concentrated supplementary fruits and vegetables, and confirming a supplementary vehicle according to the delivery volume of the concentrated supplementary fruits and vegetables;
calculating the energy consumption required by the supplementary distribution center to distribute to the target address according to the supplementary route, the supplementary vehicle and the first energy consumption relation, and obtaining supplementary energy consumption;
confirming a first target delivery vehicle by utilizing the fruit and vegetable types and the quantity of the customer orders corresponding to the first target delivery center;
calculating the energy consumption required by the first target distribution center to distribute to the target address according to the distribution path, the first target distribution vehicle and the first energy consumption relation, and obtaining first target energy consumption;
and summing the supplementary energy consumption and the first target energy consumption to obtain the first scheme energy consumption.
In order to solve the above-mentioned problems, the present invention also provides an electronic apparatus including:
At least one processor; the method comprises the steps of,
a memory communicatively coupled to the at least one processor; wherein,
the memory stores instructions executable by the at least one processor to implement the path optimization method for agricultural commodity transportation described above.
In order to solve the above-mentioned problems, the present invention also provides a computer-readable storage medium having stored therein at least one instruction that is executed by a processor in an electronic device to implement the path optimization method for agricultural product transportation described above.
Compared with the problems in the background art, the invention firstly receives the customer order, obtains the target address as the delivery terminal point and the fruit and vegetable types and the fruit and vegetable numbers corresponding to the customer order based on the customer order, and confirms the delivery environment, wherein the delivery environment comprises: the distribution environment is more practical, and therefore, the distribution environment has practical significance for optimizing the agricultural product distribution path. And screening the plurality of delivery centers to obtain a plurality of target delivery centers, and acquiring a plurality of first target delivery centers and one or a plurality of second target delivery centers by using the plurality of target delivery centers, wherein the plurality of first target delivery centers comprise fruit and vegetable types corresponding to the customer orders, the first target delivery centers cannot meet the requirements of the customer orders, at least one target delivery center exists in any one of the plurality of first target delivery centers, so that the fruit and vegetable types and the fruit and vegetable numbers contained in the two target delivery centers can meet the requirements of the customer orders, and the fruit and vegetable types and the fruit and vegetable numbers contained in the second target delivery centers can meet the requirements of the customer orders. Correspondingly, not all the distribution centers can realize all or part of the requirements of the types and the quantities of the fruits and vegetables corresponding to the customer orders, the distribution centers contained in the distribution environment are further divided, and the distribution centers meeting the requirements are screened, so that resources are saved for planning a path when the customer orders are distributed to target addresses, in addition, the second target distribution centers are extracted from the one or more second target distribution centers, and the following operations are carried out on the extracted second target distribution centers: the invention relates to a method for preparing a distribution route, which comprises the steps of planning a shortest distribution route based on an extracted second target distribution center and a distribution destination point to obtain a distribution route, calculating target energy consumption of the distribution route by utilizing a pre-built first energy consumption relation and a target distribution vehicle, utilizing the target energy consumption to obtain ideal energy consumption, utilizing a plurality of first target distribution centers and target addresses to draw three distribution schemes, utilizing the first energy consumption relation, a pre-built second energy consumption relation and the three distribution schemes to obtain combined energy consumption, obtaining the distribution energy consumption based on the ideal energy consumption and the combined energy consumption, and obtaining a distribution route corresponding to the distribution energy consumption to obtain the target route. Therefore, the method, the device, the electronic equipment and the computer readable storage medium for optimizing the path of agricultural product transportation mainly aim to solve the problem of resource waste caused by joint distribution of multiple distribution centers.
Drawings
FIG. 1 is a flow chart of a method for optimizing a path for transporting agricultural products according to an embodiment of the present application;
fig. 2 is a schematic structural diagram of an electronic device for implementing the path optimization method for transporting agricultural products according to an embodiment of the present application.
The achievement of the objects, functional features and advantages of the present application will be further described with reference to the accompanying drawings, in conjunction with the embodiments.
Detailed Description
It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the application.
The embodiment of the application provides a path optimization method for agricultural product transportation. The execution subject of the path optimization method for agricultural product transportation includes, but is not limited to, at least one of a server, a terminal, and the like, which can be configured to execute the method provided by the embodiment of the application. In other words, the path optimization method of agricultural product transportation may be performed by software or hardware installed at a terminal device or a server device. The service end includes but is not limited to: a single server, a server cluster, a cloud server or a cloud server cluster, and the like.
Example 1:
referring to fig. 1, a flow chart of a method for optimizing a path for transporting agricultural products according to an embodiment of the present application is shown. In this embodiment, the path optimization method for agricultural product transportation includes:
S1, receiving a customer order, acquiring a target address serving as a delivery terminal point and the types and the numbers of fruits and vegetables corresponding to the customer order based on the customer order, and confirming a delivery environment, wherein the delivery environment comprises: a plurality of distribution centers as distribution start points, and each of the plurality of distribution centers includes a plurality of vehicles for distribution.
It should be explained that, the customer order is an order for purchasing fruits and vegetables, and the customer has remarked in the customer order before placing the order, the destination address and the types of fruits and vegetables and the number of fruits and vegetables that the customer needs to distribute are remarked by one or more distribution centers according to the remarks in the customer order: and (5) delivering the number of fruits and vegetables, the types of fruits and vegetables and the target address. The types of fruits and vegetables are as follows: the types of fruits or vegetables required to be purchased when the clients make the order, and the number of the fruits and vegetables is as follows: the clients remark the number of fruits or vegetables corresponding to the types of the fruits and vegetables one by one when making a list. The distribution environment is a distribution environment formulated in the embodiment of the present invention and is an environment necessary for realizing the distribution of fruits and vegetables, and the distribution center is a place containing one or more fruits and vegetables and capable of realizing the distribution of fruits and vegetables, for example: supermarket supporting the delivery of fruits and vegetables, farmer market supporting the delivery of fruits and vegetables, etc. The precondition for delivering fruits and vegetables based on the delivery center is as follows: when the delivery center contains delivery fruits and vegetables, the fruits and vegetables can be delivered according to a standard assembly mode, for example: the apple assembly mode of the cross shape.
The king is used as a buyer of a certain supermarket, an order is placed in a certain shopping platform, 300kg apples and 300kg pears are purchased, and the target address is noted in the order as the address of the certain supermarket.
S2, screening the plurality of distribution centers to obtain a plurality of target distribution centers, and obtaining a plurality of first target distribution centers and one or a plurality of second target distribution centers by using the plurality of target distribution centers.
Further, the plurality of first target delivery centers include fruit and vegetable types corresponding to the customer orders, the first target delivery centers cannot meet the requirements of the customer orders, at least one target delivery center exists in any one of the plurality of first target delivery centers, the fruit and vegetable types and the fruit and vegetable numbers included in the two target delivery centers can meet the requirements of the customer orders, and the fruit and vegetable types and the fruit and vegetable numbers included in the second target delivery center can meet the requirements of the customer orders.
It should be understood that the distribution center proposed by the embodiment of the present invention may be divided according to whether the distribution center contains the types of fruits and vegetables and the number of fruits and vegetables corresponding to the customer order, and then divided more finely according to whether the distribution center can satisfy the types of fruits and vegetables and the number of fruits and vegetables corresponding to the customer order.
It should be explained that the screening the multiple distribution centers to obtain multiple target distribution centers includes:
sequentially extracting distribution centers from the plurality of distribution centers, and performing the following operations on each of the extracted distribution centers:
the fruit and vegetable types and the corresponding quantity of each fruit and vegetable contained in the distribution center are regulated to obtain a reference fruit and vegetable set;
judging whether the extracted distribution center is a target distribution center or not based on the reference fruit and vegetable set and the fruit and vegetable types and the fruit and vegetable numbers corresponding to the customer orders;
if the reference fruit and vegetable set does not contain any fruit and vegetable in the customer order or contains one or more fruits and vegetables in the customer order, and the number corresponding to the one or more fruits and vegetables in the customer order is zero, eliminating the extracted distribution center;
otherwise, reserving the extracted distribution center;
and summarizing the reserved distribution centers to obtain a plurality of target distribution centers.
It should be understood that the reference fruit and vegetable set is an extracted collection of fruit and vegetable types and fruit and vegetable numbers, and the fruit and vegetable types and the fruit and vegetable numbers are in one-to-one correspondence. The target distribution center contains fruit and vegetable types corresponding to the customer orders, and the number corresponding to the fruit and vegetable types is not 0.
Exemplary, the types of fruits and vegetables corresponding to the customer order are: apples and pears comprise ten distribution centers in the distribution environment, but fruits and vegetables corresponding to each of the first, second and third distribution centers in the ten distribution centers are only: the fruit and vegetable types corresponding to each of the fourth and fifth distribution centers include apples and pears, but the number of apples and pears is 0, and the fruit and vegetable types corresponding to each of the sixth, seventh and eighth distribution centers include: apples are not contained, the number of apples is not 0, the fruit and vegetable types in the ninth and tenth distribution centers contain apples and pears, and the number of apples and pears is not 0, the sixth, seventh, eighth, ninth and tenth distribution centers are target distribution centers.
Further, the acquiring, by using the plurality of target distribution centers, the plurality of first target distribution centers and the one or more second target distribution centers includes:
dividing the plurality of target distribution centers by using a pre-constructed constraint condition to obtain a plurality of first target distribution centers and one or more second target distribution centers, wherein the constraint condition is as follows:
Wherein,for the->The number of fruits and vegetables corresponds to the number of the fruits and vegetables>Representing +.>The target distribution center includes the first +.>The number of seeds and fruits;
if the number of fruits and vegetables corresponding to the types of fruits and vegetables contained in the target distribution center can meet the constraint condition, confirming that the target distribution center is a second reference distribution center;
otherwise, confirming the target distribution center as a first reference distribution center;
summarizing the first reference distribution center and the second reference distribution center respectively to obtain a first reference distribution center set and a second reference distribution center set;
a plurality of first target distribution centers and one or more second target distribution centers are acquired based on the first reference distribution center set and the second reference distribution center set.
It should be understood that, dividing the plurality of target delivery centers into the first target delivery center and the second target delivery center considers the storage amount of actual fruits and vegetables of the delivery centers, and the second target delivery center can only obtain the types and the quantities of fruits and vegetables corresponding to the customer orders by itself, the first target delivery center cannot only satisfy the types and the quantities of fruits and vegetables corresponding to the customer orders by itself, and the first target delivery center needs other delivery centers to combine with the first target delivery center to satisfy the types and the quantities of fruits and vegetables corresponding to the customer orders, and the other delivery centers can be other first target delivery centers or second target delivery centers.
It should be explained that the acquiring the plurality of first target distribution centers and the one or more second target distribution centers based on the first reference distribution center set and the second reference distribution center set includes:
sequentially extracting second reference distribution centers from the second reference distribution center set, and performing the following operations on the extracted second reference distribution centers:
acquiring a second reference path of the second reference distribution center for distribution based on the extracted second reference distribution center and target address, wherein the second reference path is the path with the shortest distance when the second reference distribution center distributes the fruit and vegetable types and the fruit and vegetable numbers corresponding to the customer orders, and acquiring the distance required by the second reference path to acquire a second reference distance;
summarizing the second reference distances, and sequencing the second reference distances according to the sequence from small to large to obtain a second reference distance sequence, and obtaining a first second reference distance in the second reference distance sequence to obtain a first screening distance;
acquiring the longitude and the latitude of the target address, obtaining the target longitude and the target latitude, sequentially extracting a first reference distribution center from the first reference distribution center set, and executing the following operations on the extracted first reference distribution centers:
The method comprises the steps of obtaining the extracted reference longitude and reference latitude of a first reference distribution center, and calculating the linear distance between the target distribution center and a target address based on a pre-constructed linear distance calculation formula, a target longitude, a target latitude, the reference longitude and the reference latitude, wherein the linear distance calculation formula is as follows:
wherein,representing the straight line distance between the extracted first reference distribution center and the target address, +.>、/>Respectively representing the equatorial radius of the earth and the bipolar radius of the earth, < ->Representing the target latitude +.>Representing the reference latitude>For target longitude +.>Representing a reference longitude;
summarizing the linear distances to obtain a linear distance set, and sequencing the linear distance set according to the sequence from small to large to obtain a linear distance sequence;
acquiring an e-th linear distance in a linear distance sequence based on the number of f preset first target distribution centers, wherein f=e, and comparing the e-th linear distance with the first screening distance;
if the first screening distance is greater than or equal to the e-th linear distance, setting the first screening distance as a distance threshold, comparing the linear distance in the linear distance sequence with the distance threshold, if the linear distance is less than or equal to the distance threshold, reserving a first reference distribution center corresponding to the linear distance, otherwise, eliminating the first reference distribution center corresponding to the linear distance, and summarizing the reserved first reference distribution center and one or more second reference distribution centers to obtain a plurality of first target distribution centers and one or more second target distribution centers;
And if the first screening distance is smaller than the e-th linear distance, acquiring a second reference distance in the second reference distance sequence based on the second reference distance sequence to obtain a second screening distance, and screening the first reference distribution center set and the second reference distribution center set based on the second screening distance after confirming that the second screening distance is larger than or equal to the e-th linear distance to obtain a plurality of first target distribution centers and one or more second target distribution centers.
It can be understood that the second reference path is a path planned by taking the extracted second reference distribution center as a starting point and taking the target address as an end point, and optionally, the second reference path may be obtained by: the path planning is performed by the aid of the Goldmap app, and other technologies can achieve the same action and effects, and therefore details are omitted.
It should be understood that the first screening distance is the minimum distance between the second reference distribution center and the target address when the distribution is performed, and in addition, a plurality of first reference distribution centers and one or more second reference distribution centers meeting the conditions can be screened out through the first screening distance, and the optimal distance when the distribution is performed on the fruit and vegetable types and the fruit and vegetable numbers corresponding to the customer orders is a straight line distance, that is, the distance corresponding to the planned path when the distribution center and the target address are a straight line.
It should be noted that, when the straight line distance is the length of the line segment formed by taking the extracted first reference distribution center and the target address as the two endpoints of the line segment, in addition, the most direct distance between two points is estimated as the line segment distance between the two points.
It can be understood that, the more the number of the preset f second target delivery centers is, the better the delivery paths planned based on the embodiment of the present invention are, and the distances between the second target delivery centers and the delivery paths planned by the target addresses are greater than or equal to the first screening distance in real life, and the first reference delivery center set and the second reference delivery center set are screened by the e-th straight line distance and the first screening distance, so that the actual situation existing in real life is considered, that is, the planned paths between the first reference delivery center and the target addresses are located on the same straight line, and if the distances between the screened first target delivery centers and the planned delivery paths between the target addresses are all greater than or equal to the first screening distance, the delivery scheme can be considered to be executed based on the second reference path corresponding to the first screening distance.
It should be appreciated that the method for screening the first reference distribution center set and the second reference distribution center set based on the second screening distance is the same as the method for comparing the e-th straight line distance with the first screening distance, and can achieve the same effect, which is not described herein.
It will be appreciated that the purpose of selecting the first screening distance is to: preventing a distribution center closer to the target address from being present in the second reference distribution center, thereby ensuring the practicability of the embodiment of the present invention.
The first screening distance is 500m, only one second target distribution center exists, the distance of the distribution path planned based on the second target distribution center and the target address is 600m, but one second reference distribution center exists in the second reference distribution center set, so that the distance between the existing second reference distribution center and the distribution path planned by the target address is 550m, obviously, 550m is smaller than 600m, the distribution is performed based on the existing second reference distribution center rather than the distribution is performed based on the second target distribution center, and therefore, the process of acquiring a plurality of first target distribution centers and one or more second target distribution centers based on the first reference distribution center set and the second reference distribution center set, which is constructed by the embodiment of the invention, has practical significance.
And S3, confirming a target delivery vehicle for delivery from the plurality of vehicles for delivery by utilizing the types and the quantities of the fruits and the vegetables corresponding to the customer orders.
Further, the method for identifying a target delivery vehicle for delivery by using the fruit and vegetable types and the fruit and vegetable amounts corresponding to the customer orders includes:
calculating the distribution volume of fruits and vegetables by using the types and the quantities of the fruits and vegetables corresponding to the customer orders, wherein the calculation formula is as follows:
wherein,for the dispensing volume of fruits and vegetables, <' > is->Representing the +.o corresponding to the customer order>Dispensing volume of seed fruit and vegetable, ->Representing common +.>Planting fruits and vegetables;
and acquiring a target delivery vehicle based on the delivery volume of the fruits and vegetables.
It is understood that, before the fruit and vegetable is delivered, the fruit and vegetable needs to be packaged according to the type of the fruit and vegetable to reduce damage to the fruit and vegetable during delivery, and therefore, it is considered that the volume of the fruit and vegetable after the fruit and vegetable is packaged, and the target delivery vehicle for delivery is confirmed based on the volume of the fruit and vegetable after the packaging. The target delivery vehicle is a vehicle that is identified from a plurality of delivery vehicles in a delivery environment when delivering fruits and vegetables, and the target delivery vehicle is a vehicle that has a minimum volume under the condition that the volume constraint condition is satisfied.
Illustratively, each of the plurality of distribution centers includes: the volume of the A-type delivery vehicle is 13 cubic meters, the volume of the B-type delivery vehicle is 20 cubic meters, the volume of the C-type delivery vehicle is 28 cubic meters, and the delivery volume of fruits and vegetables is 25 cubic meters by calculating the types and the quantities of the fruits and vegetables corresponding to the customer orders, so that the target delivery vehicle for delivery is confirmed to be the C-type delivery vehicle.
It should be understood that, because the density of the fruits and vegetables is low, it is difficult to reach the weight limit of the target delivery vehicle, and therefore, the confirmation of the target delivery vehicle is performed according to the volume of the fruits and vegetables after the fruits and vegetables are packaged, and the embodiment of the invention proposes that the transportation conditions of the fruits and vegetables corresponding to the customer orders are the same transportation conditions when the fruits and vegetables are delivered, that is, the fruits and vegetables do not need to be divided into different combinations according to the transportation temperature of the fruits and vegetables, and different vehicles are used for delivery.
S4, extracting second target distribution centers from the one or more second target distribution centers, and performing the following operations on all the extracted second target distribution centers: and planning a path with the shortest delivery distance based on the extracted second target delivery center and delivery destination to obtain a delivery path, calculating target energy consumption of the delivery path by utilizing a pre-constructed first energy consumption relation and a target delivery vehicle, summarizing the target energy consumption to obtain a target energy consumption set, and acquiring ideal energy consumption by utilizing the target energy consumption set.
It should be understood that the planning of the distribution path may be implemented by the prior art, alternatively, the distribution path may be planned by the aid of the Goldmap app, and the same effects may be achieved by adopting other technologies, which are not described herein.
It should be explained that the first energy consumption relation is as follows:
wherein,representing the energy consumption consumed when dispensing by the dispensing center,/->Indicating +.>Fixed cost of the seed vehicle,/->Indicate->Unit cost of the seed vehicle while driving, < >>Indicate->Cost consumed per unit time when seed vehicles store fruits and vegetables, < >>Distance travelled for delivery of the vehicle, +.>The representation is based on +.>Average speed of the vehicle when dispensing is performed, +.>Representing +.>The damage coefficient of fruits and vegetables, wherein the damage coefficient is related to the time required for distribution,/and/or>Representing +.>The number of fruits and vegetables and the number of fruits and vegetables are increased>The number of fruit and vegetable types corresponding to the customer orders is contained in the distribution center when the distribution center performs distribution.
It should be appreciated that the ideal energy consumption is the least energy consumption generated when the delivery is performed based on the second target delivery center, and the process of acquiring the plurality of first target delivery centers and the one or more second target delivery centers based on the first reference delivery center set and the second reference delivery center set is known that the number of second target delivery centers actually available for delivery may include one or more of the following purposes: by calculating the target energy consumption of the delivery path for each of the one or more second target delivery centers, it is confirmed that the energy consumption generated when the delivery is performed based on a certain one of the second target delivery centers is minimized.
It should be noted that the fixed cost of delegation is determined by the model of the vehicle selected for delivery, and the cost of fuel consumption per unit time is the cost of the oil consumed per unit time when delivering the vehicle for delivery, and is the firstThe cost consumed in unit time when the seed vehicle stores fruits and vegetables is related to the types of fruits and vegetables, if the fruits and vegetables are required to be refrigerated, the cost consumed in unit time is the cost consumed in unit time when the fruits and vegetables are refrigerated, and if the fruits and vegetables are not required to be refrigerated, the cost consumed in unit time is 0>The damage coefficient of the seed fruits and vegetables is +.>The proportion of the damage of the fruits and vegetables, optionally, the first->The damage coefficient of fruits and vegetables can be obtained by experimental simulation.
For example, when 500kg apples are distributed, the apple breakage coefficient is 0.99, and after apples are distributed to the target address, the apple mass without damage is 495kg.
S5, three distribution schemes are drawn by using a plurality of first target distribution centers and target addresses, and the combined energy consumption is obtained by using a first energy consumption relation, a pre-built second energy consumption relation and the three distribution schemes.
It should be explained that the second energy consumption relation is as follows:
Wherein,represents the energy consumption generated by the second delivery center when delivering fruits and vegetables based on the two delivery centers,/->Representing the fixed cost of delegation of the target delivery vehicle, < >>Representing unit cost of the target delivery vehicle while driving, < > for>Representing the cost consumed per unit time when the target delivery vehicle stores the fruit and vegetable, < >>Distance travelled for the target delivery vehicle, +.>Representing the average speed of the target delivery vehicle when delivery is performed,/->Representing the second loading of fruit and vegetable, the first distribution center is at the first +>Breaking coefficient of seed fruits and vegetables, < >>Indicating the kind of fruits and vegetables loaded based on the second distribution center, < > or->Indicating the loading of the second distribution center based on the +.>The number of fruits and vegetables and the number of fruits and vegetables are increased>Indicate->The breakage coefficient of fruits and vegetables.
It is understood that the second energy consumption relational expression is a relational expression suitable for calculating the energy consumption generated by the second distribution center when the distribution schemes two and three are used by the plurality of first target distribution centers or the first target distribution center and the second target distribution center. The coefficient of damage when loading fruit vegetables for the second time is the coefficient that is used for estimating fruit vegetables to break when the fruit vegetables are delivered to the second delivery center by first delivery center, and unload and load the fruit vegetables on the delivery vehicle of second delivery center, and optional, the coefficient of damage when loading fruit vegetables for the second time can be obtained by experimental simulation, adopts other technologies homoenergetic to realize same effect, and the description is omitted here again.
For example, when 500kg apples are delivered to the first target delivery center by the supplementary delivery center and 500kg apples are assembled to the target delivery vehicle, the mass of apples which are not damaged actually after assembly is 490kg, and the breakage coefficient of apples is 0.99, the breakage coefficient when fruits and vegetables are loaded secondarily is: 0.99.
further, the planning three distribution schemes by using the plurality of first target distribution centers and the target addresses includes:
sequentially extracting first target distribution centers from the plurality of first target distribution centers, and performing the following operations on all the extracted first target distribution centers:
acquiring a supplementary fruit and vegetable set based on the fruit and vegetable types and the fruit and vegetable quantity corresponding to the customer orders and the fruit and vegetable types and the fruit and vegetable quantity corresponding to the called first target distribution center;
confirming a supplementary vehicle and one or more supplementary delivery centers by using a supplementary fruit and vegetable set, wherein the supplementary delivery center is a first target delivery center or a second target delivery center which meets the demand of a customer order with the first target delivery center, and acquiring a supplementary path according to the one or more supplementary delivery centers and the extracted first target delivery center, wherein the supplementary path is the shortest path between the one or more supplementary delivery centers and the extracted first target delivery center, and three delivery schemes are planned based on the supplementary delivery center corresponding to the supplementary path and the extracted first target delivery center, wherein the three delivery schemes are as follows:
The first distribution scheme is as follows: the supplementary distribution center and the first target distribution center distribute to the target addresses respectively;
and a second distribution scheme: the method comprises the steps that after a supplementary distribution center distributes supplementary fruit and vegetable sets to a first target distribution center, the supplementary fruit and vegetable sets are distributed to target addresses based on the first target distribution center;
and a delivery scheme III: the first target distribution center distributes the types and the quantity of fruits and vegetables contained in the first target distribution center to the supplementary distribution center, and then the supplementary distribution center distributes the fruits and vegetables to the target address;
and acquiring the combined energy consumption based on the first energy consumption relation, the second energy consumption relation, the supplementary path and the three distribution schemes.
It should be explained that the supplementary fruit and vegetable set is: the first target distribution center includes a collection of differences in fruits and vegetables corresponding to the fruits and vegetables required by the customer order.
Illustratively, the first target delivery center contains 200kg apples, but the fruits and vegetables required by the customer order are 300kg apples and 300kg pears, and the extracted supplementary fruit and vegetable set corresponding to the first target delivery center is: 100kg of apples and 300kg of pears.
It should be understood that the supplementary distribution center is a distribution center capable of providing a variety and quantity of fruits and vegetables corresponding to the corresponding customer order absent from the first target distribution center, and the supplementary distribution center includes: the first target distribution center and the second target distribution center. The obtaining of the supplementary path is the same as the obtaining of the second reference path, and the same effect can be achieved by adopting other technologies, which are not described herein.
For the sake of understanding, the relationship among the target address, the first target delivery center and the second target delivery center is treated as a line segment relationship in this example, wherein the second target delivery center and the target address are located at two end points of the line segment, the first target delivery center is located at the midpoint of the line segment, and the scheme of supplementing fruits and vegetables missing in the first target delivery center by using the second target delivery center is obviously superior to the scheme of directly delivering the target address based on the second target delivery center.
It can be appreciated that the acquiring the combined energy consumption based on the first energy consumption relation, the second energy consumption relation, the supplementary route and the three distribution schemes includes:
extracting a first distribution scheme from the three distribution schemes, and calculating first scheme energy consumption based on the first distribution scheme and a first energy consumption relational expression;
extracting a second distribution scheme from the three distribution schemes, and calculating second scheme energy consumption based on the second distribution scheme, the supplementary path, the first energy consumption relational expression and the second energy consumption relational expression;
extracting a third distribution scheme from the three distribution schemes, and calculating the energy consumption of a third scheme based on the third distribution scheme, the supplementary path, the first energy consumption relational expression and the second energy consumption relational expression;
And acquiring combined energy consumption based on the first scheme energy consumption, the second scheme energy consumption and the third scheme energy consumption, wherein the combined energy consumption is the minimum energy consumption among the first scheme energy consumption, the second scheme energy consumption and the third scheme energy consumption corresponding to the plurality of first target distribution centers.
It should be understood that each of the plurality of first target delivery centers corresponds to one or more complementary delivery centers, and that each of the plurality of first target delivery centers corresponds to only one complementary delivery center by acquiring the complementary path, and it is obvious that the complementary delivery center corresponding to each of the plurality of first target delivery centers is better than the other complementary delivery centers corresponding to each of the plurality of first delivery centers. And screening the optimal distribution mode from the three schemes by acquiring the combined energy consumption, wherein in the implementation process of the scheme II and the scheme III, each first target distribution center in the plurality of first target distribution centers is required to be calculated.
It should be explained that the calculating the first scheme energy consumption based on the first distribution scheme and the first energy consumption relation includes:
calculating the delivery volume of the concentrated supplementary fruits and vegetables based on the concentrated supplementary fruits and vegetables, and confirming a supplementary vehicle according to the delivery volume of the concentrated supplementary fruits and vegetables;
Calculating the energy consumption required by the supplementary distribution center to distribute to the target address according to the supplementary route, the supplementary vehicle and the first energy consumption relation, and obtaining supplementary energy consumption;
confirming a first target delivery vehicle by utilizing the fruit and vegetable types and the quantity of the customer orders corresponding to the first target delivery center;
calculating the energy consumption required by the first target distribution center to distribute to the target address according to the distribution path, the first target distribution vehicle and the first energy consumption relation, and obtaining first target energy consumption;
and summing the supplementary energy consumption and the first target energy consumption to obtain the first scheme energy consumption.
It can be understood that the supplementary vehicle is a vehicle selected when the supplementary vehicle is delivered to the target address or other first target delivery centers based on the supplementary delivery center, and the method for confirming the supplementary vehicle is the same as the method for confirming the target delivery vehicle for delivering by using the fruit and vegetable types and the fruit and vegetable numbers corresponding to the customer orders, and the same effect can be achieved, and the details are not repeated here. The first target delivery vehicle is a vehicle selected when the first target delivery center delivers to the target address or other first target delivery centers, and the confirmation of the first target delivery vehicle is the same as the method for confirming the target delivery vehicle for delivery by using the fruit and vegetable types and the fruit and vegetable numbers corresponding to the customer orders, and can achieve the same effects, and the details are not repeated here.
It should be appreciated that the calculating the second scenario energy consumption based on the second delivery scenario, the supplementary route, the first energy consumption relation, and the second energy consumption relation includes:
after confirming that the supplementary vehicle is delivered to the first target delivery center, calculating the energy consumption required by the first target delivery center to deliver to the target address based on the target delivery vehicle, the target path and the second energy consumption relation, and obtaining second combined energy consumption;
and summing the supplementary energy consumption and the second combined energy consumption to obtain the second scheme energy consumption.
It can be understood that the method for calculating the energy consumption of the third solution based on the third delivery solution, the supplementary path, the first energy consumption relational expression and the second energy consumption relational expression is the same as the method for calculating the energy consumption of the second solution based on the second delivery solution, the supplementary path, the first energy consumption relational expression and the second energy consumption relational expression, and the same technical effects can be achieved, and the description thereof will not be repeated.
Further, when the second delivery center is used for delivering, the vehicle used for delivering is the target delivery vehicle, and the second delivery center and the third delivery center are different in number of fruits and vegetables, so that the vehicles used for delivering are different in the first delivery center and the second delivery center, paths between the first delivery center and the second delivery center and the target address are different, and accordingly, energy consumption corresponding to the second delivery center and the third delivery center is different, and the two delivery centers and the third delivery center can be proposed as different solutions.
It can be understood that, in the embodiment of the present invention, the application range of the first energy consumption relation is: the fruits and vegetables can be delivered to the target address only by delivering the fruits and vegetables once, and the application range of the second energy consumption relation is as follows: the fruit and vegetable need to be distributed for the second time, namely: and after the two first target delivery centers are delivered to the second first target delivery center, calculating the energy consumption of the second target delivery center delivered to the target address, or after the second target delivery center delivers to the first target delivery center, calculating the energy consumption of the first target delivery center delivered to the target address.
For example, the first delivery center is a first target delivery center N, the second delivery center is another first target delivery center M, and if the first target delivery center N is used as a supplementary delivery center, the vehicle for delivery corresponding to the first target delivery center N is: if the first target distribution center M is taken as a supplementary distribution center, the vehicle for distribution corresponding to the first target distribution center M is: type B vehicle with a vehicle volume of 20 cubic meters, the energy consumption calculated based on the second and third schemes is: 15 and 20, and 15 corresponds to scheme two, and 20 corresponds to scheme three.
And S6, acquiring distribution energy consumption based on ideal energy consumption and combined energy consumption, acquiring a target path by using the distribution energy consumption, and driving a vehicle for distribution to finish distribution according to the target path.
It should be explained that the delivery energy consumption is the smallest energy consumption of the ideal energy consumption and the joint energy consumption, and the delivery path corresponding to the delivery energy consumption corresponds to the shortest path obtained based on the second target delivery center and the target address or the path corresponding to the joint energy consumption in the three delivery schemes.
Compared with the problems in the background art, the invention firstly receives the customer order, obtains the target address as the delivery terminal point and the fruit and vegetable types and the fruit and vegetable numbers corresponding to the customer order based on the customer order, and confirms the delivery environment, wherein the delivery environment comprises: the distribution environment is more practical, and therefore, the distribution environment has practical significance for optimizing the agricultural product distribution path. And screening the plurality of delivery centers to obtain a plurality of target delivery centers, and acquiring a plurality of first target delivery centers and one or a plurality of second target delivery centers by using the plurality of target delivery centers, wherein the plurality of first target delivery centers comprise fruit and vegetable types corresponding to the customer orders, the first target delivery centers cannot meet the requirements of the customer orders, at least one target delivery center exists in any one of the plurality of first target delivery centers, so that the fruit and vegetable types and the fruit and vegetable numbers contained in the two target delivery centers can meet the requirements of the customer orders, and the fruit and vegetable types and the fruit and vegetable numbers contained in the second target delivery centers can meet the requirements of the customer orders. Correspondingly, not all the distribution centers can realize all or part of the requirements of the types and the quantities of the fruits and vegetables corresponding to the customer orders, the distribution centers contained in the distribution environment are further divided, and the distribution centers meeting the requirements are screened, so that resources are saved for planning a path when the customer orders are distributed to target addresses, in addition, the second target distribution centers are extracted from the one or more second target distribution centers, and the following operations are carried out on the extracted second target distribution centers: the invention relates to a method for preparing a distribution route, which comprises the steps of planning a shortest distribution route based on an extracted second target distribution center and a distribution destination point to obtain a distribution route, calculating target energy consumption of the distribution route by utilizing a pre-built first energy consumption relation and a target distribution vehicle, utilizing the target energy consumption to obtain ideal energy consumption, utilizing a plurality of first target distribution centers and target addresses to draw three distribution schemes, utilizing the first energy consumption relation, a pre-built second energy consumption relation and the three distribution schemes to obtain combined energy consumption, obtaining the distribution energy consumption based on the ideal energy consumption and the combined energy consumption, and obtaining a distribution route corresponding to the distribution energy consumption to obtain the target route. Therefore, the method, the device, the electronic equipment and the computer readable storage medium for optimizing the path of agricultural product transportation mainly aim to solve the problem of resource waste caused by joint distribution of multiple distribution centers.
Example 2:
fig. 2 is a schematic structural diagram of an electronic device for implementing a path optimization method for transporting agricultural products according to an embodiment of the present invention.
The electronic device 1 may comprise a processor 10, a memory 11, a bus 12 and a communication interface 13, and may further comprise a computer program stored in the memory 11 and executable on the processor 10, such as a path optimization program for transportation of agricultural products.
The memory 11 includes at least one type of readable storage medium, including flash memory, a mobile hard disk, a multimedia card, a card memory (e.g., SD or DX memory, etc.), a magnetic memory, a magnetic disk, an optical disk, etc. The memory 11 may in some embodiments be an internal storage unit of the electronic device 1, such as a removable hard disk of the electronic device 1. The memory 11 may in other embodiments also be an external storage device of the electronic device 1, such as a plug-in mobile hard disk, a smart memory card (SmartMediaCard, SMC), a secure digital (SecureDigital, SD) card, a flash card (FlashCard) or the like, provided on the electronic device 1. Further, the memory 11 may also include both an internal storage unit and an external storage device of the electronic device 1. The memory 11 may be used not only for storing application software installed in the electronic device 1 and various types of data such as codes of path optimization programs for transportation of agricultural products, but also for temporarily storing data that has been output or is to be output.
The processor 10 may be comprised of integrated circuits in some embodiments, for example, a single packaged integrated circuit, or may be comprised of multiple integrated circuits packaged with the same or different functions, including one or more central processing units (CentralProcessingunit, CPU), microprocessors, digital processing chips, graphics processors, a combination of various control chips, and the like. The processor 10 is a control unit (control unit) of the electronic device, connects respective parts of the entire electronic device using various interfaces and lines, and executes various functions of the electronic device 1 and processes data by running or executing programs or modules (e.g., path optimization programs for agricultural product transportation, etc.) stored in the memory 11, and calling data stored in the memory 11.
The bus may be an Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The bus may be classified as an address bus, a data bus, a control bus, etc. The bus is arranged to enable a connection communication between the memory 11 and at least one processor 10 etc.
Fig. 2 shows only an electronic device with components, it being understood by a person skilled in the art that the structure shown in fig. 2 does not constitute a limitation of the electronic device 1, and may comprise fewer or more components than shown, or may combine certain components, or may be arranged in different components.
For example, although not shown, the electronic device 1 may further include a power source (such as a battery) for supplying power to each component, and preferably, the power source may be logically connected to the at least one processor 10 through a power management device, so that functions of charge management, discharge management, power consumption management, and the like are implemented through the power management device. The power supply may also include one or more of any of a direct current or alternating current power supply, recharging device, power failure detection circuit, power converter or inverter, power status indicator, etc. The electronic device 1 may further include various sensors, bluetooth modules, wi-Fi modules, etc., which will not be described herein.
Further, the electronic device 1 may also comprise a network interface, optionally the network interface may comprise a wired interface and/or a wireless interface (e.g. WI-FI interface, bluetooth interface, etc.), typically used for establishing a communication connection between the electronic device 1 and other electronic devices.
The electronic device 1 may optionally further comprise a user interface, which may be a Display, an input unit, such as a Keyboard (Keyboard), or a standard wired interface, a wireless interface. Alternatively, in some embodiments, the display may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, an OLED (organic light-emitting diode) touch, or the like. The display may also be referred to as a display screen or display unit, as appropriate, for displaying information processed in the electronic device 1 and for displaying a visual user interface.
It should be understood that the embodiments described are for illustrative purposes only and are not limited to this configuration in the scope of the patent application.
The path optimization program for the transportation of agricultural products stored in the memory 11 of the electronic device 1 is a combination of instructions that, when executed in the processor 10, can implement:
receiving a customer order, acquiring a target address serving as a delivery terminal point and the types and the numbers of fruits and vegetables corresponding to the customer order based on the customer order, and confirming a delivery environment, wherein the delivery environment comprises: a plurality of distribution centers as distribution start points, each of the plurality of distribution centers including a plurality of vehicles for distribution;
Screening a plurality of delivery centers to obtain a plurality of target delivery centers, and obtaining a plurality of first target delivery centers and one or a plurality of second target delivery centers by using the plurality of target delivery centers, wherein the plurality of first target delivery centers comprise fruit and vegetable types corresponding to customer orders, the first target delivery centers cannot meet the requirements of the customer orders, and at least one target delivery center exists in any one of the plurality of first target delivery centers, so that the fruit and vegetable types and the fruit and vegetable numbers contained in the two target delivery centers can meet the requirements of the customer orders, and the fruit and vegetable types and the fruit and vegetable numbers contained in the second target delivery centers can meet the requirements of the customer orders;
utilizing the fruit and vegetable types and the fruit and vegetable quantity corresponding to the customer orders to confirm a target delivery vehicle for delivery from the plurality of delivery vehicles;
extracting second target distribution centers from the one or more second target distribution centers, and performing the following operations on each extracted second target distribution center:
planning a path with the shortest delivery distance based on the extracted second target delivery center and delivery destination to obtain a delivery path, and calculating target energy consumption of the delivery path by utilizing a pre-constructed first energy consumption relation and a target delivery vehicle;
Summarizing the target energy consumption to obtain a target energy consumption set, and acquiring ideal energy consumption by using the target energy consumption set;
three distribution schemes are drawn by utilizing a plurality of first target distribution centers and target addresses, and the combined energy consumption is obtained by utilizing a first energy consumption relational expression, a pre-constructed second energy consumption relational expression and the three distribution schemes;
and acquiring the distribution energy consumption based on the ideal energy consumption and the combined energy consumption, acquiring a target path by using the distribution energy consumption, and driving the vehicle for distribution to finish distribution according to the target path.
Specifically, the specific implementation method of the above instruction by the processor 10 may refer to descriptions of related steps in the corresponding embodiments of fig. 1 to 2, which are not repeated herein.
Further, the modules/units integrated in the electronic device 1 may be stored in a computer readable storage medium if implemented in the form of software functional units and sold or used as separate products. The computer readable storage medium may be volatile or nonvolatile. For example, the computer readable medium may include: any entity or device capable of carrying the computer program code, a recording medium, a U disk, a removable hard disk, a magnetic disk, an optical disk, a computer memory, a Read-only memory (ROM).
The present invention also provides a computer readable storage medium storing a computer program which, when executed by a processor of an electronic device, can implement:
receiving a customer order, acquiring a target address serving as a delivery terminal point and the types and the numbers of fruits and vegetables corresponding to the customer order based on the customer order, and confirming a delivery environment, wherein the delivery environment comprises: a plurality of distribution centers as distribution start points, each of the plurality of distribution centers including a plurality of vehicles for distribution;
screening a plurality of delivery centers to obtain a plurality of target delivery centers, and obtaining a plurality of first target delivery centers and one or a plurality of second target delivery centers by using the plurality of target delivery centers, wherein the plurality of first target delivery centers comprise fruit and vegetable types corresponding to customer orders, the first target delivery centers cannot meet the requirements of the customer orders, and at least one target delivery center exists in any one of the plurality of first target delivery centers, so that the fruit and vegetable types and the fruit and vegetable numbers contained in the two target delivery centers can meet the requirements of the customer orders, and the fruit and vegetable types and the fruit and vegetable numbers contained in the second target delivery centers can meet the requirements of the customer orders;
Utilizing the fruit and vegetable types and the fruit and vegetable quantity corresponding to the customer orders to confirm a target delivery vehicle for delivery from the plurality of delivery vehicles;
extracting second target distribution centers from the one or more second target distribution centers, and performing the following operations on each extracted second target distribution center:
planning a path with the shortest delivery distance based on the extracted second target delivery center and delivery destination to obtain a delivery path, and calculating target energy consumption of the delivery path by utilizing a pre-constructed first energy consumption relation and a target delivery vehicle;
summarizing the target energy consumption to obtain a target energy consumption set, and acquiring ideal energy consumption by using the target energy consumption set;
three distribution schemes are drawn by utilizing a plurality of first target distribution centers and target addresses, and the combined energy consumption is obtained by utilizing a first energy consumption relational expression, a pre-constructed second energy consumption relational expression and the three distribution schemes;
and acquiring the distribution energy consumption based on the ideal energy consumption and the combined energy consumption, acquiring a target path by using the distribution energy consumption, and driving the vehicle for distribution to finish distribution according to the target path.
The modules described as separate components may or may not be physically separate, and components shown as modules may or may not be physical units, may be located in one place, or may be distributed over multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional module in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units can be realized in a form of hardware or a form of hardware and a form of software functional modules.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential characteristics thereof.
Finally, it should be noted that the above-mentioned embodiments are merely for illustrating the technical solution of the present invention and not for limiting the same, and although the present invention has been described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that modifications and equivalents may be made to the technical solution of the present invention without departing from the spirit and scope of the technical solution of the present invention.

Claims (10)

1. A method of path optimization for the delivery of agricultural products, the method comprising:
receiving a customer order, acquiring a target address serving as a delivery terminal point and the types and the numbers of fruits and vegetables corresponding to the customer order based on the customer order, and confirming a delivery environment, wherein the delivery environment comprises: a plurality of distribution centers as distribution start points, each of the plurality of distribution centers including a plurality of vehicles for distribution;
Screening a plurality of delivery centers to obtain a plurality of target delivery centers, and obtaining a plurality of first target delivery centers and one or a plurality of second target delivery centers by using the plurality of target delivery centers, wherein the plurality of first target delivery centers comprise fruit and vegetable types corresponding to customer orders, the first target delivery centers cannot meet the requirements of the customer orders, and at least one target delivery center exists in any one of the plurality of first target delivery centers, so that the fruit and vegetable types and the fruit and vegetable numbers contained in the two target delivery centers can meet the requirements of the customer orders, and the fruit and vegetable types and the fruit and vegetable numbers contained in the second target delivery centers can meet the requirements of the customer orders;
utilizing the fruit and vegetable types and the fruit and vegetable quantity corresponding to the customer orders to confirm a target delivery vehicle for delivery from the plurality of delivery vehicles;
extracting second target distribution centers from the one or more second target distribution centers, and performing the following operations on each extracted second target distribution center:
planning a path with the shortest delivery distance based on the extracted second target delivery center and delivery destination to obtain a delivery path, and calculating target energy consumption of the delivery path by utilizing a pre-constructed first energy consumption relation and a target delivery vehicle;
Summarizing the target energy consumption to obtain a target energy consumption set, and acquiring ideal energy consumption by using the target energy consumption set;
three distribution schemes are drawn by utilizing a plurality of first target distribution centers and target addresses, and the combined energy consumption is obtained by utilizing a first energy consumption relational expression, a pre-constructed second energy consumption relational expression and the three distribution schemes;
and acquiring the distribution energy consumption based on the ideal energy consumption and the combined energy consumption, acquiring a target path by using the distribution energy consumption, and driving the vehicle for distribution to finish distribution according to the target path.
2. The method for optimizing the path of transportation of agricultural products according to claim 1, wherein said screening a plurality of distribution centers to obtain a plurality of target distribution centers comprises:
sequentially extracting distribution centers from the plurality of distribution centers, and performing the following operations on each of the extracted distribution centers:
the fruit and vegetable types and the corresponding quantity of each fruit and vegetable contained in the distribution center are regulated to obtain a reference fruit and vegetable set;
judging whether the extracted distribution center is a target distribution center or not based on the reference fruit and vegetable set and the fruit and vegetable types and the fruit and vegetable numbers corresponding to the customer orders;
if the reference fruit and vegetable set does not contain any fruit and vegetable in the customer order or contains one or more fruits and vegetables in the customer order, and the number corresponding to the one or more fruits and vegetables in the customer order is zero, eliminating the extracted distribution center;
Otherwise, reserving the extracted distribution center;
and summarizing the reserved distribution centers to obtain a plurality of target distribution centers.
3. The method for optimizing the path of agricultural product transport according to claim 2, wherein the acquiring a plurality of first target distribution centers and one or more second target distribution centers using a plurality of target distribution centers includes:
dividing the plurality of target distribution centers by using a pre-constructed constraint condition to obtain a plurality of first target distribution centers and one or more second target distribution centers, wherein the constraint condition is as follows:
wherein,for the->The number of fruits and vegetables corresponds to the number of the fruits and vegetables>Representing +.>The target distribution center includes the first +.>The number of seeds and fruits;
if the number of fruits and vegetables corresponding to the types of fruits and vegetables contained in the target distribution center can meet the constraint condition, confirming that the target distribution center is a second reference distribution center;
otherwise, confirming the target distribution center as a first reference distribution center;
summarizing the first reference distribution center and the second reference distribution center respectively to obtain a first reference distribution center set and a second reference distribution center set;
A plurality of first target distribution centers and one or more second target distribution centers are acquired based on the first reference distribution center set and the second reference distribution center set.
4. The method for optimizing the path of agricultural product transport according to claim 3, wherein the acquiring a plurality of first target distribution centers and one or more second target distribution centers based on the first reference distribution center set and the second reference distribution center set includes:
sequentially extracting second reference distribution centers from the second reference distribution center set, and performing the following operations on the extracted second reference distribution centers:
acquiring a second reference path of the second reference distribution center for distribution based on the extracted second reference distribution center and target address, wherein the second reference path is the path with the shortest distance when the second reference distribution center distributes the fruit and vegetable types and the fruit and vegetable numbers corresponding to the customer orders, and acquiring the distance required by the second reference path to acquire a second reference distance;
summarizing the second reference distances, and sequencing the second reference distances according to the sequence from small to large to obtain a second reference distance sequence, and obtaining a first second reference distance in the second reference distance sequence to obtain a first screening distance;
Acquiring the longitude and the latitude of the target address, obtaining the target longitude and the target latitude, sequentially extracting a first reference distribution center from the first reference distribution center set, and executing the following operations on the extracted first reference distribution centers:
the method comprises the steps of obtaining the extracted reference longitude and reference latitude of a first reference distribution center, and calculating the linear distance between the target distribution center and a target address based on a pre-constructed linear distance calculation formula, a target longitude, a target latitude, the reference longitude and the reference latitude, wherein the linear distance calculation formula is as follows:
wherein,representing the straight line distance between the extracted first reference distribution center and the target address, +.>、/>Respectively representing the equatorial radius of the earth and the bipolar radius of the earth, < ->Representing the target latitude +.>Representing the reference latitude>For target longitude +.>Representing a reference longitude;
summarizing the linear distances to obtain a linear distance set, and sequencing the linear distance set according to the sequence from small to large to obtain a linear distance sequence;
acquiring an e-th linear distance in a linear distance sequence based on the number of f preset first target distribution centers, wherein f=e, and comparing the e-th linear distance with the first screening distance;
If the first screening distance is greater than or equal to the e-th linear distance, setting the first screening distance as a distance threshold, comparing the linear distance in the linear distance sequence with the distance threshold, if the linear distance is less than or equal to the distance threshold, reserving a first reference distribution center corresponding to the linear distance, otherwise, eliminating the first reference distribution center corresponding to the linear distance, and summarizing the reserved first reference distribution center and one or more second reference distribution centers to obtain a plurality of first target distribution centers and one or more second target distribution centers;
and if the first screening distance is smaller than the e-th linear distance, acquiring a second reference distance in the second reference distance sequence based on the second reference distance sequence to obtain a second screening distance, and screening the first reference distribution center set and the second reference distribution center set based on the second screening distance after confirming that the second screening distance is larger than or equal to the e-th linear distance to obtain a plurality of first target distribution centers and one or more second target distribution centers.
5. The agricultural product transportation path optimization method of claim 1, wherein the identifying the target delivery vehicle for delivery using the fruit and vegetable type and the fruit and vegetable quantity corresponding to the customer order comprises:
Calculating the distribution volume of fruits and vegetables by using the types and the quantities of the fruits and vegetables corresponding to the customer orders, wherein the calculation formula is as follows:
wherein,for the dispensing volume of fruits and vegetables, <' > is->Representing customer order placeCorresponding->Dispensing volume of seed fruit and vegetable, ->Representing common +.>Planting fruits and vegetables;
and acquiring a target delivery vehicle based on the delivery volume of the fruits and vegetables.
6. The path optimization method for agricultural product transportation according to claim 1, wherein the first energy consumption relation is as follows:
wherein,representing the energy consumption consumed when dispensing by the dispensing center,/->Indicating the first of the distribution centers used in distributionFixed cost of the seed vehicle,/->Indicate->Unit cost of the seed vehicle while driving, < >>Indicate->Cost consumed per unit time when seed vehicles store fruits and vegetables, < >>Distance travelled for delivery of the vehicle, +.>The representation is based on +.>Average speed of the vehicle when dispensing is performed, +.>Representing +.>The damage coefficient of fruits and vegetables, wherein the damage coefficient is related to the time required for distribution,/and/or>Representing +.>The number of fruits and vegetables and the number of fruits and vegetables are increased>The number of fruit and vegetable types corresponding to the customer orders is contained in the distribution center when the distribution center performs distribution.
7. The path optimization method for agricultural product transportation according to claim 6, wherein the second energy consumption relation is as follows:
wherein,represents the energy consumption generated by the second delivery center when delivering fruits and vegetables based on the two delivery centers,/->Representing the fixed cost of delegation of the target delivery vehicle, < >>Representing unit cost of the target delivery vehicle while driving, < > for>Representing the cost consumed per unit time when the target delivery vehicle stores the fruit and vegetable, < >>Distance travelled for the target delivery vehicle, +.>Representing the average speed of the target delivery vehicle when delivery is performed,/->Representing the second loading of fruit and vegetable, the first distribution center is at the first +>Breaking coefficient of seed fruits and vegetables, < >>Indicating the kind of fruits and vegetables loaded based on the second distribution center, < > or->Indicating the loading of the second distribution center based on the +.>Seed fruit and vegetableQuantity of->Indicate->The breakage coefficient of fruits and vegetables.
8. The method for optimizing the path of agricultural product transport according to claim 1, wherein said planning three distribution schemes using a plurality of first target distribution centers and target addresses comprises:
sequentially extracting first target distribution centers from the plurality of first target distribution centers, and performing the following operations on all the extracted first target distribution centers:
Acquiring a supplementary fruit and vegetable set based on the fruit and vegetable types and the fruit and vegetable quantity corresponding to the customer orders and the fruit and vegetable types and the fruit and vegetable quantity corresponding to the called first target distribution center;
confirming a supplementary vehicle and one or more supplementary delivery centers by using a supplementary fruit and vegetable set, wherein the supplementary delivery center is a first target delivery center or a second target delivery center which meets the demand of a customer order with the first target delivery center, and acquiring a supplementary path according to the one or more supplementary delivery centers and the extracted first target delivery center, wherein the supplementary path is the shortest path between the one or more supplementary delivery centers and the extracted first target delivery center, and three delivery schemes are planned based on the supplementary delivery center corresponding to the supplementary path and the extracted first target delivery center, wherein the three delivery schemes are as follows:
the first distribution scheme is as follows: the supplementary distribution center and the first target distribution center distribute to the target addresses respectively;
and a second distribution scheme: the method comprises the steps that after a supplementary distribution center distributes supplementary fruit and vegetable sets to a first target distribution center, the supplementary fruit and vegetable sets are distributed to target addresses based on the first target distribution center;
and a delivery scheme III: the first target distribution center distributes the types and the quantity of fruits and vegetables contained in the first target distribution center to the supplementary distribution center, and then the supplementary distribution center distributes the fruits and vegetables to the target address;
And acquiring the combined energy consumption based on the first energy consumption relation, the second energy consumption relation, the supplementary path and the three distribution schemes.
9. The method for optimizing the path for transporting agricultural products according to claim 8, wherein the acquiring the joint energy consumption based on the first energy consumption relation, the second energy consumption relation, the supplementary path and the three distribution schemes comprises:
extracting a first distribution scheme from the three distribution schemes, and calculating first scheme energy consumption based on the first distribution scheme and a first energy consumption relational expression;
extracting a second distribution scheme from the three distribution schemes, and calculating second scheme energy consumption based on the second distribution scheme, the supplementary path, the first energy consumption relational expression and the second energy consumption relational expression;
extracting a third distribution scheme from the three distribution schemes, and calculating the energy consumption of a third scheme based on the third distribution scheme, the supplementary path, the first energy consumption relational expression and the second energy consumption relational expression;
and acquiring combined energy consumption based on the first scheme energy consumption, the second scheme energy consumption and the third scheme energy consumption, wherein the combined energy consumption is the minimum energy consumption among the first scheme energy consumption, the second scheme energy consumption and the third scheme energy consumption corresponding to the plurality of first target distribution centers.
10. The method for optimizing the path for transporting agricultural products according to claim 9, wherein said calculating the first scenario energy consumption based on the first delivery scenario and the first energy consumption relation comprises:
calculating the delivery volume of the concentrated supplementary fruits and vegetables based on the concentrated supplementary fruits and vegetables, and confirming a supplementary vehicle according to the delivery volume of the concentrated supplementary fruits and vegetables;
calculating the energy consumption required by the supplementary distribution center to distribute to the target address according to the supplementary route, the supplementary vehicle and the first energy consumption relation, and obtaining supplementary energy consumption;
confirming a first target delivery vehicle by utilizing the fruit and vegetable types and the quantity of the customer orders corresponding to the first target delivery center;
calculating the energy consumption required by the first target distribution center to distribute to the target address according to the distribution path, the first target distribution vehicle and the first energy consumption relation, and obtaining first target energy consumption;
and summing the supplementary energy consumption and the first target energy consumption to obtain the first scheme energy consumption.
CN202311342034.4A 2023-10-17 2023-10-17 Agricultural product conveying path optimization method Active CN117078150B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311342034.4A CN117078150B (en) 2023-10-17 2023-10-17 Agricultural product conveying path optimization method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311342034.4A CN117078150B (en) 2023-10-17 2023-10-17 Agricultural product conveying path optimization method

Publications (2)

Publication Number Publication Date
CN117078150A true CN117078150A (en) 2023-11-17
CN117078150B CN117078150B (en) 2024-02-09

Family

ID=88717672

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311342034.4A Active CN117078150B (en) 2023-10-17 2023-10-17 Agricultural product conveying path optimization method

Country Status (1)

Country Link
CN (1) CN117078150B (en)

Citations (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109544056A (en) * 2018-10-12 2019-03-29 广州快批信息科技有限公司 A kind of automatic cargo allocation method, electronic equipment and storage medium
CN109816294A (en) * 2017-11-22 2019-05-28 上海德启信息科技有限公司 A kind of determination method and apparatus of shipping room
CN112308685A (en) * 2020-11-24 2021-02-02 上海百胜软件股份有限公司 Control system and method for full channel order, electronic equipment and storage medium
CN112329970A (en) * 2020-04-14 2021-02-05 北京沃东天骏信息技术有限公司 Order information processing method and device, computer equipment and medium
CN112700177A (en) * 2019-10-22 2021-04-23 北京京东振世信息技术有限公司 Warehouse selection method and device for transporting transportation center and storage medium
CN113239317A (en) * 2021-05-11 2021-08-10 北京沃东天骏信息技术有限公司 Method and device for determining order fulfillment warehouse
CN113420928A (en) * 2021-06-30 2021-09-21 上海东普信息科技有限公司 Order scheduling method, device, equipment and storage medium
CN114692960A (en) * 2022-03-16 2022-07-01 武汉理工大学 Vehicle path planning method and system with cooperation of oil consumption and optimal path
CN116071004A (en) * 2023-02-23 2023-05-05 北京全网数商科技股份有限公司 Order processing method and device, electronic equipment and storage medium
CN116307332A (en) * 2023-05-16 2023-06-23 武汉大学人民医院(湖北省人民医院) Real-time medicine distribution method and device
CN116341765A (en) * 2023-05-24 2023-06-27 南京新桐数字科技有限公司 Automatic order source searching and splitting method and system
CN116862372A (en) * 2023-07-04 2023-10-10 康键信息技术(深圳)有限公司 Order splitting method and device, storage medium and computer equipment

Patent Citations (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109816294A (en) * 2017-11-22 2019-05-28 上海德启信息科技有限公司 A kind of determination method and apparatus of shipping room
CN109544056A (en) * 2018-10-12 2019-03-29 广州快批信息科技有限公司 A kind of automatic cargo allocation method, electronic equipment and storage medium
CN112700177A (en) * 2019-10-22 2021-04-23 北京京东振世信息技术有限公司 Warehouse selection method and device for transporting transportation center and storage medium
CN112329970A (en) * 2020-04-14 2021-02-05 北京沃东天骏信息技术有限公司 Order information processing method and device, computer equipment and medium
CN112308685A (en) * 2020-11-24 2021-02-02 上海百胜软件股份有限公司 Control system and method for full channel order, electronic equipment and storage medium
CN113239317A (en) * 2021-05-11 2021-08-10 北京沃东天骏信息技术有限公司 Method and device for determining order fulfillment warehouse
CN113420928A (en) * 2021-06-30 2021-09-21 上海东普信息科技有限公司 Order scheduling method, device, equipment and storage medium
CN114692960A (en) * 2022-03-16 2022-07-01 武汉理工大学 Vehicle path planning method and system with cooperation of oil consumption and optimal path
CN116071004A (en) * 2023-02-23 2023-05-05 北京全网数商科技股份有限公司 Order processing method and device, electronic equipment and storage medium
CN116307332A (en) * 2023-05-16 2023-06-23 武汉大学人民医院(湖北省人民医院) Real-time medicine distribution method and device
CN116341765A (en) * 2023-05-24 2023-06-27 南京新桐数字科技有限公司 Automatic order source searching and splitting method and system
CN116862372A (en) * 2023-07-04 2023-10-10 康键信息技术(深圳)有限公司 Order splitting method and device, storage medium and computer equipment

Also Published As

Publication number Publication date
CN117078150B (en) 2024-02-09

Similar Documents

Publication Publication Date Title
WO2021208950A1 (en) Order information processing method and apparatus, computer device and medium
WO2017040942A1 (en) Method and apparatus for processing logistics path information
CN107220796A (en) A kind of kinds of goods transportation resources of distributors and device
CN110765340A (en) Logistics information management system and method
CN109840729B (en) Method and system for positioning bin, storage medium and electronic equipment
CN111292030A (en) Bin selection method and device and computer readable storage medium
CN107292724A (en) A kind of automatic generation method of order, device and server
WO2020241002A1 (en) Operation assistance method, operation assistance system, and electric vehicle
CN111126688B (en) Distribution route determining method, distribution route determining device, electronic equipment and readable storage medium
US20110047000A1 (en) Shipment flow validation systems and methods
CN110826944A (en) Order processing method and device, electronic equipment and medium
CN109345166B (en) Method and apparatus for generating information
CN112396368A (en) Distribution route planning method and system and server equipment
US20160275428A1 (en) Systems and methods for replenishment in a freight tethering environment
CN112686516A (en) Distribution equipment battery replacement management method and device and electronic equipment
CN117078150B (en) Agricultural product conveying path optimization method
US20150248638A1 (en) Methods and arrangement for freight transportation management
CN111507664B (en) Method and device for crossing goods
CN114239977A (en) Method, device, equipment and storage medium for determining estimated delivery time length
CN116151723B (en) Multiple metering method and system for comprehensive grain reserve base
CN113408987B (en) Intelligent distribution and management method for logistics
CN116596429A (en) Material transportation path determining method and material transportation path determining device
CN116864088A (en) Community medical resource real-time regulation and control method and device based on Internet of things
CN115409439A (en) Multi-vehicle type supply chain scheduling method based on improved ant colony algorithm and electronic equipment
CN107679656A (en) A kind of order distribution route generation method and device

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