CN111985792B - Cold chain transport vehicle load balancing order arranging method and device and electronic equipment - Google Patents

Cold chain transport vehicle load balancing order arranging method and device and electronic equipment Download PDF

Info

Publication number
CN111985792B
CN111985792B CN202010751966.4A CN202010751966A CN111985792B CN 111985792 B CN111985792 B CN 111985792B CN 202010751966 A CN202010751966 A CN 202010751966A CN 111985792 B CN111985792 B CN 111985792B
Authority
CN
China
Prior art keywords
vehicle
order
merchant
exchange
result
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202010751966.4A
Other languages
Chinese (zh)
Other versions
CN111985792A (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.)
China Foreign Transport Co ltd
Original Assignee
China Foreign Transport 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 China Foreign Transport Co ltd filed Critical China Foreign Transport Co ltd
Priority to CN202010751966.4A priority Critical patent/CN111985792B/en
Publication of CN111985792A publication Critical patent/CN111985792A/en
Application granted granted Critical
Publication of CN111985792B publication Critical patent/CN111985792B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06313—Resource planning in a project environment
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G06Q10/0832—Special goods or special handling procedures, e.g. handling of hazardous or fragile goods

Abstract

The embodiment of the invention provides a method and a device for ordering load balance of a cold chain transport vehicle and electronic equipment, wherein the method comprises the following steps: allowing any vehicle A in the preliminary single sorting result to adopt an iterative exchange mode η Sequentially trying to exchange orders with the rest n vehicles, taking the nth order exchange result as the order arranging result of the load balancing of the cold chain transport vehicle, and using vehicle A η With vehicle A of the remaining n vehicles k When trying to make the kth order exchange, the service constraint condition and the total cost reduction condition need to be considered, if the two conditions are satisfied at the same time, the order exchange is successful, and the order exchange result is taken as the vehicle A η And vehicle A k If at least one of the two conditions is not satisfied, maintaining the last exchange of the order result, and the total cost is composed of the number of the vehicle load and the balance cost participation. The method, the device and the electronic equipment provided by the embodiment of the invention realize automatic adjustment of the vehicle list during cold chain transportation so as to achieve vehicle load balance.

Description

