配送中心拣货作业设计与优化
|
摘要
拣货作业是指按照订单的要求将用户所订的货品从储存位置取出,分类、集中、装箱的作业过程。为满足一个客户订单,拣货员需行走到货品存储区,查找待拣选货品并从存储位置中取出,整理拣好的货品,对拣货作业过程进行记录,包装货品准备配送。在配送中心所有在库活动中,拣货作业是劳动密集型程度最高且花费最大的一项活动。随着客户订单的多样化和客户服务质量要求的提高,拣货作业运作方法的研究及应用更加成为研究的热点之一,拣货作业的优化对有效提高配送中心的运作效率,降低劳动消耗具有较大的意义。
本论文系统整理、总结了拣货作业运作相关的研究成果。分别研究了三种拣货系统中的拣货作业问题:静态分区拣货系统(串行分区、并行分区)、动态分区拣货系统以及双旋转货架拣货系统。首先,在静态分区拣货系统中,考虑拣货员拣货速度不同的情况,提出储位指派算法,通过对品项在各分区间储位的安排以平衡各分区拣货员的作业量;继而分析了在作业繁忙期与空闲期拣货员的配置及储位的调整问题。然后,在静态分区拣货系统的基础上提出动态分区拣货策略,通过订单拣货顺序的优化及拣货员所在分区的动态分配,提出了“排序-动态分区-平衡”思想,设计启发式算法使分区间等待时间减少,提高拣货效率。最后对分区拣货系统中常见的另一种货架系统——旋转货架进行讨论,针对双旋转货架系统配置下的拣货优化问题,分析其特点、建立数学规划模型,分别对拣取时间可忽略的情况及拣取时间不可忽略的情况设计启发式算法求解。此外,论文根据不同的拣货作业规则和优化目标,对相关模型及算法进行模拟测试以证明其有效性,为方法选择与应用提供了依据。
Order picking is to pick customer ordered items from storage locator and prepare for shipment.To fulfill an order,the picker walks to storage locations,finds the items,takes out from the locations,consolidates,packs,and prepares for the final shipment.Order picking is the most labor-intensive and costly in all the activities of the distribution center. With the increased customer demand diversity and high service expectations,the research and application of the order picking become one hot topic,in order to increase operation efficiency and decrease the labor workload.
This dissertation reviews the current research on the typical decision problems in design and control of order-picking processes.It mainly studies the problems in three kinds of order picking system:static zone order picking system(progressive zone order picking,synchronized zone order picking),dynamic zone order picking and double carousel order picking system.For static zone order picking system,it proposes assignment heuristic algorithms to balance the pickers' workload in different zones by the item location arrangement;considering the order volume fluctuation in peak periods and slack periods,it introduces two heuristic algorithms respectively on historical data.Based on static zone order picking,it brings the dynamic zone order picking strategy by optimizing the picking schedule to share jobs among pickers in one picking lane,two heuristic algorithms are introduced to reduce the total picking time.For double carousel system,in order to minimize the total picking time,it provides the heuristic algorithms to find the optimized picking schedule respectively when picking time can be ignored and when picking time cannot be ignored.Meanwhile,for different picking strategies and optimization objectives,simulated testing is taken to validate its performance and reliability of each algorithm,which provides a reference for the application and the choice of order picking methods.
本论文系统整理、总结了拣货作业运作相关的研究成果。分别研究了三种拣货系统中的拣货作业问题:静态分区拣货系统(串行分区、并行分区)、动态分区拣货系统以及双旋转货架拣货系统。首先,在静态分区拣货系统中,考虑拣货员拣货速度不同的情况,提出储位指派算法,通过对品项在各分区间储位的安排以平衡各分区拣货员的作业量;继而分析了在作业繁忙期与空闲期拣货员的配置及储位的调整问题。然后,在静态分区拣货系统的基础上提出动态分区拣货策略,通过订单拣货顺序的优化及拣货员所在分区的动态分配,提出了“排序-动态分区-平衡”思想,设计启发式算法使分区间等待时间减少,提高拣货效率。最后对分区拣货系统中常见的另一种货架系统——旋转货架进行讨论,针对双旋转货架系统配置下的拣货优化问题,分析其特点、建立数学规划模型,分别对拣取时间可忽略的情况及拣取时间不可忽略的情况设计启发式算法求解。此外,论文根据不同的拣货作业规则和优化目标,对相关模型及算法进行模拟测试以证明其有效性,为方法选择与应用提供了依据。
Order picking is to pick customer ordered items from storage locator and prepare for shipment.To fulfill an order,the picker walks to storage locations,finds the items,takes out from the locations,consolidates,packs,and prepares for the final shipment.Order picking is the most labor-intensive and costly in all the activities of the distribution center. With the increased customer demand diversity and high service expectations,the research and application of the order picking become one hot topic,in order to increase operation efficiency and decrease the labor workload.
This dissertation reviews the current research on the typical decision problems in design and control of order-picking processes.It mainly studies the problems in three kinds of order picking system:static zone order picking system(progressive zone order picking,synchronized zone order picking),dynamic zone order picking and double carousel order picking system.For static zone order picking system,it proposes assignment heuristic algorithms to balance the pickers' workload in different zones by the item location arrangement;considering the order volume fluctuation in peak periods and slack periods,it introduces two heuristic algorithms respectively on historical data.Based on static zone order picking,it brings the dynamic zone order picking strategy by optimizing the picking schedule to share jobs among pickers in one picking lane,two heuristic algorithms are introduced to reduce the total picking time.For double carousel system,in order to minimize the total picking time,it provides the heuristic algorithms to find the optimized picking schedule respectively when picking time can be ignored and when picking time cannot be ignored.Meanwhile,for different picking strategies and optimization objectives,simulated testing is taken to validate its performance and reliability of each algorithm,which provides a reference for the application and the choice of order picking methods.
引文
ⅰ 刘凯.现代物流技术基础[M].北京:清华大学出版社,北京交通大学出版社,2004,pp172
ⅱ 王转,程国全.配送中心系统规划[M].北京:中国物资出版社,2003,pp148
ⅲ 刑文训,谢金星.现代优化计算方法[M].北京:清华大学出版社,2005,pp12
ⅰ[美]詹姆斯·汤普金斯,约翰·怀特,亚乌兹·布泽,坦乔科著.伊俊敏,袁海波等译,设施规划[M].北京:机械工业出版社,2008,pp277
ⅱ 董溪哲.仓储货位优化模型及算法研究[D].哈尔滨工业大学,2006.
ⅲ[美]詹姆斯·汤普金斯,约翰·怀特,亚乌兹·布泽,坦乔科著.伊俊敏,袁海波等译,设施规划[M].北京:机械工业出版社,2008,pp292
ⅰ 焦李成,刘静,钟伟才.协同进化计算与多智能体系统[M].科学出版社,2006.9,pp23
ⅱ[日]玄光男,程润伟著.王定伟,唐加福,黄敏译.遗传算法与工程设计[M].科学出版社,2000,pp128
ⅲ 李敏强,寇继松,林丹,李书全.遗传算法的基本理论与应用[M].北京:科学出版社,2002,pp29
ⅳ 陈国良,王熙法,庄振全,王东生.遗传算法其应用[M].北京:人民邮电出版社,1996,pp105
ⅴ 周明,孙树林.遗传算法原理及应用[M].北京:国防工业出版社,1999,pp50
[1][日]玄光男,程润伟著,王定伟,唐加福,黄敏译.遗传算法与工程设计[M].北京:科学出版社,2000.
[2][美]詹姆斯·汤普金斯,约翰·怀特,亚乌兹·布泽,坦乔科著,伊俊敏,袁海波等译.设施规划[M].北京:机械工业出版社,2008.
[3]Armbruster D.,Gel E.S.Bucket brigades revisited:Are they always effective?[J].European Journal of Operational Research.2006,172(1),213-229.
[4]Armstrong R.D.,Cook W.D.,Saipe A.L.Optimal batching in a semiautomated order picking system[J].Journal of Operational Research Society.1979,30(8),711-720.
[5]Ashayeri J.,Gelders L.F.Warehouse design optimization[J].European Journal of Operational Research.1985,21(3),285-294.
[6]Bai Y.,Keller T.Modal parameter identification for a GFRP pedestrian bridge[J].Composite Structures.2008,82(1),90-100.
[7]Barrett B.G.A further digression on the over-automated warehouse:some evidence[J].Interfaces.1977,8(1),46-49.
[8]Bartholdi J.J.,Bunimovich L.A.,Eisenstein D.D.Bucket brigades:A self-balancing order-picking system for a warehouse.1996.
[9]Barthoidi J.J.,Eisenstein D.D.A production line that balances itself[J].Operations Research.1996,44(1),21.
[10]Bartholdi J.J.,Eisenstein D.D.Using Bucket Brigades to Migrate from Craft Manufacturing to Assembly Lines[J].Manufacturing & Service Operations Management.2005,7(2),121-129.
[11]Bartholdi J.J.,Eisenstein D.D.,Foley R.D.Performance of bucket brigades when work is stochastic[J].Operations Research.2001,49(5),710-719.
[12]Bartholdi J.J.,Eisenstein D.D.,Lim Y.F.Bucket brigades on in-tree assembly networks[J].European Journal of Operational Research.2006,168(3),870-879.
[13]Bartholdi J.J.,Hackman S.T.Allocating space in a forward pick area of a distribution center for small parts[J],lie Transactions.2008,40(11),1046-1053.
[14]Bartholdi J.J.,Platzman L.K.Retrieval strategies for a carousel conveyor[J],lie Transactions.1986,18(2),166-173.
[15]Bengu G.An optimal storage assignment for automated rotating carousel[J].lie Transactions.1995,27(1),105-107.
[16]Boysen N.,Fliedner M.,Scholl A.Assembly line balancing." Which model to use when?[J]. International Journal of Production Economics.2008,111(2),509-528.
[17]Bozer Y.A.,Quiroz M.A.,Sharp G.P.An evaluation of alternative control strategies and design issues for automated order accumulation and sortation systems[J].Material Flow.1988,4 265-282.
[18]Bozer Y.A.,Sharp G.P.An empirical evaluation of general purpose automated order accumulation and sortation system used in batch picking[J].Material Flow.1985,2(2),111-131.
[19]Bozer Y.A.,White J.A.Travel-time models for automated storage/retrieval systems[J],lie Transactions.1984,16(4),329-338.
[20]Brynzer H.,Johansson M.I.Design and performance of kitting and order picking systems[J].International Journal of Production Economics.1995,41(1-3),115-125.
[21]Caron F.,Marchet G.,Perego A.Optimal layout in low-level picker-to-part systems[J].International Journal of Production Research.2000,38(1),101-117.
[22]Caron F.,Marchet,G.,Perego A.Routing policies and COI-based storage policies in picker-to-part systems[J].International Journal of Production Research.1998,36(3),713-732.
[23]Chang S.H.,Egbelu P.J.Relative pre-positioning of storage/retrieval machines in automated storage/retrieval systems to minimize expected system response time[J].Iie Transactions.1997a,29(4),313-322.
[24]Chang S.H.,Egbelu P.J.Relative pre-positioning of storage/retrieval machines in automated storage/retrieval systems to minimize maximum system response time[J].Iie Transactions.1997b,29(4),303-312.
[25]Chen M.C.,Wu H.P.An association-based clustering approach to order hatching considering customer demand patterns[J].Omega-International Journal of Management Science.2005,33(4),333-343.
[26]Chew E.P.,Tang L.C.Travel time analysis for general item location assignment in a rectangular warehouse[J].European Journal of Operational Research.1999,112(3),582-597.
[27]Choe K.,Sharp G.P.Small parts order picking:design and operation,vol.2009http://www2.isye.gatech.edu/logistiestutorial/order/article.htm(accessed(2009.1.30),1991.
[28]Choe K.I.,Sharp G.P.,Serfozo R.S.Aisle-based order pick systems with batching,zoning and sorting[J],in:Progress in Material Handling Research:1992,R.J.Graves et al.(eds.),Material Handling Institute,Charlotte.1993,245-276.
[29]Colorni A,Dorigo M,Maniezzo V.An investigation of some properties of an ant algorithm[A].Proc of the Parallel Problem Solving from Nature Conference(PPSN'92)[C].Belgium:Elsevier Publishing,1992.
[30]De Koster R.Performance approximation of pick-to-belt orderpicking systems[J].European Journal of Operational Research.1994,72(3),558-573.
[31]De Koster R.How to assess a warehouse operation in a single tour,Report,RSM Erasmus University,the Netherlands.2004.
[32]De Koster R.,Le-Duc T.,Roodbergen K.J.Design and control of warehouse order picking:A literature review[J].European Journal of Operational Research.2007,182 (2),481-501.
[33]De Koster R.,Roodbergen K.J.,van Voorden R.Reduction of walking time in the distribution center of De Bijenkorf[J].New Trends in Distribution Logistics.1999,480 215-234.
[34]De Koster R.,Van der Poort E.Routing orderpickers in a warehouse:a comparison between optimal and heuristic solutions[J].Iie Transactions.1998,30 (469-480).
[35]De Koster R.B.M.,Le-Duc T.,Yugang Y.Optimal storage rack design for a 3-dimensional compact AS/RS[J].International Journal of Production Research.2008,46 (6),1495-1514.
[36]Egbelu P.J.,Wu C.-T.A comparison of dwell point rules in an automated storage/retrieval system[J].International Journal of Production Research.1993,31 (11),2515-2530.
[37]Eisenstein D.D.Analysis and optimal design of discrete order picking technologies along a line[J].Naval Research Logistics.2008,55 (4),350-362.
[38]Elsayed E.A.Algorithms for optimal material handling in automatic warehousing systems[J].International Journal of Production Research.1981,19 (5),525-535.
[39]Elsayed E.A.,Lee M.K.Order processing in automated storage/retrieval systems with due dates [J].Iie Transactions.1996,28 (7),567-577.
[40]Elsayed E.A.,Lee M.K.,Kim S.,Scherer E.Sequencing and batching procedures for minimizing earliness and tardiness penalty of order retrievals[J].International Journal of Production Research.1993,31 (3),727-738.
[41]Elsayed E.A.,Stern R.G Computerized algorithms for order processing in automated warehousing systems[J].International Journal of Production Research.1983,21 (4),579-586.
[42]Elsayed E.A.,Unal O.I.Order batching algorithms and travel-time estimation for automated storage/retrieval systems[J].International Journal of Production Research.1989,27 (7),1097-1114.
[43]Eynan A.,Rosenblatt M.J.Establishing zones in single-command class-based rectangular AS/RS[J].Iie Transactions.1994,26 (1),38-46.
[44]Frazelle E.H.Material Handling Systems and Terminology[M].Lionheart Publishing,Inc,Atlanta,GA.,1992.
[45]Gademann A.J.R.M.N.,van den Berg J.P.,van der Hoff H.H.An order batching algorithm for wave picking in a parallel-aisle warehouse[J].Iie Transactions.2001,33 (5),385-398.
[46]Gademann N.,van de Velde S.Order batching to minimize total travel time in a parallel-aisle warehouse[J].Iie Transactions.2005,37 (1),63-75.
[47]Gibson D.R.,Sharp G P.Order batching procedures[J].European Journal of Operational Research. 1992,58(1),57-67.
[48]Goetschalckx M.,Ratliff H.D.An efficient algorithm to cluster order picking items in a wide aisle[J].Engineering Costs and Production Economics.1988a,13 (4),263-271.
[49]Goetschalckx M.,Ratliff H.D.Order picking in an aisle[J].Iie Transactions.1988b,20 (1),53-62.
[50]Gong Y.M.,De Koster R.A polling-based dynamic order picking system for online retailers[J].Iie Transactions.2008,40 (11),1070-1082.
[51]Graves S.C,Hausman W.H.,Schwarz L.B.Storage-retrieval interleaving in automatic warehousing systems[J].Management Science.1977,23 (9),935-945.
[52]Gu J.,Goetschalckx M.,McGinnis L.F.Research on warehouse operation:A comprehensive review[J].European Journal of Operational Research.2007,177 (1),1-21.
[53]Guenov M.,Raeside R.Zone shapes in class based storage and multicommand order picking when storage/retrieval machines are used[J].European Journal of Operational Research.1992,58 (1),37-47.
[54]Hackman S.T.,PIatzman L.K.Near-optimal solution of generalized resource allocation problems with large capacities[J].Operations Research.1990,38 (5),902-910.
[55]Hackman S.T.,Rosenblatt M.J.Allocating items to an automated storage and retrieval system[J].Iie Transactions.1990,22 (1),7-14.
[56]Hall R.W.Distance approximations for routing manual pickers in a warehouse[J].Iie Transactions.1993,25 (4),76-87.
[57]Han M.H.,McGinnis,White J.A.Analysis of rotary rack operation[J].Material Flow.1988,4 (1),283-293.
[58]Han M.H.,McGinnis L.F.,Shieh J.S.,White J.A.On sequencing retrievals in an automated storage/retrieval system[J].Iie Transactions.1987,19 (1),56-66.
[59]Hassini E.,Vickson R.G A two-carousel storage location problem[J].Computers & Operations Research.2003,30 (4),527-539.
[60]Hausman W H.,Schwarz L.B.,Graves S.C.Optimal storage assignment in automatic warehousing systems[J].Management Science.1976,22 (6),629-638.
[61]Heskett J.L.Cube-per-order index-a key to warehouse stock location[J].Transportation and Distribution Management.1963,3 27-31.
[62]Heskett J.L.Putting the cube-per-order index to work in warehouse layout[J].Transportation and Distribution Management.1964,4 (8),23-30.
[63]Ho Y C,Su T.S.,Shi Z.B.Order-batching methods for an order-picking warehouse with two cross aisles[J].Computers & Industrial Engineering.2008,55 (2),321-347.
[64]Ho Y.C,Wee H.M.,Chen H.C.A geometric design of zone-picking in a distribution warehouse[J].Computational Science and Its Applications-ICCSA 2007,Pt 3,Proceedings.2007,625-636.
[65]Hwang H.,Ha J.-W.Cycle time models for single/double carousel system[J].International Journal of Production Economics.1991,25 (1-3),129-140.
[66]Hwang H.,Kim C.S.,Ko K.H.Performance analysis of carousel systems with double shuttle[J].Computers & Industrial Engineering.1999,36 (2),473-485.
[67]Hwang H.,Lee M.K.Order batching algorithms for a man-on-board automated storage and retrieval system[J].Engineering Costs and Production Economics.1988,13 (4),285-294.
[68]Hwang H.,Lee Y.K.,Ko C.S.Routing policies in an order picking operation.Proceedings of the 16th International Conference on Production Research.2001.
[69]Hwang H.,Lim J.M.Deriving an optimal dwell point of the storage/retrieval machine in an automated storage/retrieval system[J].International Journal of Production Research.1993,31 (11),2591-2602.
[70]Hwang H.,Song J.Y.Sequencing picking operations and travel time models for man-on-board storage and retrieval warehousing system[J].International Journal of Production Economics.1993,29(1),75-88.
[71]Jacobs D.P.,Peck J.C.,Davis J.S.A fast algorithm for shelf optimization[J].Research Journal of Textile and Apparel.2000a,4 (2),47-51.
[72]Jacobs D.P.,Peck J.C.,Davis J.S.A simple heuristic for maximizing service of carousel storage[J].Computers and Operations Research.2000b,27 (13),1351-1356.
[73]Jane C.C.Storage location assignment in a distribution center[J].International Journal of Physical Distribution & Logistics Management.2000,30 (1-2),55-71.
[74]Jane C.C.,Laih Y.W.A clustering algorithm for item assignment in a synchronized zone order picking system[J].European Journal of Operational Research.2005,166 (2),489-496.
[75]Jarvis J.M.,McDowell E.D.Optimal product layout in an order picking warehouse[J].Iie Transactions.1991,23 (1),93-102.
[76]Jewkes E.,Lee C.Vickson R.Product location,allocation and server home base location for an order picking line with multiple servers[J].Computers & Operations Research.2004,31 (4),623-636.
[77]Jia-wei H.,Jian P.,Yi-wen Y.Mining Frequent Patterns Without Candidate Generation.In:Proceedings 2000 ACM SIGMOD International conference management of data.Dallas.TX,2000,1-12.
[78]Johnson M.E.The impact of sorting strategies on automated sortation system performance[J].Iie Transactions.1998,30 67-77.
[79]Jungwattanakit J.,Reodecha M.,Chaovalitwongse P.,Werner F.A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines,setup times,and dual criteria[J].Computers & Operations Research.2009,36 (2),358-378.
[80]Kim B.Maximizing service of carousel storage[J].Computers & Operations Research.2005,32 (4),767-772.
[81]Kim Y.K.,Hyun C.J.,Kim Y.Sequencing in mixed model assembly lines:A genetic algorithm approach[J].Computers & Operations Research.1996,23 (12),1131-1145.
[82]Koo R-H.The use of bucket brigades in zone order picking systems[J].OR Spectrum.2008.
[83]Larson T.N.,March H.,Kusiak A.A heuristic approach to warehouse layout with class-based storage[J].Iie Transactions.1997,29 (4),337-348.
[84]Le-Duc T.,De Koster R.An approximation for determining the optimal picking batch size for order picker in single aisle warehouses.In:Meller,M.,Ogle,M.K.,Brett,A.R,Taylor,GD.,Usher,J.(Eds.),Progress in Material Handling Research.Material Handling Institute,Charlotte,NC,2002,267-286.
[85]Le-Duc T.,De Koster R.B.M.Travel distance estimation and storage zone optimization in a 2-block class-based storage strategy warehouse[J].International Journal of Production Research.2005,43 (17),3561-3581.
[86]Lee H.F.,Schaefer S.K.Retrieval sequencing for unit-load automated storage and retrieval systems with multiple openings[J].International Journal of Production Research.1996,34 (10),2943-2962.
[87]Lee H.F.,Schaefer S.K.Sequencing methods for automated storage and retrieval systems with dedicated storage[J].Computers and Industrial Engineering.1997,32 (2),351-362.
[88]Lee M.K.A storage assignment policy in a man-on-board automated storage/retrieval system[J].International Journal of Production Research.1992,30 (10),2281-2292.
[89]Lee M.K.,Kim S.Y.Scheduling of storage/retrieval orders under a just-intime environment[J].International Journal of Production Research.1995,33 (12),3331-3348.
[90]Li C.-L.,Wan G Improved algorithm for maximizing service of carousel storage[J].Computers & Operations Research.2005,32 (8),2147-2150.
[91]Litvak N.,Adan I.The travel time in carousel systems under the nearest item heuristic[J].Journal of Applied Probability.2001,38 (1),45-54.
[92]Litvak N.,Adan I.J.B.F.,Wessels J.Order picking in carousel systems under the nearest item heuristic[J].Probability in the Engineering and Informational Sciences.2001,15 (2),135-164.
[93]Litvak N.,Zwet W.R.V.On the minimal travel time needed to collect n items on a circle[J].The Annals of Applied Probability.2004,14 (2),881-902.
[94]Liu P.,Lu X.On-line scheduling of parallel machines to minimize total completion times[J].Computers & Operations Research.2009,36 (9),2647-2652.
[95]Maher M.L.,Poon J.Modeling design exploration as co-evolution [J].Microcomputers in Civil Engineering.1996,11 (3),195-209.
[96]Malmborg C.J.,Bhaskaran K.A revised proof of optimality for the cube-perorder index rule for stored item location [J].Applied Mathematical Modelling.1990,14 (2),87-95.
[97]Malmborg C.J.,Krishnakumar B.Optimal storage assignment policies for multiaddress warehousing systems[J].IEEE Transactions on Systems,Man and Cybernetics.1989,19 (1),197-204.
[98]Matta M.E.A genetic algorithm for the proportionate multiprocessor open shop[J].Computers & Operations Research.2009,36 (9),2601-2618.
[99]Meller R.D.Optimal order-to-lane assignments in an order accumulation/sortation system,[J].Iie Transactions.1997,29 (4),293-301.
[100]Meller R.D.,Klote J.E.A throughput model for carousel/VLM pods[J].Iie Transactions.2004,36 (8),725-741.
[101]Muppani V.R.,Adil G K.A branch and bound algorithm for class based storage location assignment[J].European Journal of Operational Research.2008a,189 (2),492-507.
[102]Muppani V.R.,Adil G K.Efficient formation of storage classes for warehouse storage location assignment:A simulated annealing approach[J].Omega-International Journal of Management Science.2008b,36 (4),609-618.
[103]Onut S.,Tuzkaya U.R.,Dogac B.A particle swarm optimization algorithm for the multiple-level warehouse layout design problem[J].Computers & Industrial Engineering.2008,54 (4),783-799.
[104]Pan C.H.,Liu S.Y.A comparative study of order batching algorithms[J].Omega International Journal of Management Science.1995,23 (6),691-700.
[105]Pan J.C.H.,Shih P.H.Evaluation of the throughput of a multiple-picker order picking system with congestion consideration[J].Computers & Industrial Engineering.2008,55 (2),379-389.
[106]Paquete L.,Stutzleb T.Design and analysis of stochastic local search for the multiobjective traveling salesman problem[J].Computers & Operations Research.2009,36 (9),2619-2631.
[107]Parikh P.J.,Meller R.D.Selecting between batch and zone order picking strategies in a distribution center[J].Transportation Research Part E-Logistics and Transportation Review.2008,44(5),696-719.
[108]Park B.C,Park J.Y.,Foley R.D.Carousel System Performance[J].Journal of Applied Probability.2003,40 (3),602-612.
[109]Petersen C.G An evaluation of order picking routeing policies[J].International Journal of Operations & Production Management.1997,17(11),1098-1111.
[110]Petersen C.G An evaluation of order picking policies for mail order companies[J].Production and Operations Management.2000,9 (4),319-335.
[111]Petersen C.G Considerations in order picking zone configuration[J].International Journal of Operations & Production Management.2002,22 (7-8),793-805.
[112]Petersen C.G,Aase G R.,Heiser D.R.Improving order-picking performance through the implementation of class-based storage[J].International Journal of Physical Distribution & Logistics Management.2004,34 (7),534-544.
[113]Petersen C.G,Schmenner R.W.An evaluation of routing and volume-based storage policies in an order picking operation[J].Decision Sciences.1999,30 (2),481-501.
[114]Ponnambalam S.G,Aravindan P.,Naidu G A comparative evaluation of assembly line balancing heuristics[J].The International Journal of Advanced Manufacturing Technology.1999,(15),577-586.
[115]Ratliff H.D.,Rosenthal A.S.Orderpicking in a rectangular warehouse:a solvable case of the traveling salesman problem[J].Operations Research.1983,31 (3),507-521.
[116]Roberts D.L.,Isbell C.L.,Littman M.L.Optimization problems involving collections of dependent objects[J].Annals of Operations Research.2008,163 (1),255-270.
[117]Roll Y.,Rosenblatt M.J.Random versus grouped storage policies and their effect on warehouse capacity[J].Material Flow.1983,1 199-205.
[118]Roodbergen K.J.Layout and routing methods for warehouses[D].Erasmus University,Rotterdam,The Netherlands,2001.
[119]Roodbergen K.J.,De Koster R.Routing methods for warehouses with multiple cross aisles[J].International Journal of Production Research.2001a,39 (9),1865-1883.
[120]Roodbergen K.J.,de Koster R.Routing order pickers in a warehouse with a middle aisle[J].European Journal of Operational Research.2001b,133 (1),32-43.
[121]Roodbergen K.J.,P.S.G,Vis I.F.A.Designing the layout structure of manual order picking areas in warehouses[J].Iie Transactions.2008,40 (11),1032-1045.
[122]Roodbergen K.J.,Vis I.F.A.A survey of literature on automated storage and retrieval systems[J].European Journal of Operational Research.2009,194 (2),343-362.
[123]Rosenblatt M.J.,Eynan A.Deriving the optimal boundaries for class-based automatic storage/retrieval systems [J].Management Science.1989,35 (12),1519-1524.
[124]Rosenblatt M.J.,Roll Y.Warehouse design with storage policy considerations[J].International Journal of Production Research.1984,22 (5),809-821.
[125]Rosenblatt M.J.,Roll Y.Warehouse capacity in a stochastic environment[J].International Journal of Production Research.1988,26 (12),1847-1851.
[126]Rosenwein M.B.An application of cluster analysis to the problem of locating items within a warehouse[J].Iie Transactions.1994,26(1),101-103.
[127]Rosenwein M.B.A comparison of heuristics for the problem of batching orders for warehouse selection[J].International Journal of Production Research.1996,34 (3),657-664.
[128]Rouwenhorst B.,Reuter B.,Stockrahm V.,van Houtum G J.,Mantel R.J.,Zijm W.H.M.Warehouse design and control:Framework and literature review[J].European Journal of Operational Research.2000,122 (3),515-533.
[129]Ruben R.A.,Jacobs F.R.Batch construction heuristics and storage assignment strategies for walk/ride and pick systems[J].Management Science.1999,45 (4),575-596.
[130]Russell M.L.,Meller R.D.Cost and throughput modeling of manual and automated order fulfillment systems[J].Iie Transactions.2003,35 (7),589-603.
[131]Santos L.,Coutinho-Rodrigues J.,Current J.R.An improved heuristic for the capacitated arc routing problem[J].Computers & Operations Research.2009,36 (9),2632-2637.
[132]Stern H.L.Parts location andoptimal picking rules for a carousel conveyor automatic storage andretrieval system.Proceeding of the Seventh International Conference on Automation in Warehousing.1986,85-92.
[133]Su C.Performance evaluations of carousel operation[J].Production Planning and Control Engineering Practice.1998,9 (5),477-488.
[134]Tang L.C.,Chew E.K.Order picking systems:batching and storage assignment strategies[J].Computers & Industrial Engineering.1997,33 (3-4),817-820.
[135]Thonemann U.W.,Brandeau M.L.Note.Optimal storage assignment policies for automated storage and retrieval systems with stochastic demands[J].Management Science.1988,44 (1),142-148.
[136]Tompkins J.A.,Smith J.D.The Warehouse Management Handbook.[M].1998.
[137]Tompkins J.A.,White J.A.,Bozer Y.A.,Frazelle E.H.,Tanchoco J.M.A.Facilities Planning[M].NJ.:John Wiley&Sons,Hoboken,NJ,2003.
[138]Van den Berg J.P.Multiple order pick sequencing in a carousel system:a solvable case of the rural postman problem[J].Journal of the Operational Research Society.1996,47 (12),1504-1515.
[139]Van den Berg J.P.A literature survey on planning and control of warehousing systems[J].Iie Transactions.1999,31 (8),751-762.
[140]Van den Berg J.P.Analytic expressions for the optimal dwell point in an automated storage/retrieval system[J].International Journal of Production Economics.2002,76,13-25.
[141]Van den Berg J.P.,Sharp G P.,Gademann A.J.R.M.,Pochet Y.Forward-reserve allocation in a warehouse with unit-load replenishments[J].European Journal of Operational Research.1998,111 (1),98-113.
[142]Van den Berg J.P.,Zijm W.H.M.Models for warehouse management:classification and examples[J].International Journal of Production Economics.1999,5,519-528.
[143]Vaughan T.S.,Petersen C.G The effect of warehouse cross aisles on order picking efficiency[J].International Journal of Production Research.1999,37(4),881-897.
[144]Vickson R.G.,Fujimoto A.Optimal storage locations in a carousel storage and retrieval system[J].Location Science.1996,4(4),237-245.
[145]Vickson R.G.,Lu X.Optimal product and server locations in one-dimensional storage racks[J].European Journal of Operational Research.1998,105(1),18-28.
[146]W(?)scher G.Order picking:A survey of planning problems and methods.In:Supply Chain Management and Reverse Logistics.2004,323-347.
[147]Wan Y.W.,WolffR.W.Picking clumpy orders on a carousel[J].Probability in the Engineering and Informational Sciences.2004,18(1),1-11.
[148]Wang G.,Cheng T.C.E.Parallel machine scheduling with batch delivery costs[J].International Journal of Production Economics.2000,68(2),177-183.
[149]Wang G.,Cheng T.C.E.An Approximation Algorithm for Parallel Machine Scheduling with a Common Server[J].The Journal of the Operational Research Society.2001a,52(2),234-237.
[150]Wang G.,Cheng T.C.E.Heuristics for two-machine no-wait flowshop scheduling with an availability constraint[J].Information Processing Letters.2001b,80(6),305-309.
[151]Wang G.,Cheng T.C.E.Customer order scheduling to minimize total weighted completion time[J].Omega.2007,35(5),623-626.
[152]Wang G.Optimal Order Picking in a Double Carousel Storage System[J].working paper.2007.
[153]Wen U.-P.,Chang D.T.Picking rules for a carousel conveyor in an automated warehouse[J].Omega-lnternational Journal of Management Science.1988,16(2),145-151.
[154]Won J.,Olafsson S.Joint order batching and order picking in warehouse operations[J].International Journal of Production Research.2005,43(7),1427-1442.
[155]Yeh D.H.A note on "a simple heuristic for maximizing service of carousel storage"[J].Computers and Operations Research.2002,29(11),1605-1608.
[156]Yu M.,de Koster R.B.M.The impact of order hatching and picking area zoning on order picking system performance[J].European Journal of Operational Research.2008a,In Press,Corrected Proof.
[157]Yu M.F.,De Koster R.Performance approximation and design of pick-and-pass order picking systems[J].Iie Transactions.2008b,40(11),1054-1069.
[158]Yugang Y.,De Koster R.B.M.Optimal zone boundaries for two-class-based compact three-dimensional automated storage and retrieval systems[J].Iie Transactions.2009,41(3),194-208.
[159]文坚,马士华.基于时间延迟的订单分批策略研究[J].物流技术与应用.2005,(04),92-95.
[160]王宏.双区型仓库拣货路径优化方法研究[D].中南大学,2007.
[161]王雄志.配送中心配货作业计划方法研究[D].暨南大学,2007.
[162]王雄志,王国庆.配送中心定向补货作业问题[J].系统工程.2006,(01).
[163]王雄志,王国庆.配送中心补货作业问题的启发式算法[J].系统工程理论与实践.2008a,(04).
[164]王雄志,王国庆.旋转货架配货作业的改进临近域算法[J].工业工程与管理.2008b,(04).
[165]王雄志,周丽虹.配送中心补货作业问题的蚂蚁算法[J].暨南大学学报.2007,(03).
[166]王转,程国全.配送中心系统规划[M].北京:中国物资出版社,2003.
[167]王钊,林家恒,刘长有,李希霖.用改进的模拟退火算法实现对单伺服机分层水平旋转货架存取路径的优化[J].控制与决策.1996,11(suppl1).
[168]田炳丽,刘常波,解贵新.旋转货架拣选作业优化的交叉蚁群算法求解[J].现代电子技术.2008,(12).
[169]申培萍.全局优化方法[M].北京:科学出版社,2006.
[170]伍经纬,蔡临宁.订单分批算法的适用性研究[J].工业工程与管理.2007,(04).
[171]刑文训,谢金星.现代优化计算方法[M].北京:清华大学出版社,2005.
[172]朱玉全,杨鹤标,孙蕾.数据挖掘技术[M].东南大学出版社,2006.
[173]朱耀明.自动化立体仓库优化调度研究[D].山东大学,2006.
[174]李梅娟,陈雪波,张梅凤.基于群集智能算法的路径规划问题[J].清华大学学报(自然科学版).2007,(S2).
[175]李雄飞,李军.数据挖掘与知识发现[M].高等教育出版社,2003.
[176]李诗珍.配送中心订单分批拣货问题的数学模型及算法[J].铁道运输与经济.2007,(11).
[177]李诗珍.配送中心订单分批拣货模型及种籽启发式算法[J].起重运输机械.2009,(01).
[178]李诗珍,杜文宏.基于聚类分析的订单分批拣货模型及启发式算法[J].统计与决策.2008,(12).
[179]杜盛霖.基于货位优化的自动化立体仓库出入库系统设计[D].山东大学,2006.
[180]周明,孙树林.遗传算法原理及应用[M].北京:国防工业出版社,1999.
[181]林家恒,王钊,刘长有.旋转货架存取路径的一种优化方法[J].见:中国控制与决策学术年会论文集,沈阳:东北大学出版社.1995,412-415.
[182]林家恒,李国峰,李建勋.遗传算法在双拣选台旋转货架拣选路径优化中的应用[J].山东工业大学学报.1997,27(3).
[183]胡运权.运筹学教程[M].北京:清华大学出版社,2003.
[184]焦李成,刘静,钟伟才.协同进化计算与多智能体系统[M].北京:科学出版社,2006.
[185]董溪哲.仓储货位优化模型及算法研究[D].哈尔滨工业大学,2006.
[186]冯艳君,李梅娟,王罡.基于蚁群优化算法的旋转货架拣选路径规划[J].渤海大学学报(自然科学版).2007,(01).
[187]张攀,田国会,贾磊,李晓磊,路飞.旋转货架拣选作业优化问题的新型混合遗传算法求解[J].机械工程学报.2004,(06).
[188]谭俊华,李诗珍.订单分批问题的数学模型及节约启发式算法[J].起重运输机械.2008,(03).
[189]郑欢.自动化立体仓库路径优化问题研究[D].吉林大学,2006.
[190]阳明盛,罗长童.最优化原理、方法及求解软件[M].北京:科学出版社,2006.
[191]陈志平等.计算复杂性理论与NPC和NP难问题的求解[M].北京:科学出版社,2001.
[192]陈国良,王熙法,庄振全,王东生.遗传算法其应用[M].北京:人民邮电出版社,1996.
[193]马士华,文坚.基于时间延迟的订单分批策略研究[J].工业工程与管理.2004,(06).
[194]马婷.包装产品仓储货位的优化问题研究[D].2008.
[195]龚国清.基于分枝定界法的旋转货架存取路径优化[J].物流科技.2007,(12).
ⅱ 王转,程国全.配送中心系统规划[M].北京:中国物资出版社,2003,pp148
ⅲ 刑文训,谢金星.现代优化计算方法[M].北京:清华大学出版社,2005,pp12
ⅰ[美]詹姆斯·汤普金斯,约翰·怀特,亚乌兹·布泽,坦乔科著.伊俊敏,袁海波等译,设施规划[M].北京:机械工业出版社,2008,pp277
ⅱ 董溪哲.仓储货位优化模型及算法研究[D].哈尔滨工业大学,2006.
ⅲ[美]詹姆斯·汤普金斯,约翰·怀特,亚乌兹·布泽,坦乔科著.伊俊敏,袁海波等译,设施规划[M].北京:机械工业出版社,2008,pp292
ⅰ 焦李成,刘静,钟伟才.协同进化计算与多智能体系统[M].科学出版社,2006.9,pp23
ⅱ[日]玄光男,程润伟著.王定伟,唐加福,黄敏译.遗传算法与工程设计[M].科学出版社,2000,pp128
ⅲ 李敏强,寇继松,林丹,李书全.遗传算法的基本理论与应用[M].北京:科学出版社,2002,pp29
ⅳ 陈国良,王熙法,庄振全,王东生.遗传算法其应用[M].北京:人民邮电出版社,1996,pp105
ⅴ 周明,孙树林.遗传算法原理及应用[M].北京:国防工业出版社,1999,pp50
[1][日]玄光男,程润伟著,王定伟,唐加福,黄敏译.遗传算法与工程设计[M].北京:科学出版社,2000.
[2][美]詹姆斯·汤普金斯,约翰·怀特,亚乌兹·布泽,坦乔科著,伊俊敏,袁海波等译.设施规划[M].北京:机械工业出版社,2008.
[3]Armbruster D.,Gel E.S.Bucket brigades revisited:Are they always effective?[J].European Journal of Operational Research.2006,172(1),213-229.
[4]Armstrong R.D.,Cook W.D.,Saipe A.L.Optimal batching in a semiautomated order picking system[J].Journal of Operational Research Society.1979,30(8),711-720.
[5]Ashayeri J.,Gelders L.F.Warehouse design optimization[J].European Journal of Operational Research.1985,21(3),285-294.
[6]Bai Y.,Keller T.Modal parameter identification for a GFRP pedestrian bridge[J].Composite Structures.2008,82(1),90-100.
[7]Barrett B.G.A further digression on the over-automated warehouse:some evidence[J].Interfaces.1977,8(1),46-49.
[8]Bartholdi J.J.,Bunimovich L.A.,Eisenstein D.D.Bucket brigades:A self-balancing order-picking system for a warehouse.1996.
[9]Barthoidi J.J.,Eisenstein D.D.A production line that balances itself[J].Operations Research.1996,44(1),21.
[10]Bartholdi J.J.,Eisenstein D.D.Using Bucket Brigades to Migrate from Craft Manufacturing to Assembly Lines[J].Manufacturing & Service Operations Management.2005,7(2),121-129.
[11]Bartholdi J.J.,Eisenstein D.D.,Foley R.D.Performance of bucket brigades when work is stochastic[J].Operations Research.2001,49(5),710-719.
[12]Bartholdi J.J.,Eisenstein D.D.,Lim Y.F.Bucket brigades on in-tree assembly networks[J].European Journal of Operational Research.2006,168(3),870-879.
[13]Bartholdi J.J.,Hackman S.T.Allocating space in a forward pick area of a distribution center for small parts[J],lie Transactions.2008,40(11),1046-1053.
[14]Bartholdi J.J.,Platzman L.K.Retrieval strategies for a carousel conveyor[J],lie Transactions.1986,18(2),166-173.
[15]Bengu G.An optimal storage assignment for automated rotating carousel[J].lie Transactions.1995,27(1),105-107.
[16]Boysen N.,Fliedner M.,Scholl A.Assembly line balancing." Which model to use when?[J]. International Journal of Production Economics.2008,111(2),509-528.
[17]Bozer Y.A.,Quiroz M.A.,Sharp G.P.An evaluation of alternative control strategies and design issues for automated order accumulation and sortation systems[J].Material Flow.1988,4 265-282.
[18]Bozer Y.A.,Sharp G.P.An empirical evaluation of general purpose automated order accumulation and sortation system used in batch picking[J].Material Flow.1985,2(2),111-131.
[19]Bozer Y.A.,White J.A.Travel-time models for automated storage/retrieval systems[J],lie Transactions.1984,16(4),329-338.
[20]Brynzer H.,Johansson M.I.Design and performance of kitting and order picking systems[J].International Journal of Production Economics.1995,41(1-3),115-125.
[21]Caron F.,Marchet G.,Perego A.Optimal layout in low-level picker-to-part systems[J].International Journal of Production Research.2000,38(1),101-117.
[22]Caron F.,Marchet,G.,Perego A.Routing policies and COI-based storage policies in picker-to-part systems[J].International Journal of Production Research.1998,36(3),713-732.
[23]Chang S.H.,Egbelu P.J.Relative pre-positioning of storage/retrieval machines in automated storage/retrieval systems to minimize expected system response time[J].Iie Transactions.1997a,29(4),313-322.
[24]Chang S.H.,Egbelu P.J.Relative pre-positioning of storage/retrieval machines in automated storage/retrieval systems to minimize maximum system response time[J].Iie Transactions.1997b,29(4),303-312.
[25]Chen M.C.,Wu H.P.An association-based clustering approach to order hatching considering customer demand patterns[J].Omega-International Journal of Management Science.2005,33(4),333-343.
[26]Chew E.P.,Tang L.C.Travel time analysis for general item location assignment in a rectangular warehouse[J].European Journal of Operational Research.1999,112(3),582-597.
[27]Choe K.,Sharp G.P.Small parts order picking:design and operation,vol.2009http://www2.isye.gatech.edu/logistiestutorial/order/article.htm(accessed(2009.1.30),1991.
[28]Choe K.I.,Sharp G.P.,Serfozo R.S.Aisle-based order pick systems with batching,zoning and sorting[J],in:Progress in Material Handling Research:1992,R.J.Graves et al.(eds.),Material Handling Institute,Charlotte.1993,245-276.
[29]Colorni A,Dorigo M,Maniezzo V.An investigation of some properties of an ant algorithm[A].Proc of the Parallel Problem Solving from Nature Conference(PPSN'92)[C].Belgium:Elsevier Publishing,1992.
[30]De Koster R.Performance approximation of pick-to-belt orderpicking systems[J].European Journal of Operational Research.1994,72(3),558-573.
[31]De Koster R.How to assess a warehouse operation in a single tour,Report,RSM Erasmus University,the Netherlands.2004.
[32]De Koster R.,Le-Duc T.,Roodbergen K.J.Design and control of warehouse order picking:A literature review[J].European Journal of Operational Research.2007,182 (2),481-501.
[33]De Koster R.,Roodbergen K.J.,van Voorden R.Reduction of walking time in the distribution center of De Bijenkorf[J].New Trends in Distribution Logistics.1999,480 215-234.
[34]De Koster R.,Van der Poort E.Routing orderpickers in a warehouse:a comparison between optimal and heuristic solutions[J].Iie Transactions.1998,30 (469-480).
[35]De Koster R.B.M.,Le-Duc T.,Yugang Y.Optimal storage rack design for a 3-dimensional compact AS/RS[J].International Journal of Production Research.2008,46 (6),1495-1514.
[36]Egbelu P.J.,Wu C.-T.A comparison of dwell point rules in an automated storage/retrieval system[J].International Journal of Production Research.1993,31 (11),2515-2530.
[37]Eisenstein D.D.Analysis and optimal design of discrete order picking technologies along a line[J].Naval Research Logistics.2008,55 (4),350-362.
[38]Elsayed E.A.Algorithms for optimal material handling in automatic warehousing systems[J].International Journal of Production Research.1981,19 (5),525-535.
[39]Elsayed E.A.,Lee M.K.Order processing in automated storage/retrieval systems with due dates [J].Iie Transactions.1996,28 (7),567-577.
[40]Elsayed E.A.,Lee M.K.,Kim S.,Scherer E.Sequencing and batching procedures for minimizing earliness and tardiness penalty of order retrievals[J].International Journal of Production Research.1993,31 (3),727-738.
[41]Elsayed E.A.,Stern R.G Computerized algorithms for order processing in automated warehousing systems[J].International Journal of Production Research.1983,21 (4),579-586.
[42]Elsayed E.A.,Unal O.I.Order batching algorithms and travel-time estimation for automated storage/retrieval systems[J].International Journal of Production Research.1989,27 (7),1097-1114.
[43]Eynan A.,Rosenblatt M.J.Establishing zones in single-command class-based rectangular AS/RS[J].Iie Transactions.1994,26 (1),38-46.
[44]Frazelle E.H.Material Handling Systems and Terminology[M].Lionheart Publishing,Inc,Atlanta,GA.,1992.
[45]Gademann A.J.R.M.N.,van den Berg J.P.,van der Hoff H.H.An order batching algorithm for wave picking in a parallel-aisle warehouse[J].Iie Transactions.2001,33 (5),385-398.
[46]Gademann N.,van de Velde S.Order batching to minimize total travel time in a parallel-aisle warehouse[J].Iie Transactions.2005,37 (1),63-75.
[47]Gibson D.R.,Sharp G P.Order batching procedures[J].European Journal of Operational Research. 1992,58(1),57-67.
[48]Goetschalckx M.,Ratliff H.D.An efficient algorithm to cluster order picking items in a wide aisle[J].Engineering Costs and Production Economics.1988a,13 (4),263-271.
[49]Goetschalckx M.,Ratliff H.D.Order picking in an aisle[J].Iie Transactions.1988b,20 (1),53-62.
[50]Gong Y.M.,De Koster R.A polling-based dynamic order picking system for online retailers[J].Iie Transactions.2008,40 (11),1070-1082.
[51]Graves S.C,Hausman W.H.,Schwarz L.B.Storage-retrieval interleaving in automatic warehousing systems[J].Management Science.1977,23 (9),935-945.
[52]Gu J.,Goetschalckx M.,McGinnis L.F.Research on warehouse operation:A comprehensive review[J].European Journal of Operational Research.2007,177 (1),1-21.
[53]Guenov M.,Raeside R.Zone shapes in class based storage and multicommand order picking when storage/retrieval machines are used[J].European Journal of Operational Research.1992,58 (1),37-47.
[54]Hackman S.T.,PIatzman L.K.Near-optimal solution of generalized resource allocation problems with large capacities[J].Operations Research.1990,38 (5),902-910.
[55]Hackman S.T.,Rosenblatt M.J.Allocating items to an automated storage and retrieval system[J].Iie Transactions.1990,22 (1),7-14.
[56]Hall R.W.Distance approximations for routing manual pickers in a warehouse[J].Iie Transactions.1993,25 (4),76-87.
[57]Han M.H.,McGinnis,White J.A.Analysis of rotary rack operation[J].Material Flow.1988,4 (1),283-293.
[58]Han M.H.,McGinnis L.F.,Shieh J.S.,White J.A.On sequencing retrievals in an automated storage/retrieval system[J].Iie Transactions.1987,19 (1),56-66.
[59]Hassini E.,Vickson R.G A two-carousel storage location problem[J].Computers & Operations Research.2003,30 (4),527-539.
[60]Hausman W H.,Schwarz L.B.,Graves S.C.Optimal storage assignment in automatic warehousing systems[J].Management Science.1976,22 (6),629-638.
[61]Heskett J.L.Cube-per-order index-a key to warehouse stock location[J].Transportation and Distribution Management.1963,3 27-31.
[62]Heskett J.L.Putting the cube-per-order index to work in warehouse layout[J].Transportation and Distribution Management.1964,4 (8),23-30.
[63]Ho Y C,Su T.S.,Shi Z.B.Order-batching methods for an order-picking warehouse with two cross aisles[J].Computers & Industrial Engineering.2008,55 (2),321-347.
[64]Ho Y.C,Wee H.M.,Chen H.C.A geometric design of zone-picking in a distribution warehouse[J].Computational Science and Its Applications-ICCSA 2007,Pt 3,Proceedings.2007,625-636.
[65]Hwang H.,Ha J.-W.Cycle time models for single/double carousel system[J].International Journal of Production Economics.1991,25 (1-3),129-140.
[66]Hwang H.,Kim C.S.,Ko K.H.Performance analysis of carousel systems with double shuttle[J].Computers & Industrial Engineering.1999,36 (2),473-485.
[67]Hwang H.,Lee M.K.Order batching algorithms for a man-on-board automated storage and retrieval system[J].Engineering Costs and Production Economics.1988,13 (4),285-294.
[68]Hwang H.,Lee Y.K.,Ko C.S.Routing policies in an order picking operation.Proceedings of the 16th International Conference on Production Research.2001.
[69]Hwang H.,Lim J.M.Deriving an optimal dwell point of the storage/retrieval machine in an automated storage/retrieval system[J].International Journal of Production Research.1993,31 (11),2591-2602.
[70]Hwang H.,Song J.Y.Sequencing picking operations and travel time models for man-on-board storage and retrieval warehousing system[J].International Journal of Production Economics.1993,29(1),75-88.
[71]Jacobs D.P.,Peck J.C.,Davis J.S.A fast algorithm for shelf optimization[J].Research Journal of Textile and Apparel.2000a,4 (2),47-51.
[72]Jacobs D.P.,Peck J.C.,Davis J.S.A simple heuristic for maximizing service of carousel storage[J].Computers and Operations Research.2000b,27 (13),1351-1356.
[73]Jane C.C.Storage location assignment in a distribution center[J].International Journal of Physical Distribution & Logistics Management.2000,30 (1-2),55-71.
[74]Jane C.C.,Laih Y.W.A clustering algorithm for item assignment in a synchronized zone order picking system[J].European Journal of Operational Research.2005,166 (2),489-496.
[75]Jarvis J.M.,McDowell E.D.Optimal product layout in an order picking warehouse[J].Iie Transactions.1991,23 (1),93-102.
[76]Jewkes E.,Lee C.Vickson R.Product location,allocation and server home base location for an order picking line with multiple servers[J].Computers & Operations Research.2004,31 (4),623-636.
[77]Jia-wei H.,Jian P.,Yi-wen Y.Mining Frequent Patterns Without Candidate Generation.In:Proceedings 2000 ACM SIGMOD International conference management of data.Dallas.TX,2000,1-12.
[78]Johnson M.E.The impact of sorting strategies on automated sortation system performance[J].Iie Transactions.1998,30 67-77.
[79]Jungwattanakit J.,Reodecha M.,Chaovalitwongse P.,Werner F.A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines,setup times,and dual criteria[J].Computers & Operations Research.2009,36 (2),358-378.
[80]Kim B.Maximizing service of carousel storage[J].Computers & Operations Research.2005,32 (4),767-772.
[81]Kim Y.K.,Hyun C.J.,Kim Y.Sequencing in mixed model assembly lines:A genetic algorithm approach[J].Computers & Operations Research.1996,23 (12),1131-1145.
[82]Koo R-H.The use of bucket brigades in zone order picking systems[J].OR Spectrum.2008.
[83]Larson T.N.,March H.,Kusiak A.A heuristic approach to warehouse layout with class-based storage[J].Iie Transactions.1997,29 (4),337-348.
[84]Le-Duc T.,De Koster R.An approximation for determining the optimal picking batch size for order picker in single aisle warehouses.In:Meller,M.,Ogle,M.K.,Brett,A.R,Taylor,GD.,Usher,J.(Eds.),Progress in Material Handling Research.Material Handling Institute,Charlotte,NC,2002,267-286.
[85]Le-Duc T.,De Koster R.B.M.Travel distance estimation and storage zone optimization in a 2-block class-based storage strategy warehouse[J].International Journal of Production Research.2005,43 (17),3561-3581.
[86]Lee H.F.,Schaefer S.K.Retrieval sequencing for unit-load automated storage and retrieval systems with multiple openings[J].International Journal of Production Research.1996,34 (10),2943-2962.
[87]Lee H.F.,Schaefer S.K.Sequencing methods for automated storage and retrieval systems with dedicated storage[J].Computers and Industrial Engineering.1997,32 (2),351-362.
[88]Lee M.K.A storage assignment policy in a man-on-board automated storage/retrieval system[J].International Journal of Production Research.1992,30 (10),2281-2292.
[89]Lee M.K.,Kim S.Y.Scheduling of storage/retrieval orders under a just-intime environment[J].International Journal of Production Research.1995,33 (12),3331-3348.
[90]Li C.-L.,Wan G Improved algorithm for maximizing service of carousel storage[J].Computers & Operations Research.2005,32 (8),2147-2150.
[91]Litvak N.,Adan I.The travel time in carousel systems under the nearest item heuristic[J].Journal of Applied Probability.2001,38 (1),45-54.
[92]Litvak N.,Adan I.J.B.F.,Wessels J.Order picking in carousel systems under the nearest item heuristic[J].Probability in the Engineering and Informational Sciences.2001,15 (2),135-164.
[93]Litvak N.,Zwet W.R.V.On the minimal travel time needed to collect n items on a circle[J].The Annals of Applied Probability.2004,14 (2),881-902.
[94]Liu P.,Lu X.On-line scheduling of parallel machines to minimize total completion times[J].Computers & Operations Research.2009,36 (9),2647-2652.
[95]Maher M.L.,Poon J.Modeling design exploration as co-evolution [J].Microcomputers in Civil Engineering.1996,11 (3),195-209.
[96]Malmborg C.J.,Bhaskaran K.A revised proof of optimality for the cube-perorder index rule for stored item location [J].Applied Mathematical Modelling.1990,14 (2),87-95.
[97]Malmborg C.J.,Krishnakumar B.Optimal storage assignment policies for multiaddress warehousing systems[J].IEEE Transactions on Systems,Man and Cybernetics.1989,19 (1),197-204.
[98]Matta M.E.A genetic algorithm for the proportionate multiprocessor open shop[J].Computers & Operations Research.2009,36 (9),2601-2618.
[99]Meller R.D.Optimal order-to-lane assignments in an order accumulation/sortation system,[J].Iie Transactions.1997,29 (4),293-301.
[100]Meller R.D.,Klote J.E.A throughput model for carousel/VLM pods[J].Iie Transactions.2004,36 (8),725-741.
[101]Muppani V.R.,Adil G K.A branch and bound algorithm for class based storage location assignment[J].European Journal of Operational Research.2008a,189 (2),492-507.
[102]Muppani V.R.,Adil G K.Efficient formation of storage classes for warehouse storage location assignment:A simulated annealing approach[J].Omega-International Journal of Management Science.2008b,36 (4),609-618.
[103]Onut S.,Tuzkaya U.R.,Dogac B.A particle swarm optimization algorithm for the multiple-level warehouse layout design problem[J].Computers & Industrial Engineering.2008,54 (4),783-799.
[104]Pan C.H.,Liu S.Y.A comparative study of order batching algorithms[J].Omega International Journal of Management Science.1995,23 (6),691-700.
[105]Pan J.C.H.,Shih P.H.Evaluation of the throughput of a multiple-picker order picking system with congestion consideration[J].Computers & Industrial Engineering.2008,55 (2),379-389.
[106]Paquete L.,Stutzleb T.Design and analysis of stochastic local search for the multiobjective traveling salesman problem[J].Computers & Operations Research.2009,36 (9),2619-2631.
[107]Parikh P.J.,Meller R.D.Selecting between batch and zone order picking strategies in a distribution center[J].Transportation Research Part E-Logistics and Transportation Review.2008,44(5),696-719.
[108]Park B.C,Park J.Y.,Foley R.D.Carousel System Performance[J].Journal of Applied Probability.2003,40 (3),602-612.
[109]Petersen C.G An evaluation of order picking routeing policies[J].International Journal of Operations & Production Management.1997,17(11),1098-1111.
[110]Petersen C.G An evaluation of order picking policies for mail order companies[J].Production and Operations Management.2000,9 (4),319-335.
[111]Petersen C.G Considerations in order picking zone configuration[J].International Journal of Operations & Production Management.2002,22 (7-8),793-805.
[112]Petersen C.G,Aase G R.,Heiser D.R.Improving order-picking performance through the implementation of class-based storage[J].International Journal of Physical Distribution & Logistics Management.2004,34 (7),534-544.
[113]Petersen C.G,Schmenner R.W.An evaluation of routing and volume-based storage policies in an order picking operation[J].Decision Sciences.1999,30 (2),481-501.
[114]Ponnambalam S.G,Aravindan P.,Naidu G A comparative evaluation of assembly line balancing heuristics[J].The International Journal of Advanced Manufacturing Technology.1999,(15),577-586.
[115]Ratliff H.D.,Rosenthal A.S.Orderpicking in a rectangular warehouse:a solvable case of the traveling salesman problem[J].Operations Research.1983,31 (3),507-521.
[116]Roberts D.L.,Isbell C.L.,Littman M.L.Optimization problems involving collections of dependent objects[J].Annals of Operations Research.2008,163 (1),255-270.
[117]Roll Y.,Rosenblatt M.J.Random versus grouped storage policies and their effect on warehouse capacity[J].Material Flow.1983,1 199-205.
[118]Roodbergen K.J.Layout and routing methods for warehouses[D].Erasmus University,Rotterdam,The Netherlands,2001.
[119]Roodbergen K.J.,De Koster R.Routing methods for warehouses with multiple cross aisles[J].International Journal of Production Research.2001a,39 (9),1865-1883.
[120]Roodbergen K.J.,de Koster R.Routing order pickers in a warehouse with a middle aisle[J].European Journal of Operational Research.2001b,133 (1),32-43.
[121]Roodbergen K.J.,P.S.G,Vis I.F.A.Designing the layout structure of manual order picking areas in warehouses[J].Iie Transactions.2008,40 (11),1032-1045.
[122]Roodbergen K.J.,Vis I.F.A.A survey of literature on automated storage and retrieval systems[J].European Journal of Operational Research.2009,194 (2),343-362.
[123]Rosenblatt M.J.,Eynan A.Deriving the optimal boundaries for class-based automatic storage/retrieval systems [J].Management Science.1989,35 (12),1519-1524.
[124]Rosenblatt M.J.,Roll Y.Warehouse design with storage policy considerations[J].International Journal of Production Research.1984,22 (5),809-821.
[125]Rosenblatt M.J.,Roll Y.Warehouse capacity in a stochastic environment[J].International Journal of Production Research.1988,26 (12),1847-1851.
[126]Rosenwein M.B.An application of cluster analysis to the problem of locating items within a warehouse[J].Iie Transactions.1994,26(1),101-103.
[127]Rosenwein M.B.A comparison of heuristics for the problem of batching orders for warehouse selection[J].International Journal of Production Research.1996,34 (3),657-664.
[128]Rouwenhorst B.,Reuter B.,Stockrahm V.,van Houtum G J.,Mantel R.J.,Zijm W.H.M.Warehouse design and control:Framework and literature review[J].European Journal of Operational Research.2000,122 (3),515-533.
[129]Ruben R.A.,Jacobs F.R.Batch construction heuristics and storage assignment strategies for walk/ride and pick systems[J].Management Science.1999,45 (4),575-596.
[130]Russell M.L.,Meller R.D.Cost and throughput modeling of manual and automated order fulfillment systems[J].Iie Transactions.2003,35 (7),589-603.
[131]Santos L.,Coutinho-Rodrigues J.,Current J.R.An improved heuristic for the capacitated arc routing problem[J].Computers & Operations Research.2009,36 (9),2632-2637.
[132]Stern H.L.Parts location andoptimal picking rules for a carousel conveyor automatic storage andretrieval system.Proceeding of the Seventh International Conference on Automation in Warehousing.1986,85-92.
[133]Su C.Performance evaluations of carousel operation[J].Production Planning and Control Engineering Practice.1998,9 (5),477-488.
[134]Tang L.C.,Chew E.K.Order picking systems:batching and storage assignment strategies[J].Computers & Industrial Engineering.1997,33 (3-4),817-820.
[135]Thonemann U.W.,Brandeau M.L.Note.Optimal storage assignment policies for automated storage and retrieval systems with stochastic demands[J].Management Science.1988,44 (1),142-148.
[136]Tompkins J.A.,Smith J.D.The Warehouse Management Handbook.[M].1998.
[137]Tompkins J.A.,White J.A.,Bozer Y.A.,Frazelle E.H.,Tanchoco J.M.A.Facilities Planning[M].NJ.:John Wiley&Sons,Hoboken,NJ,2003.
[138]Van den Berg J.P.Multiple order pick sequencing in a carousel system:a solvable case of the rural postman problem[J].Journal of the Operational Research Society.1996,47 (12),1504-1515.
[139]Van den Berg J.P.A literature survey on planning and control of warehousing systems[J].Iie Transactions.1999,31 (8),751-762.
[140]Van den Berg J.P.Analytic expressions for the optimal dwell point in an automated storage/retrieval system[J].International Journal of Production Economics.2002,76,13-25.
[141]Van den Berg J.P.,Sharp G P.,Gademann A.J.R.M.,Pochet Y.Forward-reserve allocation in a warehouse with unit-load replenishments[J].European Journal of Operational Research.1998,111 (1),98-113.
[142]Van den Berg J.P.,Zijm W.H.M.Models for warehouse management:classification and examples[J].International Journal of Production Economics.1999,5,519-528.
[143]Vaughan T.S.,Petersen C.G The effect of warehouse cross aisles on order picking efficiency[J].International Journal of Production Research.1999,37(4),881-897.
[144]Vickson R.G.,Fujimoto A.Optimal storage locations in a carousel storage and retrieval system[J].Location Science.1996,4(4),237-245.
[145]Vickson R.G.,Lu X.Optimal product and server locations in one-dimensional storage racks[J].European Journal of Operational Research.1998,105(1),18-28.
[146]W(?)scher G.Order picking:A survey of planning problems and methods.In:Supply Chain Management and Reverse Logistics.2004,323-347.
[147]Wan Y.W.,WolffR.W.Picking clumpy orders on a carousel[J].Probability in the Engineering and Informational Sciences.2004,18(1),1-11.
[148]Wang G.,Cheng T.C.E.Parallel machine scheduling with batch delivery costs[J].International Journal of Production Economics.2000,68(2),177-183.
[149]Wang G.,Cheng T.C.E.An Approximation Algorithm for Parallel Machine Scheduling with a Common Server[J].The Journal of the Operational Research Society.2001a,52(2),234-237.
[150]Wang G.,Cheng T.C.E.Heuristics for two-machine no-wait flowshop scheduling with an availability constraint[J].Information Processing Letters.2001b,80(6),305-309.
[151]Wang G.,Cheng T.C.E.Customer order scheduling to minimize total weighted completion time[J].Omega.2007,35(5),623-626.
[152]Wang G.Optimal Order Picking in a Double Carousel Storage System[J].working paper.2007.
[153]Wen U.-P.,Chang D.T.Picking rules for a carousel conveyor in an automated warehouse[J].Omega-lnternational Journal of Management Science.1988,16(2),145-151.
[154]Won J.,Olafsson S.Joint order batching and order picking in warehouse operations[J].International Journal of Production Research.2005,43(7),1427-1442.
[155]Yeh D.H.A note on "a simple heuristic for maximizing service of carousel storage"[J].Computers and Operations Research.2002,29(11),1605-1608.
[156]Yu M.,de Koster R.B.M.The impact of order hatching and picking area zoning on order picking system performance[J].European Journal of Operational Research.2008a,In Press,Corrected Proof.
[157]Yu M.F.,De Koster R.Performance approximation and design of pick-and-pass order picking systems[J].Iie Transactions.2008b,40(11),1054-1069.
[158]Yugang Y.,De Koster R.B.M.Optimal zone boundaries for two-class-based compact three-dimensional automated storage and retrieval systems[J].Iie Transactions.2009,41(3),194-208.
[159]文坚,马士华.基于时间延迟的订单分批策略研究[J].物流技术与应用.2005,(04),92-95.
[160]王宏.双区型仓库拣货路径优化方法研究[D].中南大学,2007.
[161]王雄志.配送中心配货作业计划方法研究[D].暨南大学,2007.
[162]王雄志,王国庆.配送中心定向补货作业问题[J].系统工程.2006,(01).
[163]王雄志,王国庆.配送中心补货作业问题的启发式算法[J].系统工程理论与实践.2008a,(04).
[164]王雄志,王国庆.旋转货架配货作业的改进临近域算法[J].工业工程与管理.2008b,(04).
[165]王雄志,周丽虹.配送中心补货作业问题的蚂蚁算法[J].暨南大学学报.2007,(03).
[166]王转,程国全.配送中心系统规划[M].北京:中国物资出版社,2003.
[167]王钊,林家恒,刘长有,李希霖.用改进的模拟退火算法实现对单伺服机分层水平旋转货架存取路径的优化[J].控制与决策.1996,11(suppl1).
[168]田炳丽,刘常波,解贵新.旋转货架拣选作业优化的交叉蚁群算法求解[J].现代电子技术.2008,(12).
[169]申培萍.全局优化方法[M].北京:科学出版社,2006.
[170]伍经纬,蔡临宁.订单分批算法的适用性研究[J].工业工程与管理.2007,(04).
[171]刑文训,谢金星.现代优化计算方法[M].北京:清华大学出版社,2005.
[172]朱玉全,杨鹤标,孙蕾.数据挖掘技术[M].东南大学出版社,2006.
[173]朱耀明.自动化立体仓库优化调度研究[D].山东大学,2006.
[174]李梅娟,陈雪波,张梅凤.基于群集智能算法的路径规划问题[J].清华大学学报(自然科学版).2007,(S2).
[175]李雄飞,李军.数据挖掘与知识发现[M].高等教育出版社,2003.
[176]李诗珍.配送中心订单分批拣货问题的数学模型及算法[J].铁道运输与经济.2007,(11).
[177]李诗珍.配送中心订单分批拣货模型及种籽启发式算法[J].起重运输机械.2009,(01).
[178]李诗珍,杜文宏.基于聚类分析的订单分批拣货模型及启发式算法[J].统计与决策.2008,(12).
[179]杜盛霖.基于货位优化的自动化立体仓库出入库系统设计[D].山东大学,2006.
[180]周明,孙树林.遗传算法原理及应用[M].北京:国防工业出版社,1999.
[181]林家恒,王钊,刘长有.旋转货架存取路径的一种优化方法[J].见:中国控制与决策学术年会论文集,沈阳:东北大学出版社.1995,412-415.
[182]林家恒,李国峰,李建勋.遗传算法在双拣选台旋转货架拣选路径优化中的应用[J].山东工业大学学报.1997,27(3).
[183]胡运权.运筹学教程[M].北京:清华大学出版社,2003.
[184]焦李成,刘静,钟伟才.协同进化计算与多智能体系统[M].北京:科学出版社,2006.
[185]董溪哲.仓储货位优化模型及算法研究[D].哈尔滨工业大学,2006.
[186]冯艳君,李梅娟,王罡.基于蚁群优化算法的旋转货架拣选路径规划[J].渤海大学学报(自然科学版).2007,(01).
[187]张攀,田国会,贾磊,李晓磊,路飞.旋转货架拣选作业优化问题的新型混合遗传算法求解[J].机械工程学报.2004,(06).
[188]谭俊华,李诗珍.订单分批问题的数学模型及节约启发式算法[J].起重运输机械.2008,(03).
[189]郑欢.自动化立体仓库路径优化问题研究[D].吉林大学,2006.
[190]阳明盛,罗长童.最优化原理、方法及求解软件[M].北京:科学出版社,2006.
[191]陈志平等.计算复杂性理论与NPC和NP难问题的求解[M].北京:科学出版社,2001.
[192]陈国良,王熙法,庄振全,王东生.遗传算法其应用[M].北京:人民邮电出版社,1996.
[193]马士华,文坚.基于时间延迟的订单分批策略研究[J].工业工程与管理.2004,(06).
[194]马婷.包装产品仓储货位的优化问题研究[D].2008.
[195]龚国清.基于分枝定界法的旋转货架存取路径优化[J].物流科技.2007,(12).