CN113762580B - Method and device for determining logistics park for merchant - Google Patents
Method and device for determining logistics park for merchant Download PDFInfo
- Publication number
- CN113762580B CN113762580B CN202110062424.0A CN202110062424A CN113762580B CN 113762580 B CN113762580 B CN 113762580B CN 202110062424 A CN202110062424 A CN 202110062424A CN 113762580 B CN113762580 B CN 113762580B
- Authority
- CN
- China
- Prior art keywords
- merchant
- cost
- park
- logistics park
- logistics
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 51
- 238000003860 storage Methods 0.000 claims abstract description 25
- 238000012546 transfer Methods 0.000 claims description 51
- 238000012384 transportation and delivery Methods 0.000 claims description 46
- 230000005484 gravity Effects 0.000 claims description 14
- 238000004590 computer program Methods 0.000 claims description 9
- 239000000758 substrate Substances 0.000 claims 4
- 238000004364 calculation method Methods 0.000 abstract description 4
- 230000009286 beneficial effect Effects 0.000 abstract description 3
- 230000006870 function Effects 0.000 description 46
- 238000010586 diagram Methods 0.000 description 12
- 238000010276 construction Methods 0.000 description 7
- 238000004891 communication Methods 0.000 description 6
- 230000008569 process Effects 0.000 description 5
- 230000003287 optical effect Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000013439 planning Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 241000557133 Hunnemannia fumariifolia Species 0.000 description 1
- 102000002423 Octamer Transcription Factor-6 Human genes 0.000 description 1
- 108010068113 Octamer Transcription Factor-6 Proteins 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000004880 explosion Methods 0.000 description 1
- 238000011534 incubation Methods 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- 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/06311—Scheduling, planning or task assignment for a person or group
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Quality & Reliability (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- General Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Game Theory and Decision Science (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Educational Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a method and a device for determining a logistics park for a merchant, and relates to the technical field of computers. One embodiment of the method comprises the following steps: acquiring the current corresponding relation between n merchants and m logistics parks, logistics park information and operation data of the merchants, wherein n and m are natural numbers larger than 0; constructing an objective function according to logistics park information and operation data of a merchant, wherein the objective function is the difference between a first part representing the cost required for transferring the merchant from a current logistics park to the target logistics park and a second part representing the current cost of the merchant in the current logistics park; and under the constraint condition, when the objective function takes the minimum value, the obtained target corresponding relations between n merchants and m parks determine the logistics parks for the merchants according to the target corresponding relations. The embodiment is not only beneficial to saving the storage cost of the commercial tenant, but also solves the corresponding relation between the logistics park with the optimal cost and the commercial tenant at one time, thereby improving the calculation efficiency.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a method and a device for determining a logistics park for a merchant.
Background
With the explosion of the e-commerce industry, in order to improve the shopping experience of consumers (i.e., users) and reduce the operation cost of merchants, more and more merchants begin to use the warehouse logistics service of a logistics company, for example, merchants store their goods in the logistics park of the logistics company, and when users order the goods of the merchants, the goods of the merchants are distributed from the logistics park to user addresses by distribution vehicles of the logistics park. For logistics companies and merchants, how to adjust the correspondence between the merchants and the logistics park according to merchant operation data and the like after the merchants operate for a period of time is an important way to effectively reduce logistics operation cost.
In reality, a heuristic method is generally used for adjusting the correspondence between a logistics park and a merchant, for example, a combination scheme of the merchant and the logistics park is firstly generated according to constraint conditions, then corresponding logistics operation cost is calculated according to the correspondence between the logistics park and the merchant in each combination scheme, and finally a scheme with better cost is screened out in a trial-and-computation mode.
In the process of implementing the present invention, the inventor finds that at least the following problems exist in the prior art:
When the number of merchants and the number of logistics parks are large, the calculation logic is complex, and the cost of all possible schemes cannot be calculated, i.e. the scheme screened finally cannot be guaranteed to be close to the optimal solution.
Disclosure of Invention
In view of this, the embodiment of the invention provides a method and a device for determining a logistics park for a merchant, which can simultaneously consider information of the logistics park where the merchant is currently located and information of a plurality of logistics parks to which the merchant can transfer, thereby not only being beneficial to saving the storage cost of the merchant, but also solving the corresponding relation between the logistics park with optimal cost and the merchant at one time and outputting various cost data including a transfer vehicle, a distribution vehicle and the like.
To achieve the above object, according to one aspect of the embodiments of the present invention, there is provided a method for determining a logistic park for a merchant, including: acquiring the current corresponding relation between n merchants and m logistics parks, logistics park information and operation data of the merchants, wherein n and m are natural numbers larger than 0; constructing an objective function according to the logistics park information and operation data of the merchant, wherein the objective function is the difference between a first part representing the cost required for transferring the merchant from a current logistics park to a target logistics park and a second part representing the current cost of the merchant in the current logistics park, and the current logistics park and the target logistics park are one of the m logistics parks; and under the constraint condition, when the objective function takes the minimum value, determining the logistics park for the merchants according to the obtained target corresponding relations between the n merchants and the m parks.
Optionally, the method for determining a logistic park for a merchant further comprises: the first portion is determined from a first sub-function representing a transfer cost of transferring the merchant from the current logistics park to the target logistics park, a second sub-function representing a storage cost of the target logistics park, and a third sub-function representing a distribution cost of the target logistics park.
Optionally, the method for determining a logistic park for a merchant further comprises: the first sub-function is determined based on a fixed cost of the transfer vehicle and an operating cost of the transfer vehicle required to transfer the merchant from the current logistics park to the target logistics park.
Optionally, the method for determining a logistic park for a merchant further comprises: and determining the second sub-function according to the total bin area of the target logistics park used by the merchant.
Optionally, the method for determining a logistic park for a merchant further comprises: and determining the second sub-function according to the effective field area of the target logistics park used by the merchant, wherein the effective field area is determined according to whether different industries correspond to the logistics park, an area sharing coefficient and the system bin area.
Optionally, the method for determining a logistic park for a merchant further comprises: the third sub-function is determined based on a fixed cost of the delivery vehicle required to deliver the merchant's items from the target logistics park to the user, and an operating cost of the delivery vehicle.
Optionally, the method for determining a logistic park for a merchant further comprises: and determining the running cost of the delivery vehicle according to the distance between the target logistics park and the gravity center of the user, wherein the position coordinates of the gravity center of the user are determined according to the longitude and latitude of the user and the volume of the goods delivered to the user.
Optionally, the method for determining a logistic park for a merchant further comprises: the constraints include one or more of the following: the merchant only has a corresponding relation with one logistics park, the fixed cost and the running cost of the selected transfer vehicle enable the objective function to be minimum, and the fixed cost and the running cost of the selected delivery vehicle enable the objective function to be minimum.
Optionally, the method for determining a logistic park for a merchant further comprises: when the objective function is satisfied as a minimum value, one or more values of the following are also obtained: the fixed cost and running cost of the transfer vehicles, the number of transfer vehicles, the fixed cost and running cost of the distribution vehicles.
Optionally, the method for determining a logistic park for a merchant further comprises: the objective function is constructed based on a mixed integer programming model.
To achieve the above object, according to a second aspect of the embodiments of the present invention, there is provided an apparatus for determining a logistic park for a merchant, including: the data acquisition module is used for acquiring the current corresponding relation between n merchants and m logistics parks, logistics park information and operation data of the merchants, wherein n and m are natural numbers larger than 0; the model construction module is used for constructing an objective function according to the logistics park information and operation data of the merchant, wherein the objective function is the difference between a first part representing the cost required for transferring the merchant from a current logistics park to a target logistics park and a second part representing the current cost of the merchant in the current logistics park, and the current logistics park and the target logistics park are one of the m logistics parks; and the model solving module is used for determining the logistics park for the n merchants according to the obtained target corresponding relations between the n merchants and the m parks when the objective function takes the minimum value under the constraint condition.
To achieve the above object, according to a third aspect of the embodiment of the present invention, there is provided a server for determining a logistic park for a merchant, comprising: one or more processors; and a storage device for storing one or more programs that, when executed by the one or more processors, cause the one or more processors to implement the method as described in any of the methods of determining a logistic park for a merchant above.
To achieve the above object, according to a fourth aspect of embodiments of the present invention, there is provided a computer readable medium having stored thereon a computer program, characterized in that the program when executed by a processor implements a method as described in any one of the above methods for determining a logistical park for a merchant.
One embodiment of the above invention has the following advantages or benefits: because the technical means of constructing the objective function based on the mixed integer model is adopted, wherein the objective function is the difference between a first part representing the cost required for transferring the merchant from the current logistics park to the target logistics park and a second part representing the current cost of the merchant on the current logistics park, the technical problem of low calculation efficiency is solved, and the technical effects of saving the storage cost of the merchant, solving the corresponding relation between the logistics park and the merchant with the optimal cost at one time and outputting various cost data including a transfer vehicle, a delivery vehicle and the like are achieved. Further, in the invention, the moving warehouse cost, the park site cost, the personnel cost, the transfer cost, the distribution cost and the like are comprehensively considered, a mixed integer planning model with the optimal cost as a target is constructed, and the corresponding relation between the merchant and the park is optimized. In addition, when parameters, decision variables and constraint conditions are determined, various business logics are integrated, and the scales of the decision variables and the constraint are effectively reduced. Meanwhile, the restriction of the actual scene, such as rounding upwards, selecting the vehicle type which can minimize the whole cost, and the like, is considered. The invention can directly output the corresponding relation between the merchant with the optimal cost and the park, the related cost items and the like.
Further effects of the above-described non-conventional alternatives are described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
FIG. 1 illustrates correspondence between a logistic park and a merchant according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of the main flow of a method of determining a logistic park for a merchant according to an embodiment of the invention;
FIG. 3 is a schematic diagram of the primary modules of an apparatus for determining a logistical park for a merchant according to an embodiment of the present invention;
FIG. 4 is an exemplary system architecture diagram in which embodiments of the present invention may be applied;
fig. 5 is a schematic diagram of a computer system suitable for use in implementing an embodiment of the invention.
Detailed Description
Exemplary embodiments of the present invention will now be described with reference to the accompanying drawings, in which various details of the embodiments of the present invention are included to facilitate understanding, and are to be considered merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
In general, in a warehouse logistics scene, a merchant stores goods in a logistics park, and after a user orders the goods of the merchant, the user needs to use a delivery vehicle to deliver the goods of the merchant stored in the logistics park to a user address for ordering the goods. It can be seen that factors affecting the logistics cost of merchant warehouse mainly include the site fee and labor cost of the logistics park; the comprehensive distance between the receiving address of the user of the merchant and the logistics park where the merchant is located, the related cost of the delivery vehicles equipped in the logistics park, and the like, so that the corresponding relationship between the merchant and the logistics park is adjusted according to the operation data of the merchant and the logistics park, namely, the logistics park with the minimum cost is determined for the merchant, and the commodity (goods) is transferred to the logistics park for storage, management and delivery, thereby being beneficial to reducing the storage logistics cost of the merchant. In the technical scheme, the mixed integer programming model is utilized, and the new correspondence between the merchant and the logistics park is determined by taking the optimal cost as a target, namely, the logistics park with lower storage logistics cost is tried to be found for the merchant. In addition, in the present disclosure, merchants are transferred from a current logistics park to another logistics park, also referred to as a "carrousel".
Fig. 1 shows correspondence between a logistic park and a merchant according to an embodiment of the present invention. The problem addressed by the present invention as described above is how to determine the lowest cost logistics park of warehouse logistics among n logistics parks for each of m merchants. Wherein one logistics park may serve multiple merchants-e.g., logistics park 1 in fig. 1 serves merchant 1 and merchant 2, and logistics park 2 serves merchant 3, merchant 4, and merchant 5; it is also possible to serve only one merchant-for example, logistic park 3 in fig. 1 serves merchant 6; any merchant may also be temporarily not serviced-e.g., for logistical park 4 in fig. 1, there is no merchant temporarily resident. Further, merchants belonging to a logistics park can belong to an industry, such as clothing industry or fresh industry; and can also belong to different industries, for example, a logistics park can have both clothing industry merchants and fresh industry merchants. As described below, in one embodiment, the number of industry categories for a logistics park will affect the effective floor area (i.e., the floor area that counts the cost) of the logistics park used by the merchant.
Fig. 2 is a schematic diagram of the main flow of a method of determining a logistic park for a merchant according to an embodiment of the invention. As shown in fig. 2, in step S201, current correspondence between n merchants and m logistics parks, and logistics park information and operation data of the merchants are obtained, where n and m are natural numbers greater than 0.
The model of the present disclosure may be used to determine whether to transfer to one of m logistic parks for n merchants simultaneously; in the preferred embodiment, one merchant is located on only one logistics park, i.e., one merchant has a correspondence with only one logistics park. The current correspondence between merchants and logistics parks can be obtained in the following two ways: adopting the corresponding relation between the commercial tenant and the logistics park in the actual situation; or the corresponding relation between the merchant and the logistics park is arbitrarily constructed to be used as the current corresponding relation.
It will be appreciated that in order to assess whether a merchant should be transferred to another logistics park, it is necessary to learn logistics park information including, but not limited to, logistics park related data, warehouse removal cost data, distribution cost data, and operational data of the merchant including, but not limited to, merchant inventory data and merchant order data. Specifically:
logistics park related data: the use area of the merchant in the current logistics park, the unit area cost of different logistics parks and the position coordinates (such as longitude and latitude) of different logistics parks;
Merchant inventory data: monthly inventory and ex-warehouse data in the operation process of merchants;
order data for merchants: merchant ID, industry ID, city ID, location coordinates (e.g., latitude and longitude) of the order's receiving address, the volume of goods ordered by the user, etc.;
And carrying bin cost data: a cost of a commercial tenant moving warehouse, a cost of a moving vehicle (e.g., a type of a moving vehicle, and a vehicle fixing work cost and an operation cost corresponding to the type) for transferring a logistics park for the commercial tenant, in addition to the cost of the moving vehicle, wherein the moving vehicle is, for example, a large truck of 7 m 2, 9m 6, or the like;
Distribution cost data: delivery vehicle data (e.g., type of delivery vehicle, and fixed tooling costs and running costs of the vehicle for that type), distance between different campuses, for delivering goods to a user of a merchant, wherein the delivery vehicle is, for example, a minivan such as a golden cup, a facet, a IVECO, a 4.2 meter van, or the like;
In addition, it will be appreciated that model parameters such as dispensing volume limitations, dispensing distance limitations, preconfigured personnel departure rates due to bin removal, personnel incubation costs, etc. should also be obtained.
In step S202, an objective function is constructed according to the logistics park information and the operation data of the merchant, wherein the objective function is a difference between a first part representing a cost required for transferring the merchant from a current logistics park to a target logistics park and a second part representing a current cost of the merchant at the current logistics park, and the current logistics park and the target logistics park are one of the m logistics parks.
After obtaining the above logistic park information and the operation data of the merchant, the obtained initial data needs to be processed to obtain direct parameters that can be used for the objective function (i.e., model), or intermediate parameters that can be used for calculating the direct parameters. In solving the new correspondence between the business and the logistics park by using the mixed integer programming model, the meanings of the parameters used are as shown in table 1, wherein the parameters refer to the data input into the integer programming model.
TABLE 1 definition of parameters
The objective function constructed based on the mixed integer programming model is as follows:
The objective function includes two parts, the first part being defined by the sum of the subfunctions numbered [ 1], [ 2], [ 3], representing the cost required to transfer the merchant from the current logistics park to the target logistics park; and a second portion, defined by the subfunction numbered [ 4], representing a second portion of the current cost of the merchant at the current logistics park, wherein a difference between a first portion representing the cost required to transfer the merchant from the current logistics park to a target logistics park and a second portion representing the current cost of the merchant at the current logistics park is an objective function based on a mixed integer programming model. Wherein, current commodity circulation garden is with target commodity circulation garden be one among the m commodity circulation garden, current commodity circulation garden refers to the commodity circulation garden that the merchant is located at present, perhaps before solving objective function, to this commodity circulation garden that the merchant appointed, target commodity circulation garden refers to when satisfying under the later-described constraint condition objective function takes minimum, commodity circulation garden that the merchant should be located.
More specifically, the subfunction numbered [1 ], also called the first subfunction, represents the transfer cost of transferring the merchant from the current logistics park to the target logistics park, the subfunction numbered [ 2 ], also called the second subfunction, represents the storage cost of the target logistics park, and the subfunction numbered [ 3 ], also called the third subfunction, represents the distribution cost of the target logistics park.
Further, the first sub-function is determined based on a fixed cost of the transfer vehicle required to transfer the merchant from the current logistics park to the target logistics park, namely F j in the objective function, and an operating cost of the transfer vehicle, namely N i*Ci*dij in the objective function; in addition, the movement costs epsilon i of the merchant may be considered as the transfer costs of transferring the merchant from the current logistics park to the target logistics park. Wherein F j and the number delta jc of vehicles of the transportation vehicle type c required by the logistics park j and the fixed cost per vehicle of the transportation vehicle type usedRegarding the specific constraint conditions, the following are described. C i is the running cost per unit distance of the transfer vehicle type used, i.e. when the transfer vehicle type C is determined, C i is/>N i is the number of transfer vehicles to be used for the inventory of the commercial tenant when the commercial tenant i uses the transfer vehicles to carry the warehouse, and the specific definition is as shown in the table 1.
And determining the second sub-function according to the total bin area of the target logistics park used by the merchant. In order to meet the storage requirement of the commodity of the commercial tenant, the inventory area of the month with the largest commodity occupation area (namely the maximum value in the psi im) in each month of the whole year of the commercial tenant is selected as the commodity occupation area (also called as the unified warehouse area) in the park; the invention is not limited thereto, and for example, the inventory area of the quarter with the largest goods occupation area among the quarters of the whole year of the merchant may be selected as the total bin area of the merchant.
Notably, if the target logistics park of a merchant has only one industry (i.e., β j =0), the system bin area of that merchant is directly usedAs an effective site area for accounting for warehouse costs. If the campus contains multiple industries (i.e., β j =1), then a conversion is required according to the current campus area of use of the merchant, i.e., the effective site area required to account for warehouse costs is/>It is understood that the effective area in this case is (current campus area used-system warehouse area) x area sharing coefficient), and the specific meaning of each parameter is explained in table 1.
To sum up, in the second sub-functionOr/>An effective floor area of the target logistics park is defined. For the case where there is only one industry (i.e., β j =0) for the target logistics park, the area sharing coefficient/>
On the other hand, the personnel culture cost P j of the logistics park can also be considered to be the storage cost of the target logistics park.
The third sub-function is determined based on a fixed cost of the delivery vehicle required to deliver the merchant's items from the target logistics park to the user, i.e., Q j in the objective function, and an operating cost of the delivery vehicle, i.e., M j in the objective function. Wherein Q j relates to the number of users U i to which the merchant needs to deliver the goods, and the fixed cost E d of single user delivery/single delivery of delivery vehicle model d, and specific constraints are described below. M j relates to the distance between the logistics park and the center of gravity of the commercial user, and the running cost per unit distance of the delivery vehicle type d. Since the geographic locations of the customers are different, the volumes of the goods delivered for the customers are also different, and the geographic locations of the customers are closely related to the volumes of the goods and the delivery cost, in order to comprehensively consider the influence of the geographic locations of the respective customers and the volumes of the goods delivered correspondingly on the delivery cost, the comprehensive geographic locations of all the volumes of the goods delivered for all the customers are represented by the position coordinates of the gravity center points of the customers. The specific constraint condition of the position coordinates of the gravity center point of the user is determined according to the longitude and latitude of each user of the merchant and the volume of goods distributed to the user, and is described later.
On the other hand, the total cost gamma of the merchant in the current logistics park is calculated according to various fees of the merchant in the current logistics park, including the fixed cost of the transfer vehicle of the current logistics park, the storage cost of the current logistics park and the like. For example, the warehouse cost of the current logistics park can be calculated by multiplying the area of use of the merchant on the current logistics park by the unit area cost of the current logistics park; for another example, the fixed cost of the transfer vehicle for the current logistics park may be calculated by the product of the transfer vehicle required by all merchants of the park and the fixed cost per vehicle of the transfer vehicle.
In step S203, when the objective function takes the minimum value under the constraint condition, the obtained target correspondence between the n merchants and the m parks determines the logistics parks for the merchants according to the target correspondence.
When the objective function based on the mixed integer programming model takes the minimum value, besides the corresponding relation between the merchant and the objective of the logistics park, decision variables can be obtained. The decision variable refers to a variable value that is generated together when the objective function (i.e., the model) is solved to be the minimum value, that is, when the relevant variable takes the corresponding variable value, the minimum value of the objective function can be obtained. The decision variables are defined as in table 2.
TABLE 2 decision variable definition
The constraints are defined as follows:
Theta i≤Si (constraint 1)
/>
1- Βj.ltoreq.kj (constraint 16)
Wherein:
constraint (1) indicates that the merchant needs to meet constraint conditions that the merchant can adjust in a logistics park;
constraint (2) indicates that merchants can only be on one logistics park;
Constraint (3) indicates that when the merchant does not change the current logistics park area, the sum of products of the target corresponding relation between the merchant and the park and the current corresponding relation is 1; when the commercial tenant changes the current logistics park, the sum of products of the target corresponding relation between the commercial tenant and the park and the current corresponding relation is 0;
Constraint (4, 5) rounds up the number of vehicles of the transfer vehicle type needed in the logistics park. The method is that the number of the vehicles actually calculated is smaller than or equal to the upward integer and larger than or equal to the upward integer minus 1. Wherein μ is a minimum value for preventing a plurality of data rounded up when the number of actually calculated vehicles is an integer;
Constraints (6, 7, 8) obtain a fixed cost for the model of the transporter that allows the objective function to take a minimum value by using a large M method, where M big is a maximum value. The meaning is that F j in the park needs to meet the fixed cost of each vehicle model or less, and the fixed cost of each vehicle model or more minus a maximum value (when not the minimum value). The fixed cost of the transfer vehicle model is equal to the number of vehicles of the transfer vehicle model c required by the park j multiplied by the fixed cost per vehicle of the transfer vehicle model c.
Constraints (9, 10, 11) obtain the maximum merchant usage area of the campus using a large M method, where M big is a maximum. The maximum business use area of the park is required to be more than or equal to the business use area of each month of the park, and less than or equal to the business use area of each month of the park plus a maximum value (when not the maximum value). The maximum business use area of the campus corresponds to only one month of business use area.
The constraints (12, 13) indicate whether there is a need to limit the number of industries t on campus j within campus j, which is 0 when the number of industries on campus is 0, and 1 when the number of industries on campus is greater than 0. Calculating the number of industries t in a park j according to the relationship between the merchants and the industries and the corresponding relationship between the merchants and the park;
Constraints (14, 15) are obtained by using a large M method to obtain whether there are multiple industries on the campus, where M big is a maximum and μ is a minimum. The method is that when the park comprises a plurality of industries, the number of industries in the park is more than or equal to 2 and less than or equal to a maximum value.
Constraint (16) indicates that the merchant usage area needs in campus j are less than the campus usage area limit. If the target park only has one industry after the business performs park adjustment, the park area (i.e. the system warehouse area) required by the business is directly used, and if the park contains a plurality of industries, the conversion is required according to the current park use area of the business.
The constraints (17, 18, 19) obtain the maximum number of employees in the campus using a large M method, where M big is a maximum. The maximum employee number of the park is required to be more than or equal to the employee number of each month of the park, and less than or equal to the maximum value (when not the maximum value) is added to the employee number of each month of the park. The maximum number of employees in the park corresponds to only one month of employees.
The constraints (20, 21, 22) obtain a fixed cost of the delivery vehicle that allows the objective function to be minimized by using a large M method, where M big is a maximum. The fixed cost of the delivery vehicle is required to be smaller than or equal to the fixed cost of each delivery vehicle type of the park, and is larger than or equal to the fixed cost of each delivery vehicle type of the park minus a maximum value (when the fixed cost is not the minimum value). The fixed cost of the campus delivery vehicle is equal to the number of users U i to which the merchant needs to deliver the goods multiplied by the fixed cost of single user delivery/single delivery E d of delivery vehicle model d. Where D is the number of types of delivery vehicles, e.g., delivery vehicles of four types of golden cups, facets, ivek, 4.2 meters van, then d=4.
Constraints (23, 24) represent that the longitude and latitude of the center of gravity point (i.e., the geographic coordinates of the center of gravity point of the user) of the user corresponding to the campus are calculated from the longitude and latitude of the receiving address of the user of the merchant in the campus and the square quantity (volume) of the goods to be delivered. The longitude of the center of gravity of the user is: the product of the longitude of the receiving address of all users and the volume of the goods delivered thereto, and the quotient of the total volume of the goods delivered; the latitude of the center of gravity point of the user is: the product of the latitude of the receiving address of all users and the volume of the goods delivered thereto, and the quotient of the total volume of the goods delivered.
The constraints (25, 26, 27) are such that the running cost of the delivery vehicle is obtained by using a large M method that minimizes the objective function, where M big is a maximum. The running cost of the delivery vehicle is required to be equal to or less than the running cost of each delivery vehicle model in the park, and is equal to or more than the running cost of each delivery vehicle model in the park minus a maximum value (not the minimum value). Wherein the distance of the campus to the center of gravity of the user is obtained by euclidean distance calculation (constraint 25). Where D is the number of types of delivery vehicles, e.g., delivery vehicles of four types of golden cups, facets, ivek, 4.2 meters van, then d=4.
In one embodiment, the objective function may be solved using an integer programming solver (e.g., SCIP) to solve for the target correspondence of merchants to parks with the goal of minimizing costs. Typically, the solution time is about 1 hour when the number of merchants and parks is within 10.
Finally, when the objective function is satisfied as a minimum, one or more of the following values are also obtained, according to the constraints described above: the fixed cost and the running cost of the transfer vehicle can be determined, namely the used transfer vehicle type, the required number of transfer vehicles and the fixed cost and the running cost of the delivery vehicle can be determined, namely the used delivery vehicle type and the maximum number of staff in the target logistics park.
According to the method, based on the relation between the commercial tenant and the park in the logistics scene, the moving warehouse cost, the park site cost, the personnel cost, the transfer cost, the delivery cost and the like are comprehensively considered, a mixed integer planning model with the optimal cost as a target is constructed, and the corresponding relation between the commercial tenant and the park is optimized. In addition, when parameters, decision variables and constraint conditions are determined, various business logics are integrated, and the scales of the decision variables and the constraint are effectively reduced. Meanwhile, the restriction of the actual scene, such as rounding upwards, selecting the vehicle type which can minimize the whole cost, and the like, is considered. The invention can directly output the corresponding relation between the merchant with the optimal cost and the park, the related cost items and the like.
Fig. 3 is a schematic diagram of the main modules of an apparatus for determining a logistical park for a merchant according to an embodiment of the present invention. The device comprises a data acquisition module, a model construction module and a model solving module.
The data acquisition module is used for acquiring the current corresponding relation between n merchants and m logistics parks, logistics park information and operation data of the merchants, wherein n and m are natural numbers larger than 0;
the model construction module is used for constructing an objective function according to the logistics park information and operation data of the merchant, wherein the objective function is the difference between a first part representing the cost required for transferring the merchant from a current logistics park to a target logistics park and a second part representing the current cost of the merchant in the current logistics park, and the current logistics park and the target logistics park are one of the m logistics parks;
and the model solving module is used for determining the logistics park for the n merchants according to the obtained target corresponding relations between the n merchants and the m parks when the objective function takes the minimum value under the constraint condition.
Further, the model building module determines the first portion based on a first sub-function representing a transfer cost to transfer the merchant from the current logistics park to the target logistics park, a second sub-function representing a storage cost of the target logistics park, and a third sub-function representing a distribution cost of the target logistics park.
Wherein the model building module determines the first sub-function based on a fixed cost of the transfer vehicle and an operating cost of the transfer vehicle required to transfer the merchant from the current logistics park to the target logistics park.
The model building module determines the second sub-function according to the total bin area of the target logistics park used by the merchant; further, the second sub-function is determined according to the effective site area of the target logistics park used by the merchant, wherein the effective site area is determined according to whether different industries correspond to the logistics park, an area sharing coefficient and the system bin area.
The model construction module determines the third sub-function according to the fixed cost of the delivery vehicle required by delivering the goods of the merchant from the target logistics park to the user and the running cost of the delivery vehicle, and further determines the running cost of the delivery vehicle according to the distance between the target logistics park and the center of gravity of the user, wherein the geographic coordinates of the center of gravity of the user are determined according to the longitude and latitude of the user and the volume of the goods delivered to the user.
The model construction module constructs the objective function based on a mixed integer programming model.
FIG. 4 is an exemplary system architecture diagram in which embodiments of the present invention may be applied.
As shown in fig. 4, the system architecture 400 may include terminal devices 4X01, 402, 403, a network 404, and a server 405. The network 404 is used as a medium to provide communication links between the terminal devices 401, 402, 403 and the server 405. The network 404 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
A user may interact with the server 405 via the network 404 using the terminal devices 401, 402, 403 to receive or send messages or the like. The terminal devices 401, 402, 403 may have installed thereon applications that input model parameters and receive model outputs.
The terminal devices 401, 402, 403 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smartphones, tablets, laptop and desktop computers, and the like.
The server 405 may be a server providing various services, such as a background server (by way of example only) that provides support for the desiring party to input model parameters with the terminal devices 401, 402, 403 in hopes of obtaining a target correspondence of merchants to the campus. The background server can process the received corresponding relation adjustment request of the merchant and the logistics park and feed back a processing result (the corresponding relation between the recommended merchant and the logistics park) to the terminal equipment.
It should be noted that, the method for determining a logistic park for a merchant according to the embodiment of the present invention is generally executed by the server 405, and accordingly, the device for determining a logistic park for a merchant is generally disposed in the server 405.
It should be understood that the number of terminal devices, networks and servers in fig. 4 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 5, there is illustrated a schematic diagram of a computer system 500 suitable for use in implementing a terminal device or server in accordance with an embodiment of the present invention. The terminal device or server shown in fig. 5 is only an example, and should not impose any limitation on the functions and scope of use of the embodiments of the present invention.
As shown in fig. 5, the computer system 500 includes a Central Processing Unit (CPU) 501, which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. In the RAM 503, various programs and data required for the operation of the system 500 are also stored. The CPU501, ROM 502, and RAM 503 are connected to each other through a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
The following components are connected to the I/O interface 505: an input section 506 including a keyboard, a mouse, and the like; an output portion 507 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker, and the like; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The drive 510 is also connected to the I/O interface 505 as needed. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as needed so that a computer program read therefrom is mounted into the storage section 508 as needed.
In particular, according to embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication portion 509, and/or installed from the removable media 511. The above-described functions defined in the system of the present invention are performed when the computer program is executed by a Central Processing Unit (CPU) 501.
The computer readable medium shown in the present invention may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units (or "modules") involved in the embodiments of the present invention may be implemented in software or in hardware. The described unit (or "module") may also be provided in the processor, for example, it may be described as: a processor includes a transmission unit (or "module"), a data acquisition unit, a model construction unit, and a model solving unit. The names of these units do not in any way constitute a limitation of the unit itself, for example, the data acquisition unit may also be described as "unit sending parameters to the connected server".
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be present alone without being fitted into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to include: acquiring the current corresponding relation between n merchants and m logistics parks, logistics park information and operation data of the merchants, wherein n and m are natural numbers larger than 0; constructing an objective function according to the logistics park information and operation data of the merchant, wherein the objective function is the difference between a first part representing the cost required for transferring the merchant from a current logistics park to a target logistics park and a second part representing the current cost of the merchant in the current logistics park, and the current logistics park and the target logistics park are one of the m logistics parks; and under the constraint condition, when the objective function takes the minimum value, determining the logistics park for the merchants according to the obtained target corresponding relations between the n merchants and the m parks.
According to the technical scheme provided by the embodiment of the invention, based on the relation between the commercial tenant and the park in the logistics scene, the moving cost, the park site cost, the personnel cost, the transfer cost, the distribution cost and the like are comprehensively considered, a mixed integer planning model with the optimal cost as a target is constructed, and the corresponding relation between the commercial tenant and the park is optimized. In addition, when parameters, decision variables and constraint conditions are determined, various business logics are integrated, and the scales of the decision variables and the constraint are effectively reduced. Meanwhile, the restriction of the actual scene, such as rounding upwards, selecting the vehicle type which can minimize the whole cost, and the like, is considered. The invention can directly output the corresponding relation between the merchant with the optimal cost and the park, the related cost items and the like.
The above embodiments do not limit the scope of the present invention. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives can occur depending upon design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of the present invention.
Claims (12)
1. A method of determining a logistic park for a merchant, comprising:
Acquiring the current corresponding relation between n merchants and m logistics parks, logistics park information and operation data of the merchants, wherein n and m are natural numbers larger than 0;
Constructing an objective function according to the logistics park information and operation data of the merchant, wherein the objective function is the difference between a first part representing the cost required for transferring the merchant from a current logistics park to a target logistics park and a second part representing the current cost of the merchant in the current logistics park, and the current logistics park and the target logistics park are one of the m logistics parks;
Under the constraint condition, when the objective function takes the minimum value, the obtained target corresponding relations between the n merchants and the m logistics parks determine the logistics parks for the merchants according to the target corresponding relations;
the first portion represents a cost required to transfer the merchant from a current logistics park to a target logistics park, and the second portion represents a current cost of the merchant at the current logistics park; the constraints include one or more of the following: the merchant only has a corresponding relation with one logistics park, the fixed cost and the running cost of the selected transfer vehicle enable the objective function to be minimum, and the fixed cost and the running cost of the selected delivery vehicle enable the objective function to be minimum.
2. The method of claim 1, wherein the step of determining the position of the substrate comprises,
The first portion is determined from a first sub-function representing a transfer cost of transferring the merchant from the current logistics park to the target logistics park, a second sub-function representing a storage cost of the target logistics park, and a third sub-function representing a distribution cost of the target logistics park.
3. The method of claim 2, wherein the step of determining the position of the substrate comprises,
The first sub-function is determined based on a fixed cost of the transfer vehicle and an operating cost of the transfer vehicle required to transfer the merchant from the current logistics park to the target logistics park.
4. The method of claim 2, wherein the step of determining the position of the substrate comprises,
And determining the second sub-function according to the total bin area of the target logistics park used by the merchant.
5. The method of claim 4, wherein the step of determining the position of the first electrode is performed,
And determining the second sub-function according to the effective field area of the target logistics park used by the merchant, wherein the effective field area is determined according to whether different industries correspond to the logistics park, an area sharing coefficient and the system bin area.
6. The method of claim 2, wherein the step of determining the position of the substrate comprises,
The third sub-function is determined based on a fixed cost of the delivery vehicle required to deliver the merchant's items from the target logistics park to the user, and an operating cost of the delivery vehicle.
7. The method of claim 6, wherein the step of providing the first layer comprises,
And determining the running cost of the delivery vehicle according to the distance between the target logistics park and the gravity center of the user, wherein the position coordinates of the gravity center of the user are determined according to the longitude and latitude of the user and the volume of the goods delivered to the user.
8. The method according to any one of claims 1 to 7, wherein,
When the objective function is satisfied as a minimum value, one or more values of the following are also obtained: the fixed cost and running cost of the transfer vehicles, the number of transfer vehicles, the fixed cost and running cost of the distribution vehicles.
9. The method of claim 8, wherein the step of determining the position of the first electrode is performed,
The objective function is constructed based on a mixed integer programming model.
10. An apparatus for determining a logistic park for a merchant, comprising:
The data acquisition module is used for acquiring the current corresponding relation between n merchants and m logistics parks, logistics park information and operation data of the merchants, wherein n and m are natural numbers larger than 0;
a model building module, configured to build an objective function according to the logistics park information and operation data of the merchant, where the objective function is a difference between a first part representing a cost required for transferring the merchant from a current logistics park to a target logistics park and a second part representing a current cost of the merchant at the current logistics park, and the current logistics park and the target logistics park are both one of the m logistics parks;
The model solving module is used for determining the logistics park for the n merchants according to the obtained target corresponding relations between the n merchants and the m logistics parks when the objective function takes the minimum value under the constraint condition;
the first portion represents a cost required to transfer the merchant from a current logistics park to a target logistics park, and the second portion represents a current cost of the merchant at the current logistics park; the constraints include one or more of the following: the merchant only has a corresponding relation with one logistics park, the fixed cost and the running cost of the selected transfer vehicle enable the objective function to be minimum, and the fixed cost and the running cost of the selected delivery vehicle enable the objective function to be minimum.
11. A server, comprising:
One or more processors;
Storage means for storing one or more programs,
When executed by the one or more processors, causes the one or more processors to implement the method of any of claims 1-9.
12. A computer readable medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements the method according to any of claims 1-9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110062424.0A CN113762580B (en) | 2021-01-18 | 2021-01-18 | Method and device for determining logistics park for merchant |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110062424.0A CN113762580B (en) | 2021-01-18 | 2021-01-18 | Method and device for determining logistics park for merchant |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113762580A CN113762580A (en) | 2021-12-07 |
| CN113762580B true CN113762580B (en) | 2024-06-18 |
Family
ID=78786420
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110062424.0A Active CN113762580B (en) | 2021-01-18 | 2021-01-18 | Method and device for determining logistics park for merchant |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113762580B (en) |
Family Cites Families (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4069438B2 (en) * | 2001-11-27 | 2008-04-02 | 凸版印刷株式会社 | Cost billing data creation system, cost billing data creation method and processing program therefor |
| KR20110052054A (en) * | 2009-11-12 | 2011-05-18 | 부산대학교 산학협력단 | Transportation logistics network management system and method thereof |
| CN104346710A (en) * | 2013-08-05 | 2015-02-11 | 郑州同心创远生物科技有限公司 | Food-logistics supply-chain model |
| CN104715291A (en) * | 2015-03-25 | 2015-06-17 | 江苏中设集团股份有限公司 | Logistics park site selection method |
| CN106874598A (en) * | 2017-02-17 | 2017-06-20 | 国网天津市电力公司 | A kind of electric power meter is directly with the storage dispensing Network Optimization Design method under pattern |
| CN107092979A (en) * | 2017-04-07 | 2017-08-25 | 东南大学 | Consider the transport network system in saving site selecting method of carbon emission |
| CN108549971A (en) * | 2018-03-20 | 2018-09-18 | 东南大学 | A kind of modular logistics zonal function section planning method |
| CN110348770A (en) * | 2018-04-02 | 2019-10-18 | 北京京东尚科信息技术有限公司 | A kind of storage management method and device |
| CN110390409A (en) * | 2018-04-17 | 2019-10-29 | 北京京东尚科信息技术有限公司 | The determination method, apparatus and computer readable storage medium of distribution project |
| CN110390501A (en) * | 2018-04-18 | 2019-10-29 | 北京京东尚科信息技术有限公司 | Data processing method and its system, computer system and computer-readable medium |
| CN108717614B (en) * | 2018-05-16 | 2021-04-09 | 吉林大学 | Logistics park function distinguishing stage layout method |
| CN112215530B (en) * | 2019-07-11 | 2024-05-17 | 北京京东振世信息技术有限公司 | Bin selection method and device |
| CN111340423A (en) * | 2020-02-26 | 2020-06-26 | 上海明略人工智能(集团)有限公司 | Storehouse selecting platform |
| CN111598603A (en) * | 2020-03-03 | 2020-08-28 | 深圳前海微众银行股份有限公司 | Warehouse site selection method, device, equipment and storage medium |
| CN111784260A (en) * | 2020-07-14 | 2020-10-16 | 国网北京市电力公司 | Transportation planning method and device, storage medium and processor |
| CN111846723B (en) * | 2020-07-24 | 2022-02-01 | 北京极智嘉科技股份有限公司 | Stereoscopic warehouse carrying and scheduling system and method for realizing goods sorting |
-
2021
- 2021-01-18 CN CN202110062424.0A patent/CN113762580B/en active Active
Non-Patent Citations (2)
| Title |
|---|
| An integrated model for warehouse and inventory planning;Géraldine Strack等;European Journal of Operational Research;35-50 * |
| 基于SLP方法和遗传算法的仓库设施规划;李碧轩;中国优秀硕士学位论文全文数据库 工程科技II辑;第2017年卷(第2期);C029-457 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113762580A (en) | 2021-12-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113259144B (en) | Warehouse network planning method and device | |
| CN113673932B (en) | Logistics network planning method and device | |
| CN108492068B (en) | Method and device for path planning | |
| CN112184100A (en) | Article inventory monitoring method and device, electronic equipment and computer readable medium | |
| Kanyalkar et al. | Aggregate and detailed production planning integrating procurement and distribution plans in a multi-site environment | |
| CN113762858B (en) | Inventory management method and device | |
| CN109978470A (en) | A kind of logistics information determines method, apparatus, equipment and medium | |
| CN113034090B (en) | Transportation equipment scheduling method and device, electronic equipment and computer readable medium | |
| CN109345166B (en) | Method and apparatus for generating information | |
| CN112884405A (en) | Inquiry system and scheduling method thereof | |
| CN109934427B (en) | Method and device for generating item distribution scheme | |
| CN113762580B (en) | Method and device for determining logistics park for merchant | |
| CN113222490A (en) | Inventory allocation method and device | |
| CN110858332B (en) | Order production method and device | |
| CN112633541A (en) | Inventory network optimization method and device based on single commodity flow | |
| CN112862415B (en) | Transportation vehicle scheduling method and device, electronic equipment and computer readable medium | |
| CN110827102A (en) | Method and device for adjusting goods price ratio | |
| CN111860918B (en) | Distribution method and device, electronic equipment and computer readable medium | |
| CN111932191A (en) | Shelf scheduling method and device, electronic equipment and computer readable medium | |
| CN111985967A (en) | Article information generation method and device, electronic equipment and computer readable medium | |
| CN113256194B (en) | Method and device for determining self-holding inventory of distribution center | |
| CN111861293A (en) | Method and apparatus for transmitting information | |
| CN116362427B (en) | Cargo distribution method and device | |
| CN114626779A (en) | Warehouse information processing method and device, electronic equipment and computer readable medium | |
| CN107767094A (en) | A kind of logistics ladder freight charges optimization 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 |