| Along with the development of modern logistics technology, automated storage and retrieval system (AS/RS)are widely used in production and circulation more and more. The management technology of AS/RS .especially the scheduling technology .becomes one of crucial technologies. There are mainly three scheduling problems in AS/RS, including optimization of rack zone, crane route scheduling and optimization of load and unload system. Optimization of rack zone and crane route scheduling are mainly discussed in the thesis.Based on the former research, we develop the conception of stage optimization, that is, first arrange shelves reasonably, second optimize the crane route, at last optimize the total load and unload system. In present, when people arrange rack zone, they only take care crane. But in this thesis, the load and unload frequencies of goods are also taken into count. So it can avoid haphazard plan. A mathematic model of rack zone scheduling is also proposed in this thesis. Aim at different scale problems, two method, traditional Hungary method and genetic algorithm, are proposed. Coding method, crossover method and mutation method are also discussed in this thesis. A instance are proposed in the thesis.The route scheduling of crane is a research focus. In this thesis, we discussed the feasibility of using genetic algorithm with binary code or gray code to solve this problem and proposed the conception of programming feasible route set, which feasible route set are taken as a regular set. As using binary code, a feasible route are look upon a positive integer, for example, the route from shelve 1 then to shelve 2 and last to 3 is integer 123 and feasible route solution set are the set of all feasible integers which arrange according its value. The method of gray code is that feasible solution set are regular permutation, two adjacent feasible route have only two different position. At last, an example are proposed to certificate the conception.
|
PDF Full Text Request