CN113706084B - Door and window warehouse storage position adjusting method based on Internet of things and big data - Google Patents

Door and window warehouse storage position adjusting method based on Internet of things and big data Download PDF

Info

Publication number
CN113706084B
CN113706084B CN202111260848.4A CN202111260848A CN113706084B CN 113706084 B CN113706084 B CN 113706084B CN 202111260848 A CN202111260848 A CN 202111260848A CN 113706084 B CN113706084 B CN 113706084B
Authority
CN
China
Prior art keywords
door
window
storage
warehouse
area
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202111260848.4A
Other languages
Chinese (zh)
Other versions
CN113706084A (en
Inventor
张钱良
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nantong Jinyueliang New Material Technology Development Co ltd
Original Assignee
Nantong Jinyueliang New Material Technology Development Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nantong Jinyueliang New Material Technology Development Co ltd filed Critical Nantong Jinyueliang New Material Technology Development Co ltd
Priority to CN202111260848.4A priority Critical patent/CN113706084B/en
Publication of CN113706084A publication Critical patent/CN113706084A/en
Application granted granted Critical
Publication of CN113706084B publication Critical patent/CN113706084B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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/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
    • 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/0639—Performance analysis of employees; Performance analysis of enterprise or organisation operations
    • G06Q10/06393—Score-carding, benchmarking or key performance indicator [KPI] analysis
    • 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/10—Office automation; Time management
    • G06Q10/109—Time management, e.g. calendars, reminders, meetings or time accounting
    • G—PHYSICS
    • G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16Y—INFORMATION AND COMMUNICATION TECHNOLOGY SPECIALLY ADAPTED FOR THE INTERNET OF THINGS [IoT]
    • G16Y10/00—Economic sectors
    • G16Y10/40—Transportation
    • G—PHYSICS
    • G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16Y—INFORMATION AND COMMUNICATION TECHNOLOGY SPECIALLY ADAPTED FOR THE INTERNET OF THINGS [IoT]
    • G16Y20/00—Information sensed or collected by the things
    • G16Y20/10—Information sensed or collected by the things relating to the environment, e.g. temperature; relating to location
    • G—PHYSICS
    • G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16Y—INFORMATION AND COMMUNICATION TECHNOLOGY SPECIALLY ADAPTED FOR THE INTERNET OF THINGS [IoT]
    • G16Y20/00—Information sensed or collected by the things
    • G16Y20/20—Information sensed or collected by the things relating to the thing itself

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Strategic Management (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Tourism & Hospitality (AREA)
  • Theoretical Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Marketing (AREA)
  • Physics & Mathematics (AREA)
  • Computing Systems (AREA)
  • General Physics & Mathematics (AREA)
  • Accounting & Taxation (AREA)
  • Educational Administration (AREA)
  • Health & Medical Sciences (AREA)
  • Environmental & Geological Engineering (AREA)
  • General Health & Medical Sciences (AREA)
  • Toxicology (AREA)
  • Game Theory and Decision Science (AREA)
  • Finance (AREA)
  • Data Mining & Analysis (AREA)
  • Warehouses Or Storage Devices (AREA)
  • Air Conditioning Control Device (AREA)

Abstract

The invention relates to a door and window warehouse storage position adjusting method based on the Internet of things and big data, and belongs to the technical field of warehouse storage management. The method comprises the following steps: acquiring a floor plan of a door and window warehouse, and identifying a storage position, a passageway position and an entrance position in the floor plan of the door and window warehouse; when doors and windows are to be warehoused, calculating the transportation time corresponding to each door and window position adjustment scheme according to the storage position, the aisle position and the entrance position, wherein the transportation time comprises the warehousing time of the doors and windows to be warehoused and the storage position adjustment time; calculating the rationality corresponding to each door and window position adjusting scheme according to the carrying time, the door and window heat matching degree and the door and window category aggregation degree corresponding to each door and window position adjusting scheme; and selecting the door and window position adjusting scheme according to the rationality corresponding to each door and window position adjusting scheme. The invention has reasonable arrangement of the storage positions of the doors and the windows.

Description

Door and window warehouse storage position adjusting method based on Internet of things and big data
Technical Field
The invention relates to the technical field of warehouse storage management, in particular to a door and window warehouse storage position adjusting method based on the Internet of things and big data.
Background
The door and window warehouse is used for storing doors and windows, a plurality of storage positions for storing the doors and the windows are arranged in the warehouse, and when the doors and the windows need to be put in the warehouse, the storage positions of the doors and the windows need to be determined. In the existing method, when the storage positions of doors and windows to be warehoused in a warehouse are determined, in order to reduce the door and window carrying time, only the distance between the current vacant storage position and the warehouse entrance is often referred to, and the door and window to be warehoused are stored in the storage position closest to the warehouse entrance each time. Although the method can ensure the shortest transportation time of the secondary door and window, the method cannot ensure the shorter transportation time of the whole door and window, so that the existing method has the problem of unreasonable arrangement of the door and window storage position.
Disclosure of Invention
The invention aims to provide a door and window warehouse storage position adjusting method based on the Internet of things and big data, which is used for solving the problem that the door and window storage positions are unreasonably arranged in the existing method.
In order to solve the problems, the technical scheme of the door and window warehouse storage position adjusting method based on the internet of things and big data comprises the following steps:
acquiring a floor plan of a door and window warehouse, and identifying a storage position, a passageway position and an entrance position in the floor plan of the door and window warehouse;
when doors and windows are to be warehoused, calculating the transportation time corresponding to each door and window position adjustment scheme according to the storage position, the aisle position and the entrance position, wherein the transportation time comprises the warehousing time of the doors and windows to be warehoused and the storage position adjustment time;
calculating the rationality corresponding to each door and window position adjusting scheme according to the carrying time, the door and window heat matching degree and the door and window category aggregation degree corresponding to each door and window position adjusting scheme;
and selecting the door and window position adjusting scheme according to the rationality corresponding to each door and window position adjusting scheme.
The beneficial effects of the invention are: when doors and windows are to be put in storage, calculating the rationality corresponding to each door and window position adjusting scheme according to the carrying time, the door and window heat matching degree and the door and window category aggregation degree corresponding to each door and window position adjusting scheme, and selecting the door and window position adjusting scheme according to the rationality corresponding to each door and window position adjusting scheme; the invention comprehensively considers the reasonability of the position adjusting scheme of each door and window from multiple aspects, and the arrangement of the storage positions of the doors and the windows is more reasonable.
Further, the method for calculating the door and window heat matching degree corresponding to each door and window position adjustment scheme comprises the following steps:
judging whether doors and windows are stored in each storage position after adjustment according to each door and window position adjustment scheme;
for each storage position where doors and windows are stored, calculating the ex-warehouse time index corresponding to the storage position and the ex-warehouse heat degree of the door and window category to which the doors and windows stored in the storage position belong in a set time period in the future, and calculating the door and window heat degree matching degree corresponding to the storage position according to the ex-warehouse time index and the ex-warehouse heat degree;
and calculating the door and window heat degree matching degree corresponding to each door and window position adjusting scheme according to the door and window heat degree matching degree corresponding to each storage position in which the door and window is stored.
Further, the calculation formula of the door and window heat matching degree corresponding to each storage position storing the door and window is as follows:
Figure 236006DEST_PATH_IMAGE002
Figure 310273DEST_PATH_IMAGE004
Figure 385676DEST_PATH_IMAGE006
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE007
the matching degree of the heat degree of the door and window corresponding to the storage position of the ith door and window is the index of the time of leaving warehouse corresponding to the storage position of the ith door and window,
Figure 628307DEST_PATH_IMAGE008
the door and window category to which the door and window stored for the ith storage location belongs is
Figure DEST_PATH_IMAGE009
The heat of the inner part of the container when the container is taken out of the container,
Figure 623115DEST_PATH_IMAGE010
the corresponding warehouse-out time of the storage position of the door and window is stored for the ith,
Figure DEST_PATH_IMAGE011
the door and window category to which the door and window stored for the ith storage location belongs is
Figure 937291DEST_PATH_IMAGE009
The number of times of delivery of the warehouse in the warehouse,
Figure 571928DEST_PATH_IMAGE009
for the ith storage position for storing doors and windowsThe corresponding future sets the time period.
Further, the method for calculating the door and window category aggregation degree corresponding to each door and window position adjustment scheme comprises the following steps:
judging whether doors and windows are stored in each storage position after adjustment according to each door and window position adjustment scheme;
for each storage position where doors and windows are stored, calculating the door and window category aggregation degree corresponding to the door and window category to which the doors and windows stored in the storage position belong according to the distance between the storage position and the corresponding door and window category aggregation center;
and calculating the door and window category aggregation degree corresponding to each door and window position adjusting scheme according to the door and window category aggregation degree corresponding to each door and window category.
Further, the calculation formula of the door and window category aggregation degree corresponding to each door and window category is as follows:
Figure DEST_PATH_IMAGE013
wherein the content of the first and second substances,
Figure 782198DEST_PATH_IMAGE014
the aggregation degree of the door and window categories corresponding to the kth door and window category,
Figure DEST_PATH_IMAGE015
the abscissa of the storage position of the door and window for the jth stored door and window category,
Figure 571294DEST_PATH_IMAGE016
the abscissa of the aggregation center corresponding to the kth door and window category,
Figure DEST_PATH_IMAGE017
for the ordinate of the storage position of the jth door window stored with the kth door window category,
Figure 223248DEST_PATH_IMAGE018
is the ordinate of the aggregation center corresponding to the kth door and window category,
Figure DEST_PATH_IMAGE019
the number of storage positions where the door/window of the kth door/window category is stored.
Furthermore, the rationality and the carrying time form a negative correlation relationship, the rationality and the door and window heat matching degree form a positive correlation relationship, and the rationality and the door and window category aggregation degree form a positive correlation relationship.
Further, the calculation formula of the rationality corresponding to each door and window position adjustment scheme is as follows:
Figure DEST_PATH_IMAGE021
wherein the content of the first and second substances,
Figure 584829DEST_PATH_IMAGE022
for the corresponding rationality of the adjustment scheme of the mth door and window position,
Figure DEST_PATH_IMAGE023
for the transport time corresponding to the mth door and window position adjustment scheme,
Figure 234509DEST_PATH_IMAGE024
the door and window heat matching degree corresponding to the storage position of the ith door and window corresponding to the mth door and window position adjusting scheme,
Figure DEST_PATH_IMAGE025
for the door and window category aggregation degree corresponding to the kth door and window category corresponding to the mth door and window position adjustment scheme,
Figure 275015DEST_PATH_IMAGE026
the number of the storage positions of the doors and windows is stored corresponding to the mth door and window position adjustment scheme,
Figure DEST_PATH_IMAGE027
the number of the door and window types corresponding to the mth door and window position adjustment scheme,
Figure 166879DEST_PATH_IMAGE028
the weight corresponding to the transportation time is the weight,
Figure DEST_PATH_IMAGE029
the weight corresponding to the degree of matching of the heat degree of the door and the window,
Figure 991089DEST_PATH_IMAGE030
and the weight corresponding to the door and window category aggregation degree is obtained.
Drawings
FIG. 1 is a flow chart of a door and window warehouse storage location adjustment method based on the Internet of things and big data according to the present invention;
FIG. 2 is a schematic view of a door and window storage of the present invention;
FIG. 3 is a schematic diagram of the adjacency relation of the present invention.
Detailed Description
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 described below with reference to the drawings in the embodiments of the present invention.
The embodiment aims to improve the reasonability of arrangement of the storage positions of the doors and windows in the door and window warehouse, and as shown in fig. 1, the method for adjusting the storage positions of the door and window warehouse based on the internet of things and big data comprises the following steps:
(1) acquiring a floor plan of a door and window warehouse, and identifying a storage position, a passage position, an entrance position and an exit position in the floor plan of the door and window warehouse;
after the floor plan of the door and window warehouse is obtained, the whole warehouse area in the map is firstly divided by using the warehouse position detection network to obtain the whole warehouse map area. In the embodiment, the warehouse position detection network adopts a DNN (deep neural network) with an Encoder-Decoder structure, and when the warehouse position detection network is trained, a data set is a floor plan of a door and window warehouse; the labels are of two types, the warehouse area is 1, and the others are 0; cross entropy is used as a loss function.
After the entire warehouse area is obtained, the warehouse access position and the storage position in the warehouse are marked in the warehouse floor plan by using the warehouse partition network. The warehouse partition network of the embodiment adopts DNN with an Encoder-Decoder structure, and when the warehouse partition network is trained, a data set is a whole warehouse area map; the labels are 5 types, the storage position is marked as 1, the aisle position is marked as 2, the entrance position is marked as 3, the exit position is marked as 4, and other positions are marked as 0; the loss function is a cross entropy loss function.
In this way, the positions of the various storage locations, aisle locations, entrance locations and exit locations in the door and window warehouse can be obtained.
(2) When doors and windows are to be put in storage, calculating the conveying time corresponding to each door and window position adjusting scheme according to the storage position, the aisle position and the entrance position, wherein the conveying time comprises the storage time and the storage position adjusting time of the doors and windows to be put in storage;
when doors and windows are to be put in a warehouse, all storage positions in the warehouse are traversed, the storage positions can be divided into 2 types, one type is occupied storage positions, namely storage positions where doors and windows are stored, and the other type is unoccupied storage positions, namely storage positions where doors and windows are not stored. For any storage position in the warehouse, the present embodiment determines whether the storage position is occupied by setting a pressure sensor at the storage position, and the determination method is as follows: if the reading of the pressure sensor is not zero, the corresponding storage position is occupied; if the indication number of the pressure sensor is zero, the corresponding storage position is not occupied.
If the doors and windows to be put into the warehouse need to be stored in the unoccupied storage positions in the door and window position adjusting scheme
Figure DEST_PATH_IMAGE031
Then, the adjusting sequence of the door and window storage position corresponding to the door and window position adjusting scheme is as follows:
Figure 808741DEST_PATH_IMAGE032
because the door and window position adjusting scheme only stores the doors and windows to be put into storage in the storage positions
Figure 431484DEST_PATH_IMAGE031
The adjustment of the existing door and window storage positions in the warehouse is not involved, so that the door and window storage position adjustment sequence corresponding to the door and window position adjustment scheme only comprises one element
Figure DEST_PATH_IMAGE033
，
Figure 362924DEST_PATH_IMAGE033
As a storage location
Figure 121933DEST_PATH_IMAGE031
The number of (2); corresponding carrying time of the door and window position adjusting scheme
Figure 766278DEST_PATH_IMAGE034
Wherein, in the step (A),
Figure DEST_PATH_IMAGE035
representing the transport time when the entrance position is the starting point and the storage position P is the end point.
If the doors and windows to be put into the warehouse need to be stored in the occupied storage positions in the door and window position adjusting scheme
Figure 17262DEST_PATH_IMAGE031
Then, the doors and windows originally stored in the storage position P need to be stored in other storage positions
Figure 345869DEST_PATH_IMAGE036
If the memory location is
Figure 959384DEST_PATH_IMAGE036
If the storage position is not occupied, the adjustment sequence of the storage position of the door and window corresponding to the door and window position adjustment scheme is as follows:
Figure DEST_PATH_IMAGE037
，
Figure 118839DEST_PATH_IMAGE038
as a storage location
Figure 450594DEST_PATH_IMAGE036
The number of (2); corresponding carrying time of the door and window position adjusting scheme
Figure DEST_PATH_IMAGE039
In which
Figure 786154DEST_PATH_IMAGE040
Representing the storage location starting from storage location P
Figure DEST_PATH_IMAGE041
The transport time at the end point.
If the above-mentioned storage position
Figure 424814DEST_PATH_IMAGE042
Is an occupied storage location, then the original storage location is stored in
Figure 115690DEST_PATH_IMAGE042
The door and window also need to be stored in other storage positions
Figure DEST_PATH_IMAGE043
If the memory location is
Figure 565433DEST_PATH_IMAGE043
The storage position is an unoccupied storage position, and the door and window storage position adjusting sequence corresponding to the door and window position adjusting scheme is as follows:
Figure 734377DEST_PATH_IMAGE044
，
Figure DEST_PATH_IMAGE045
is stored in a storage location for the original
Figure 24282DEST_PATH_IMAGE042
The door and window need to be transferred to the storage position
Figure 886059DEST_PATH_IMAGE043
The number of (2); corresponding carrying time of the door and window position adjusting scheme
Figure 192406DEST_PATH_IMAGE046
In which
Figure DEST_PATH_IMAGE047
Representing a storage location
Figure 807452DEST_PATH_IMAGE042
Starting from a storage location
Figure 748601DEST_PATH_IMAGE043
The transport time at the end point.
If the above-mentioned storage position
Figure 781279DEST_PATH_IMAGE043
The occupied storage position is the corresponding door and window storage position adjustment sequence of the door and window position adjustment scheme:
Figure 574922DEST_PATH_IMAGE048
corresponding carrying time of the door and window position adjusting scheme
Figure DEST_PATH_IMAGE049
The principle of the corresponding method for calculating the transportation time of the door and window position adjusting scheme is the same as that of the above calculation method, and the details are not repeated here.
The method for calculating the transport time between the two positions in the embodiment is as follows:
firstly, establishing a warehouse position coordinate system to measure relative positions among different positions;
in order to measure the relative position relationship among different positions in a door and window warehouse, a warehouse position coordinate system is established according to the distribution condition of the entrance and exit positions and the storage positions of the warehouse, and the specific method comprises the following steps:
using the left lower corner of the warehouse as the origin of coordinates and pixel coordinate system
Figure 790396DEST_PATH_IMAGE050
The positive direction of (A) is the positive direction of the x axis, and the pixel coordinate system
Figure DEST_PATH_IMAGE051
The negative direction of (a) is the y-axis positive direction, and the warehouse coordinate system is established, so that the width of the aisle region in the warehouse is 1 unit length of the coordinate system. Marking each storage position and the warehouse-in and warehouse-out positions in the warehouse in a coordinate system, as shown in fig. 2, acquiring the central position coordinates of different storage positions and warehouse-in and warehouse-out positions in the coordinate system, wherein the largest frame in fig. 2 represents the position of the whole warehouse, the small solid line square frame represents the storage area corresponding to different storage positions, and the broken line square frame represents the aisle area. The storage areas and the aisle areas are numbered respectively, as shown in fig. 2, P represents the storage area, R represents the aisle area, and the numbers increase from left to right and from bottom to top.
It should be noted that, different door and window warehouses have different floor plans, and the area division effect obtained according to the coordinate system establishing method is also different; the purpose of establishing the coordinate system in this embodiment is to measure the relative positions between different positions, and in practical application, the method need not be limited to the coordinate system establishment method, and different coordinate systems can be established according to practical situations.
Searching a conveying path between a start point and a stop point according to the relative position relation of each region;
the transport time is measured based on the shortest possible transport path between the transport start point and the transport end point, and the transport path is the travel path between the transport start point and the transport end point. And determining the adjacent aisle of each storage area according to the relative position relationship between the storage areas and the aisle areas. When goods are stored in or taken out of the current storage area, the trolley responsible for the handling work must be located on the adjacent aisle to complete the storage and taking action. The adjacent aisle area selection conditions of the current storage area are as follows:
Figure DEST_PATH_IMAGE053
wherein, the current storage area is centrally seatedWith coordinates of the centre of the other aisle areas
Figure 867943DEST_PATH_IMAGE054
Distance. A 1 indicates a contiguous aisle that is the current storage area, and a 0 indicates a contiguous aisle that is not the current storage area. For example, in fig. 2, the adjacent aisle of P1 is three areas R2, R14 and R19, the adjacent aisle of P2 is two areas R3 and R20, the adjacent aisle of the warehouse-in position is an area R7, and the adjacent aisle of the warehouse-out position is an area R58. It should be noted that the present embodiment will be described
Figure DEST_PATH_IMAGE055
The judgment condition is that the distance between the adjacent storage area and the aisle area in the coordinate system established by the embodiment is 1, and the distance between the non-adjacent storage area and the aisle area is greater than 1; if the coordinate system established in the actual application is changed, the judgment needs to be carried out according to the actual situation
Figure 979512DEST_PATH_IMAGE056
Whether or not less than or equal to other values.
And determining an adjacency list of each aisle area according to the position coordinates of each aisle area in the warehouse. The adjacency list represents the position relation of the aisle areas, namely the adjacency relation of the aisle areas. Determining aisle area conditions adjacent to the current aisle as:
Figure 994872DEST_PATH_IMAGE058
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE059
for the coordinates of the center of the current aisle region and the center of the other aisle regions
Figure 479949DEST_PATH_IMAGE054
Distance. For example, in fig. 2, R1 is in communication with R2 and R14, R2 is in communication with R1 and R3, and R14 is in communication with R1 and R18. The communication relationship is real-time in this embodiment, and if the position of R1 is accidentally blocked, R is1 is not communicated with R2 and R14. As shown in fig. 3, R1 is adjacent to R14 and R2, R18 is adjacent to R14, R19 and R31, and R22 is adjacent to R15, R21, R23 and R32. It should be noted that the present embodiment will be described
Figure 897155DEST_PATH_IMAGE060
The judgment condition is that the distance between adjacent aisle areas in the coordinate system established in the embodiment is 1, and the distance between non-adjacent aisle areas is greater than 1; if the coordinate system established in the actual application is changed, the judgment needs to be carried out according to the actual situation
Figure 784819DEST_PATH_IMAGE059
Whether or not less than or equal to other values.
In this embodiment, all the transportation paths between the start-stop areas need to be determined, and the transportation paths can be possible paths for transporting the doors and windows from the start-point storage area to the end-point storage area. The method comprises the following specific steps:
determining a starting point storage area and an end point storage area;
respectively determining adjacent aisle areas of a starting point storage area and an end point storage area;
respectively taking each adjacent aisle area of the starting point storage area as a starting point area and each adjacent aisle area of the end point storage area as an end point area;
calculating all the transport paths between the starting point regions and the end point regions by using DFS depth-first traversal, and recording the paths as
Figure DEST_PATH_IMAGE061
、
Figure 192536DEST_PATH_IMAGE062
、…
Figure DEST_PATH_IMAGE063
。
Calculating the required conveying time of each conveying path;
calculating the path length of each path for all possible conveying pathsLength of conveying path
Figure 717189DEST_PATH_IMAGE064
The number of aisle areas included in this path. For example, in FIG. 2, one path is R2-R1-R14-R18-R19-R20, and the length of this path is 6.
Considering that the speed of the car in the turning region in the conveying path is reduced relative to the speed of the non-turning region when the car is used for conveying the door and window, in order to accurately calculate the time corresponding to each conveying path, the embodiment also identifies the turning region in each conveying path. The identification process of the turning area is as follows:
acquiring horizontal and vertical coordinates of the center of each aisle area in each carrying path in a warehouse position coordinate system;
the abscissa of the center of the aisle area in each carrying path is respectively differed from the abscissa of the adjacent aisle area to obtain
Figure DEST_PATH_IMAGE065
. The adjacent aisle areas here refer to aisle areas adjacent to each other in front of and behind the current aisle area in the transport path. For example, in the paths R2-R1-R14-R18-R19-R20, the adjacent aisle regions of R1 are R2 and R14; the vertical coordinate of the center of the aisle area in each carrying path is respectively differed with the vertical coordinate of the adjacent area to obtain
Figure 162470DEST_PATH_IMAGE066
；
Judgment of
Figure 409650DEST_PATH_IMAGE065
Whether both are 0. If the number of the turning points is zero, the current aisle area is not a turning area; if not, carrying out the next step;
judgment of
Figure 399602DEST_PATH_IMAGE066
Whether both are 0. If the number of the turning points is zero, the current aisle area is not the turning area; if not, the current region is the turning region.
For example, in FIG. 2, one path is the path R2-R1-R14-R18-R19-R20. In this path, R1 and R2 have the same ordinate and different abscissa,
Figure DEST_PATH_IMAGE067
is zero,
Figure 963832DEST_PATH_IMAGE068
Is not zero; r1 and R14 have the same abscissa and different ordinate,
Figure DEST_PATH_IMAGE069
is zero,
Figure 995111DEST_PATH_IMAGE067
Is not zero; r1 is the corner region.
Counting the number of turning areas in each carrying path
Figure 711394DEST_PATH_IMAGE070
Calculating the relative transportation time required by each possible transportation path, and walking the current transportation path
Figure DEST_PATH_IMAGE071
Relative transport time required for transporting doors and windows
Figure 96633DEST_PATH_IMAGE072
The calculation formula of (a) is as follows:
Figure 556564DEST_PATH_IMAGE074
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE075
is the speed of the straight-line travel,
Figure 707929DEST_PATH_IMAGE076
is the running speed when turning a corner,
Figure DEST_PATH_IMAGE077
。
selecting relative transit times in all transport paths
Figure 694646DEST_PATH_IMAGE072
The shortest one is the conveying route from the starting point storage area to the end point storage area
Figure 190350DEST_PATH_IMAGE078
Transport path
Figure 657234DEST_PATH_IMAGE078
Corresponding relative transport time
Figure DEST_PATH_IMAGE079
I.e. the relative transit time between the start and stop zones.
According to the method for calculating the carrying time between the two positions, when doors and windows are to be put into a warehouse, the carrying time corresponding to each door and window position adjustment scheme can be calculated; in fig. 2, there are 27 storage areas, and there are 27 storage position adjustment schemes when doors and windows are newly put in storage, where each storage position adjustment scheme corresponds to one door and window position adjustment sequence, and each door and window position adjustment sequence corresponds to one transportation time.
(3) Calculating the rationality corresponding to each door and window position adjusting scheme according to the carrying time, the door and window heat matching degree and the door and window category aggregation degree corresponding to each door and window position adjusting scheme;
in addition to using the transportation time corresponding to each door and window position adjustment scheme as a reference factor for judging the rationality corresponding to each door and window position adjustment scheme, the embodiment also uses the door and window heat matching degree and the door and window category aggregation degree corresponding to each door and window position adjustment scheme as a reference factor for judging the rationality corresponding to each door and window position adjustment scheme.
The door and window heat degree matching degree mainly reflects the matching degree between the warehouse-out time corresponding to each storage position and the stored warehouse-out heat degree of the door and the window. The door and window warehouse is characterized in that the door and window warehouse can be moved out of the warehouse not once but for many times, the warehouse-out heat degree refers to the warehouse-out frequency corresponding to the door and window category to which the door and window belongs in a future period of time, and if the warehouse-out frequency of the category of a certain door and window in the future period of time is large, the warehouse-out heat degree corresponding to the door and window is large. If the warehouse-out heat of a certain door and window is larger and the corresponding storage position is closer to the exit position, the overall carrying time corresponding to each door and window position adjusting scheme is shorter; if the door and window is more hot when being taken out of the warehouse, but the corresponding storage position is far away from the exit position, the whole conveying time corresponding to each door and window position adjusting scheme is increased. Therefore, the higher the door and window heat matching degree corresponding to the door and window position adjusting scheme is, the higher the rationality corresponding to the door and window position adjusting scheme is.
The method for calculating the door and window heat matching degree corresponding to each door and window position adjusting scheme in the embodiment comprises the following steps:
judging whether doors and windows are stored in each storage position after adjustment according to each door and window position adjustment scheme;
for each storage position storing doors and windows, calculating the warehouse-out time index corresponding to the storage position and the warehouse-out heat degree of the door and window category to which the doors and windows stored in the storage position belong in a future set time period, and calculating the door and window heat degree matching degree corresponding to the storage position according to the warehouse-out time index and the warehouse-out heat degree;
and calculating the door and window heat degree matching degree corresponding to each door and window position adjusting scheme according to the door and window heat degree matching degree corresponding to each storage position in which the door and window is stored.
The calculation formula of the door and window heat matching degree corresponding to each storage position where the door and window is stored in the embodiment is as follows:
Figure 663105DEST_PATH_IMAGE002
Figure 222656DEST_PATH_IMAGE004
Figure 674497DEST_PATH_IMAGE006
wherein the content of the first and second substances,
Figure 476231DEST_PATH_IMAGE007
the heat matching degree of the door and window corresponding to the storage position of the ith door and window is stored,
Figure 930084DEST_PATH_IMAGE080
the corresponding warehouse-out time index of the storage position of the door and window is stored for the ith,
Figure 690229DEST_PATH_IMAGE008
the door and window category to which the door and window stored for the ith storage position belongs is
Figure 363787DEST_PATH_IMAGE009
The heat of the discharged warehouse in the warehouse,
Figure 205098DEST_PATH_IMAGE010
the corresponding warehouse-out time of the storage position of the door and window is stored for the ith,
Figure 280501DEST_PATH_IMAGE011
the door and window category to which the door and window stored for the ith storage position belongs is
Figure 444504DEST_PATH_IMAGE009
The number of times of delivery of the warehouse in the warehouse,
Figure 339779DEST_PATH_IMAGE009
and setting a time period for the future corresponding to the storage position of the ith door and window.
And summing the door and window heat degree matching degrees corresponding to the storage positions in which doors and windows are stored to obtain the door and window heat degree matching degree corresponding to the corresponding door and window position adjustment scheme.
The door and window type aggregation degree corresponding to each door and window position adjustment scheme mainly reflects whether the storage position of the door and window corresponding to each door and window type in the door and window warehouse is close or not; when the storage positions of the doors and windows corresponding to the door and window categories are close, the door and window category aggregation degree corresponding to the door and window position adjustment scheme is high; when the storage positions of the doors and windows corresponding to the door and window categories are far away, the door and window category aggregation degree corresponding to the door and window position adjustment scheme is low. When the door and window storage of the same door and window type is concentrated, the classification management of the door and window is convenient, so that the door and window type aggregation degree corresponding to the door and window position adjusting scheme is higher, and the reasonability corresponding to the door and window position adjusting scheme is higher.
The method for calculating the door and window category aggregation degree corresponding to each door and window position adjustment scheme in the embodiment comprises the following steps:
judging whether doors and windows are stored in each storage position after adjustment according to each door and window position adjustment scheme;
for each storage position where doors and windows are stored, calculating the door and window category aggregation degree corresponding to the door and window category to which the doors and windows stored in the storage position belong according to the distance between the storage position and the corresponding door and window category aggregation center;
and calculating the door and window category aggregation degree corresponding to each door and window position adjusting scheme according to the door and window category aggregation degree corresponding to each door and window category.
In the embodiment, the door and window category aggregation degree corresponding to the door and window category is calculated by calculating the mean value of the distance from each door and window storage position to the door and window aggregation center of the category in the same door and window category, and the coordinates of the door and window aggregation center of the category are obtained by calculating the mean value according to the coordinates corresponding to each door and window storage position in the category. The specific calculation formula for calculating the aggregation degree of the door and window categories corresponding to each door and window category in the embodiment is as follows:
Figure 748894DEST_PATH_IMAGE082
wherein the content of the first and second substances,
Figure 180269DEST_PATH_IMAGE014
the aggregation degree of the door and window categories corresponding to the kth door and window category,
Figure 751059DEST_PATH_IMAGE015
for the abscissa of the storage location of the jth door window stored in the kth door window category,
Figure 399209DEST_PATH_IMAGE016
the abscissa of the aggregation center corresponding to the kth door and window category,
Figure 844972DEST_PATH_IMAGE017
for the ordinate of the storage position of the jth door window stored with the kth door window category,
Figure 629388DEST_PATH_IMAGE018
the ordinate of the aggregation center corresponding to the kth door and window category is the number of storage positions of the doors and windows storing the kth door and window category.
And summing the door and window category aggregation degrees corresponding to the door and window categories to obtain the door and window category aggregation degree corresponding to the corresponding door and window position adjustment scheme.
In this embodiment, the rationality that each door and window position adjustment scheme corresponds with the transport time becomes the negative correlation, with door and window heat matching degree becomes positive correlation, with door and window category aggregation degree becomes positive correlation. The concrete calculation formula of the rationality corresponding to each door and window position adjusting scheme is as follows:
Figure 149842DEST_PATH_IMAGE021
wherein the content of the first and second substances,
Figure 19709DEST_PATH_IMAGE022
for the rationality of the adjustment scheme of the mth door and window position,
Figure 770627DEST_PATH_IMAGE023
for the transport time corresponding to the mth door and window position adjustment scheme,
Figure 173665DEST_PATH_IMAGE024
corresponding to the mth door or window position adjustment schemeThe heat matching degree of the door and window corresponding to the storage position of the ith door and window,
Figure 86257DEST_PATH_IMAGE025
for the door and window category aggregation degree corresponding to the kth door and window category corresponding to the mth door and window position adjustment scheme,
Figure 708999DEST_PATH_IMAGE026
the number of the storage positions of the doors and windows is stored corresponding to the mth door and window position adjustment scheme,
Figure 499494DEST_PATH_IMAGE027
the number of the door and window categories corresponding to the mth door and window position adjustment scheme,
Figure 258503DEST_PATH_IMAGE028
the weight corresponding to the carrying time is the weight,
Figure 840531DEST_PATH_IMAGE029
the weight corresponding to the degree of heat matching of the door and window,
Figure 684991DEST_PATH_IMAGE030
and the weight corresponding to the door and window category aggregation degree is obtained.
Figure 777712DEST_PATH_IMAGE028
、
Figure 627112DEST_PATH_IMAGE029
And
Figure 147087DEST_PATH_IMAGE030
the sum is 1, and the value can be determined according to the importance degree of the parameters in practical application.
(4) And selecting the door and window position adjusting scheme according to the corresponding rationality of each door and window position adjusting scheme.
And if doors and windows need to be put in storage, taking the door and window position adjusting scheme with the maximum rationality value as a door and window position adjusting scheme to be adopted, and determining the storage positions of the doors and windows to be put in storage and the storage positions of the relevant doors and windows after adjustment according to a door and window position adjusting sequence corresponding to the door and window position adjusting scheme to be adopted.
For example, the door/window position adjustment sequence corresponding to the door/window position adjustment scheme to be adopted is [5, 14, 11], and then the door/window position adjustment sequence is: transfer the door and window of P14 to P11 → transfer the door and window of P5 to P14 → transfer the door and window to be put in storage to P5.
In the present embodiment, the door and window warehouse is considered to be a case where the entrance and the exit are not at the same position, and if the entrance and the exit of the door and window warehouse are at the same position in practical application, it is only necessary to replace the calculation related to the exit position with the calculation related to the entrance position.
When doors and windows are to be put in storage, the rationality corresponding to each door and window position adjusting scheme is calculated according to the carrying time, the door and window heat matching degree and the door and window category aggregation degree corresponding to each door and window position adjusting scheme, and the door and window position adjusting scheme is selected according to the rationality corresponding to each door and window position adjusting scheme; the embodiment comprehensively considers the reasonability of each door and window position adjusting scheme from a plurality of aspects, and the arrangement of the door and window storage positions is reasonable.
It should be noted that while the preferred embodiments of the present invention have been described, additional variations and modifications to those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the invention.

Claims (1)

1. A door and window warehouse storage position adjusting method based on the Internet of things and big data is characterized by comprising the following steps:
acquiring a floor plan of a door and window warehouse, and identifying a storage position, a passageway position and an entrance position in the floor plan of the door and window warehouse;
when doors and windows are to be put in storage, the carrying time corresponding to each door and window position adjustment scheme is calculated according to the storage position, the passage position and the entrance position, wherein the carrying time comprises the door and window to be put in storageAdjusting time of warehousing time and storage position; if the doors and windows to be put into the warehouse need to be stored in the occupied storage positions in the door and window position adjusting scheme
Figure DEST_PATH_IMAGE002
And the doors and windows originally stored in the storage position P need to be stored in the storage positions which are not occupied
Figure DEST_PATH_IMAGE004
Then the transportation time corresponding to the door and window position adjustment scheme
Figure DEST_PATH_IMAGE006
Wherein, in the step (A),
Figure DEST_PATH_IMAGE008
the conveying time is set with the entrance position as the starting point and the storage position P as the end point,
Figure DEST_PATH_IMAGE010
starting from the storage position P and starting from the storage position
Figure DEST_PATH_IMAGE012
The transport time at the end point; if the doors and windows to be put into the warehouse need to be stored in the occupied storage positions in the door and window position adjusting scheme
Figure 845806DEST_PATH_IMAGE002
The doors and windows originally stored in the storage position P also need to be stored in the occupied storage position
Figure 231788DEST_PATH_IMAGE004
And is originally stored in a storage location
Figure DEST_PATH_IMAGE014
The door and window also need to be stored in an unoccupied storage position
Figure DEST_PATH_IMAGE016
The transportation time corresponding to the door and window position adjustment scheme
Figure DEST_PATH_IMAGE018
Wherein, in the process,
Figure DEST_PATH_IMAGE020
representing a storage location
Figure 323110DEST_PATH_IMAGE014
Starting from a storage location
Figure 187161DEST_PATH_IMAGE016
The transport time at the end point;
calculating the rationality corresponding to each door and window position adjusting scheme according to the carrying time, the door and window heat matching degree and the door and window category aggregation degree corresponding to each door and window position adjusting scheme; the rationality and the carrying time form a negative correlation relationship, the rationality and the degree of heat matching of the doors and the windows form a positive correlation relationship, and the rationality and the degree of category aggregation of the doors and the windows form a positive correlation relationship;
selecting a door and window position adjusting scheme according to the rationality corresponding to each door and window position adjusting scheme;
the calculation formula of the corresponding rationality of each door and window position adjusting scheme is as follows:
Figure DEST_PATH_IMAGE022
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE024
for the rationality of the adjustment scheme of the mth door and window position,
Figure DEST_PATH_IMAGE026
for the transport time corresponding to the mth door and window position adjustment scheme,
Figure DEST_PATH_IMAGE028
the door and window heat matching degree corresponding to the storage position of the ith door and window corresponding to the mth door and window position adjusting scheme,
Figure DEST_PATH_IMAGE030
for the door and window category aggregation degree corresponding to the kth door and window category corresponding to the mth door and window position adjustment scheme,
Figure DEST_PATH_IMAGE032
the number of the storage positions of the doors and windows is stored corresponding to the mth door and window position adjustment scheme,
Figure DEST_PATH_IMAGE034
the number of the door and window types corresponding to the mth door and window position adjustment scheme,
Figure DEST_PATH_IMAGE036
the weight corresponding to the transportation time is the weight,
Figure DEST_PATH_IMAGE038
the weight corresponding to the degree of matching of the heat degree of the door and the window,
Figure DEST_PATH_IMAGE040
the weight corresponding to the door and window category aggregation degree;
the method for calculating the door and window heat matching degree corresponding to each door and window position adjusting scheme comprises the following steps:
judging whether doors and windows are stored in each storage position after adjustment according to each door and window position adjustment scheme;
for each storage position where doors and windows are stored, calculating the ex-warehouse time index corresponding to the storage position and the ex-warehouse heat degree of the door and window category to which the doors and windows stored in the storage position belong in a set time period in the future, and calculating the door and window heat degree matching degree corresponding to the storage position according to the ex-warehouse time index and the ex-warehouse heat degree;
calculating the door and window heat degree matching degree corresponding to each door and window position adjusting scheme according to the door and window heat degree matching degree corresponding to each storage position storing the door and window; the calculation formula of the door and window heat matching degree corresponding to each storage position storing the door and window is as follows:
Figure DEST_PATH_IMAGE042
Figure DEST_PATH_IMAGE044
Figure DEST_PATH_IMAGE046
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE048
the degree of matching of the heat of the door and window corresponding to the storage position of the ith door and window,
Figure DEST_PATH_IMAGE050
the corresponding warehouse-out time index of the storage position of the ith stored door and window,
Figure DEST_PATH_IMAGE052
the door and window category to which the door and window stored for the ith storage position belongs is
Figure DEST_PATH_IMAGE054
The heat of the discharged warehouse in the warehouse,
Figure DEST_PATH_IMAGE056
the corresponding warehouse-out time of the storage position of the door and window is stored for the ith,
Figure DEST_PATH_IMAGE058
the door and window stored for the ith storage positionDoor and window categories of
Figure 556526DEST_PATH_IMAGE054
The number of times of delivery of the warehouse in the warehouse,
Figure 847830DEST_PATH_IMAGE054
setting a time period for the future corresponding to the storage position of the ith door and window;
the method for calculating the door and window category aggregation degree corresponding to each door and window position adjustment scheme comprises the following steps:
judging whether doors and windows are stored in each storage position after adjustment according to each door and window position adjustment scheme;
for each storage position where doors and windows are stored, calculating the door and window category aggregation degree corresponding to the door and window category to which the doors and windows stored in the storage position belong according to the distance between the storage position and the corresponding door and window category aggregation center;
calculating the door and window category aggregation degree corresponding to each door and window position adjustment scheme according to the door and window category aggregation degree corresponding to each door and window category; the calculation formula of the door and window category aggregation degree corresponding to each door and window category is as follows:
Figure DEST_PATH_IMAGE060
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE062
the aggregation degree of the door and window categories corresponding to the kth door and window category,
Figure DEST_PATH_IMAGE064
for the abscissa of the storage location of the jth door window stored in the kth door window category,
Figure DEST_PATH_IMAGE066
the abscissa of the aggregation center corresponding to the kth door and window category,
Figure DEST_PATH_IMAGE068
for the ordinate of the storage position of the jth door window stored with the kth door window category,
Figure DEST_PATH_IMAGE070
is the ordinate of the aggregation center corresponding to the kth door and window category,
Figure DEST_PATH_IMAGE072
the number of the storage positions of the doors and windows storing the kth door and window category is set;
the method of calculating the transit time between two positions is as follows:
firstly, establishing a warehouse position coordinate system to measure relative positions among different positions;
searching a conveying path between a start point and a stop point according to the relative position of each region;
determining a starting point storage area and an end point storage area;
respectively determining adjacent aisle areas of a starting point storage area and an end point storage area;
respectively taking each adjacent aisle area of the starting point storage area as a starting point area and each adjacent aisle area of the end point storage area as an end point area;
calculating all the conveying paths between the starting point regions and the end point regions by using DFS depth-first traversal, and respectively recording the paths as
Figure DEST_PATH_IMAGE074
、
Figure DEST_PATH_IMAGE076
、
Figure DEST_PATH_IMAGE078
…
Figure DEST_PATH_IMAGE080
；
Wherein, the adjacent aisle area selection conditions are as follows:
Figure DEST_PATH_IMAGE082
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE084
for the coordinates of the centre of the current storage area and the centre of the other aisle areas
Figure DEST_PATH_IMAGE086
Distance, 1 represents an adjoining aisle that is the current storage area, and 0 represents an adjoining aisle that is not the current storage area;
calculating the required conveying time of each conveying path;
identifying a turning area in each conveying path, wherein the identification process of the turning area is as follows:
acquiring horizontal and vertical coordinates of the center of each aisle area in each carrying path in a warehouse position coordinate system;
the abscissa of the center of the passage area in each carrying path is respectively subtracted from the abscissa of the adjacent passage area to obtain
Figure DEST_PATH_IMAGE088
(ii) a The vertical coordinate of the center of the passage area in each carrying path is respectively subtracted from the vertical coordinate of the adjacent area to obtain
Figure DEST_PATH_IMAGE090
(ii) a Judgment of
Figure 257075DEST_PATH_IMAGE088
Whether all the aisle areas are 0 or not, and if all the aisle areas are zero, the current aisle area is not a turning area; if not, carrying out the next step; judgment of
Figure 924817DEST_PATH_IMAGE090
Whether all the aisle areas are 0 or not, and if all the aisle areas are zero, the current aisle area is not a turning area; if it isIf not, the current area is the turning area;
counting the number of turning areas in each conveying path
Figure DEST_PATH_IMAGE092
Calculating the relative transportation time required by each possible transportation path and the current transportation path
Figure DEST_PATH_IMAGE094
Relative transport time required for transporting doors and windows
Figure DEST_PATH_IMAGE096
The calculation formula of (c) is as follows:
Figure DEST_PATH_IMAGE098
wherein, the first and the second end of the pipe are connected with each other,
Figure DEST_PATH_IMAGE100
is the speed of the straight-line travel,
Figure DEST_PATH_IMAGE102
is the running speed when turning a corner,
Figure DEST_PATH_IMAGE104
；
selecting relative transit times in all transport paths
Figure 547690DEST_PATH_IMAGE096
The shortest one is the conveying route from the starting point storage area to the end point storage area
Figure DEST_PATH_IMAGE106
Transport path
Figure 681999DEST_PATH_IMAGE106
Corresponding relative movementTime of flight
Figure DEST_PATH_IMAGE108
I.e. the relative transit time between start and stop areas.
CN202111260848.4A 2021-10-28 2021-10-28 Door and window warehouse storage position adjusting method based on Internet of things and big data Active CN113706084B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111260848.4A CN113706084B (en) 2021-10-28 2021-10-28 Door and window warehouse storage position adjusting method based on Internet of things and big data

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111260848.4A CN113706084B (en) 2021-10-28 2021-10-28 Door and window warehouse storage position adjusting method based on Internet of things and big data

Publications (2)

Publication Number Publication Date
CN113706084A CN113706084A (en) 2021-11-26
CN113706084B true CN113706084B (en) 2022-09-09

Family

ID=78647259

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111260848.4A Active CN113706084B (en) 2021-10-28 2021-10-28 Door and window warehouse storage position adjusting method based on Internet of things and big data

Country Status (1)

Country Link
CN (1) CN113706084B (en)

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111008804B (en) * 2019-12-06 2023-04-18 拉货宝网络科技有限责任公司 Intelligent recommendation method for warehouse-in goods position of warehouse goods
CN112734344A (en) * 2021-03-31 2021-04-30 牧星机器人(江苏)有限公司 Commodity warehousing optimization method and device in commodity warehousing and warehousing system
CN113343570A (en) * 2021-06-08 2021-09-03 陕西科技大学 Dynamic picking method and system considering relevance of picking order

Also Published As

Publication number Publication date
CN113706084A (en) 2021-11-26

Similar Documents

Publication Publication Date Title
CN108830531B (en) Intelligent classification logistics storage system
Zhen Modeling of yard congestion and optimization of yard template in container ports
Kim et al. An optimal layout of container yards
US11886191B2 (en) Scheduling method and system for fully autonomous waterborne inter terminal transportation
CN112001064B (en) Full-autonomous water transport scheduling method and system between container terminals
Wang et al. Research on logistics distribution vehicle scheduling based on heuristic genetic algorithm
CN108038651A (en) A kind of monitoring logistics transportation system for tracing and managing
CN110543171B (en) Storage multi-AGV path planning method based on improved BP neural network
CN107862493A (en) A kind of goods stock matching travels on the way the numerical value determination methods of goods nearby
CN110909952A (en) City two-stage distribution and scheduling method with mobile distribution station
CN115063090B (en) Digital goods position management method for bulk goods storage
CN111047858A (en) Method and device for determining OD (origin-destination) of bus passenger flow travel by fusion algorithm
Sun et al. An autonomous vehicle interference-free scheduling approach on bidirectional paths in a robotic mobile fulfillment system
CN112907188A (en) Shared bicycle carrying optimization method based on adaptive neighborhood search algorithm
CN113570025A (en) E-commerce storage center goods space distribution method based on discrete particle swarm algorithm
CN113706084B (en) Door and window warehouse storage position adjusting method based on Internet of things and big data
CN113934217A (en) Intelligent scheduling processing system based on 5G
CN116523270B (en) Logistics transportation task automatic scheduling method, equipment, server and medium
WO2024093758A1 (en) Transportation scheduling method and apparatus for vertical warehouse
CN112978166B (en) Intelligent stereoscopic warehouse and warehouse entry control method, device and system thereof
CN113525978B (en) Goods warehouse-in method, device and system for dense warehouse
CN116629734A (en) Method, device, equipment and medium for planning article picking path of warehouse system
CN110488826A (en) A kind of AGV collision prevention method, terminal device and storage medium suitable for path conflict
CN114757394A (en) Logistics vehicle path optimization method, system and medium based on workload balance
CN115310917A (en) Warehousing management method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant