CN113762580A - Method and device for determining logistics park for commercial tenant - Google Patents
Method and device for determining logistics park for commercial tenant Download PDFInfo
- Publication number
- CN113762580A CN113762580A CN202110062424.0A CN202110062424A CN113762580A CN 113762580 A CN113762580 A CN 113762580A CN 202110062424 A CN202110062424 A CN 202110062424A CN 113762580 A CN113762580 A CN 113762580A
- Authority
- CN
- China
- Prior art keywords
- logistics park
- logistics
- merchant
- cost
- park
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 53
- 238000012384 transportation and delivery Methods 0.000 claims description 47
- 238000012546 transfer Methods 0.000 claims description 32
- 230000005484 gravity Effects 0.000 claims description 13
- 238000004590 computer program Methods 0.000 claims description 9
- 238000004364 calculation method Methods 0.000 abstract description 6
- 230000009286 beneficial effect Effects 0.000 abstract description 2
- 230000006870 function Effects 0.000 description 43
- 238000010586 diagram Methods 0.000 description 12
- 238000004891 communication Methods 0.000 description 6
- 230000008569 process Effects 0.000 description 5
- 238000010276 construction Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 238000013439 planning Methods 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 102000002423 Octamer Transcription Factor-6 Human genes 0.000 description 1
- 108010068113 Octamer Transcription Factor-6 Proteins 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 239000002360 explosive Substances 0.000 description 1
- PCHJSUWPFVWCPO-UHFFFAOYSA-N gold Chemical compound [Au] PCHJSUWPFVWCPO-UHFFFAOYSA-N 0.000 description 1
- 239000010931 gold Substances 0.000 description 1
- 229910052737 gold Inorganic materials 0.000 description 1
- 230000006872 improvement Effects 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
- 238000005457 optimization Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- 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: acquiring current corresponding relations between n merchants and m logistics parks, logistics park information and operation data of the merchants, wherein n and m are both natural numbers larger than 0; constructing an objective function according to the logistics park information and the operation data of the commercial tenant, wherein the objective function is the difference between a first part representing the cost required by transferring the commercial tenant from the current logistics park to the target logistics park and a second part representing the current cost of the commercial tenant in the current logistics park; and when the target function is the minimum value under the condition of meeting the constraint condition, obtaining the target corresponding relation between n merchants and m parks, and determining the logistics parks for the merchants according to the target corresponding relation. The embodiment is not only beneficial to saving the warehousing cost of the merchants, but also can solve the corresponding relation between the logistics park with the optimal cost and the merchants at one time, and the calculation efficiency is improved.
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 explosive development 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 start to use the warehouse logistics service of the 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 the user addresses by the distribution vehicles of the logistics park. For logistics companies and merchants, how to adjust the corresponding relationship between merchants and a 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 usually used to adjust the corresponding relationship between the logistics park and the merchants, for example, a combination scheme between a merchant and the logistics park is first generated according to a constraint condition, then corresponding logistics operation costs are calculated for the corresponding relationship between the logistics park and the merchant in each combination scheme, and finally a scheme with a better cost is screened out in a trial calculation manner.
In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:
when the number of the merchants and the number of the logistics parks are large, the calculation logic is complex, and the cost of all possible schemes cannot be calculated, that is, the scheme finally screened cannot be close to the optimal solution.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for determining a logistics park for a merchant, which can simultaneously consider information of a logistics park where the merchant is currently located and information of a plurality of logistics parks that the merchant can transfer to, thereby not only helping to save the warehousing cost of the merchant, but also solving a correspondence between the logistics park and the merchant with an optimal cost at a time, and outputting cost data including transfer vehicles, delivery vehicles, and the like.
To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a method for determining a logistics park for a merchant, including: acquiring current corresponding relations between n merchants and m logistics parks, logistics park information and operation data of the merchants, wherein n and m are both natural numbers larger than 0; constructing an objective function according to the logistics park information and the operation data of the commercial tenant, wherein the objective function is the difference between a first part representing the cost required for transferring the commercial tenant from the current logistics park to a target logistics park and a second part representing the current cost of the commercial tenant in the current logistics park, and the current logistics park and the target logistics park are both one of the m logistics parks; and when the target function is the minimum value under the condition of meeting the constraint condition, obtaining the target corresponding relation between the n commercial tenants and the m parks, and determining the logistics parks for the commercial tenants according to the target corresponding relation.
Optionally, the method for determining the logistics park for the merchant further includes: the first part is determined according to a first sub-function representing a diversion cost of transferring the merchant from the current logistics park to the target logistics park, a second sub-function representing a warehousing 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 the logistics park for the merchant further includes: and determining the first sub-function according to the fixed cost of the transfer vehicle required for transferring the merchant from the current logistics park to the target logistics park and the operation cost of the transfer vehicle.
Optionally, the method for determining the logistics park for the merchant further includes: and determining the second subfunction according to the bin merging area of the target logistics park used by the merchant.
Optionally, the method for determining the logistics park for the merchant further includes: and determining the second subfunction 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 the logistics park corresponds to different industries, an area sharing coefficient and the warehouse integrating area.
Optionally, the method for determining the logistics park for the merchant further includes: and determining the third sub-function according to the fixed cost of the delivery vehicle required by the user for delivering the goods of the merchant from the target logistics park and the running cost of the delivery vehicle.
Optionally, the method for determining the logistics park for the merchant further includes: and determining the running cost of the delivery vehicle according to the distance between the target logistics park and the gravity center point of the user, wherein the position coordinate of the gravity center point of the user is determined according to the longitude and latitude of the user and the volume of goods delivered to the user.
Optionally, the method for determining the logistics park for the merchant further includes: the constraints include one or more of the following: the merchant has correspondence with only one logistics park, the fixed cost and operating cost of the selected transit vehicle minimizes the objective function, and the fixed cost and operating cost of the selected delivery vehicle minimizes the objective function.
Optionally, the method for determining the logistics park for the merchant further includes: when the objective function is satisfied as a minimum value, one or more of the following values are also obtained: fixed and operational costs of the transfer vehicles, the number of transfer vehicles, fixed and operational costs of the delivery vehicles.
Optionally, the method for determining the logistics park for the merchant further includes: and constructing the objective function 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 logistics park for a merchant, including: the data acquisition module is used for acquiring the current corresponding relation between n merchants and m logistics parks, as well as logistics park information and operation data of the merchants, wherein n and m are both natural numbers larger than 0; the model building module is used for building an objective function according to the logistics park information and the 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 the 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 both one of the m logistics parks; and the model solving module is used for obtaining the target corresponding relations between the n merchants and the m parks when the target function takes the minimum value under the constraint condition, and determining the logistics parks for the merchants according to the target corresponding relations.
To achieve the above object, according to a third aspect of the embodiments of the present invention, there is provided a server for determining a logistics park for a merchant, including: one or more processors; a storage device for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to implement the method as in any of the methods of determining a logistics park for a merchant as described above.
To achieve the above object, according to a fourth aspect of the embodiments of the present invention, there is provided a computer-readable medium having a computer program stored thereon, wherein the program, when executed by a processor, implements the method as set forth in any one of the methods of determining a logistics park for a merchant.
One embodiment of the above invention has the following advantages or benefits: because a technical means of constructing an objective function based on a mixed integer model is adopted, wherein the objective function is the difference between a first part representing the cost required by transferring the merchant from the current logistics park to the target logistics park and a second part representing the current cost of the merchant in the current logistics park, the technical problem of low calculation efficiency is overcome, and the technical effects of saving the warehousing 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 transfer vehicles, delivery vehicles and the like are achieved. Further, in the invention, the warehouse moving cost, the park site cost, the personnel cost, the transportation cost, the distribution cost and the like are comprehensively considered, a mixed integer programming model taking the cost optimal as a target is constructed, and the corresponding relation between the commercial tenant and the park is optimized. And when parameters, decision variables and constraint conditions are determined, various business logics are integrated, and the scales of the decision variables and the constraints are effectively reduced. Meanwhile, the constraints of the actual scene are considered, such as rounding up, selecting the vehicle type which can minimize the overall cost and the like. The method can directly output the corresponding relation between the merchant and the park with the optimal cost, the related cost items and the like.
Further effects of the above-mentioned non-conventional alternatives will be 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 shows a correspondence between a logistics park and a merchant according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a main flow of a method of determining a logistics park for a merchant according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of the major modules of an apparatus for determining a logistics 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 employed;
fig. 5 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server of an embodiment of the invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as 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.
Generally, in a warehouse logistics scenario, a merchant deposits its goods in a logistics park, and after a user orders the merchant goods, the merchant goods deposited in the logistics park needs to be delivered to the address of the user who ordered the goods by using a delivery vehicle. Obviously, factors influencing the merchant warehouse logistics cost mainly comprise site fees and labor costs of the logistics park; the receiving address of the user of the merchant is the comprehensive distance from the logistics park where the merchant is located, the related cost of the distribution vehicle 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 merchant (goods) is transferred to the logistics park for storage, management and distribution, which is beneficial to reducing the warehousing and logistics cost of the merchant. In the technical scheme, a mixed integer programming model is utilized, the cost optimization is taken as a target, the new corresponding relation between the commercial tenant and the logistics park is determined, and the logistics park with lower warehouse logistics cost is tried to be found for the commercial tenant. Additionally, in the present disclosure, the merchant is transferred from the current logistics park to another logistics park, also referred to as "moving the warehouse".
Fig. 1 shows a correspondence relationship between a logistics park and a merchant according to an embodiment of the present invention. The problem solved by the present invention as described above is how to determine the logistics park of the n logistics parks where the warehouse logistics cost is the lowest, for each of the m merchants. Wherein, one logistics park can serve multiple merchants — for example, the logistics park 1 in fig. 1 serves merchant 1 and merchant 2, and the logistics park 2 serves merchant 3, merchant 4 and merchant 5; it is also possible to serve only one merchant-for example, the logistics park 3 in fig. 1 serves the merchant 6; it is also possible that no merchant is temporarily served-for example, for the logistics park 4 in fig. 1, no merchant is temporarily resident. Furthermore, the merchants belonging to the same logistics park may belong to the same industry, such as the clothing industry or the fresh food industry; or belong to different industries, for example, a logistics park can have both the business of clothing industry and the business of fresh food industry. As described below, in one embodiment, the number of industry types of the logistics park will affect the effective floor area (i.e., the floor area on which the costs are accounted for) of the logistics park used by the merchant.
Fig. 2 is a schematic diagram of a main flow of a method for determining a logistics park for a merchant according to an embodiment of the present invention. As shown in fig. 2, in step S201, current corresponding relations between n merchants and m logistics parks, information of the logistics parks, and operation data of the merchants are obtained, where n and m are both natural numbers greater than 0.
The model of the present disclosure may be used to determine whether to transfer to one of m logistics parks for n merchants at a time; in a preferred embodiment, one merchant is only located in one logistics park, that is, one merchant only has a corresponding relationship with one logistics park. The current corresponding relation between the commercial tenant and the logistics park can be obtained through the following two ways: adopting the corresponding relation between the commercial tenant and the logistics park under the actual condition; or, the corresponding relation between the commercial tenant 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, the logistics park information, including but not limited to logistics park related data, warehouse removal cost data, distribution cost data, and the operation data of the merchant, including but not limited to merchant inventory data and merchant order data, and the operation data of the merchant are known. Specifically, the method comprises the following steps:
related data of the logistics park: the using 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 the merchant;
order data of the merchant: merchant ID, industry ID, city ID, location coordinates (e.g., latitude and longitude) of the shipping address of the order, volume of the goods ordered by the user, etc.;
move bin cost data: the system comprises the steps of (1) merchant warehouse taking cost except transit vehicle cost, transit vehicle data (such as the type of transit vehicle and vehicle fixed work cost and running cost corresponding to the type) for transferring a logistics park for the merchant, wherein the transit vehicle is a 7-meter 2, 9-meter 6 and other large truck;
delivery cost data: delivery vehicle data (e.g., type of delivery vehicle, and vehicle capital and operating costs for that type), distance between different parks for delivering goods to customers of a merchant, such as a minivan such as a gold cup, a facet, an evaluo, a 4.2 meter box truck;
furthermore, it is understood that model parameters such as delivery volume limits, delivery distance limits, pre-configured personnel outages due to deportation, 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, 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 in the current logistics park, and the current logistics park and the target logistics park are both one of the m logistics parks.
After obtaining the logistics 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 an objective function (i.e., a model), or intermediate parameters that can be used for calculating the direct parameters. In solving the new correspondence between the merchants and the logistics park by using the mixed integer programming model, the meaning of the parameters used is as shown in table 1, wherein the parameters refer to data input into the integer programming model.
TABLE 1 parameter definitions
The objective function constructed based on the mixed integer programming model is as follows:
the objective function comprises two parts, wherein the first part is a first part defined by the sum of sub-functions numbered as [ 1 ], [ 2 ], [ 3 ], and represents the cost required for transferring the merchant from the current logistics park to the objective logistics park; and a second part defined by a sub-function with the number of [ 4 ], wherein the second part represents the current cost of the merchant in the current logistics park, and the difference between the first part representing the cost required for transferring the merchant from the current logistics park to the target logistics park and the second part representing the current cost of the merchant in the current logistics park is the target function based on the mixed integer programming model. The current logistics park and the target logistics park are both one of the m logistics parks, the current logistics park refers to the logistics park where the merchant is located at present, or before the objective function is solved, for the logistics park specified by the merchant, the target logistics park refers to the logistics park where the merchant should be located when the objective function is minimum value under the condition that the constraint condition is met.
More specifically, the sub-function numbered [ 1 ], also referred to as a first sub-function, represents a transfer cost of the merchant from the current logistics park to the target logistics park, the sub-function numbered [ 2 ], also referred to as a second sub-function, represents a warehousing cost of the target logistics park, and the sub-function numbered [ 3 ], also referred to as a third sub-function, represents a distribution cost of the target logistics park.
Further, according to the fixed cost of the transfer vehicle needed for transferring the merchant from the current logistics park to the target logistics park, namely F in the objective functionjAnd the operating cost of the transit vehicle-N in the objective functioni*Ci*dijDetermining the first sub-function; besides, the moving cost epsilon of the merchant can be usediConsideration is given to the diversion costs of the merchant from the current logistics park to the target logistics park. Wherein, FjNumber delta of vehicles of transfer vehicle type c required by logistics park jjcAnd fixed cost per vehicle of the type of transshipment vehicle used
The specific constraints are as described later. CiOperating costs per unit distance for the type of transfer vehicle used, i.e. when the type of transfer vehicle C is determined, CiIs that
NiWhen a transfer vehicle is used for carrying out the warehouse for a merchant i, the number of transfer vehicles needed to be used for the merchant inventory is specifically defined as table 1.
And determining the second subfunction according to the bin merging area of the target logistics park used by the merchant. In order to meet the storage requirements of the commercial tenant goods, the storage area (namely psi) of the month with the largest goods occupation area in each month of the whole year of the commercial tenant is selectedimMaximum of (d) as the area it occupies in the campus for its goods (also known as the unified warehouse area); for example, the stock area of the quarter with the largest occupied area of the goods in all seasons of the year of the merchant may be selected as the stock area of the merchant.
It is worth noting that if the merchant's target logistics park has only one industry (i.e., beta)j0), the system area of the merchant is directly used
As an effective area to account for warehousing costs. If the campus contains multiple industries (i.e., β)j1), the current area of the park needs to be converted according to the current area of the merchant, that is, the effective area of the field needs to be counted in the warehousing cost is
It can be understood that the effective site area in this case is (current campus utilization area-unified warehouse area) × area sharing factor), and the specific meanings of each parameter are explained in table 1.
In summary, in the second sub-function
Or
An effective site area of the target logistics park is defined. There is only one industry (i.e., beta) for the target logistics parkj0), area sharing coefficient
On the other hand, the personnel cultivation cost P of the logistics park can be further reducedjTaking into account the warehousing costs of the target logistics park.
According to the fixed cost of the delivery vehicle, namely Q in the objective function, required for delivering the goods of the merchant from the target logistics park to the userjOperating costs of the delivery vehicles, i.e. M in the objective functionjAnd determining the third sub-function. Wherein Q isjNumber U of users to whom the merchant needs to distribute goodsiAnd fixed cost of single user delivery/single delivery E of delivery vehicle type ddThe specific constraints are as described later. MjThe distance between the logistics park and the gravity center point of the merchant user and the running cost of the unit distance of the distribution vehicle type d are related. In order to comprehensively consider the influence of the geographical location of each user and the corresponding delivered goods volume on the delivery cost, the position coordinates of the user's center of gravity point are used herein to represent the comprehensive geographical location of all the goods volumes delivered for all the users. The specific constraint conditions of the position coordinates of the user center of gravity point are determined according to the longitude and latitude of each user of the merchant and the volume of goods delivered to the user.
And on the other hand, calculating the total cost gamma of the merchant in the current logistics park according to the various expenses of the merchant in the current logistics park, including the fixed cost of a transfer vehicle in the current logistics park, the storage cost of the current logistics park and the like. For example, the warehousing cost of the current logistics park can be calculated by the product of the use area of the merchant in the current park and the unit area cost of the current logistics park; as another example, the fixed cost of the transit vehicle for the current logistics park may be calculated by multiplying the transit vehicles required by all merchants of the park by the fixed cost per vehicle for the transit vehicle.
In step S203, when the target function takes the minimum value under the constraint condition, the target correspondence between the n merchants and the m parks is obtained, and the logistics park is determined for the merchant according to the target correspondence.
When the objective function based on the mixed integer programming model takes the minimum value, the decision variables can be obtained besides the objective corresponding relation between the commercial tenant and the logistics park. The decision variable is a variable value that is generated when the minimum value of the objective function (i.e., the model) is solved, that is, the minimum value of the objective function is obtained when the relevant variable is the corresponding variable value. The decision variables are defined as described in table 2.
TABLE 2 decision variable definitions
The constraints are defined as follows:
θi≤Si(constraint 1)
1- β j ≦ kj (constraint 16)
Wherein:
constraint (1) represents that a merchant needs to meet the constraint condition that the merchant can adjust the logistics park;
constraint (2) means that the merchant can only be in one logistics park;
constraint (3) means that when the merchant does not change the current logistics park, the sum of the products of the target corresponding relation and the current corresponding relation of the merchant and the park is 1; when a merchant changes the current logistics park area, the sum of the products of the target corresponding relation and the current corresponding relation between the merchant and the park area is 0;
and (4) the constraint (4 and 5) rounds the number of the vehicles of the required transfer vehicle type in the logistics park upwards. The meaning is that the number of the actually calculated vehicles is less than or equal to the upward integer and is greater than or equal to the upward integer minus 1. Where μ 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) the fixed cost of a vehicle model for which the objective function can be minimized is obtained by using a large M method, where M isbigIs a maximum. Meaning F of the parkjThe fixed cost of each vehicle type is required to be less than or equal to, and the fixed cost of each vehicle type is less than or equal to a maximum value (when the fixed cost is not the minimum value). The fixed cost of the transfer vehicle type is equal to the number of vehicles of the transfer vehicle type c needed by the park j multiplied by the fixed cost of each vehicle of the transfer vehicle type c.
Constraints (9, 10, 11) acquisition of parks by using the large M methodMaximum merchant utilization area of, where MbigIs a maximum. The meaning is that the maximum merchant use area of the park needs to satisfy the condition that the merchant use area of the park is more than or equal to the merchant use area of each month, and the merchant use area of the park is less than or equal to the maximum value (when the maximum value is not added). The campus maximum merchant usage area corresponds to only one month of merchant usage area.
Constraints (12, 13) indicate whether a limit needs to be placed on the number of industries t on campus j within campus j, with a value of 0 when the number of industries on campus is 0 and a value of 1 when the number of industries on campus is greater than 0. Calculating the number of the industries t in the park j according to the relationship between the merchants and the industries and the corresponding relationship between the merchants and the parks;
constraints (14, 15) obtain whether there are multiple industries on a campus using the large M method, where M isbigIs a maximum and μ is a minimum. The meaning is that when the park comprises a plurality of industries, the number of the 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 customer usage area needs to be less than the usage area limit for the campus j. If the target park is only one industry after the park adjustment is carried out by the merchant, the park area (namely, the area of the warehouse) required by the merchant is directly used, and if the park comprises a plurality of industries, the conversion is carried out according to the current park use area of the merchant.
Constraints (17, 18, 19) obtain the maximum number of members of the park by using the large M method, where M isbigIs a maximum. The meaning is that the maximum number of employees in the park is required to be greater than or equal to the number of employees in each month in the park, and less than or equal to the number of employees in each month in the park plus a maximum value (when the maximum value is not the maximum value). The maximum number of employees in the campus corresponds to the number of employees in a month only.
Constraints (20, 21, 22) obtain a fixed cost of delivery vehicles that can minimize the objective function by using a large M method, where M isbigIs a maximum. The fixed cost of the delivery vehicles needs to meet the fixed cost of each delivery vehicle type in a park or less and the fixed cost of each delivery vehicle type in the park or moreThe cost is subtracted by a maximum (when not a minimum). The fixed cost of the garden delivery vehicle is equal to the number U of users to whom the merchant needs to deliver goodsiFixed cost of single user delivery/single delivery E multiplied by delivery model dd. Where D is the number of types of delivery vehicles, for example, the delivery vehicles are four types of cup, facet, evaco, and 4.2 m truck, and D is 4.
The constraints (23, 24) represent the calculation of the longitude and latitude of the (receiving address of the) user (i.e. the geographical coordinates of the user's center of gravity) according to the longitude and latitude of the receiving address of the user of the merchant in the campus and the volume of the goods to be delivered. The longitude of the user's center of gravity point is: the quotient of the product of the longitude of the shipping address of all the users and the volume of the goods delivered to them and the total volume of the delivered goods; the latitude of the user's center of gravity point is: the product of the latitude of the shipping address of all the users and the volume of the goods delivered to them, and the quotient of the total volume of the delivered goods.
Constraints (25, 26, 27) are obtained by using a large M method, where M is the operating cost of the delivery vehicle at which the objective function can be minimizedbigIs a maximum. The meaning of the operation cost of the delivery vehicle is that the operation cost of each delivery vehicle type in the park is less than or equal to the operation cost of each delivery vehicle type in the park, and is more than or equal to the operation cost of each delivery vehicle type in the park minus a maximum value (when the operation cost is not the minimum value). Where the distance of the campus to the user's center of gravity is obtained by euclidean distance calculations (constraints 25). Where D is the number of types of delivery vehicles, for example, the delivery vehicles are four types of cup, facet, evaco, and 4.2 m truck, and D is 4.
In one embodiment, an integer programming solver (e.g., SCIP) may be used to solve the objective function to solve the objective correspondence between merchants and the campus with a cost minimization objective. In general, when the number of merchants and parks is 10 or less, the solution time is about 1 hour.
Finally, when the objective function is satisfied as the minimum value, according to the constraint condition, one or more of the following values are also obtained: the fixed cost and the operating cost of the transfer vehicle, i.e. the type of transfer vehicle used, the number of transfer vehicles required, the fixed cost and the operating cost of the delivery vehicle, i.e. the type of delivery vehicle used, the maximum number of employees of the target logistics park can be determined.
According to the method, based on the relationship between the commercial tenant and the park in the logistics scene, the warehouse 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 cost optimal as the target is constructed, and the corresponding relationship between the commercial tenant and the park is optimized. And when parameters, decision variables and constraint conditions are determined, various business logics are integrated, and the scales of the decision variables and the constraints are effectively reduced. Meanwhile, the constraints of the actual scene are considered, such as rounding up, selecting the vehicle type which can minimize the overall cost and the like. The method can directly output the corresponding relation between the merchant and the park with the optimal cost, the related cost items and the like.
FIG. 3 is a schematic diagram of the major modules of an apparatus for determining a logistics 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, as well as logistics park information and operation data of the merchants, wherein n and m are both natural numbers larger than 0;
the model building module is used for building an objective function according to the logistics park information and the 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 the 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 both one of the m logistics parks;
and the model solving module is used for obtaining the target corresponding relations between the n merchants and the m parks when the target function takes the minimum value under the constraint condition, and determining the logistics parks for the merchants according to the target corresponding relations.
Further, the model building module determines the first part according to a first sub-function representing a transfer cost of the merchant from the current logistics park to the target logistics park, a second sub-function representing a warehousing cost of the target logistics park, and a third sub-function representing a delivery cost of the target logistics park.
Wherein the model building module determines the first sub-function according to a fixed cost of a transfer vehicle required for transferring the merchant from the current logistics park to the target logistics park and an operating cost of the transfer vehicle.
The model building module determines the second sub-function according to the warehouse unifying area of the target logistics park used by the merchant; further, the second subfunction 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 the logistics park corresponds to different industries, an area sharing coefficient and the warehouse integrating area.
The model building module determines the third subfunction according to the fixed cost of a delivery vehicle required for delivering goods of the merchant from the target logistics park to a user and the operation cost of the delivery vehicle, and further determines the operation cost of the delivery vehicle according to the distance between the target logistics park and the gravity center of the user, wherein the geographic 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.
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 employed.
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 serves as a medium for providing communication links between the terminal devices 401, 402, 403 and the server 405. Network 404 may include various types of connections, such as wire, wireless communication links, or fiber optic cables, to name a few.
A user may use terminal devices 401, 402, 403 to interact with a server 405 over a network 404 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 smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 405 may be a server that provides various services, such as a background server (for example only) that provides support for a demander to input model parameters using the terminal devices 401, 402, 403 in anticipation of obtaining a target correspondence of a merchant with a campus. The background server may process the received request for adjusting the correspondence between the merchant and the logistics park, and feed back a processing result (the recommended correspondence between the merchant and the logistics park) to the terminal device.
It should be noted that the method for determining the logistics park for the merchant provided by the embodiment of the present invention is generally executed by the server 405, and accordingly, the apparatus for determining the logistics park for the 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, a block diagram of a computer system 500 suitable for use with a terminal device or server implementing an embodiment of the invention is shown. The terminal device or the server shown in fig. 5 is only an example, and should not bring any limitation to the functions and the 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 that 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 necessary for the operation of the system 500 are also stored. The CPU 501, ROM 502, and RAM 503 are connected to each other via 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 portion 506 including a keyboard, a mouse, and the like; an output portion 507 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; 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 driver 510 is also connected to the I/O interface 505 as necessary. 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 necessary, so that a computer program read out therefrom is mounted into the storage section 508 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the 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 illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 509, and/or installed from the removable medium 511. The computer program performs the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 501.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination 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 present invention, 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, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. 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 flowchart 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") mentioned in the embodiments of the present invention may be implemented by software, or may be implemented by hardware. The described units (or "modules") may also be provided in a processor, which may be described, for example, as: a processor includes a sending unit (or "module"), a data acquisition unit, a model construction unit, and a model solution unit. The names of these units do not in some cases form a limitation on the units themselves, and for example, the data acquisition unit may also be described as a "unit that transmits 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 separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: acquiring current corresponding relations between n merchants and m logistics parks, logistics park information and operation data of the merchants, wherein n and m are both natural numbers larger than 0; constructing an objective function according to the logistics park information and the operation data of the commercial tenant, wherein the objective function is the difference between a first part representing the cost required for transferring the commercial tenant from the current logistics park to a target logistics park and a second part representing the current cost of the commercial tenant in the current logistics park, and the current logistics park and the target logistics park are both one of the m logistics parks; and when the target function is the minimum value under the condition of meeting the constraint condition, obtaining the target corresponding relation between the n commercial tenants and the m parks, and determining the logistics parks for the commercial tenants according to the target corresponding relation.
According to the technical scheme of the embodiment of the invention, based on the relationship between the commercial tenant and the park in a logistics scene, the warehouse 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 cost optimal as the target is constructed, and the corresponding relationship between the commercial tenant and the park is optimized. And when parameters, decision variables and constraint conditions are determined, various business logics are integrated, and the scales of the decision variables and the constraints are effectively reduced. Meanwhile, the constraints of the actual scene are considered, such as rounding up, selecting the vehicle type which can minimize the overall cost and the like. The method can directly output the corresponding relation between the merchant and the park with the optimal cost, the related cost items and the like.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (13)
1. A method for determining a logistics park for a merchant, comprising:
acquiring current corresponding relations between n merchants and m logistics parks, logistics park information and operation data of the merchants, wherein n and m are both natural numbers larger than 0;
constructing an objective function according to the logistics park information and the operation data of the commercial tenant, wherein the objective function is the difference between a first part representing the cost required for transferring the commercial tenant from the current logistics park to a target logistics park and a second part representing the current cost of the commercial tenant in the current logistics park, and the current logistics park and the target logistics park are both one of the m logistics parks;
and when the target function is the minimum value under the condition of meeting the constraint condition, obtaining the target corresponding relation between the n commercial tenants and the m parks, and determining the logistics parks for the commercial tenants according to the target corresponding relation.
2. The method of claim 1,
the first part is determined according to a first sub-function representing a diversion cost of transferring the merchant from the current logistics park to the target logistics park, a second sub-function representing a warehousing 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,
and determining the first sub-function according to the fixed cost of the transfer vehicle required for transferring the merchant from the current logistics park to the target logistics park and the operation cost of the transfer vehicle.
4. The method of claim 2,
and determining the second subfunction according to the bin merging area of the target logistics park used by the merchant.
5. The method of claim 4,
and determining the second subfunction 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 the logistics park corresponds to different industries, an area sharing coefficient and the warehouse integrating area.
6. The method of claim 2,
and determining the third sub-function according to the fixed cost of the delivery vehicle required by the user for delivering the goods of the merchant from the target logistics park and the running cost of the delivery vehicle.
7. The method of claim 6,
and determining the running cost of the delivery vehicle according to the distance between the target logistics park and the gravity center point of the user, wherein the position coordinate of the gravity center point of the user is determined according to the longitude and latitude of the user and the volume of goods delivered to the user.
8. The method according to any one of claims 1 to 7,
the constraints include one or more of the following: the merchant has correspondence with only one logistics park, the fixed cost and operating cost of the selected transit vehicle minimizes the objective function, and the fixed cost and operating cost of the selected delivery vehicle minimizes the objective function.
9. The method according to any one of claims 1 to 7,
when the objective function is satisfied as a minimum value, one or more of the following values are also obtained: fixed and operational costs of the transfer vehicles, the number of transfer vehicles, fixed and operational costs of the delivery vehicles.
10. The method of claim 9,
and constructing the objective function based on a mixed integer programming model.
11. An apparatus for determining a logistics park for a merchant, comprising:
the data acquisition module is used for acquiring the current corresponding relation between n merchants and m logistics parks, as well as logistics park information and operation data of the merchants, wherein n and m are both natural numbers larger than 0;
the model building module is used for building an objective function according to the logistics park information and the 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 the 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 both one of the m logistics parks;
and the model solving module is used for obtaining the target corresponding relations between the n merchants and the m parks when the target function takes the minimum value under the constraint condition, and determining the logistics parks for the merchants according to the target corresponding relations.
12. A server, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-10.
13. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-10.
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 true CN113762580A (en) | 2021-12-07 |
| CN113762580B 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) |
Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003162674A (en) * | 2001-11-27 | 2003-06-06 | Toppan Printing Co Ltd | Demand-for-cost data generation, system thereof and its program |
| 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 |
| CN108717614A (en) * | 2018-05-16 | 2018-10-30 | 吉林大学 | A kind of Logistics Park function distinguishing stage layout method |
| CN110348770A (en) * | 2018-04-02 | 2019-10-18 | 北京京东尚科信息技术有限公司 | A kind of storage management method and device |
| CN110390501A (en) * | 2018-04-18 | 2019-10-29 | 北京京东尚科信息技术有限公司 | Data processing method and its system, computer system and computer-readable medium |
| CN110390409A (en) * | 2018-04-17 | 2019-10-29 | 北京京东尚科信息技术有限公司 | The determination method, apparatus and computer readable storage medium of distribution project |
| 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 |
| CN111846723A (en) * | 2020-07-24 | 2020-10-30 | 北京极智嘉科技有限公司 | Stereoscopic warehouse carrying and scheduling system and method for realizing goods sorting |
| CN112215530A (en) * | 2019-07-11 | 2021-01-12 | 北京京东尚科信息技术有限公司 | Bin selection method and device |
-
2021
- 2021-01-18 CN CN202110062424.0A patent/CN113762580B/en active Active
Patent Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003162674A (en) * | 2001-11-27 | 2003-06-06 | Toppan Printing Co Ltd | Demand-for-cost data generation, system thereof and its program |
| 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 |
| CN108717614A (en) * | 2018-05-16 | 2018-10-30 | 吉林大学 | A kind of Logistics Park function distinguishing stage layout method |
| CN112215530A (en) * | 2019-07-11 | 2021-01-12 | 北京京东尚科信息技术有限公司 | 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 |
| CN111846723A (en) * | 2020-07-24 | 2020-10-30 | 北京极智嘉科技有限公司 | Stereoscopic warehouse carrying and scheduling system and method for realizing goods sorting |
Non-Patent Citations (4)
| Title |
|---|
| GÉRALDINE STRACK等: "An integrated model for warehouse and inventory planning", EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, pages 35 - 50 * |
| 宋振波;马文凯;吴耀华;: "基于电商行业的前置仓选址优化", 科学技术与工程, no. 02, 18 January 2020 (2020-01-18), pages 264 - 269 * |
| 张钰川等: "基于成本优化的物流园选址模型", 南京理工大学学报, vol. 44, no. 3, 30 June 2020 (2020-06-30), pages 372 - 378 * |
| 李碧轩: "基于SLP方法和遗传算法的仓库设施规划", 中国优秀硕士学位论文全文数据库 工程科技II辑, vol. 2017, no. 2, pages 029 - 457 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113762580B (en) | 2024-06-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110371548B (en) | Goods warehousing method and device | |
| CN113259144B (en) | Warehouse network planning method and device | |
| CN111932189B (en) | Inventory related information display method, device, electronic equipment and computer medium | |
| CN111932161B (en) | Vehicle scheduling method and device for articles, electronic equipment and computer medium | |
| CN105631625A (en) | Logistics multi-supplier order management system and logistics multi-supplier order management method | |
| CN113673932A (en) | Logistics network planning method and device | |
| CN111178810B (en) | Method and device for generating information | |
| CN109961247A (en) | A kind of generation method and device of article storage information | |
| CN110633928A (en) | Commodity inverse matching decision method and device | |
| CN112184100A (en) | Article inventory monitoring method and device, electronic equipment and computer readable medium | |
| CN109978470A (en) | A kind of logistics information determines method, apparatus, equipment and medium | |
| CN110689157A (en) | Method and device for determining call relation | |
| CN111507664A (en) | Method and device for goods crossing warehouse | |
| CN110555641B (en) | Warehouse allocation method and device | |
| CN112085442B (en) | Device operation method, apparatus, electronic device, and computer-readable medium | |
| CN113222490A (en) | Inventory allocation method and device | |
| CN110858332B (en) | Order production method and device | |
| CN112862415B (en) | Transportation vehicle scheduling method and device, electronic equipment and computer readable medium | |
| CN113762580A (en) | Method and device for determining logistics park for commercial tenant | |
| CN115099865A (en) | Data processing method and device | |
| CN114997779A (en) | Storage processing method and device, electronic equipment and computer readable medium | |
| CN111860918B (en) | Distribution method and device, electronic equipment and computer readable medium | |
| CN112085441A (en) | Information generation method and device, electronic equipment and computer readable medium | |
| CN113650997A (en) | Method and device for positioning articles in warehouse-out process | |
| CN112950240A (en) | Distribution 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 |