CN112308353A - An optimization method for job scheduling in drug warehouse - Google Patents
An optimization method for job scheduling in drug warehouse Download PDFInfo
- Publication number
- CN112308353A CN112308353A CN201910698008.2A CN201910698008A CN112308353A CN 112308353 A CN112308353 A CN 112308353A CN 201910698008 A CN201910698008 A CN 201910698008A CN 112308353 A CN112308353 A CN 112308353A
- Authority
- CN
- China
- Prior art keywords
- agv
- goods
- stacker
- operation time
- warehouse
- 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
- 239000003814 drug Substances 0.000 title claims abstract description 36
- 238000000034 method Methods 0.000 title claims abstract description 24
- 238000005457 optimization Methods 0.000 title claims abstract description 23
- 229940079593 drug Drugs 0.000 title abstract description 15
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 52
- 238000010367 cloning Methods 0.000 claims abstract description 25
- 238000003860 storage Methods 0.000 claims abstract description 6
- 239000000427 antigen Substances 0.000 claims description 15
- 102000036639 antigens Human genes 0.000 claims description 13
- 108091007433 antigens Proteins 0.000 claims description 13
- 239000002131 composite material Substances 0.000 claims description 9
- 229960005486 vaccine Drugs 0.000 claims description 7
- 230000001133 acceleration Effects 0.000 claims description 6
- 238000013178 mathematical model Methods 0.000 claims description 6
- 238000013461 design Methods 0.000 claims description 4
- 150000001875 compounds Chemical class 0.000 claims description 3
- 239000000203 mixture Substances 0.000 claims description 3
- 230000001902 propagating effect Effects 0.000 claims description 3
- 238000012216 screening Methods 0.000 claims description 3
- 238000012163 sequencing technique Methods 0.000 claims description 3
- 235000006679 Mentha X verticillata Nutrition 0.000 claims 1
- 235000002899 Mentha suaveolens Nutrition 0.000 claims 1
- 235000001636 Mentha x rotundifolia Nutrition 0.000 claims 1
- 230000002068 genetic effect Effects 0.000 abstract description 10
- 238000004458 analytical method Methods 0.000 abstract description 2
- 239000000243 solution Substances 0.000 description 14
- 230000006870 function Effects 0.000 description 11
- 238000010586 diagram Methods 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 2
- 238000009826 distribution Methods 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000011451 sequencing strategy Methods 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- GNFTZDOKVXKIBK-UHFFFAOYSA-N 3-(2-methoxyethoxy)benzohydrazide Chemical compound COCCOC1=CC=CC(C(=O)NN)=C1 GNFTZDOKVXKIBK-UHFFFAOYSA-N 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 210000001728 clone cell Anatomy 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000002950 deficient Effects 0.000 description 1
- 230000028993 immune response Effects 0.000 description 1
- 238000002347 injection Methods 0.000 description 1
- 239000007924 injection Substances 0.000 description 1
- 230000009545 invasion Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000035772 mutation Effects 0.000 description 1
- 238000004806 packaging method and process Methods 0.000 description 1
- 239000002245 particle Substances 0.000 description 1
- 239000003016 pheromone Substances 0.000 description 1
- 230000002028 premature Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 238000002255 vaccination Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/004—Artificial life, i.e. computing arrangements simulating life
- G06N3/006—Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/12—Computing arrangements based on biological models using genetic models
- G06N3/126—Evolutionary algorithms, e.g. genetic algorithms or genetic programming
-
- 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
- G06Q10/0875—Itemisation or classification of parts, supplies or services, e.g. bill of materials
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Human Resources & Organizations (AREA)
- General Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Life Sciences & Earth Sciences (AREA)
- Biophysics (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- General Business, Economics & Management (AREA)
- Software Systems (AREA)
- Evolutionary Computation (AREA)
- General Health & Medical Sciences (AREA)
- Molecular Biology (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Computational Linguistics (AREA)
- Mathematical Physics (AREA)
- Data Mining & Analysis (AREA)
- Biomedical Technology (AREA)
- Artificial Intelligence (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- Evolutionary Biology (AREA)
- Tourism & Hospitality (AREA)
- Bioinformatics & Computational Biology (AREA)
- Quality & Reliability (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Marketing (AREA)
- Genetics & Genomics (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Physiology (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Warehouses Or Storage Devices (AREA)
Abstract
本发明公开了一种药品仓库作业调度优化方法，本方法以出、入库订单作业时间总时间最短为目标，建立适合于药品仓库的堆垛机与AGV联合调度系统的混合命令序列作业时间模型。在此基础上，针对单批次订单作业序列的排序策略混乱等问题，提出一种改进免疫克隆算法，构造改进记忆单元克服了遗传算法中只记忆单个最优抗体而无法记忆最优解群的弱点，对订单作业序列的排序策略进行了优化，并将该模型与算法通过python编译在某药品仓库实际案例下验证分析。本发明提出的模型对于该药品物流仓储系统具有良好的适用性，同时优化算法可以合理有效的对成组订单进行作业排序，有效地提升药品仓库联合作业系统的仓储效率。
The invention discloses a method for optimizing drug warehouse operation scheduling. The method aims at the shortest total operation time of outgoing and warehousing orders, and establishes a mixed order sequence operation time model suitable for a stacker and AGV joint scheduling system in drug warehouses. . On this basis, in order to solve the problem of confusion in the sorting strategy of single batch order job sequence, an improved immune cloning algorithm is proposed, and an improved memory unit is constructed to overcome the problem of only remembering a single optimal antibody but not the optimal solution group in the genetic algorithm. We optimized the sorting strategy of the order job sequence, and compiled the model and algorithm through python to verify the analysis in the actual case of a drug warehouse. The model proposed by the present invention has good applicability to the drug logistics storage system, and at the same time, the optimization algorithm can reasonably and effectively sort groups of orders, and effectively improve the storage efficiency of the drug warehouse joint operation system.
Description
Technical Field
The invention relates to the technical field of warehouse operation scheduling, in particular to a medicine warehouse operation scheduling optimization method.
Background
The stacker and AGV joint scheduling problem is a TSP combined optimization problem, is proved to belong to the NP-hard problem category, and is usually solved by adopting a heuristic optimization algorithm, so that the invention designs an improved immune clone algorithm (ICSA) for solving aiming at the order scheduling optimization problem. By simulating the invasion of antigen into organism, the immune clone cell capable of recognizing and eliminating corresponding antigen can be selected for immune response. The algorithm has shown strong data searching capability in solving the problems of injection combination optimization, intelligent optimization, production scheduling and the like.
Compared with other intelligent algorithms, the algorithm has the following advantages:
(1) the genetic algorithm emphasizes global search, while the algorithm takes local search into account;
(2) not only emphasizes the antibody-antigen fitness function (i.e., objective function), but also focuses on anti-antibody affinity (i.e., the interrelationship between solutions);
(3) change the probability-based scaling to local antibody-antigen affinity (mutation rules);
(4) a memory unit is created to replace a genetic algorithm single optimal antibody, and a memory mode of a population of an optimal solution is formed;
(5) the ant colony algorithm is deficient in initial pheromone, and the advantages of the algorithm vaccine enable the guidance generated by initial solution to be more excellent;
(6) the particle swarm algorithm is used for processing premature convergence in a complex multi-peak search problem;
(7) real numbers are adopted for coding, and the algorithm is simple and easy to implement.
Disclosure of Invention
Aiming at the problems of low operation efficiency, high idle load rate and the like of a stacker and an AGV caused by severe requirements on medicine batches of a medicine warehouse, dispersed product distribution and the like, factors such as efficiency matching of an operation system connected in an upper stage and a lower stage are fully considered, the shortest total time of the operation time of an order in and out is taken as a target, and a mixed command sequence operation time model suitable for a combined dispatching system of the stacker and the AGV of the medicine warehouse is established.
Based on an improved immune clone algorithm, completing the optimization solution of a scheduling model to obtain a scheduling scheme;
the practical case of the medicine warehouse is analyzed and compared with other intelligent methods, and the applicability of the method to the medicine logistics warehousing system is verified.
The above aspect and any possible implementation further provides an implementation, where the mathematical model includes:
Min T＝max(T1，T2)
the expression shows that the total operation time is determined by one of the two AGVs with smaller operation time, wherein T is the total operation time, and T is the total operation time1And T2AGV operation times No. 1 and No. 2.
Ti＝TC+TI+TO
The formula shows that the operation time of each AGV consists of composite cycle operation time, single cycle warehousing operation time and single cycle ex-warehousing operation time, wherein TCTotal time of combined cycle operation, TIAnd TOThe AGV warehousing and ex-warehousing operation time are respectively.
The formula respectively represents the composition of the AGV composite cycle operation time, the AGV single cycle warehousing operation time and the AGV single cycle ex-warehousing operation time. Wherein T isCThe total time of the combined cycle operation; t isLDelivering goods time for the AGV; t isGTravel per unit path time for the AGV; v. ofcThe horizontal running speed of the stacker; v. ofrThe vertical running speed of the stacker; a isCThe horizontal acceleration of the stacker; a isrVertical acceleration of the stacker; hCThe length of the goods grid in the horizontal direction; hrThe length of the goods grid in the vertical direction; t isUThe time for storing and taking the goods by the stacker; a and b are unit path parameters; and c and d are single-cycle task parameters.
The parameters of a, b, c and d take the following values:
when in use
When a is 2
When in use
When screened
Wherein the value range of the warehousing-in/out node number J is (6, 7, 8); the value range of lane number K (1, 2, 3, 4, 5). The value ranges of x and y are shown in constraint 4.
The above-described aspect and any possible implementation further provide an implementation, where the constraint includes the following four constraints:
constraint 1:
constraint 2:
constraint 3:
constraint 4:
the above aspect and any possible implementation manner further provide an implementation manner, and the specific calculation steps of the working time corresponding to the above formula are as follows: :
and a, the AGV receives the goods at the goods loading point and calculates the operation time of the AGV reaching the goods loading point.
Step b, the stacker receives the goods from the AGV, and the stacker is calculated to be put in storage to a goods position (x)1，y1) And storing the working time of the goods.
Step c, calculating the slave (x) of the stacker1，y1) Moving to the delivery location (x) of the composite job order2，y2) And the operation time of inserting and taking the goods.
Step d, calculating the slave (x) of the stacker2，y2) Working time to initial origin (0,0)
And e, the AGV receives the goods from the stacker and runs to a goods placing point to place the goods.
And f, completing the compound circulation order by circulating the above operations.
Step g, calculating the remaining order-placing cycle order operation time
The above aspects and any possible implementations further provide an implementation, and the improved immune cloning algorithm design includes:
this formula represents the fitness function between the antibody and antigen, m is a solution scheme, TmFor the objective function value, G is the penalty weight for each infeasible solution, typically taking a large positive number. MmIs a corresponding infeasible scheme.
The formula represents an affinity function of the antibody and the antibody, and the affinity between the antibodies is judged by adopting a Euclidean distance measuring and calculating method. The larger the value of D, the lower the similarity between the two; when D is 0, both are the same solution.
The above-described aspects and any possible implementation further provide an implementation, and the algorithm solving step includes the following steps:
step a, antigen recognition. And taking the given objective function and constraint conditions as the antigen of the problem to be solved.
And b, initializing the population. Giving various parameters and obtaining 20 pieces of outbound orders and inbound orders.
And c, classifying the antibodies. And screening out the outbound and inbound orders with the consistent lane number K. And dividing the screened orders into two columns of matrixes in random order. The first column is a warehousing order and the second column is an ex-warehouse order. When multiple warehouse-out orders cannot be matched, the first-column warehouse-in order is X'1，Y′1...X′R-2M，Y′2R-2MThe second column is 0, 0; on the contrary, when the multiple outbound orders cannot be matched, the first column is 0,0, and the second column is X'1，Y′1...X′R-2M，Y′2R-2M。
And d, inoculating the vaccine. And (4) inoculating the established vaccine according to the experience of a principle and the like nearby, and optimizing order sequencing.
And e, calculating the antibody fitness and affinity. The affinity of antibody fitness was calculated by the formulas (3) and (4).
And f, cloning and propagating. Cloning each antibody according to the affinity value according to the size of the affinity, wherein the cloning scale is qiAnd then:
wherein N iscIs the total clone scale of the antibody population, and the higher the antibody fitness, the larger the clone scale.
And g, cloning and mutating. And generating and inputting combinations by respectively and correspondingly exchanging the columns and the layers among each row.
And h, judging the termination condition. A form of hybrid termination is used that defines the number of iterations and cannot be improved over successive iterations.
Drawings
FIG. 1 is a layout diagram of a stacker and AGV combined operation system of the present invention.
FIG. 2 is a schematic diagram of the encoding of the improved immune cloning algorithm of the present invention.
FIG. 3 is a flow chart of the improved immune cloning algorithm of the present invention.
FIG. 4 is a diagram of the antigen classification groupings of the improved immune cloning algorithm.
FIG. 5 is a graph of clonal variation rules for an improved immune cloning algorithm.
Fig. 6 is an evolutionary iteration diagram of an improved immune cloning algorithm.
FIG. 7 is a comparison of results before and after optimization.
FIG. 8 is an iterative graph of an immune cloning algorithm for a shift of tasks.
FIG. 9 is an iterative graph of genetic algorithm for a shift of tasks.
FIG. 10 is an iterative graph of the artificial immune algorithm under a certain shift task.
In the figure, English Immune clone Algorithm is an Immune clone Algorithm, Iteration Number is Iteration Number, In-out stock Execution Time is In-out library Execution Time, Execution Time Comparison is Execution Time Comparison, before optimization, after optimization, Genetic Algorithm is a Genetic Algorithm, and Artificial Immune Algorithm is an Artificial Immune Algorithm.
Detailed Description
For better understanding of the technical solutions of the present invention, the following detailed descriptions of the embodiments of the present invention are provided with reference to the accompanying drawings.
Aiming at the problems of low operation efficiency, high idle load rate and the like of a stacker and an AGV caused by severe requirements on medicine batches of a medicine warehouse, dispersed product distribution and the like, factors such as efficiency matching of an operation system connected in an upper stage and a lower stage are fully considered, the shortest total time of the operation time of an order in and out is taken as a target, and a mixed command sequence operation time model suitable for a combined dispatching system of the stacker and the AGV of the medicine warehouse is established.
On the basis, aiming at the problems of disordered sequencing strategies of single-batch order operation sequences and the like, an improved immune clone algorithm is provided, an improved memory unit is constructed, the defect that only a single optimal antibody is memorized in a genetic algorithm and an optimal solution group cannot be memorized is overcome, the sequencing strategy of the order operation sequences is optimized, and the model and the algorithm are verified and analyzed under the actual case of a certain medicine warehouse through python.
Simulation results show that the model provided by the invention has good applicability to the drug logistics and warehousing system, and meanwhile, the optimization algorithm can reasonably and effectively sequence the operation of grouped orders, thereby effectively improving the warehousing efficiency of the drug warehouse combined operation system.
Fig. 1 is a layout of a logistics system of a drug warehouse. The logistics system consists of two AGVs, five roadway stackers and ten three-dimensional storehouses.
According to the current operation situation of the drug warehouse stacker and AGV combined dispatching system, the following assumptions are provided:
(1) the batch requirements of the drug and goods are strict, so that the goods position information of the warehouse-in and warehouse-out orders is provided by an upper-level system and cannot be randomly modified.
(2) Due to the beat limitation of the preorder film wrapping and packaging work, the AGV has enough time to reach the next task loading point after the operation of entering and exiting the warehouse.
(3) The AGV is running at a constant speed.
(4) The AGV and the stacker have the same no-load and full-load speed.
Based on the assumptions, a mathematical model is established by taking the operation time of the stacker and AGV combined system as a target. The superior system obtains a plurality of ex-warehouse and in-warehouse tasks. The first AGV initial state is at a first order pick-up point and the second AGV initial state is at a second order pick-up point. Each stacker is located at each initial position (0,0) of the roadway.
With this assumption, the present implementation provides the following possible embodiments.
S101, aiming at the shortest total time of the operation time of the outgoing and the warehousing orders, establishing a mixed command sequence operation time model suitable for a stacker and AGV combined scheduling system of a medicine warehouse.
S102, based on an improved immune clone algorithm, completing the optimization solution of a scheduling model to obtain a scheduling scheme;
s103, verifying the applicability of the method to a medicine logistics storage system by analyzing the actual cases of the medicine warehouse and comparing the actual cases with other intelligent methods.
In the embodiment of the present invention, a job scheduling problem is modeled first, and the mathematical model in step S101 includes:
Min T＝max(T1，T2)
the expression shows that the total operation time is determined by one of the two AGVs with smaller operation time, wherein T is the total operation time, and T is the total operation time1And T2AGV operation times No. 1 and No. 2.
Ti＝TC+TI+TO
The formula shows that the operation time of each AGV consists of composite cycle operation time, single cycle warehousing operation time and single cycle ex-warehousing operation time, wherein TCTotal time of combined cycle operation, TIAnd TOThe AGV warehousing and ex-warehousing operation time are respectively.
The formula respectively represents the composition of the AGV composite cycle operation time, the AGV single cycle warehousing operation time and the AGV single cycle ex-warehousing operation time. Wherein T isCThe total time of the combined cycle operation; t isLDelivering goods time for the AGV; t isGTravel per unit path time for the AGV; v. ofcThe horizontal running speed of the stacker; v. ofrThe vertical running speed of the stacker; a isCThe horizontal acceleration of the stacker; a isrVertical acceleration of the stacker; hcThe length of the goods grid in the horizontal direction; hrThe length of the goods grid in the vertical direction; t isUThe time for storing and taking the goods by the stacker; a and b are unit path parameters; and c and d are single-cycle task parameters.
The parameters of a, b, c and d take the following values:
when in use
When a is 2
When in use
When screened
Wherein the value range of the warehousing-in/out node number J is (6, 7, 8); the value range of lane number K (1, 2, 3, 4, 5). The value ranges of x and y are shown in constraint 4.
In addition, based on the above objective function, the constraint conditions for establishing the model are as follows:
constraint 1:
constraint 2:
constraint 3:
constraint 4:
the specific calculation steps of the working time corresponding to step S101 are as follows:
and a, the AGV receives the goods at the goods loading point and calculates the operation time of the AGV reaching the goods loading point.
Step b, the stacker receives the goods from the AGV, and the stacker is calculated to be put in storage to a goods position (x)1，y1) And storing the working time of the goods.
Step c, calculating the slave (x) of the stacker1，y1) Moving to the delivery location (x) of the composite job order2，y2) And the operation time of inserting and taking the goods.
Step d, calculating the slave (x) of the stacker2，y2) Working time to initial origin (0,0)
And e, the AGV receives the goods from the stacker and runs to a goods placing point to place the goods.
And f, completing the compound circulation order by circulating the above operations.
And g, calculating the remaining work time of the order placing circulation order.
FIG. 2 depicts a coding scheme for an immune cloning algorithm
And when the order warehousing-out node number set is J ═ {6, 7, 8 and 9}, when J ═ 9, the order is a warehousing-out order, and the rest are warehousing orders. The order warehouse-in/warehouse-out target roadway number set is K ═ 1, 2, 3, 4, 5, and this indicates that the order is warehouse-in/warehouse-out operated by the stacker of the roadway.
The line number and the layer number set of the order target goods space are respectively X ═ 1, 2, 3.
In the set of P ═ {0, 1}, 0 indicates that the order goods position is in the stereo library on the left side of the roadway, and 1 indicates the right side.
The improved immune cloning algorithm design in step S102 includes:
this formula represents the fitness function between the antibody and antigen, m is a solution scheme, TmFor the objective function value, G is the penalty weight for each infeasible solution, typically taking a large positive number. MmIs a corresponding infeasible scheme.
The formula represents an affinity function of the antibody and the antibody, and the affinity between the antibodies is judged by adopting a Euclidean distance measuring and calculating method. The larger the value of D, the lower the similarity between the two; when D is 0, both are the same solution.
FIG. 3 is a schematic flow chart of the improved immunoconclone provided by the implementation of the present invention, which specifically comprises the following steps:
step a, antigen recognition. And taking the given objective function and constraint conditions as the antigen of the problem to be solved.
And b, initializing the population. Giving various parameters and obtaining 20 pieces of outbound orders and inbound orders.
And c, classifying the antibodies. Screening laneAnd (5) taking out and putting in the order with the consistent track number K. And dividing the screened orders into two columns of matrixes in random order. The first column is a warehousing order and the second column is an ex-warehouse order. When multiple warehouse-out orders cannot be matched, the first-column warehouse-in order is X'1，Y′1...X′R-2M，Y′2R-2MThe second column is 0, 0; on the contrary, when the multiple outbound orders cannot be matched, the first column is 0,0, and the second column is X'1，Y′1...X′R-2M，Y′2R-2M。
FIG. 4 is a graphical representation of the antigen classification groupings provided by the practice of the present invention.
And d, inoculating the vaccine. And (4) inoculating the established vaccine according to the experience of a principle and the like nearby, and optimizing order sequencing.
And e, calculating the antibody fitness and affinity. The affinity of antibody fitness was calculated by the formulas (3) and (4).
And f, cloning and propagating. Cloning each antibody according to the affinity value according to the size of the affinity, wherein the cloning scale is qiAnd then:
wherein N iscIs the total clone scale of the antibody population, and the higher the antibody fitness, the larger the clone scale.
And g, cloning and mutating. And generating and inputting combinations by respectively and correspondingly exchanging the columns and the layers among each row.
FIG. 5 is a diagram of clonal variation rules provided in the practice of the present invention.
And h, judging the termination condition. A form of hybrid termination is used that defines the number of iterations and cannot be improved over successive iterations.
And carrying out example analysis on the actual out-of-warehouse and in-warehouse orders of the drug warehouse stacker and AGV combined scheduling system, and verifying the applicability and effectiveness of the established model and the optimization method.
The medicine logistics warehouse comprises five roadways, ten stereoscopic warehouses, two AGV and other equipment, the warehouse entry and exit operation is carried out on finished inner and outer bags of medicines, the operation is carried out for two shifts, the working time of each shift is 8 hours, and the whole transfer process is automatically operated.
In the operation process, the stacker and the AGV carry out warehouse-in and warehouse-out operation according to the order operation sequence arranged by the superior system. Therefore, the overall work efficiency of the system is greatly influenced by the different arrangement orders of the warehouse-in and warehouse-out work orders.
The step S103 of analyzing the actual cases of the drug warehouse and comparing the actual cases with other intelligent methods mainly includes:
calculating by an immune clone algorithm, selecting a population with the size of 200, the iteration times of 100, the cross probability of 0.8, the individual vaccination probability of 0.5 and the infeasible punishment weight of 100. The total operation time of the combined system of the stacker crane and the AGV becomes shorter and shorter along with the continuous optimization of the population, and tends to be stable after 75 iterations.
FIG. 6 is a graph of the results of evolutionary iterations of the improved immune cloning algorithm.
The result shows that the scheduling efficiency of the optimized stacker and AGV combined operation system is improved by 4.2%.
FIG. 7 is a comparison of results before and after optimization.
On the basis, all the warehouse-in and warehouse-out orders of 8 hours of work completed at a certain time are simulated, and the orders come from the warehouse-in and warehouse-out order list before the intelligent logistics system of the medicine warehouse is not modified. The operation results are as follows
FIG. 8 is an iterative graph of an immune cloning algorithm for a shift of tasks.
Convergence is completed around 65 iterations, the total job time is reduced from 28004 seconds to 25960 seconds, and the total job time is reduced by about 7.3%.
Meanwhile, by using the genetic algorithm and the comparison of the optimization solution of the model, the convergence of the genetic algorithm and the artificial immune algorithm is finished in about 250 generations and 150 generations respectively, the time for the warehouse-in and warehouse-out execution is 26825 seconds and 26875S respectively, and the optimization rate is about 4.2 percent and 4 percent respectively.
FIG. 9 is an iterative graph of genetic algorithm for a shift of tasks.
FIG. 10 is an iterative graph of the artificial immune algorithm under a certain shift task.
Therefore, the immune clone algorithm has great advantages in convergence speed and optimized warehouse-in and warehouse-out execution time, and has better applicability to the problem of stacker-AGV combined scheduling optimization of the intelligent logistics system of the medicine warehouse.
In conclusion, the stacker and AGV combined scheduling model established by the invention is suitable for the intelligent logistics system of the medicine warehouse, and can greatly improve the operation efficiency of the stacker-AGV combined scheduling system on the premise of not changing the order and goods allocation.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention.
Claims (6)
1. A medicine warehouse operation scheduling optimization method is characterized by comprising the following steps:
constructing a mathematical model for the combined operation scheduling of the stacker and the AGV of the medicine warehouse, wherein the mathematical model comprises four constraints;
based on an improved immune clone algorithm, completing the optimization solution of a scheduling model to obtain a scheduling scheme;
the practical case of the medicine warehouse is analyzed and compared with other intelligent methods, and the applicability of the method to the medicine logistics warehousing system is verified.
2. The method of claim 1, wherein the mathematical model comprises:
MinT＝max(T1,T2)
the expression shows that the total operation time is determined by one of the two AGVs with smaller operation time, wherein T is the total operation time, and T is the total operation time1And T2AGV operation times No. 1 and No. 2.
Ti＝TC+TI+TO
The formula shows that the operation time of each AGV consists of composite cycle operation time, single cycle warehousing operation time and single cycle ex-warehousing operation time, wherein TCTotal time of combined cycle operation, TIAnd TOThe AGV warehousing and ex-warehousing operation time are respectively.
The formula respectively represents the composition of the AGV composite cycle operation time, the AGV single cycle warehousing operation time and the AGV single cycle ex-warehousing operation time. Wherein T isCThe total time of the combined cycle operation; t isLDelivering goods time for the AGV; t isGTravel per unit path time for the AGV; v. ofcThe horizontal running speed of the stacker; v. ofrThe vertical running speed of the stacker; a isCThe horizontal acceleration of the stacker; a isrVertical acceleration of the stacker; hcThe length of the goods grid in the horizontal direction; hrThe length of the goods grid in the vertical direction; t isUThe time for storing and taking the goods by the stacker; a and b are unit path parameters; and c and d are single-cycle task parameters.
The parameters of a, b, c and d take the following values:
when in use
When a is 2
When in use
When screened
Wherein the value range of the warehousing-in/out node number J is (6, 7, 8); the value range of lane number K (1, 2, 3, 4, 5). The value ranges of x and y are shown in constraint 4.
3. The method of claim 1, wherein the constraints include the following four constraints:
constraint 1:
constraint 2:
constraint 3:
constraint 4:
4. the method of claim 1, wherein the working time corresponding to the formula is calculated by the following steps:
and a, the AGV receives the goods at the goods loading point and calculates the operation time of the AGV reaching the goods loading point.
Step b, the stacker receives the goods from the AGV, and the stacker is calculated to be put in storage to a goods position (x)1,y1) And storing the working time of the goods.
Step c, calculatingStacker slave (x)1,y1) Moving to the delivery location (x) of the composite job order2,y2) And the operation time of inserting and taking the goods.
Step d, calculating the slave (x) of the stacker2,y2) Working time to initial origin (0,0)
And e, the AGV receives the goods from the stacker and runs to a goods placing point to place the goods.
And f, completing the compound circulation order by circulating the above operations.
And g, calculating the remaining work time of the order placing circulation order.
5. The method of claim 1, wherein the improved immune cloning algorithm design comprises:
this formula represents the fitness function between the antibody and antigen, m is a solution scheme, TmFor the objective function value, G is the penalty weight for each infeasible solution, typically taking a large positive number. MmIs a corresponding infeasible scheme.
The formula represents an affinity function of the antibody and the antibody, and the affinity between the antibodies is judged by adopting a Euclidean distance measuring and calculating method. The larger the value of D, the lower the similarity between the two; when D is 0, both are the same solution.
6. The method of claim 1, wherein the algorithm solving step is as follows:
step a, antigen recognition. And taking the given objective function and constraint conditions as the antigen of the problem to be solved.
And b, initializing the population. Giving various parameters and obtaining 20 pieces of outbound orders and inbound orders.
And c, classifying the antibodies. And screening out the outbound and inbound orders with the consistent lane number K. And dividing the screened orders into two columns of matrixes in random order. The first column is a warehousing order and the second column is an ex-warehouse order. When multiple warehouse-out orders cannot be matched, the first-column warehouse-in order is X'1,Y′1…X′R-2M,Y′2R-2MThe second column is 0, 0; on the contrary, when the multiple outbound orders cannot be matched, the first column is 0,0, and the second column is X'1，Y′1…X′R-2M，Y′2R-2M。
And d, inoculating the vaccine. And (4) inoculating the established vaccine according to the experience of a principle and the like nearby, and optimizing order sequencing.
And e, calculating the antibody fitness and affinity. The affinity of antibody fitness was calculated by the formulas (3) and (4).
And f, cloning and propagating. Cloning each antibody according to the affinity value according to the size of the affinity, wherein the cloning scale is qiAnd then:
wherein N iscIs the total clone scale of the antibody population, and the higher the antibody fitness, the larger the clone scale.
And g, cloning and mutating. And generating and inputting combinations by respectively and correspondingly exchanging the columns and the layers among each row.
And h, judging the termination condition. A form of hybrid termination is used that defines the number of iterations and cannot be improved over successive iterations.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910698008.2A CN112308353A (en) | 2019-07-31 | 2019-07-31 | An optimization method for job scheduling in drug warehouse |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910698008.2A CN112308353A (en) | 2019-07-31 | 2019-07-31 | An optimization method for job scheduling in drug warehouse |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112308353A true CN112308353A (en) | 2021-02-02 |
Family
ID=74485754
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910698008.2A Pending CN112308353A (en) | 2019-07-31 | 2019-07-31 | An optimization method for job scheduling in drug warehouse |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112308353A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113222396A (en) * | 2021-05-08 | 2021-08-06 | 福州大学 | Intelligent ordering and scheduling method for prescription orders in automatic medicine dispensing system |
| CN113837694A (en) * | 2021-09-24 | 2021-12-24 | 多点生活(成都)科技有限公司 | Article display method, apparatus, electronic device and readable medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109230142A (en) * | 2018-10-22 | 2019-01-18 | 陕西科技大学 | A kind of scheduling method for optimizing route of intensive warehousing system multiple working |
-
2019
- 2019-07-31 CN CN201910698008.2A patent/CN112308353A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109230142A (en) * | 2018-10-22 | 2019-01-18 | 陕西科技大学 | A kind of scheduling method for optimizing route of intensive warehousing system multiple working |
Non-Patent Citations (4)
| Title |
|---|
| 朱文真等: "基于遗传禁忌搜索算法的自动化立体仓库出入库路径优化研究", 《机械科学与技术》, vol. 30, no. 7, 15 July 2011 (2011-07-15) * |
| 杨云: "烟丝原料配方立体仓库物流调度与库存控制", 《中国优秀硕士学位论文全文数据库工程科技Ⅰ辑》, no. 1, 15 January 2009 (2009-01-15) * |
| 蒋伦山: "某烟草原料配方立体仓库堆垛机和AGV输送系统联合调度作业研究", 《中国优秀硕士学位论文全文数据库工程科技Ⅰ辑》, no. 1, 15 January 2018 (2018-01-15), pages 37 - 73 * |
| 陈林等: "免疫克隆遗传算法在物流配送中的应用", 《河南科技学院学报(自然科学版)》, vol. 40, no. 5, 15 October 2012 (2012-10-15), pages 70 - 74 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113222396A (en) * | 2021-05-08 | 2021-08-06 | 福州大学 | Intelligent ordering and scheduling method for prescription orders in automatic medicine dispensing system |
| CN113222396B (en) * | 2021-05-08 | 2022-06-21 | 福州大学 | Intelligent ordering and scheduling method for prescription orders in automatic medicine dispensing system |
| CN113837694A (en) * | 2021-09-24 | 2021-12-24 | 多点生活(成都)科技有限公司 | Article display method, apparatus, electronic device and readable medium |
| CN113837694B (en) * | 2021-09-24 | 2023-06-30 | 多点生活(成都)科技有限公司 | Article display method, apparatus, electronic device, and readable medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Qin et al. | A novel reinforcement learning-based hyper-heuristic for heterogeneous vehicle routing problem | |
| Ene et al. | Storage location assignment and order picking optimization in the automotive industry | |
| CN109945881B (en) | A mobile robot path planning method based on ant colony algorithm | |
| CN110807559B (en) | Order batching and picking path combined optimization method | |
| Dou et al. | Genetic scheduling and reinforcement learning in multirobot systems for intelligent warehouses | |
| CN111562785B (en) | A path planning method and system for cooperative coverage of swarm robots | |
| CN107807665B (en) | Unmanned aerial vehicle formation detection task cooperative allocation method and device | |
| CN108037758A (en) | A kind of method for planning path for mobile robot based on improvement AFSA | |
| Luo et al. | A* guiding DQN algorithm for automated guided vehicle pathfinding problem of robotic mobile fulfillment systems | |
| CN117910932A (en) | Warehouse management method, device, terminal equipment and storage medium | |
| CN115454070B (en) | A multi-robot path planning method based on K-Means ant colony algorithm | |
| CN103077425A (en) | Immune genetic algorithm for AUV (Autonomous Underwater Vehicle) real-time path planning | |
| CN114839982B (en) | A path planning method and system for automated transportation equipment | |
| CN113935452A (en) | A distribution center picking path planning method based on the fusion of ant colony algorithm and genetic algorithm | |
| CN113867358A (en) | Intelligent path planning method for cooperative traversal tasks of multiple unmanned vehicles | |
| Kareem et al. | Planning the Optimal 3D Quadcopter Trajectory Using a Delivery System-Based Hybrid Algorithm. | |
| Wang et al. | Toward optimization of AGV path planning: an RRT*-ACO algorithm | |
| CN113240215B (en) | Scheduling method and system for storage AGV, storage medium and electronic equipment | |
| CN112308353A (en) | An optimization method for job scheduling in drug warehouse | |
| CN112862212A (en) | Multi-AGV (automatic guided vehicle) scheduling method, device and equipment based on improved sparrow search algorithm | |
| CN116596440A (en) | Automatic stereoscopic warehouse-in and warehouse-out intelligent scheduling method | |
| CN118886673A (en) | A method for scheduling stacker cranes and AGV clusters in aviation material warehouses based on improved RRT algorithm | |
| Li et al. | Efficient path planning method based on genetic algorithm combining path network | |
| CN115577833B (en) | Particle swarm optimization method and system for solving path planning of collaborative distribution | |
| CN114625137A (en) | AGV-based intelligent parking path planning method and system |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20210202 |