CN105858044A - Optimal dispatching method for warehousing systems combining rail guided vehicles and lifts - Google Patents
Optimal dispatching method for warehousing systems combining rail guided vehicles and lifts Download PDFInfo
- Publication number
- CN105858044A CN105858044A CN201610365624.2A CN201610365624A CN105858044A CN 105858044 A CN105858044 A CN 105858044A CN 201610365624 A CN201610365624 A CN 201610365624A CN 105858044 A CN105858044 A CN 105858044A
- Authority
- CN
- China
- Prior art keywords
- car
- elevator
- goods
- access
- scheduling
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
- B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
- B65G1/00—Storing articles, individually or in orderly arrangement, in warehouses or magazines
- B65G1/02—Storage devices
- B65G1/04—Storage devices mechanical
- B65G1/137—Storage devices mechanical with arrangements or automatic control means for selecting which articles are to be removed
Landscapes
- Engineering & Computer Science (AREA)
- Mechanical Engineering (AREA)
Abstract
The invention discloses an optimal dispatching method for warehousing systems combining rail guided vehicles and lifts. With the minimum dispatching travel time as the target, a dispatching warehouse-out and warehouse-in model is optimized through the genetic algorithm, the storing and delivering travel time is greatly shortened, the time cost is obviously reduced, the energy is saved, the advantages of the high efficiency, the high density and the high utilization rate of rail guided sub-vehicle full-automatic stereoscopic warehouses can be given full play to, real-time and online optimal dispatching of the automatic stereoscopic warehouses can be realized, and the practical application significance is great.
Description
Technical field
The invention belongs to intensive storage inbound/outbound process dispatching technique field, be specifically related to one and shuttle back and forth main-auxiliary vehicle and elevator (1:1
Type) hybrid optimization dispatching method.
Background technology
Along with scientific and technical and industrial fast development, separately rise based on " intensive storage " concept, modern enterprise pair
Require in producing, store in a warehouse and providing and delivering improves constantly, and promotes storage mode from the simple heap initially passing through manpower manual work
Amass the warehouse-type storage by simple devices such as fork trucks be improved to use at present high position forklift, unmanned guide trolleys AGV,
The tiered warehouse facility storage of the automation equipments such as shuttle.Rail mounted shuttle (RGV), low cost fast with its speed especially
In the industry such as modern manufacturing industry, logistics, the most important role is play with good stability.
The inbound/outbound process using piler to realize goods scheduling in conventional stereo warehouse, the advantage of piler is to achieve warehouse more
The mechanization of operation and automatization, be greatly improved work efficiency, meanwhile, utilizes computer to be controlled and manages, operation
Process and information processing rapidly, accurately, in time, can be accelerated goods and materials turnover, reduce carrying cost.But, piler needs
Taking corresponding tunnel and carry out operation, tiered warehouse facility effectively stores area and cannot make full use of, and, erecting of separate unit piler
Directly cannot carry out with horizontal operation, goods inbound/outbound process is inefficient simultaneously.
There is minority tiered warehouse facility to use shuttle to be combined with piler at present both at home and abroad and carry out operation, take full advantage of warehouse
Effective area and storage area, make cargo storage centralization, three-dimensional, reduces floor space, reduces Land Purchase expense.
But, Chinese scholars is mostly based on static scheduling to the research of shuttle, seldom relates to dynamic mixed scheduling, meanwhile,
Enterprise customizes service and deepens continuously, and small lot, the order of timeliness feature multiple batches of, high are on the increase, conventional palletizer
Formula tiered warehouse facility can not meet the nowadays market demand with the most perfect vehicle type shelf that shuttle back and forth.
Summary of the invention
It is an object of the invention to provide the warehousing system Optimization Scheduling that a kind of shuttle is combined with elevator.
For reaching above-mentioned purpose, present invention employs techniques below scheme:
1) the dispatch situation foundation of a set of main-auxiliary vehicle that shuttles back and forth is joined for calculating tune according to an elevator in fully automatic stereo warehouse
The mathematical model of degree journey time;
2) it being minimised as target dispatching journey time, utilizes step 1) mathematical model set up is to each in scheduler task
The dispatching sequence of individual goods to be dispatched is optimized, and determines that this scheduler task is utilizing an elevator to join a set of primary and secondary that shuttles back and forth
Car completes the optimal scheduling order under dispatch situation.
Described scheduler task includes accessing goods multiple working.
In the case of access goods multiple working, the mathematical model calculating scheduling journey time is expressed as:
Td=∑ [mij×Tt+(1-mij)×Tb]
Wherein, TdFor access goods multiple working scheduling journey time, TtAn access is completed when same layer for access goods yard
To scheduling journey time, TbFor access goods yard do not complete when same layer one access to scheduling journey time, access
The double goods scheduling taken afterwards is first deposited to representing;mij=0 or 1, value be 0 expression access to access goods not with
One layer, value be 1 expression access to access goods at same layer, i is stock, and j is picking.
Described TtAnd TbIt is expressed as:
Wherein, x, y and z are goods correspondence goods yard coordinate under OXYZ coordinate system, in described OXYZ coordinate system,
The I/O position in initial point O correspondence fully automatic stereo warehouse, X-axis correspondence mother's car moving direction, the corresponding sub-car side of movement of Y-axis
To, Z axis correspondence elevator moving direction;tzFor sub-car picking or unloading time;tmFor car female under no-load condition take sub-car or
Unload the time of sub-car;tm' take sub-car for car female under full load conditions or unload the time of sub-car;tsTake for elevator under no-load condition
Female car or unload time of female car;ts' take female car for elevator under full load conditions or unload the time of female car;vsFor elevator speed;
vmFor female car no-load speed, vm' it is female car full-load speed;vzFor sub-car no-load speed, vz' for sub-car full-load speed.
During described optimization, if the stock task amount included in scheduler task is more than picking task amount, then use respective counts
That measures treats that the picking task that picking article coordinate is (0,0,0) makes access goods task amount equal.
The method of described optimization is genetic algorithm.
Crossover probability P in described genetic algorithmcIt is 0.7~0.9, mutation probability PmIt is 0.1~0.2.
Beneficial effects of the present invention is embodied in:
One elevator is joined the dispatch situation founding mathematical models of a set of main-auxiliary vehicle that shuttles back and forth by the present invention, then sets up and goes out accordingly
Entering library model, after using genetic algorithm to optimize the library model that comes in and goes out, access journey time is greatly shortened, and can substantially save
Time cost, saves the energy, makes the shuttle back and forth high efficiency in main-auxiliary vehicle fully automatic stereo warehouse, high density, and high usage
Being not fully exerted etc. advantage, it is achieved the Optimized Operation that automatic stereowarehouse is real-time, online, having bigger reality should
Use meaning.
Accompanying drawing explanation
Fig. 1 is the main-auxiliary vehicle fully automatic stereo warehouse schematic diagram that shuttles back and forth;
Fig. 2 is the main-auxiliary vehicle fully automatic stereo storehouse model figure that shuttles back and forth;
In figure: 1 is female track road, and 2 is sub-track road, and 3 is rail of lifter.
Detailed description of the invention
The present invention is described in detail with embodiment below in conjunction with the accompanying drawings.
The present invention provides one to shuttle back and forth main-auxiliary vehicle and elevator hybrid optimization dispatching method, specifically implements according to following steps:
One elevator is joined the dispatch situation of a set of main-auxiliary vehicle that shuttles back and forth (1:1 type) and is set up rational mathematical model by step 1;
1.1 pairs of main-auxiliary vehicle fully automatic stereo warehouses that shuttle back and forth are analyzed research, formulate goods access rule
Seeing Fig. 1, the main-auxiliary vehicle fully automatic stereo warehouse that shuttles back and forth comprises: the main-auxiliary vehicle that shuttles back and forth (being made up of sub-car and female car), mother
Track (tunnel) is walked by garage, track is walked by sub-garage (shelf row), shuttle rack, pallet vertical promote system (lifting
Machine), tray conveying system, CMS apparatus control system, WMS warehouse management system.By complete certainly for the actual main-auxiliary vehicle that shuttles back and forth
Dynamic tiered warehouse facility is converted into the model under OXYZ coordinate system, as in figure 2 it is shown, include rail of lifter 3, female track road
1 and sub-track road 2.Wherein, elevator will be equipped with the main-auxiliary vehicle of goods and carries out the transport of Z-direction, female car by sub-car with
Goods carries out X-direction transport, and goods is carried out Y direction transport by sub-car.Single goods yard coordinate is [x, y, z], this
Coordinate refers to the centrical coordinate of goods, is above-mentioned coordinate origin O with I/O point (going out inbound station).
The present invention also sets following goods access rule:
(1) use a set of main-auxiliary vehicle that shuttles back and forth, once transport and be only capable of carrying a goods.Individually stock (or picking) feelings
Under condition, the main-auxiliary vehicle stock (picking) that shuttles back and forth returns to out inbound station (I/O point) after terminating;In the case of access goods multiple working,
After the main-auxiliary vehicle stock that shuttles back and forth terminates, carry out ensuing picking task, after final task terminates, elevator from this point
Main-auxiliary vehicle all returns to out inbound station with shuttling back and forth.
(2) initial position of elevator and the main-auxiliary vehicle that shuttles back and forth is going out inbound station (i.e. I/O point).
Going out to put in storage after order (i.e. scheduler task) assigns, order is analyzed by warehouse management system (WMS), according to
Simple stock operation, simple unstaffing, three kinds of situations of access goods multiple working, apparatus control system (CMS) regulates and controls
Main-auxiliary vehicle is risen to corresponding layer by elevator, and female car, at tunnel movement, rests at the goods row at goods place, female car
Discharging sub-car, sub-car returns after completing stock or unstaffing.
1.2 set up an elevator joins a set of main-auxiliary vehicle that shuttles back and forth (1:1 type) access goods mathematical model
Definition: the sub-car loading, unloading goods time is tz;Female car loading, unloading unloaded sub-car time is tm, female car loading, unloading are fully loaded with
The sub-car time is tm', elevator loading, unloading zero load mother is t the car times, elevator loading, unloading fully loaded female car time is ts', dress
The same with the time of unloading;Elevator speed is vs;Female car no-load speed is vm, female car full-load speed is vm';Sub-car zero load speed
Degree is vz, sub-car full-load speed is vz'。
(1) simple stock job model
Because the initial position of elevator and main-auxiliary vehicle is at O point, and main-auxiliary vehicle is returned to O point after every time stock completes, so
Total activation journey time T of simple stockcAs follows:
Tc=∑ Tc1
(2) simple unstaffing model
Because the initial position of elevator and main-auxiliary vehicle is at O point, and main-auxiliary vehicle is returned to O point after every time picking completes, so
Total activation journey time T of simple pickingqAs follows:
Tq=∑ Tq1
(3) access goods multiple working model
The access of goods being matched, it is right to be referred to as accessing, and i.e. one deposits one is taken as a unit.It is right for each access,
In two kinds of situation:
A () picking goods yard and stock goods yard are at same layer;
B () picking goods yard and stock goods yard be not at same layer;
Meanwhile, by access to access goods whether be set to a 0-1 variable m at same layerij,
Then each access is to (i is stock, and j is picking), and access goods yard is at same layer (zi=zj) scheduling journey time
Tt, access goods yard not in scheduling journey time T of same layerbAs follows:
Access goods multiple working access to total activation journey time TdAs follows:
Td=∑ [mij×Tt+(1-mij)×Tb] (5)
To sum up, the Access Model of the tiered warehouse facility joining a set of main-auxiliary vehicle that shuttles back and forth for an elevator is as follows:
Step 2 is optimized emulation to Access Model, determines input work optimal scheduling order and the shortest scheduling time.
The present invention uses MATLAB to carry out simulation analysis based on genetic algorithm, joins a set of primary and secondary that shuttles back and forth for an elevator
The dispatch situation of car, studies, respectively in terms of two: inventory amounts is equal to picking quantity, and inventory amounts
More than picking quantity.Inventory amounts is not considered less than the situation of picking quantity.Access goods quantity phase is here discussed in detail
Deng time 30 task amounts result of study, wherein parameter value is shown in Table 1.Specifically comprise the following steps that
Number respectively to the goods yard of all goods to be accessed, using the traversal order in goods yard as the coding of genetic algorithm.
The initial population being made up of 100 (population number n=100) random ergodic order is produced in MATLAB.Goods
Position compiling before specify, it is possible to use the coordinate parameters of stochastic generation.
Use the selection in basic genetic algorithmic, intersection, mutation operation that the traversal order in goods yard is optimized, choose repeatedly
Generation number c=50, crossover probability Pc=0.9, mutation probability Pm=0.2, adaptation value is eliminated and is accelerated exponent m=2.In the present invention
The objective function used is as follows:
Fitness (i, 1)=(1-((len (i, 1)-minlen)/(maxlen-minlen+0.0001))) ^m
Wherein, len (i, 1) represents the scheduling journey time that any individual i is corresponding, maxlen and minlen is respectively in colony
Journey time is the longest and the time used by shortest path in scheduling.
Utilizing fitness > rand selects individuality, by less for the time (fitness is bigger) individual selection and remain.
When inventory amounts is exactly equal to picking quantity:
30 goods correspondence goods yard coordinates are expressed as N (x y z) and N ' (x y z), and wherein, 15 is stock (square
Battle array A), N represents stock goods yard numbering (N=1~15), and 15 is picking (matrix B), and N ' represents picking goods yard numbering
(N '=1 '~15 ').For seeking the shortest time that a paths makes access goods complete, the goods yard coordinate that goods is corresponding is as follows:
A=[1 (13 10 3);2(7 6 4);3(15 11 2);4(3 5 2);5(14 9 3);6(8 2 1);7(12 12 2);8(16 3 4);9(20 9
2);10(2 4 3);11(3 8 2);12(3 10 3);13(13 9 1);14(5 8 2);15(14 4 3)];
B=[1 ' (5 7 4);2’(16 4 1);3’(17 6 2);4’(4 11 2);5’(10 11 1);6’(9 2 3);7’(8 4 2);8’(16 5
3);9’(19 5 1);10’(13 6 1);11’(17 9 3);12’(7 3 2);13’(2 2 4);14’(12 1 2);15’(18 7 2)];
Stochastic generation 100 about in A element put in order that (traversal order array a), stochastic generation 100 is about B
The putting in order of middle element (traversal order array b), it is then determined that element (representing a traversal order) and number in array a
The one_to_one corresponding mapping relations of element (representing a traversal order) in group b, by 100 mapping relations thus form 100
The traversal order of the individual access goods multiple working about 30 car loadings.Element in array a and array b is utilized respectively heredity
Algorithm is optimized, and changes the value (i.e. traversal order) of element in array, and according to the traversal time of access goods multiple working
Sequence calculating adaptation value (it is the adaptation value of respective element in array a, is also the adaptation value of respective element in array b, so-called
Corresponding two elements i.e. constituting mapping relations).
According to the random gained of program one group access goods multiple working order it is: (8 → 3 ') → (12 → 14 ') → (3 → 12 ') → (13
→10’)→(9→15’)→(1→11’)→(2→1’)→(5→5’)→(10→6’)→(7→4’)→(11→7’)→(6→13’)→
(14→8’)→(15→9’)→(4→2’).Journey time is: RTime=1015.2 (s).
After optimizing, gained one group access goods multiple working order is: (13 → 9 ') → (14 → 4 ') → (6 → 10 ') → (7 → 14 ')
→(9→2’)→(8→1’)→(5→8’)→(12→13’)→(11→7’)→(15→11’)→(4→12’)→(2→15’)→(10
→6’)→(3→3’)→(1→5’).Journey time is: RTime=977.75 (s).Optimize efficiency: η=(optimization front travel
Time m-optimization after journey time)/optimize front travel time=(1015.2-977.75)/1015.2=3.7%.
The result finally given ibid, is concluded into table 2 by other situation methods.Wherein, when inventory amounts > picking quantity,
(0 0 0) that can introduce respective numbers put as picking goods yard coordinate so that inventory amounts=picking quantity.Simultaneously as
A set of shuttle back and forth main-auxiliary vehicle time, for simple stock or the order of simple picking, its journey time and stock or picking
It is the most unrelated, so table 2 does not carry out record.
Learnt the discrepancy library model set up by the present invention by table 2, after algorithm optimization, taking of goods yard is deposited operation sequencing and is obtained
To optimizing, the journey time of shuttle and elevator and substantially shortening, time cost can be greatly saved, improve efficiency,
Further demonstrate the feasibility of this model, for automatic stereowarehouse the most on the market, economic benefits.
Table 1. model program parameters
Table 2. simulation analysis result
Claims (7)
1. the warehousing system Optimization Scheduling that a shuttle is combined with elevator, it is characterised in that: comprise the following steps:
1) the dispatch situation foundation of a set of main-auxiliary vehicle that shuttles back and forth is joined for calculating tune according to an elevator in fully automatic stereo warehouse
The mathematical model of degree journey time;
2) it being minimised as target dispatching journey time, utilizes step 1) mathematical model set up is to each in scheduler task
The dispatching sequence of individual goods to be dispatched is optimized, and determines that this scheduler task is utilizing an elevator to join a set of primary and secondary that shuttles back and forth
Car completes the optimal scheduling order under dispatch situation.
The warehousing system Optimization Scheduling that a kind of shuttle is combined with elevator, its feature
It is: described scheduler task includes accessing goods multiple working.
The warehousing system Optimization Scheduling that a kind of shuttle is combined with elevator, its feature
Being: in the case of access goods multiple working, the mathematical model calculating scheduling journey time is expressed as:
Td=∑ [mij×Tt+(1-mij)×Tb]
Wherein, TdFor access goods multiple working scheduling journey time, TtAn access is completed when same layer for access goods yard
To scheduling journey time, TbFor access goods yard do not complete when same layer one access to scheduling journey time, access
The double goods scheduling taken afterwards is first deposited to representing;mij=0 or 1, value be 0 expression access to access goods not with
One layer, value be 1 expression access to access goods at same layer, i is stock, and j is picking.
The warehousing system Optimization Scheduling that a kind of shuttle is combined with elevator, its feature
It is: described TtAnd TbIt is expressed as:
Wherein, x, y and z are goods correspondence goods yard coordinate under OXYZ coordinate system, in described OXYZ coordinate system,
The I/O position in initial point O correspondence fully automatic stereo warehouse, X-axis correspondence mother's car moving direction, the corresponding sub-car side of movement of Y-axis
To, Z axis correspondence elevator moving direction;tzFor sub-car picking or unloading time;tmFor car female under no-load condition take sub-car or
Unload the time of sub-car;tm' take sub-car for car female under full load conditions or unload the time of sub-car;tsTake for elevator under no-load condition
Female car or unload time of female car;ts' take female car for elevator under full load conditions or unload the time of female car;vsFor elevator speed;
vmFor female car no-load speed, vm' it is female car full-load speed;vzFor sub-car no-load speed, vz' for sub-car full-load speed.
The warehousing system Optimization Scheduling that a kind of shuttle is combined with elevator, its feature
It is: during described optimization, if the stock task amount included in scheduler task is more than picking task amount, then with corresponding
Quantity treat that the picking task that picking article coordinate is (0,0,0) makes access goods task amount equal.
The warehousing system Optimization Scheduling that a kind of shuttle is combined with elevator, its feature
It is: the method for described optimization is genetic algorithm.
The warehousing system Optimization Scheduling that a kind of shuttle is combined with elevator, its feature
It is: crossover probability P in described genetic algorithmcIt is 0.7~0.9, mutation probability PmIt is 0.1~0.2.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610365624.2A CN105858044B (en) | 2016-05-27 | 2016-05-27 | The warehousing system Optimization Scheduling that a kind of shuttle is combined with lift |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610365624.2A CN105858044B (en) | 2016-05-27 | 2016-05-27 | The warehousing system Optimization Scheduling that a kind of shuttle is combined with lift |
Publications (2)
Publication Number | Publication Date |
---|---|
CN105858044A true CN105858044A (en) | 2016-08-17 |
CN105858044B CN105858044B (en) | 2017-12-05 |
Family
ID=56642613
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201610365624.2A Active CN105858044B (en) | 2016-05-27 | 2016-05-27 | The warehousing system Optimization Scheduling that a kind of shuttle is combined with lift |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN105858044B (en) |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107416400A (en) * | 2017-07-04 | 2017-12-01 | 山东大学 | Model and its optimization method based on the intensive automatic storage system of cross-layer shuttle |
CN109081030A (en) * | 2018-09-28 | 2018-12-25 | 陕西科技大学 | A kind of method for optimizing configuration of the intensive warehousing system of primary and secondary shuttle vehicle type |
CN109230142A (en) * | 2018-10-22 | 2019-01-18 | 陕西科技大学 | A kind of scheduling method for optimizing route of intensive warehousing system multiple working |
CN109360447A (en) * | 2018-10-16 | 2019-02-19 | 北京首钢自动化信息技术有限公司 | A kind of control method that stereo garage avoids automatically |
CN111612202A (en) * | 2019-02-26 | 2020-09-01 | 北京京东尚科信息技术有限公司 | Method and system for transporting objects |
CN111942795A (en) * | 2020-08-17 | 2020-11-17 | 东华大学 | Operation efficiency evaluation method for four-way vehicle dense warehousing system |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109190840A (en) * | 2018-09-21 | 2019-01-11 | 中电科技(合肥)博微信息发展有限责任公司 | A kind of freezer shuttle dispatching management information system and dispatching method |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103955818A (en) * | 2014-05-27 | 2014-07-30 | 山东大学 | Task scheduling method of multilayer shuttle vehicle automatic warehousing system |
CN103971222A (en) * | 2014-05-27 | 2014-08-06 | 山东大学 | Goods location allocating method applied to automatic warehousing system of multi-layer shuttle vehicle |
CN104609086A (en) * | 2015-01-12 | 2015-05-13 | 世仓物流设备(上海)有限公司 | Four-directional shuttle vehicle control system based on road right tokens |
CA2954055A1 (en) * | 2014-07-08 | 2016-01-14 | Dematic Corp. | Lift configuration for carriage-based warehouse |
-
2016
- 2016-05-27 CN CN201610365624.2A patent/CN105858044B/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103955818A (en) * | 2014-05-27 | 2014-07-30 | 山东大学 | Task scheduling method of multilayer shuttle vehicle automatic warehousing system |
CN103971222A (en) * | 2014-05-27 | 2014-08-06 | 山东大学 | Goods location allocating method applied to automatic warehousing system of multi-layer shuttle vehicle |
CA2954055A1 (en) * | 2014-07-08 | 2016-01-14 | Dematic Corp. | Lift configuration for carriage-based warehouse |
CN104609086A (en) * | 2015-01-12 | 2015-05-13 | 世仓物流设备(上海)有限公司 | Four-directional shuttle vehicle control system based on road right tokens |
Non-Patent Citations (2)
Title |
---|
郭红丽: "基于多层穿梭车的立体仓库调度优化研究", 《中国优秀硕士学位论文全文数据库经济与管理科学辑》 * |
鲁春强等: "基于穿梭式母车运动学模型的matlab仿真分析", 《物流技术》 * |
Cited By (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107416400A (en) * | 2017-07-04 | 2017-12-01 | 山东大学 | Model and its optimization method based on the intensive automatic storage system of cross-layer shuttle |
CN107416400B (en) * | 2017-07-04 | 2018-03-23 | 山东大学 | Model and its optimization method based on the intensive automatic storage system of cross-layer shuttle |
CN109081030A (en) * | 2018-09-28 | 2018-12-25 | 陕西科技大学 | A kind of method for optimizing configuration of the intensive warehousing system of primary and secondary shuttle vehicle type |
CN109360447A (en) * | 2018-10-16 | 2019-02-19 | 北京首钢自动化信息技术有限公司 | A kind of control method that stereo garage avoids automatically |
CN109230142A (en) * | 2018-10-22 | 2019-01-18 | 陕西科技大学 | A kind of scheduling method for optimizing route of intensive warehousing system multiple working |
CN111612202A (en) * | 2019-02-26 | 2020-09-01 | 北京京东尚科信息技术有限公司 | Method and system for transporting objects |
CN111612202B (en) * | 2019-02-26 | 2024-04-19 | 北京京东乾石科技有限公司 | Method and system for transporting articles |
CN111942795A (en) * | 2020-08-17 | 2020-11-17 | 东华大学 | Operation efficiency evaluation method for four-way vehicle dense warehousing system |
CN111942795B (en) * | 2020-08-17 | 2021-11-12 | 东华大学 | Operation efficiency evaluation method for four-way vehicle dense warehousing system |
Also Published As
Publication number | Publication date |
---|---|
CN105858044B (en) | 2017-12-05 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN105836356B (en) | A kind of intensive warehousing system hybrid optimization dispatching method | |
CN105858044A (en) | Optimal dispatching method for warehousing systems combining rail guided vehicles and lifts | |
CN105858043B (en) | The warehousing system Optimization Scheduling that a kind of lift is combined with shuttle | |
CN104408589B (en) | AGV Optimization Schedulings based on Hybrid Particle Swarm | |
CN113222293B (en) | Intelligent stereoscopic warehouse optimal scheduling method | |
CN107480922A (en) | Both ends formula is unloaded goods bit allocation scheduling model method for building up with the double car operational modes of rail | |
CN109597304B (en) | Intelligent partitioned storage method for mold library based on artificial bee colony algorithm | |
CN109345017A (en) | A kind of shop material dispatching optimization method considering vanning constraint | |
CN109081030B (en) | Configuration optimization method of primary and secondary shuttle type intensive warehousing system | |
CN106773686B (en) | Path model method for building up is dispatched with piler under the double vehicle operational modes of rail | |
CN112070412A (en) | Configuration scheme and task scheduling method for multiple elevators in three-dimensional warehouse | |
CN111507644B (en) | Multi-point unloading constrained three-dimensional multi-container loading method | |
CN114611767A (en) | Global optimal intelligent warehousing scheduling optimization algorithm | |
CN111626516A (en) | Double-deep-position four-way shuttle system order ordering optimization method considering goods reversing strategy | |
CN110888905B (en) | Automatic generation method and system for unloading sequence of crane cargos | |
Yan et al. | Travel time analysis and dimension optimisation design of double-ended compact storage system | |
CN116342039A (en) | Optimizing method for goods distribution and sorting of stereoscopic warehouse | |
CN114897244A (en) | Order batch optimization method suitable for RMFS storage system | |
Kluska | Support the decision processes in management through the automatic generation of simulation models of warehouses | |
CN109872023B (en) | Integrated scheduling model of quay bridge QC, integrated card YT and gantry crane YC and GA algorithm thereof | |
Huang et al. | Route-optimization based storage allocation algorithm in intelligent high-bay warehouses | |
Zhou | The pallet loading method of single category cargo based on railway containerized transport | |
CN115043122B (en) | Airport early-arrival luggage stereo storage system entry-exit mode evaluation selection method | |
CN118014160A (en) | Multi-SM/RGV scheduling optimization method, equipment, medium and product for stereoscopic warehouse | |
Parab et al. | A review on automated storage and retrieval system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant | ||
TR01 | Transfer of patent right | ||
TR01 | Transfer of patent right |
Effective date of registration: 20210118 Address after: No.12, industrial road, Taihu hi tech Industrial Park, Huzhou south, Huzhou City, Zhejiang Province, 313000 Patentee after: Zhejiang Jingxing logistics equipment Co.,Ltd. Address before: No. 1, Weiyang District university garden, Xi'an, Shaanxi Province, Shaanxi Patentee before: SHAANXI University OF SCIENCE & TECHNOLOGY |