Cold chain transport vehicle load balancing order arranging method and device and electronic equipment
Technical Field
The invention relates to the technical field of cold chain transportation, in particular to a method and a device for arranging a bill for load balancing of a cold chain transportation vehicle and electronic equipment.
Background
Cold chain food transportation mainly relates to daily distribution of cold chain food to a certain number of merchants in cities, wherein the cold chain food comprises food and raw materials which are easy to deteriorate at normal temperature and need to be transported by refrigerated vehicles, such as refrigerated drinks, dairy products, fruit juice, fruits, ice cream, chocolate and the like. The cold chain food transportation needs to arrange the required vehicle quantity and the merchant quantity and sequence of each vehicle delivery according to the types and the number of the articles required to be delivered by each merchant, the reserved delivery time, the merchant address, the area where the merchant is located, the unloading time of the merchant and other factors.
Generally, a plurality of merchants with relatively close distances are spliced and loaded on a vehicle to be intensively distributed according to the area of the merchants, but because the cold chain food transportation involves a plurality of types of articles, the number of articles to be distributed by each merchant may be greatly different, so that the number of articles loaded between different vehicles is greatly different and is not balanced. The number of general carried articles is directly related to the charge of the transportation driver, so that unbalanced number of the carried articles can cause unbalanced income of the driver, and the problem of driver management is generated. Therefore, when the vehicle is loaded, the requirement of balancing the number of the vehicle loads is considered, and the situation that the number of partial vehicle loads is too large, the number of other vehicle loads is too small and the loading rate is too low is avoided as far as possible, so that the service income of each driver is balanced and ensured.
When the cold chain food transportation is manually ordered and dispatched, the cold chain food transportation is mainly operated based on personal experience and habit, and different schedulers have different ordering methods, so that ordering standards are not uniform.
In the specific order arranging process, as a plurality of factors are needed to be considered, including the types and the number of the articles required to be distributed by each merchant, the reserved distribution time, the merchant address, the area where the merchant is located, the unloading time of the merchant and the like, the merchant is generally manually divided according to the areas so as to reduce the complexity of order arranging, and then the order arranging is carried out for the merchants in each area. Typically, the division is performed manually according to administrative regions of a city, for example, a merchant in a certain city may be divided into regions according to administrative regions.
Then, for the merchants in each area, the merchants with close distances or consistent delivery directions, i.e. forward paths, are manually arranged on the same line and assigned to a vehicle for delivery. Since cold chain food transportation and distribution merchants typically have a daily distribution demand, a person will secure a line that includes a plurality of merchants, distribution orders, and corresponding transportation vehicles and drivers covered by the line.
However, the number of articles to be delivered by different merchants may be greatly different, and the number of articles to be delivered per day may also have relatively large fluctuation, which may cause a large difference in the total number of delivered articles between different lines, or a large difference in the number of articles in the same line on different days, which may cause imbalance in the number of loads and the loading rate of corresponding vehicles, and may cause situations in which the loading rate of some vehicles is too high and the loading rate of other vehicles is too low, or situations in which the loading rate of one vehicle is very high for some days and the loading rate of the other vehicle is too low for some days.
In the face of such imbalance, the manual effort is limited by the complexity of order placement, and it is difficult to effectively make further adjustments to improve the imbalance condition, because changing merchants between different lines to attempt balancing requires ensuring that new lines still meet the distribution aging requirements of each merchant, and there are many possibilities for such changing, but the manual effort cannot accurately calculate and compare the effects of each possibility, and it is difficult to ensure that new lines still meet the aging requirements after changing, so the result of manual final order placement is still often the case of imbalance in the number of vehicle loads.
Therefore, how to avoid the situation that the number of the vehicle loads is unbalanced due to the fact that the conventional manual ordering of the cold chain transportation cannot accurately calculate and compare each possibility is still a problem to be solved by the person skilled in the art.
Disclosure of Invention
The embodiment of the invention provides a method, a device and electronic equipment for arranging a load balance of a cold chain transport vehicle, which are used for solving the problem that the number of the vehicle loads is unbalanced because the existing manual arrangement of the cold chain transport vehicle cannot accurately calculate and compare each possibility.
In a first aspect, an embodiment of the present invention provides a method for load balancing a cold chain transport vehicle, including:
determining a preliminary ordering result of the cold chain transport vehicle;
based on the preliminary ranking results, any vehicle in the preliminary ranking results is selectedWith the rest n vehicles { A 1 ，A 2 ，…，A n Sequentially trying to exchange orders, and taking an nth order exchange result as an order arranging result of load balancing of the cold chain transport vehicle, wherein n is a positive integer;
wherein any one of the vehiclesWith the rest n vehicles { A 1 ，A 2 ，…，A n Sequentially trying to exchange orders, and specifically including:
for vehiclesWith vehicle A of the remaining n vehicles k In an attempt to make the kth order exchange, where k=1, 2, …, n,
if there is a vehicleWith vehicle A k The order exchange mode between the two modes is that the single fruit arranged after the order exchange mode is adopted meets the constraint condition and the value of the total cost function is reduced compared with the value before the order exchange mode is adopted, and the exchange result of the order exchange mode is taken as the vehicle->And vehicle A k The order result of the (2) is recorded as the k order exchange result;
if there is no vehicleWith vehicle A k The order exchange mode between the two modes is that the single fruit arranged after the order exchange mode is adopted meets the constraint condition or the value of the total cost function is reduced compared with the value before the order exchange mode is adopted, the vehicle is->Vehicle A maintains the last exchange order results k Maintaining the original order, and recording as a kth order exchange result;
the overall cost function is made up of vehicle load number balancing cost participation.
Preferably, in the method, the overall cost function is composed of a vehicle load number balancing cost participation, and specifically includes:
the overall cost function is constructed based on line mileage costs, vehicle costs, unassigned order costs, and vehicle load number balancing costs.
Preferably, in the method, the overall cost function is formed based on line mileage cost, vehicle cost, unassigned order cost and vehicle load number balancing cost, and specifically includes:
the overall cost function B is determined by the following formula:
；
wherein,for the line mileage cost, < >>For the cost of the vehicle->Cost for unassigned order, +.>Cost balancing for the number of vehicle loads, < >>、/>、/>And->Dividing the weighted coefficients into corresponding cost items;
；
where M is the set of all vehicles, m= { a 1 ，A 2 ，…，A n , M represents the mth vehicle in set M, Q is the set of all the required shipping merchant addresses, +.>For the distance of merchant i to merchant j, +.>Whether vehicle m passes the side of merchant i to merchant j, if so,/or->=1, if not, add>=0；/>Fixed cost for vehicle m; p is the set of all orders and,unassigned costs for order s; />For the loading of vehicle m>Is the average load of all vehicles.
Preferably, in the method, the constraint condition specifically includes:
each merchant requires the type and number of items to be dispensed, the time of the reserved dispensing, the merchant address, the area in which the merchant is located, the length of the loading and unloading, and the load of the vehicle.
Preferably, in the method, the determining the preliminary ordering result of the cold chain transport vehicle specifically includes:
generating an initial line by adopting a large-scale neighborhood search algorithm to the original merchant vehicle data;
the original merchant vehicle data comprises an order number, a merchant number, a reservation time window, a merchant number, a merchant address, an area where the merchant is located, a merchant longitude and latitude, a vehicle model, a vehicle number, a vehicle carrying capacity and a distance matrix between merchants.
In a second aspect, an embodiment of the present invention provides a billing device for load balancing of a cold chain transport vehicle, which is characterized by comprising:
a determining unit for determining a preliminary ranking result of the cold chain transport vehicle;
an equalizing unit, configured to base on the preliminary ranking result, any vehicle in the preliminary ranking resultWith the rest n vehicles { A 1 ，A 2 ，…，A n Sequentially trying to exchange orders, and taking an nth order exchange result as an order arranging result of load balancing of the cold chain transport vehicle, wherein n is a positive integer;
wherein any one of the vehiclesWith the rest n vehicles { A 1 ，A 2 ，…，A n Sequentially trying to exchange orders, and specifically including:
for vehiclesWith vehicle A of the remaining n vehicles k In an attempt to make the kth order exchange, where k=1, 2, …, n,
if there is a vehicleWith vehicle A k The order exchange mode between the two modes is that the single fruit arranged after the order exchange mode is adopted meets the constraint condition and the value of the total cost function is reduced compared with the value before the order exchange mode is adopted, and the exchange result of the order exchange mode is taken as the vehicle->And vehicle A k The order result of the (2) is recorded as the k order exchange result;
if there is no vehicleWith vehicle A k The order exchange mode between the two modes is that the single fruit arranged after the order exchange mode is adopted meets the constraint condition or the value of the total cost function is reduced compared with the value before the order exchange mode is adopted, the vehicle is->Vehicle A maintains the last exchange order results k Maintaining the original order, and recording as a kth order exchange result;
the overall cost function is made up of vehicle load number balancing cost participation.
Preferably, in the device, the overall cost function is composed of a vehicle load number balancing cost participation, and specifically includes:
the overall cost function is constructed based on line mileage costs, vehicle costs, unassigned order costs, and vehicle load number balancing costs.
Preferably, in the apparatus, the overall cost function is formed based on line mileage cost, vehicle cost, unassigned order cost and vehicle load number balancing cost, and specifically includes:
the overall cost function B is determined by the following formula:
；
wherein,for the line mileage cost, < >>For the cost of the vehicle->Cost for unassigned order, +.>Cost balancing for the number of vehicle loads, < >>、/>、/>And->Dividing the weighted coefficients into corresponding cost items;
；
where M is the set of all vehicles, m= { a 1 ，A 2 ，…，A n , M represents the mth vehicle in set M, Q is the set of all the required shipping merchant addresses, +.>For the distance of merchant i to merchant j, +.>Whether vehicle m passes the side of merchant i to merchant j, if so,/or->=1, if not, add>=0；/>Fixed cost for vehicle m; p is the set of all orders and,unassigned costs for order s; />For the loading of vehicle m>Is the average load of all vehicles.
In a third aspect, an embodiment of the present invention provides an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the ordering device for load balancing of a cold chain transport vehicle as provided in the first aspect when the program is executed.
In a fourth aspect, embodiments of the present invention provide a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of the ordering apparatus for cold chain transport vehicle load balancing as provided in the first aspect.
The method, the device and the electronic equipment provided by the embodiment of the invention enable any vehicle in the preliminary single sorting result by adopting an iterative exchange mode to the preliminary single sorting resultWith the rest n vehicles { A 1 ，A 2 ，…，A n Sequentially tasting between }Taking the nth order exchange result as the order arranging result of the cold chain transport vehicle load balancing, wherein the vehicle +.>With vehicle A of the remaining n vehicles k When the kth order exchange is tried, the service constraint condition and the total cost reduction condition need to be considered, if the two conditions are met at the same time, the order exchange is successful, and the order exchange result is taken as the vehicle +.>And vehicle A k If at least one of the two conditions is not fulfilled, vehicle +.>Vehicle A maintains the last exchange order results k The original order is maintained and the overall cost is constituted by the number of vehicle loads balancing cost participation. Therefore, the automatic adjustment attempt to the vehicles with fewer loads in the preliminary order arranging result is realized, and each iterative adjustment attempt considers the total cost and the business constraint condition formed by the participation of the balancing cost of the number of the loads of the vehicles, so that the adjusted order can meet the business requirement and realize the load balancing. The method, the device and the electronic equipment provided by the embodiment of the invention realize automatic adjustment of the vehicle list during cold chain transportation so as to achieve vehicle load balance.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, a brief description will be given below of the drawings required for the embodiments or the prior art descriptions, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a schematic flow chart of a method for load balancing of a cold chain transport vehicle according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a load balancing unit for a cold chain transport vehicle according to an embodiment of the present invention;
fig. 3 is a schematic entity structure diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments of the present invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without any inventive effort, are intended to be within the scope of the invention.
The existing manual unilateral arrangement method for cold chain transportation generally has the problem that the number of vehicle loads is unbalanced because each possibility cannot be accurately calculated and compared. In this regard, the embodiment of the invention provides a billing method for load balancing of a cold chain transport vehicle. Fig. 1 is a schematic flow chart of a method for load balancing of a cold chain transport vehicle according to an embodiment of the present invention, as shown in fig. 1, the method includes:
at step 110, a preliminary ordering result for the cold chain transport vehicle is determined.
In particular, there are various methods of determining the preliminary ranking of the cold chain transport vehicle, which may be manual wire-laying or generated by various wire-optimizing algorithms, and are not particularly limited herein. The determined preliminary order results allocate respective orders for each vehicle, and respective order delivery orders.
Step 120, based on the preliminary ranking result, selecting any vehicle from the preliminary ranking resultWith the rest n vehicles { A 1 ，A 2 ，…，A n Sequentially trying to exchange orders, and taking an nth order exchange result as an order arranging result of load balancing of the cold chain transport vehicle, wherein n is a positive integer; wherein, any one of the vehicles is +.>With the rest n vehicles { A 1 ，A 2 ，…，A n Sequentially trying to exchange orders, and specifically including: for vehicle->With vehicle A of the remaining n vehicles k When a kth order exchange is attempted, where k=1, 2, …, n, if a vehicle is present +.>With vehicle A k The order exchange mode between the two modes is that the single fruit arranged after the order exchange mode is adopted meets the constraint condition and the value of the total cost function is reduced compared with the value before the order exchange mode is adopted, and the exchange result of the order exchange mode is taken as the vehicle->And vehicle A k The order result of the (2) is recorded as the k order exchange result; if there is no vehicle +>With vehicle A k The order exchange mode between the two modes is that the single fruit arranged after the order exchange mode is adopted meets the constraint condition or the value of the total cost function is reduced compared with the value before the order exchange mode is adopted, the vehicle is->Vehicle A maintains the last exchange order results k Maintaining the original order, and recording as a kth order exchange result; the overall cost function is made up of vehicle load number balancing cost participation.
Specifically, any one of n+1 vehicles in the preliminary order arranging results is selected, order exchange is sequentially attempted between the vehicle and the rest n vehicles, and the nth order exchange result is used as an order arranging result of load balancing of the cold chain transport vehicle, wherein n is a positive integer. Such as for the vehicleWith the remaining n vehicles { A 1 ，A 2 ，…，A n Kth vehicle a in } k Vehicle +.>Original e orders are placed on the kth vehicle A k There are f orders, e and f are positive integers, vehicle +.>Any order and kth vehicle A k Any order exchange is marked as vehicle +.>With the kth vehicle A k Is an order exchange mode of (1), thus, vehicle +.>With the kth vehicle A k There is->An order exchange mode. For vehicle->With vehicle A of the remaining n vehicles k When order exchange is attempted, the above ++are attempted in turn>If the currently attempted order exchange method satisfies the constraint condition of the single fruit arranged after the order exchange method and the numerical value of the total cost function is reduced compared with that before the order exchange method, the exchange result of the order exchange method is taken as a vehicle>And vehicle A k Is recorded as the order exchange result of the kth order and stops the continuous vehicle trialSum vehicleVehicle A k Other order exchange methods between; if all +.>After the order exchange mode is adopted, no exchange mode exists, so that the single fruit arranged after the order exchange mode can simultaneously meet the constraint condition and the numerical value of the total cost function is reduced compared with that before the order exchange mode is adopted, and the vehicle is->Vehicle A maintains the last exchange order results k The original order is maintained and recorded as the k order exchange result. />With the remaining n vehicles { A 1 ，A 2 ，…，A n Each vehicle in the order exchange attempts are sequentially carried out, and the kth exchange attempt is the vehicle +.>With vehicle A k Exchange attempt between, k order exchange result is vehicle +.>With vehicle A k Exchange results obtained by adopting a plurality of order exchange modes and capable of being successfully exchanged or traversing all +.>The maintained k-1 order exchange results cannot be successfully exchanged after the order exchange mode. The overall cost function is composed of the number of vehicle loads and the balancing cost of the number of vehicle loads, which is obtained based on a load balancing index obtained from a variance value of the number of vehicle loads. The variance value of the number of vehicle loads is converted into a penalty value and added to the overall cost function, so that when the variance value of the number of vehicle loads increases due to unbalanced vehicle loads, the overall cost function increases as a penalty value.
Embodiments of the present invention provideBy using the method of (1) to make any vehicle in the preliminary ordering result by adopting an iterative exchange modeWith the rest n vehicles { A 1 ，A 2 ，…，A n Sequentially trying to exchange orders, and taking the nth order exchange result as the order arranging result of cold chain transport vehicle load balancing, wherein the vehicles are ∈ ->With vehicle A of the remaining n vehicles k When the kth order exchange is tried, the service constraint condition and the total cost reduction condition need to be considered, if the two conditions are met at the same time, the order exchange is successful, and the order exchange result is taken as the vehicle +.>And vehicle A k If at least one of the two conditions is not fulfilled, vehicle +.>Vehicle A maintains the last exchange order results k The original order is maintained and the overall cost is constituted by the number of vehicle loads balancing cost participation. Therefore, the automatic adjustment attempt to the vehicles with fewer loads in the preliminary order arranging result is realized, and each iterative adjustment attempt considers the total cost and the business constraint condition formed by the participation of the balancing cost of the number of the loads of the vehicles, so that the adjusted order can meet the business requirement and realize the load balancing. The method provided by the embodiment of the invention realizes automatic adjustment of the vehicle list during cold chain transportation so as to achieve vehicle load balance.
Based on the above embodiment, in the method, the overall cost function is composed of a vehicle load number balancing cost participation, and specifically includes:
the overall cost function is constructed based on line mileage costs, vehicle costs, unassigned order costs, and vehicle load number balancing costs.
Specifically, the overall cost function needs to consider line mileage costs, vehicle costs, and unassigned order costs in addition to considering whether the vehicle load balances and thus introducing vehicle load number balancing costs. The vehicle load number balancing cost is obtained based on a load balancing index, and the load balancing index is obtained according to a variance value of the vehicle load number. Converting the variance value of the number of the vehicle loads into a penalty value and adding the penalty value to the overall cost function, so that when the variance value of the number of the vehicle loads is increased due to unbalanced vehicle loads, the overall cost function is increased as the penalty value; the line mileage cost is to calculate the total mileage of all distribution lines; the vehicle cost calculates the total maintenance cost of all vehicles participating in distribution, wherein the maintenance cost comprises maintenance cost and fuel cost; the unallocated order costs calculate the cost of loss and fleet reputation reduction costs incurred by unallocated orders to merchants.
Based on any of the above embodiments, in the method, the overall cost function is formed based on line mileage cost, vehicle cost, unassigned order cost, and vehicle load number balancing cost, and specifically includes:
the overall cost function B is determined by the following formula:
；
wherein,for the line mileage cost, < >>For the cost of the vehicle->Cost for unassigned order, +.>Cost balancing for the number of vehicle loads, < >>、/>、/>And->Dividing the weighted coefficients into corresponding cost items;
；
where M is the set of all vehicles, m= { a 1 ，A 2 ，…，A n , M represents the mth vehicle in set M, Q is the set of all the required shipping merchant addresses, +.>For the distance of merchant i to merchant j, +.>Whether vehicle m passes the side of merchant i to merchant j, if so,/or->=1, if not, add>=0；/>Fixed cost for vehicle m; p is the set of all orders and,unassigned costs for order s; />For the loading of vehicle m>Is the average load of all vehicles.
Specifically, the overall cost function B is defined by the line mileage costVehicle cost->Unassigned order cost->And vehicle load number balancing cost->Respectively weighted values are added, wherein the line mileage cost is +.>The corresponding weighting coefficient is +.>Line mileage cost->The corresponding weighting coefficient is +.>Line mileage cost->The corresponding weighting coefficient is +.>Line mileage cost->The corresponding weighting coefficient is +.>. But->、/>、/>And->The calculation method of (2) is described by the following formula:
；
where M is the set of all vehicles, m= { a 1 ，A 2 ，…，A n , M represents the mth vehicle in set M, Q is the set of all the required shipping merchant addresses, +.>For the distance of merchant i to merchant j, +.>For whether vehicle m passes the side of merchant i to merchant j, which represents the line of the address of merchant i to the address of merchant j, if so,/>=1, if not, add>=0；/>Fixed cost for vehicle m; p is the aggregate of all orders, +.>Unassigned costs for order s; />For the loading of vehicle m>Is the average load of all vehicles.
Based on any one of the foregoing embodiments, in the method, the constraint condition specifically includes:
each merchant requires the type and number of items to be dispensed, the time of the reserved dispensing, the merchant address, the area in which the merchant is located, the length of the loading and unloading, and the load of the vehicle.
Specifically, when judging whether the single-row fruits after order exchange meet constraint conditions or not in order exchange, considering whether the single-row fruits meet the requirements of the types and the numbers of the articles required to be delivered by each merchant, the requirement of reserved delivery time, the requirement of merchant addresses, the requirement of areas where merchants are located, the requirement of loading and unloading duration and the requirement of vehicle loading capacity or not. Only if the requirements are met at the same time, the ordering result after order exchange meets the constraint condition, and if at least one of the requirements cannot be met, the ordering result after order exchange does not meet the constraint condition.
Based on any one of the above embodiments, in the method, determining the preliminary ordering result of the cold chain transport vehicle specifically includes:
generating an initial line and an order allocation scheme by adopting a large-scale neighborhood search algorithm to the original merchant vehicle data;
the original merchant vehicle data comprises an order number, a merchant number, a reservation time window, a merchant number, a merchant address, an area where the merchant is located, a merchant longitude and latitude, a vehicle model, a vehicle number, a vehicle carrying capacity and a distance matrix between merchants.
Specifically, a large-scale neighborhood search algorithm is adopted for original merchant vehicle data, and an initial line and an order allocation scheme are generated from near to far according to the distance from an issuing point to serve as an initial ordering result, wherein the original merchant vehicle data comprises an order number, a merchant number, a reservation time window, a merchant number, a merchant address, an area where a merchant is located, longitude and latitude of the merchant, a vehicle model number, a vehicle carrying capacity and a distance matrix among merchants.
In a second aspect, an embodiment of the present invention provides a cold chain transport vehicle load balancing order arranging device, and fig. 2 is a schematic structural diagram of the cold chain transport vehicle load balancing order arranging device provided in the embodiment of the present invention. As shown in fig. 2, the apparatus includes a determining unit 210 and an equalizing unit 220, wherein,
the determining unit is used for determining a preliminary ordering result of the cold chain transport vehicle;
an equalizing unit, configured to base on the preliminary ranking result, any vehicle in the preliminary ranking resultWith the rest n vehicles { A 1 ，A 2 ，…，A n Sequentially trying to exchange orders, and taking an nth order exchange result as an order arranging result of load balancing of the cold chain transport vehicle, wherein n is a positive integer;
wherein any one of the vehiclesWith the rest n vehicles { A 1 ，A 2 ，…，A n Sequentially trying to exchange orders, and specifically including:
for vehiclesWith vehicle A of the remaining n vehicles k In an attempt to make the kth order exchange, where k=1, 2, …, n,
if there is a vehicleWith vehicle A k The order exchange mode between the two modes is that the single fruit arranged after the order exchange mode is adopted meets the constraint condition and the value of the total cost function is reduced compared with the value before the order exchange mode is adopted, and the exchange result of the order exchange mode is taken as the vehicle->And vehicle A k Is recorded as the kth order resultExchanging results of orders;
if there is no vehicleWith vehicle A k The order exchange mode between the two modes is that the single fruit arranged after the order exchange mode is adopted meets the constraint condition or the value of the total cost function is reduced compared with the value before the order exchange mode is adopted, the vehicle is->Vehicle A maintains the last exchange order results k Maintaining the original order, and recording as a kth order exchange result;
the overall cost function is made up of vehicle load number balancing cost participation.
The device provided by the embodiment of the invention enables any vehicle in the preliminary single sorting result by adopting an iterative exchange modeWith the rest n vehicles { A 1 ，A 2 ，…，A n Sequentially trying to exchange orders, and taking the nth order exchange result as the order arranging result of cold chain transport vehicle load balancing, wherein the vehicles are ∈ ->With vehicle A of the remaining n vehicles k When the kth order exchange is tried, the service constraint condition and the total cost reduction condition need to be considered, if the two conditions are met at the same time, the order exchange is successful, and the order exchange result is taken as the vehicle +.>And vehicle A k If at least one of the two conditions is not fulfilled, vehicle +.>Vehicle A maintains the last exchange order results k Maintaining the original order while the overall cost is participated by the vehicle load number balancing costThe composition is formed. Therefore, the automatic adjustment attempt to the vehicles with fewer loads in the preliminary order arranging result is realized, and each iterative adjustment attempt considers the total cost and the business constraint condition formed by the participation of the balancing cost of the number of the loads of the vehicles, so that the adjusted order can meet the business requirement and realize the load balancing. The device provided by the embodiment of the invention realizes automatic adjustment of the vehicle list during cold chain transportation so as to achieve vehicle load balance.
Based on any one of the above embodiments, in the device, the overall cost function is composed of a vehicle load number balancing cost participation, and specifically includes:
the overall cost function is constructed based on line mileage costs, vehicle costs, unassigned order costs, and vehicle load number balancing costs.
Based on any of the above embodiments, in the apparatus, the overall cost function is configured based on a line mileage cost, a vehicle cost, an unassigned order cost, and a vehicle load number balancing cost, and specifically includes:
the overall cost function B is determined by the following formula:
；
wherein,for the line mileage cost, < >>For the cost of the vehicle->Cost for unassigned order, +.>Cost balancing for the number of vehicle loads, < >>、/>、/>And->Dividing the weighted coefficients into corresponding cost items;
；
where M is the set of all vehicles, m= { a 1 ，A 2 ，…，A n , M represents the mth vehicle in set M, Q is the set of all the required shipping merchant addresses, +.>For the distance of merchant i to merchant j, +.>Whether vehicle m passes the side of merchant i to merchant j, if so,/or->=1, if not, add>=0；/>Fixed cost for vehicle m; p is the set of all orders and,unassigned costs for order s; />For the loading of vehicle m>For all vehiclesAverage loading of (c) in the conveyor belt.
Based on any one of the foregoing embodiments, in the apparatus, the constraint condition specifically includes:
each merchant requires the type and number of items to be dispensed, the time of the reserved dispensing, the merchant address, the area in which the merchant is located, the length of the loading and unloading, and the load of the vehicle.
Based on any one of the above embodiments, in the apparatus, the determining the preliminary ordering result of the cold chain transport vehicle specifically includes:
generating an initial line and an order allocation scheme by adopting a large-scale neighborhood search algorithm to the original merchant vehicle data;
the original merchant vehicle data comprises an order number, a merchant number, a reservation time window, a merchant number, a merchant address, an area where the merchant is located, a merchant longitude and latitude, a vehicle model, a vehicle number, a vehicle carrying capacity and a distance matrix between merchants.
Fig. 3 is a schematic physical structure of an electronic device according to an embodiment of the present invention, where, as shown in fig. 3, the electronic device may include: processor 301, communication interface (Communications Interface) 302, memory (memory) 303 and communication bus 304, wherein processor 301, communication interface 302, memory 303 accomplish the communication between each other through communication bus 304. The processor 301 may invoke a computer program stored in the memory 303 and executable on the processor 301 to perform the method of load balancing of the cold chain transport vehicle provided by the above embodiments, including, for example: determining a preliminary ordering result of the cold chain transport vehicle; based on the preliminary ranking results, any vehicle in the preliminary ranking results is selectedWith the rest n vehicles { A 1 ，A 2 ，…，A n Sequentially trying to exchange orders, and taking an nth order exchange result as an order arranging result of load balancing of the cold chain transport vehicle, wherein n is a positive integer; wherein, any one of the vehicles is +.>With the rest n vehicles { A 1 ，A 2 ，…，A n Sequentially trying to exchange orders, and specifically including: for vehicle->With vehicle A of the remaining n vehicles k When a kth order exchange is attempted, where k=1, 2, …, n, if a vehicle is present +.>With vehicle A k The order exchange mode between the two modes is that the single fruit arranged after the order exchange mode is adopted meets the constraint condition and the value of the total cost function is reduced compared with the value before the order exchange mode is adopted, and the exchange result of the order exchange mode is taken as the vehicle->And vehicle A k The order result of the (2) is recorded as the k order exchange result; if there is no vehicle +>With vehicle A k The order exchange mode between the two modes is that the single fruit arranged after the order exchange mode is adopted meets the constraint condition or the value of the total cost function is reduced compared with the value before the order exchange mode is adopted, the vehicle is->Vehicle A maintains the last exchange order results k Maintaining the original order, and recording as a kth order exchange result; the overall cost function is made up of vehicle load number balancing cost participation.
Further, the logic instructions in the memory 303 may be implemented in the form of software functional units and stored in a computer readable storage medium when sold or used as a stand alone product. Based on such understanding, the technical solution of the embodiments of the present invention may be embodied in essence or a part contributing to the prior art or a part of the technical solution, in the form of a software product stored in a storage medium, including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
Embodiments of the present invention also provide a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, is implemented to perform the method of load balancing of a cold chain transport vehicle provided by the above embodiments, for example, including: determining a preliminary ordering result of the cold chain transport vehicle; based on the preliminary ranking results, any vehicle in the preliminary ranking results is selectedWith the rest n vehicles { A 1 ，A 2 ，…，A n Sequentially trying to exchange orders, and taking an nth order exchange result as an order arranging result of load balancing of the cold chain transport vehicle, wherein n is a positive integer; wherein, any one of the vehicles is +.>With the rest n vehicles { A 1 ，A 2 ，…，A n Sequentially trying to exchange orders, and specifically including: for vehiclesWith vehicle A of the remaining n vehicles k When a kth order exchange is attempted, where k=1, 2, …, n, if a vehicle is present +.>With vehicle A k The order exchange mode between the two modes is that the single fruit arranged after the order exchange mode is adopted meets the constraint condition and the numerical value of the total cost function is compared with that after the order exchange mode is adoptedPreviously lowered, the exchange result of the order exchange mode is taken as vehicle + ->And vehicle A k The order result of the (2) is recorded as the k order exchange result; if there is no vehicle +>With vehicle A k The order exchange mode between the two modes is that the single fruit arranged after the order exchange mode is adopted meets the constraint condition or the value of the total cost function is reduced compared with the value before the order exchange mode is adopted, the vehicle is->Vehicle A maintains the last exchange order results k Maintaining the original order, and recording as a kth order exchange result; the overall cost function is made up of vehicle load number balancing cost participation.
The system embodiments described above are merely illustrative, wherein the elements illustrated as separate elements may or may not be physically separate, and the elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
From the above description of the embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus necessary general hardware platforms, or of course may be implemented by means of hardware. Based on this understanding, the foregoing technical solution may be embodied essentially or in a part contributing to the prior art in the form of a software product, which may be stored in a computer readable storage medium, such as ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method described in the respective embodiments or some parts of the embodiments.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and are not limiting; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims (6)

1. A method for load balancing of a cold chain transport vehicle, comprising:
determining a preliminary ordering result of the cold chain transport vehicle;
based on the preliminary ranking results, any vehicle in the preliminary ranking results is selectedWith the rest n vehicles { A 1 ，A 2 ，…，A n Sequentially trying to exchange orders, and taking an nth order exchange result as an order arranging result of load balancing of the cold chain transport vehicle, wherein n is a positive integer;
wherein any one of the vehiclesWith the rest n vehicles { A 1 ，A 2 ，…，A n Sequentially trying to exchange orders, and specifically including:
for vehiclesWith vehicle A of the remaining n vehicles k In an attempt to make the kth order exchange, where k=1, 2, …, n,
if there is a vehicleWith vehicle A k The order exchange mode between the two modes is that the single fruit arranged after the order exchange mode is adopted meets the constraint condition and the value of the total cost function is reduced compared with the value before the order exchange mode is adopted, and the exchange result of the order exchange mode is taken as the vehicle->And vehicle A k The order result of the (2) is recorded as the k order exchange result;
if there is no vehicleWith vehicle A k The order exchange mode between the two modes is that the single fruit arranged after the order exchange mode is adopted meets the constraint condition or the value of the total cost function is reduced compared with the value before the order exchange mode is adopted, the vehicle is->Vehicle A maintains the last exchange order results k Maintaining the original order, and recording as a kth order exchange result;
the overall cost function B is determined by the following formula:
；
wherein,for the line mileage cost, < >>For the cost of the vehicle->Cost for unassigned order, +.>Cost balancing for the number of vehicle loads, < >>、/>、/>And->Dividing the weighted coefficients into corresponding cost items;
；
where M is the set of all vehicles, m= { a 1 ，A 2 ，…，A n , M represents the mth vehicle in set M, Q is the set of all the required shipping merchant addresses, +.>For the distance of merchant i to merchant j, +.>Whether vehicle m passes the side of merchant i to merchant j, if so,/or->=1, if not, add>=0；/>Fixed cost for vehicle m; p is the aggregate of all orders, +.>Unassigned costs for order s; />For the loading of vehicle m>Is the average load of all vehicles.
2. The method for load balancing of cold chain transport vehicles according to claim 1, wherein the constraints specifically include:
each merchant requires the type and number of items to be dispensed, the time of the reserved dispensing, the merchant address, the area in which the merchant is located, the length of the loading and unloading, and the load of the vehicle.
3. The method for ordering cold chain transport vehicle load balancing according to claim 1, wherein determining the preliminary ordering result of the cold chain transport vehicle specifically comprises:
generating an initial line and an order allocation scheme by adopting a large-scale neighborhood search algorithm to the original merchant vehicle data;
the original merchant vehicle data comprises an order number, a merchant number, a reservation time window, a merchant number, a merchant address, an area where the merchant is located, a merchant longitude and latitude, a vehicle model, a vehicle number, a vehicle carrying capacity and a distance matrix between merchants.
4. A cold chain transport vehicle load balancing ordering apparatus, comprising:
a determining unit for determining a preliminary ranking result of the cold chain transport vehicle;
an equalizing unit, configured to base on the preliminary ranking result, any vehicle in the preliminary ranking resultWith the rest n vehicles { A 1 ，A 2 ，…，A n Sequentially trying to exchange orders, and taking an nth order exchange result as an order arranging result of load balancing of the cold chain transport vehicle, wherein n is a positive integer;
wherein any one of the vehiclesWith the rest n vehicles { A 1 ，A 2 ，…，A n Sequentially trying to exchange orders, and specifically including:
for vehiclesWith vehicle A of the remaining n vehicles k In an attempt to make the kth order exchange, where k=1, 2, …, n,
if there is a vehicleWith vehicle A k The order exchange mode between the two modes is that the single fruit arranged after the order exchange mode is adopted meets the constraint condition and the value of the total cost function is reduced compared with the value before the order exchange mode is adopted, and the exchange result of the order exchange mode is taken as the vehicle->And vehicle A k The order result of the (2) is recorded as the k order exchange result;
if there is no vehicleWith vehicle A k The order exchange mode between the two modes is that the single fruit arranged after the order exchange mode is adopted meets the constraint condition or the value of the total cost function is reduced compared with the value before the order exchange mode is adopted, the vehicle is->Maintaining the last order exchange result, and vehicleVehicle A k Maintaining the original order, and recording as a kth order exchange result;
the overall cost function B is determined by the following formula:
；
wherein,for the line mileage cost, < >>For the cost of the vehicle->Cost for unassigned order, +.>Cost balancing for the number of vehicle loads, < >>、/>、/>And->Dividing the weighted coefficients into corresponding cost items;
；
where M is the set of all vehicles, m= { a 1 ，A 2 ，…，A n , }，mRepresenting the mth vehicle in set M, Q is the set of all required shipping merchant addresses, +.>For the distance of merchant i to merchant j, +.>Whether vehicle m passes the side of merchant i to merchant j, if so,/or->=1, if not, add>=0；/>Fixed cost for vehicle m; p is the aggregate of all orders, +.>Unassigned costs for order s; />For the loading of vehicle m>Is the average load of all vehicles.
5. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor performs the steps of implementing the cold chain transport vehicle load balancing ordering device of any one of claims 1-3.
6. A non-transitory computer readable storage medium having stored thereon a computer program, which when executed by a processor, implements the steps of the cold chain transport vehicle load balancing ordering device of any one of claims 1-3.
CN202010751966.4A 2020-07-30 2020-07-30 Cold chain transport vehicle load balancing order arranging method and device and electronic equipment Active CN111985792B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010751966.4A CN111985792B (en) 2020-07-30 2020-07-30 Cold chain transport vehicle load balancing order arranging method and device and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010751966.4A CN111985792B (en) 2020-07-30 2020-07-30 Cold chain transport vehicle load balancing order arranging method and device and electronic equipment

Publications (2)

Publication Number Publication Date
CN111985792A CN111985792A (en) 2020-11-24
CN111985792B true CN111985792B (en) 2023-12-29

Family

ID=73444736

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010751966.4A Active CN111985792B (en) 2020-07-30 2020-07-30 Cold chain transport vehicle load balancing order arranging method and device and electronic equipment

Country Status (1)

Country Link
CN (1) CN111985792B (en)

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TW200802148A (en) * 2006-01-10 2008-01-01 Lg Chemical Ltd Method for optimal multi-vehicle dispatch and system for the same
EP2525309A1 (en) * 2011-05-16 2012-11-21 motiondrive AG Stationary or mobile system for providing consumer goods, in particular fresh and frozen foods
CN103226801A (en) * 2013-03-19 2013-07-31 天津市市政工程设计研究院 Airport collecting and distributing traffic volume determination method based on multi-user assignment model
CN105512747A (en) * 2015-11-25 2016-04-20 安吉汽车物流有限公司 Intelligent optimized scheduling system for logistics
CN108921472A (en) * 2018-06-30 2018-11-30 华南理工大学 A kind of two stages vehicle and goods matching method of multi-vehicle-type
CN109559062A (en) * 2019-01-07 2019-04-02 大连理工大学 A kind of task distribution of cooperative logistical problem and paths planning method
CN109636002A (en) * 2018-11-13 2019-04-16 深圳大学 A kind of site selecting method and system of the Cold Chain Logistics home-delivery center based on goods damage
CN110390409A (en) * 2018-04-17 2019-10-29 北京京东尚科信息技术有限公司 The determination method, apparatus and computer readable storage medium of distribution project
CN110580546A (en) * 2019-08-26 2019-12-17 安徽师范大学 route planning method and system based on same vehicle carrier and goods
CN111160690A (en) * 2019-11-15 2020-05-15 杭州拼便宜网络科技有限公司 Vehicle loading planning method and device and storage medium

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150269521A1 (en) * 2014-03-21 2015-09-24 Amazon Technologies, Inc. Route scheduling of multi-class transport vehicles

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TW200802148A (en) * 2006-01-10 2008-01-01 Lg Chemical Ltd Method for optimal multi-vehicle dispatch and system for the same
EP2525309A1 (en) * 2011-05-16 2012-11-21 motiondrive AG Stationary or mobile system for providing consumer goods, in particular fresh and frozen foods
CN103226801A (en) * 2013-03-19 2013-07-31 天津市市政工程设计研究院 Airport collecting and distributing traffic volume determination method based on multi-user assignment model
CN105512747A (en) * 2015-11-25 2016-04-20 安吉汽车物流有限公司 Intelligent optimized scheduling system for logistics
CN110390409A (en) * 2018-04-17 2019-10-29 北京京东尚科信息技术有限公司 The determination method, apparatus and computer readable storage medium of distribution project
CN108921472A (en) * 2018-06-30 2018-11-30 华南理工大学 A kind of two stages vehicle and goods matching method of multi-vehicle-type
CN109636002A (en) * 2018-11-13 2019-04-16 深圳大学 A kind of site selecting method and system of the Cold Chain Logistics home-delivery center based on goods damage
CN109559062A (en) * 2019-01-07 2019-04-02 大连理工大学 A kind of task distribution of cooperative logistical problem and paths planning method
CN110580546A (en) * 2019-08-26 2019-12-17 安徽师范大学 route planning method and system based on same vehicle carrier and goods
CN111160690A (en) * 2019-11-15 2020-05-15 杭州拼便宜网络科技有限公司 Vehicle loading planning method and device and storage medium

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
城市冷链物流配送路径优化研究;富佳;《中国优秀硕士学位论文全文库 工程科技I辑》(第03期);全文 *
基于城市配送平台的订单与车辆匹配优化策略;李建斌;徐礼平;梅启煌;陈利;;工业工程与管理(06);全文 *
多车型冷链物流配送车辆的路径优化;孙国华;屈冉冉;;山东财经大学学报(03);全文 *
电子商务中订单配送优化模型及两阶段算法;李琳;刘士新;唐加福;;系统工程学报(02);全文 *

Also Published As

Publication number Publication date
CN111985792A (en) 2020-11-24

Similar Documents

Publication Publication Date Title
CN102598034B (en) Efficient inventory management for providing distinct service qualities for multiple demand groups
CN109426885A (en) Order allocation method and device
CN112990528A (en) Logistics transportation stowage management method and device
CN110738376A (en) cloud logistics service resource optimization matching method
CN111985700B (en) Vehicle carrying bill quantity balancing method and device for determining home delivery
CN113469416B (en) Dispatching task planning method and equipment
Hezarkhani et al. Gain-sharing in urban consolidation centers
CN110544055A (en) order processing method and device
CN109377291A (en) Task price expectation method, apparatus, electronic equipment and computer storage medium
CN111950777A (en) Customized bus route design method and device
CN111626482A (en) Air freight cabin allocation method and system
CN111985792B (en) Cold chain transport vehicle load balancing order arranging method and device and electronic equipment
CN112085271A (en) Crowdsourcing mode-based traditional industry cluster goods collection path optimization method
CN110992123A (en) Order distribution method and device
CN113743854A (en) Logistics order generation method and device and storage medium
CN111062769B (en) Order dispatching method, system and storage device
Pal et al. SmartPorter: A combined perishable food and people transport architecture in smart urban areas
CN112613701A (en) Finished cigarette logistics scheduling method
CN115169739A (en) Transportation path planning method considering timeliness and discount based on logistics supply chain
CN111415075B (en) Vehicle scheduling method and device
Bergmann et al. An adaptive heuristic for Feeder Network Design with optional transshipment
CN113570169A (en) Cargo delivery planning method, cargo delivery planning device and readable storage medium
US8478665B1 (en) Vehicle ordering system
CN110874706A (en) System and method for calculating logistics cost of bulk commodities on line
CN113723680B (en) Automatic scheduling method for spare parts and components and computer equipment

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