CN115099460A - Region division method for urban logistics immediate distribution merchants - Google Patents
Region division method for urban logistics immediate distribution merchants Download PDFInfo
- Publication number
- CN115099460A CN115099460A CN202210558090.0A CN202210558090A CN115099460A CN 115099460 A CN115099460 A CN 115099460A CN 202210558090 A CN202210558090 A CN 202210558090A CN 115099460 A CN115099460 A CN 115099460A
- Authority
- CN
- China
- Prior art keywords
- area
- merchant
- constraint
- city
- point
- 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.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/043—Optimisation of two dimensional placement, e.g. cutting of clothes or wood
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Quality & Reliability (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a region division method for urban logistics immediate distribution merchants, which comprises the following steps: setting node out-degree and in-degree constraints, merchant affiliated area constraints, merchant number constraints of each area, vehicle number constraints, time continuity constraints of vehicles visiting a certain place, time window constraints and access sequence constraints of merchants and customers to construct a merchant area division model by taking the distribution cost minimization of historical orders of a city where a certain logistics platform is located as an objective function, wherein the nodes comprise a distribution center place, merchant places and customer delivery places; based on the historical order information of the logistics platform, solving software by adopting the existing integer programming model through a merchant region division model to obtain the division result of the merchant region immediately distributed by the platform; the method generates a merchant area division scheme based on historical customer orders, and forms a plurality of distribution areas by carrying out area division on a plurality of merchants so as to realize effective management of the merchants, vehicles and riders in the areas.
Description
Technical Field
The invention belongs to the technical field of internet, and relates to a region division method for urban logistics immediate distribution merchants.
Background
The rapid development of electronic commerce enables the range of online shopping commodities to be continuously expanded and extended, and besides traditional online shopping commodities such as clothes, shoes, hats, household digital products and the like which can be distributed across cities in multiple days, fast-life consumables which are needed by people immediately after ordering from current merchants in cities or regions, such as catering snacks, fresh fruits and vegetables, commercial super-miscellaneous goods and the like, also become the main force of online shopping. The urban logistics immediate distribution service adopts a mode of completing transactions on line and delivering immediately off line, greatly meets the urgent needs of people on fast pace, high quality and convenient life, and provides great convenience for modern life. Therefore, a plurality of urban logistics instant distribution platforms such as American groups, hungry groups and the like appear, the platforms gather a large amount of merchant information, a customer can buy goods of a certain merchant on the platform, the platform can dispatch a rider and a vehicle to get the goods from the merchant immediately, and the goods are sent to the customer in time.
However, since such logistics platforms need to manage a large number of merchants, in order to facilitate efficient management of their orders and their distribution resources (riders and vehicles), the logistics platforms generally need to divide the whole city into a plurality of areas, and the merchants in each area manage separately, thereby improving management efficiency. However, how the region of the business is divided is a relatively complicated problem, and different dividing methods are completely different for the distribution cost of the vehicle and the rider.
With the rapid development of electronic commerce, the instant distribution of urban logistics plays an increasingly important role in the life of people, and the reasonable regional division is carried out on merchants, so that the distribution efficiency can be effectively improved, and the distribution cost is reduced. In the current Chinese invention patent application, different business circle division methods, devices and electronic equipment are provided. For example, in some patent application documents of the invention, a region to be divided is divided into a plurality of sub-regions in advance, the number of orders of each sub-region is adjusted, and the region to be divided is divided into a plurality of business circles according to the number of orders of each sub-region, the distance between each sub-region and the reverse clustering. In some patent application of the invention, a target area is divided into a plurality of grids, people flow data and the number of merchants of each grid in the grids are obtained, and then a merchant circle in the target area is determined according to the people flow data and the number of merchants. In some patent application of the invention, a plurality of commercial tenants in a target area are determined, a commercial tenant relationship network of the target area is constructed according to commercial tenant information of the commercial tenants, and a commercial circle corresponding to each of the commercial tenants is determined based on the commercial tenant relationship network. And determining the business circle boundary of each business circle according to the geographic information of the merchants included in each business circle.
In summary, in the area division patents in the prior art, the invention considers the partitioning of logistics distribution and geographic networks, and has fewer patents for the area division method of the merchant; in the method for dividing and determining the business circles, the areas of the businesses are divided and solved by using a mathematical model, the characteristics and the rules of historical orders are considered by less patents, and the existing business area dividing method still has a larger improvement space.
Disclosure of Invention
In order to solve the problems, the invention adopts the technical scheme that: a region division method for urban logistics immediate distribution merchants comprises the following steps:
setting node out-degree and in-degree constraint, merchant belonging area constraint, merchant number constraint in each area, vehicle number constraint, time continuity constraint of vehicle visiting a certain place, time window constraint and access sequence constraint of merchants and customers by using the distribution cost minimization of historical orders in a city where a certain logistics platform is located as an objective function, and constructing a merchant area division model, wherein the node comprises: a distribution center location, a merchant location, and a customer delivery location;
based on the historical order information of the logistics platform, the division result of the area of the immediate distribution merchant of the platform is obtained by adopting the existing integer programming model solving software through a merchant area division model.
Further: the historical order information includes the time the order was placed, the location of the merchant from which the goods required for the order came, and the delivery location and time period range requested by the customer.
Further: the objective function expression is as follows
Wherein:
i, j is a distribution center, a route merchant, or a customer, d is a certain distribution day, z is a certain area,
whether the vehicle visits the area in front of and behind the i, j points continuously on the distribution day or not is shown;
c ij : indicating the distribution cost between points i, j.
Further: the merchant region division model is as follows:
wherein: constraints (2) to (4) represent y rz Associated limit, y rz Indicates whether the source merchant r is assigned to the delivery area z;
constraint (2) is a node out-degree in-degree constraint, which means that if a vehicle exits from a certain point i in an area z on a certain day, namely the out-degree is 1 or the vehicle enters, namely the in-degree is 1, a source merchant of the point must be in the area z, otherwise, the source merchant of the point is not in the area z;
the constraint (3) is a constraint of the region to which the source merchant belongs, and the constraint indicates that each source merchant necessarily belongs to one region;
constraint (4) is the quantity constraint of merchants in each area, and the constraint gives the quantity range of source merchants contained in each area;
constraints (5) to (9) represent
A related limitation;
the constraint (5) is a vehicle number constraint, and the constraint indicates that the sum of the number of vehicles used in all areas per day cannot exceed an upper limit, namely an o-point out-degree upper limit and an in-degree upper limit, and each vehicle is supposed to be used in only one area and cannot be used across the areas;
the constraint (6) is a time continuity constraint of the vehicle access points, and the constraint ensures that the time sequence of the vehicle access points is continuous, namely if the vehicle accesses the i point first and then accesses the j point, the time for the vehicle to access the j point is not less than the sum of the time for the vehicle to access the i point and the travel time between the i point and the j point;
constraint (7) indicates that the visit time of the distribution center is 0;
constraint (8) is a time window constraint indicating that the time at which the vehicle arrives for delivery by customer i is within the delivery time range requested by customer i;
the constraint (9) is a point's access sequence constraint that indicates that the customer point must be accessed after its route merchant point, i.e., the vehicle must first come to the merchant to pick up the goods before the goods can be delivered to the customer;
wherein: r: subscript of a set of active merchants is R, and R belongs to R;
d: the subscript of the set of all the distribution days is D, and D belongs to D;
z: all the areas are collected, subscript is Z, and Z belongs to Z;
k: a set of all vehicles;
C d : the set of all customers on d days;
R d : a set of all route merchants on day d;
N d : the collection of all points at d days includes distribution center o, customer point C d And route merchant point R d ；
r i : i is a route merchant or a customer, i belongs to U d∈D (R d ∪C d )，r i Representing the source merchant to which i belongs;
o: indicating a distribution center;
[e i ,l i ]: i is a customer, i belongs to U d∈D C d ，[e i ,l i ]A time window representing customer i;
[ L, U ]: representing a lower bound and an upper bound for the number of merchants in each area;
y rz : r is the source merchant, z is a certain delivery area, and the variable y rz Indicates whether the source merchant r is assigned to zone z;
further: and obtaining the partition result of the immediate distribution merchant area of the platform through the merchant area partition model and the existing integer programming model solving software.
Further: the existing integer linear programming model solving software comprises Gurobi, Cplex or Lingo.
The area division method for the urban logistics immediate delivery merchants, provided by the invention, has the advantages that the merchant area division scheme is generated based on historical orders of customers, a plurality of delivery areas are formed by carrying out area division on a plurality of merchants, so that effective management of merchants, vehicles and riders in the areas is realized, the merchants to which delivery orders with similar space-time characteristics belong are divided into one area, the order execution efficiency is improved, and the delivery cost is reduced.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the embodiments or the description of the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
FIG. 1 is a flow chart of the method;
FIG. 2 is a location distribution graph of merchants and customers;
FIG. 3 is a diagram of the results of an embodiment delivery routing scheme;
fig. 4 is a diagram of the result of region division.
Detailed Description
In order to make the technical solutions and advantages of the present invention clearer, the following describes the technical solutions in the embodiments of the present invention clearly and completely with reference to the drawings in the embodiments of the present invention:
it should be noted that, in the case of conflict, the embodiments and features of the embodiments of the present invention may be combined with each other, and the present invention will be described in detail with reference to the accompanying drawings and embodiments.
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all the embodiments. The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the invention, its application, or uses. All other embodiments, which can be obtained by a person skilled in the art without making any creative effort based on the embodiments in the present invention, belong to the protection scope of the present invention.
It is noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of example embodiments in accordance with the invention. As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, and it should be understood that when the terms "comprises" and/or "comprising" are used in this specification, they specify the presence of stated features, steps, operations, devices, components, and/or combinations thereof, unless the context clearly indicates otherwise.
The relative arrangement of the components and steps, the numerical expressions and numerical values set forth in these embodiments do not limit the scope of the present invention unless specifically stated otherwise. Meanwhile, it should be understood that the sizes of the respective portions shown in the drawings are not drawn in an actual proportional relationship for the convenience of description. Techniques, methods, and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate. In all examples shown and discussed herein, any particular value should be construed as exemplary only and not as limiting. Thus, other examples of the exemplary embodiments may have different values. It should be noted that: like reference numbers and letters indicate like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.
In the description of the present invention, it is to be understood that the directions or positional relationships indicated by the directional terms such as "front, rear, upper, lower, left, right", "lateral, vertical, horizontal" and "top, bottom", etc., are generally based on the directions or positional relationships shown in the drawings for the convenience of description and simplicity of description, and that these directional terms, unless otherwise specified, do not indicate and imply that the device or element so referred to must have a particular orientation or be constructed and operated in a particular orientation, and therefore should not be considered as limiting the scope of the invention: the terms "inner and outer" refer to the inner and outer relative to the profile of the respective component itself.
Spatially relative terms, such as "above … …," "above … …," "above … …," "above," and the like, may be used herein for ease of description to describe one device or feature's spatial relationship to another device or feature as illustrated in the figures. It will be understood that the spatially relative terms are intended to encompass different orientations of the device in use or operation in addition to the orientation depicted in the figures. For example, if a device in the figures is turned over, devices described as "above" or "on" other devices or configurations would then be oriented "below" or "under" the other devices or configurations. Thus, the exemplary term "above … …" can include both an orientation of "above … …" and "below … …". The device may be otherwise oriented (rotated 90 degrees or at other orientations) and the spatially relative descriptors used herein interpreted accordingly.
It should be noted that the terms "first", "second", and the like are used to define the components, and are only used for convenience of distinguishing the corresponding components, and the terms have no special meanings unless otherwise stated, and therefore, the scope of the present invention should not be construed as being limited.
A region division method for urban logistics immediate distribution merchants comprises the following steps:
s1, setting out degree-in degree constraint of nodes, region constraint of merchants, number constraint of merchants in each region, vehicle number constraint, time continuity constraint of vehicles visiting a certain place, time window constraint and visit sequence constraint of merchants and customers by using the distribution cost minimization of the historical orders of the city where a certain logistics platform is located as an objective function, and constructing a merchant region division model, wherein the nodes comprise: a distribution center location, a merchant location, and a customer delivery location;
and S2, obtaining the partition result of the area of the immediate distribution merchant of the logistics platform by adopting the existing integer programming model solving software through the merchant area partition model based on the historical order information of the logistics platform.
Steps S1 and S2 are sequentially carried out;
further, the historical order information includes the order placing time, the place of the merchant from which the goods required by the order come, and the delivery place and time period range required by the customer.
The objective function expression is as follows
Wherein:
i, j may be a distribution center (i.e., the starting and stopping point of the distribution vehicle), a route merchant (explained below), or a customer, d is a certain distribution day, z is a certain area,
indicating whether the user is visited before or after the two points i, j in the area on the delivery day.
There are two concepts of "source merchant" and "route merchant" in this patent. There is only one "source merchant" per merchant, the merchant itself. The number of the route merchants of each merchant can be multiple, namely the merchants are duplicated into multiple according to the number of customers, each route merchant corresponds to a pick-up store of one customer, and each route merchant can be accessed only once.
c ij : indicating the distribution cost between points i, j.
Further: the merchant region division model is as follows:
wherein: the constraints (2) to (4) represent y rz Associated limit, y rz Indicating whether the source merchant r is assigned to a distribution area z. Constraint (2) is a node out-of-range and in-range constraint, which means that if a vehicle exits (i.e. out-of-range is 1) or enters (i.e. in-range is 1) from a certain point i (i is a route merchant or a customer point) in an area z on a certain day, the source merchant of the point must be in the area z, otherwise, the source merchant of the point is not in the area z. Here, the out-degree and the in-degree are concepts in a directed graph, the out-degree represents the number of out-sides of a certain point, and the in-degree represents the number of in-sides of a certain point, where the out-degree is equal to the in-degree, that is, for a certain point, the number of sides entering the point (the number of times the vehicle enters) is equal to the number of sides exiting the point (the number of times the vehicle exits). In addition, if the degree of departure exists, the degree of departure must be 1, and similarly, if the degree of entrance exists, the degree of entrance must be 1, because i in the place is a route merchant or a customer point, and if the route merchant or the customer point is visited, the route merchant or the customer point can only be visited once;
constraint (3) is a constraint of the region to which the source merchant belongs, and the constraint indicates that each source merchant necessarily belongs to one region;
constraint (4) is the quantity constraint of merchants in each area, and the constraint gives the quantity range of source merchants contained in each area;
the constraints (5) to (9) represent
A related limitation;
the constraint (5) is a vehicle number constraint, and the constraint indicates that the sum of the number of vehicles used in all areas per day cannot exceed an upper limit, namely an out-degree upper limit and an in-degree upper limit of an o point (distribution central point), and each vehicle is supposed to be used in only one area and cannot be used across areas;
the constraint (6) is a time continuity constraint of the vehicle access points, and the constraint ensures that the time sequence of the vehicle access points is continuous, namely if the vehicle accesses the i point first and then accesses the j point, the time for the vehicle to access the j point is not less than the sum of the time for the vehicle to access the i point and the travel time between the i point and the j point;
constraint (7) indicates that the visit time of the distribution center is 0;
the constraint (8) is a time window constraint, which indicates that the time for the vehicle to arrive at the customer i to deliver the goods is within the delivery time range required by the customer i, and the time window constraint is the time window range required by the customer to deliver the goods when placing an order; for example, if the time window for customer i is [10:00,10:30], the vehicle should deliver the goods to the customer within a time range of 10:00-10: 30;
the constraint (9) is a point's visit order constraint, which means that the customer point must be visited after its route merchant point, i.e. the vehicle must first come to the merchant to pick up the goods before the goods can be delivered to the customer;
the above model uses the following symbols, which represent the meanings:
r: subscript of a set of active merchants is R, and R belongs to R;
d: the subscript of the set of all the distribution days is D, and D belongs to D;
z: the subscript of the set of all the regions is Z, and Z belongs to Z;
k: a set of all vehicles;
C d : the set of all customers on d days;
R d : a set of all route merchants on day d;
N d : the collection of all points on d days comprises a distribution center o and a customer point C d And route merchant point R d ；
r i : i is a route merchant or a customer, i belongs to U d∈D (R d ∪C d )，r i Representing the source merchant to which i belongs;
o: indicating a distribution center;
[e i ,l i ]: i is a customer，i∈∪ d∈D C d ，[e i ,l i ]A time window representing customer i;
[ L, U ]: representing a lower bound and an upper bound for the number of merchants in each area;
y rz : r is the source merchant, z is a certain delivery area, and the variable y rz Indicates whether the source merchant r is assigned to zone z;
further: and obtaining the partition result of the immediate distribution merchant area of the platform through the merchant area partition model and the existing integer programming model solving software.
Further: the existing integer linear programming model solving software comprises Gurob, Cplex or Lingo and the like;
in the case of the example 1, the following examples are given,
step 1: obtaining historical order data including the order time of the order, the place of the order merchant, the delivery place requested by the customer and the delivery time window, i.e. the time period range [ e ] i ,l i ]. Copying each merchant into a plurality of copies corresponding to each customer, wherein each copy is called as a 'route merchant', and recording the customer corresponding to each 'route merchant' and a 'source merchant' to which the customer belongs;
step 2: acquiring the travel time t between any two points (i, j) according to the historical order data ij And distribution cost c ij Setting the upper and lower limits of the number of merchants in each region [ L, U ]]A vehicle set K;
step 3: the travel time t between two points (i, j) ij The source merchant r to which the route merchant i belongs i Delivery time window [ e ] for customer j j ,l j ]Number of merchants upper and lower bound [ L, U ]]Inputting the isoparametric into a merchant region division model;
step 4: solving a software Gurobi operation merchant region division model by means of an integer linear programming model to obtain a merchant region division scheme;
for example, assuming that there are 4 merchants A, B, C, D, 8 orders 1, 2, 3, 4, 5, 6, 7, 8 on a day, these 4 merchants are now pre-divided into 2 areas. It is known that: the order of the merchant A is 1 and 2, the order of the merchant B is 3, the order of the merchant C is 4, 5 and 6, the order of the merchant D is 7 and 8, and r is set 1 ＝r 2 ＝A，r 3 ＝B，r 4 ＝r 5 ＝r 6 ＝C，r 7 ＝r 8 D. The delivery time window for each order is as follows, with the two numbers in parentheses indicating the start and stop times of the delivery time period requested by the customer: [0,4]，[1,6]，[3,7]，[2,5]，[2,7]，[3,9]，[0,6]，[1,9](ii) a The location distribution of the merchant and the customer is shown in fig. 2.
Calculating the travel time t between each point according to the order data ij And distribution cost c ij It is assumed that the number of merchants in each area has an upper limit L of 1, a lower limit U of 3, and a number K of 4. The data are brought into a mathematical model, a Gurobi solver is used for solving a merchant region division model, and merchant region division model variables are used
The results of the distribution route plan obtained on the day are shown in fig. 3.
The merchant region division model will eventually find the variable y rz Obtaining the value of the merchant partition scheme; the 4 merchants are divided into 2 areas, area one contains merchants A and B, area two contains merchants C and D, and the result of area division is shown in FIG. 4.
Finally, it should be noted that: the above embodiments are only used for illustrating the technical solutions of the present invention, and not for limiting the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.
Claims (6)
1. A region division method for city logistics immediate delivery merchants is characterized in that: the method comprises the following steps:
setting node out-degree and in-degree constraint, merchant belonging area constraint, merchant number constraint in each area, vehicle number constraint, time continuity constraint of vehicle visiting a certain place, time window constraint and access sequence constraint of merchants and customers by using the distribution cost minimization of historical orders in a city where a certain logistics platform is located as an objective function, and constructing a merchant area division model, wherein the node comprises: a distribution center location, a merchant location, and a customer delivery location;
based on the historical order information of the logistics platform, the division result of the area of the immediate distribution merchant of the platform is obtained by adopting the existing integer programming model solving software through a merchant area division model.
2. The method of claim, wherein the area of the merchant is divided into two areas, and the area of the merchant is divided into two areas, wherein the area of the area is divided into two areas, and the area of the area is divided into two areas, and the area of the area is divided into the area of the city, and the area of the city, and the area of the area is divided, and the area of the area, and the area of the area is divided, and the area of the city, and the area, of the city, and the area of the city, of the area, and the area, the area of the city, the area of the area, the city, of the city, the area, of the area, of the city, the area, and the area, and the area, of the area: the historical order information includes the time the order was placed, the location of the merchant from which the goods required for the order came, and the delivery location and time range requested by the customer.
3. The method for dividing the area of the urban logistics immediate distribution merchant according to the claim, characterized in that: the objective function expression is as follows
Wherein:
i, j is a distribution center, route merchant, or customer, d is a certain distribution day, z is a certain area,
whether the vehicle visits the area in front of and behind the i, j points continuously on the distribution day or not is shown;
c ij : indicating the distribution cost between points i, j.
4. The method for dividing the area of the urban logistics immediate distribution merchant according to the claim, characterized in that: the merchant region division model is as follows:
wherein: the constraints (2) to (4) represent y rz Associated limit, y rz Indicates whether the source merchant r is assigned to a distribution area z;
constraint (2) is a node out-of-degree and in-degree constraint, which indicates that if a vehicle exits from a certain route merchant or customer point in the area z on a certain day or a vehicle enters from a certain route merchant or customer point in the area z on a certain day, the source merchant of the point must be in the area z, otherwise, the source merchant of the point is not in the area z;
constraint (3) is a constraint of the region to which the source merchant belongs, and the constraint indicates that each source merchant necessarily belongs to one region;
constraint (4) is the quantity constraint of merchants in each area, and the constraint gives the quantity range of source merchants contained in each area;
the constraints (5) to (9) represent
A related limitation;
the constraint (5) is a vehicle number constraint, the constraint indicates that the sum of the number of vehicles used in all areas cannot exceed an upper limit every day, namely an o-point out-degree upper limit and an in-degree upper limit, and it is assumed that each vehicle can be used in only one area and cannot be used across areas;
the constraint (6) is a time continuity constraint of the vehicle access points, and the constraint ensures that the time sequence of the vehicle access points is continuous, namely if the vehicle accesses the i point first and then accesses the j point, the time for the vehicle to access the j point is not less than the sum of the time for the vehicle to access the i point and the travel time between the i point and the j point;
constraint (7) indicates that the visit time of the distribution center is 0;
constraint (8) is a time window constraint indicating that the time at which the vehicle arrives for delivery by customer i is within the delivery time range requested by customer i;
the constraint (9) is a point's access sequence constraint that indicates that the customer point must be accessed after its route merchant point, i.e., the vehicle must first come to the merchant to pick up the goods before the goods can be delivered to the customer;
wherein: r: subscript of a set of active merchants is R, and R belongs to R;
d: the subscript of the set of all the distribution days is D, and D belongs to D;
z: the subscript of the set of all the regions is Z, and Z belongs to Z;
k: a set of all vehicles;
C d : the set of all customers on d days;
R d : a set of all route merchants on day d;
N d : the collection of all points on d days comprises a distribution center o and a customer point C d And route merchant point R d ；
r i : i is a route merchant or a customer, i belongs to U d∈D (R d ∪C d )，r i Indicating the source merchant to which i belongs;
o: indicating a distribution center;
[e i ,l i ]: i is a customer, i belongs to U d∈D C d ，[e i ,l i ]A time window representing customer i;
[ L, U ]: representing a lower bound and an upper bound for the number of merchants in each area;
y rz : r is the source merchant, z is a certain delivery area, and the variable y rz Indicates whether the source merchant r is assigned to zone z;
5. the method for dividing the area of the urban logistics immediate distribution merchant according to the claim, characterized in that: and obtaining the partition result of the immediate distribution merchant area of the platform through the merchant area partition model and the existing integer programming model solving software.
6. The method of claim, wherein the area of the merchant is divided into two areas, and the area of the merchant is divided into two areas, wherein the area of the area is divided into two areas, and the area of the area is divided into two areas, and the area of the area is divided into the area of the city, and the area of the city, and the area of the area is divided, and the area of the area, and the area of the area is divided, and the area of the city, and the area, of the city, and the area of the city, of the area, and the area, the area of the city, the area of the area, the city, of the city, the area, of the area, of the city, the area, and the area, and the area, of the area: the existing integer linear programming model solving software comprises Gurobi, Cplex or Lingo.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210558090.0A CN115099460A (en) | 2022-05-19 | 2022-05-19 | Region division method for urban logistics immediate distribution merchants |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210558090.0A CN115099460A (en) | 2022-05-19 | 2022-05-19 | Region division method for urban logistics immediate distribution merchants |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115099460A true CN115099460A (en) | 2022-09-23 |
Family
ID=83288888
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210558090.0A Pending CN115099460A (en) | 2022-05-19 | 2022-05-19 | Region division method for urban logistics immediate distribution merchants |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115099460A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116596170A (en) * | 2023-07-18 | 2023-08-15 | 合肥城市云数据中心股份有限公司 | Intelligent prediction method for delivery time based on space-time attention mechanism |
| CN117035897A (en) * | 2023-05-26 | 2023-11-10 | 浙江大学 | Instant delivery platform rider unilateral method |
-
2022
- 2022-05-19 CN CN202210558090.0A patent/CN115099460A/en active Pending
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117035897A (en) * | 2023-05-26 | 2023-11-10 | 浙江大学 | Instant delivery platform rider unilateral method |
| CN117035897B (en) * | 2023-05-26 | 2024-04-12 | 浙江大学 | Instant delivery platform rider unilateral method |
| CN116596170A (en) * | 2023-07-18 | 2023-08-15 | 合肥城市云数据中心股份有限公司 | Intelligent prediction method for delivery time based on space-time attention mechanism |
| CN116596170B (en) * | 2023-07-18 | 2023-09-22 | 合肥城市云数据中心股份有限公司 | Intelligent prediction method for delivery time based on space-time attention mechanism |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ansari et al. | Advancements in continuous approximation models for logistics and transportation systems: 1996–2016 | |
| Cardenas et al. | City logistics, urban goods distribution and last mile delivery and collection | |
| Oruc et al. | Post-disaster assessment routing problem | |
| JP6945076B2 (en) | Efficient route planning systems, equipment, and methods for e-commerce fulfillment | |
| Zhang et al. | Control of robotic mobility-on-demand systems: a queueing-theoretical perspective | |
| Pavone | Autonomous mobility-on-demand systems for future urban mobility | |
| Laporte et al. | Shared mobility systems | |
| Shu et al. | Models for effective deployment and redistribution of bicycles within public bicycle-sharing systems | |
| Ghaderi et al. | Crowdsourced last-mile delivery with parcel lockers | |
| US20170046653A1 (en) | Planning of transportation requests | |
| CN115099460A (en) | Region division method for urban logistics immediate distribution merchants | |
| Yuan et al. | A mixed integer linear programming model for optimal planning of bicycle sharing systems: A case study in Beijing | |
| Li et al. | Implications of matching and pricing strategies for multiple-delivery-points service in a freight O2O platform | |
| Lee et al. | A heuristic for vehicle fleet mix problem using tabu search and set partitioning | |
| Mancini et al. | Bundle generation for last-mile delivery with occasional drivers | |
| Zhao et al. | Ridesharing problem with flexible pickup and delivery locations for app-based transportation service: Mathematical modeling and decomposition methods | |
| Li et al. | Optimizing flexible one-to-two matching in ride-hailing systems with boundedly rational users | |
| Caros et al. | Day-to-day market evaluation of modular autonomous vehicle fleet operations with en-route transfers | |
| Vishkaei et al. | Balancing public bicycle sharing system using inventory critical levels in queuing network | |
| Inturri et al. | Taxi vs. demand responsive shared transport systems: An agent-based simulation approach | |
| Dragomir et al. | The pickup and delivery problem with alternative locations and overlapping time windows | |
| Asghari et al. | Environmental and social implications of incorporating carpooling service on a customized bus system | |
| Zhu et al. | Location deployment of depots and resource relocation for connected car-sharing systems through mobile edge computing | |
| Ban et al. | Curvature-based distribution algorithm: rebalancing bike sharing system with agent-based simulation | |
| Janinhoff et al. | Multitrip vehicle routing with delivery options: A data-driven application to the parcel industry |
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 |