中文部分
1. 李勝隆,基因演算法於印刷電路板鑽孔排程之應用,元智大學工業工程與管理碩士論文,民國91年。2. 物流中心揀貨作業,經濟部商業自動化系列叢書,台北:經濟部商業司,民國84年。
3. 物流經營管理實務,經濟部商業司,民國85年。
4. 葉昭憲,「改善基因演算法之文獻回顧」,台灣水利,第44 卷,第一期,頁92-105,民國85年。
5. 董福慶、陳明德,物流中心揀貨作業,經濟部商業自動化系列叢書,民國84年。
6. 錢文俊,空服員之雇用及排班整合研究,輔仁大學管理學研究所碩士論文,民國92年。7. 官長輝,基因演算法於國道客運最適車數及排程之整合研究,輔仁大學管理學研究所碩士論文,民國92年。英文部分
1. Ackerman, K. B., Practical Handbook of Warehousing, Van Nostrand Reinhold , New York, NY, (1990).
2. Armstrong, R. D., W. D., Cook and A. L. Saipe, , "Optimal Batching in a semi-automated order picking system," Journal of the operational research society, Vol. 30, No. 8, pp. 711-720, (1979).
3. Chaime M.E., "Operations sequencing in automated warehousing systems", I.J.P.R., Vol. 30, No. 10, pp. 2401-2409, (1992).
4. Coyle, J.J., Bardi, The Management of Business Logistics, (1986).
5. Davis L., "Job-shop scheduling with genetic algorithms," Proceedings of the First International Conference on Genetic Algorithms and their Applications, Hillsdale: Lawrence Erlbaum. pp. 136-140, (1985).
6. Djerid L, M-C and Portmann, "How to keep good schemata using crossover operators for the permutation problems," International Transactions in Operations Research, Vol. 7, No. 6, pp.637-651, (2000).
7. Elsayed, E. A. and R. G. Stern, "Comtuterized algorithms for order processing in automated warehousing systems," International Journal of Production Research, Vol.21, No.4, pp.579 — 586, (1983).
8. Elsayed, E. A., "Algorithms for optimal material handling in automatic warehousing systems," International Journal of Production Research, Vol.19, No.5, pp.525-535, (1981).
9. Elsayed, E. A., and O. I. Unal, "Order batching algorithms and travel-time estimation for automated storage/retrieval systems," International Journal of Production Research, Vol. 27, No. 7, pp. 1097-1114, (1989).
10. Eshelman, L. J., Caruanu, R.A. and J.D. Schaffer, Biases in crossover landscape. In Proc. 3rd International Conference Genetic Algorithms, 10-19, (1989).
11. Fox BR, McMahon MB. In: Rawlins GJE, editor. Genetic operations for sequencing problems, foundations of genetic algorithms. San Mateo: Morgan Kaufmann Publishers; pp. 284-300, (1991).
12. Francis, R. L. and J. A. White, "Facility Layout and Location - An Analytical Approach", Prentice-Hall, Englewood Cliffs, NJ, (1974).
13. Frazelle, E.H. and J.M. Apple, Warehouse Operations in The Distribution Management Handbook, Tompkins, J.A. and Harmelink, D.A., McGraw-Hill, New York, NY, (1994).
14. Frazelle, E.H., and G.P. Sharp, "Correlated assignment strategy can improve order-picking operation," Industrial Engineering Vol. 21, No. 4, pp. 33-37, (1989).
15. Frazelle, E. H., S.T. Hackman, U. Passy, and L.K., Platzman, The forward-reserve problem, Optimization in Industry 2, Ciriani. T.A. and Leachman, R.C., John Wiley, pp.43-61. (1994).
16. Gibson, D. R., and G. P. Sharp, "Order batching procedures," European Journal of Operational Research, vol. 58, no. 1, pp. 57-67, (1992).
17. Goetschalckx, M. and H.D. Ratliff, "An efficient algorithm to cluster order picking items in a wide aisle," Engineering Costs and Production Economics, vol. 13, pp. 263-271, (1988)
18. Goldberg DE, GAs in search, Optimization and Machine learning. Reading, MA: Addison-Wesley, (1989).
19. Grefenstette, J., "Optimization of Control Parameters for Genetic Algorithms," IEEE Transactions on Systems, Man, and Cybernetics SMC vol. 16, no.1 , pp. 122-128. (1986).
20. Ishibuchi H., N. Yamamoto, T. Murata, and H, Tanaka, "Genetic Algorithms and Neighbourhood Search Algorithms for Fuzzy Flowshop Scheduling Problems", Fuzzy Sets and systems, vol. 67, no. 1, pp. 81-100, (1994).
21. Hackman, S.T. and M.J. Rosenblatt, "Allocating items to an automated storage and retrieval system, " IIE Transactions, vol.22 no.1, pp. 7-14, (1990).
22. Hall, R. W., "Distance approximations for routing manual pickers in a warehouse," IIE Transactions. vol. 25, no. 4, pp. 76-87, (1993).
23. Hausman, W. H., L. B. Schwarz, and S. C. Graves, "Optimal storage assignment in automatic warehousing systems," Management Science, vol. 22, no. 6, pp. 629-638, (1976).
24. Holland JH. Adaption in natural and artifcial systems. Ann Arbor: The University of Michigan Press, (1975).
25. Hwang, H., W. Bake, and M. K. Lee, "Clustering algorithms for order picking in an automated storage and retrieval systems," International Journal of Production Research, vol. 26, no. 2, pp. 189-201, (1988).
26. Jarvis Jay M. and Edward D. McDowell, "Optimal Product Layout in an Order Picking Warehouse," IIE Transactions, vol. 23, no. 1, pp. 93-102, (1991).
27. Jeroen P. van den Berg, J. P., "A literature survey on planning and control of warehousing systems," IIE Transactions, vol. 31, no. 8, pp. 751-762, (1999).
28. Jog P et al. The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem. Proceedings of the Third IGCA, San Mateo, pp. 110-115, (1989).
29. M. Srinivas and L. M. Patnaik, Genetic Algorithms: A Survey, IEEE Computer, June, (1994).
30. Mitchell, M., "An Introduction to Genetic Algorithms", Massachusetts Institute of Technology, pp. 170-171, (1996).
31. Petersen II, C.G. & R. W. Schmenner, "An evaluation of routing and volume-based storage policies in an order picking operation," Decision Sciences, vol. 30, no. 2, pp. 481-501, (1999).
32. Petersen II, C.G., "The impact of routing and storage policies on warehouse efficiency," International Journal of Operations & Production Management, vol. 19, no. 10, pp. 1053-1064, (1999).
33. Petersen II, C.G., "An evaluation of order picking policies for mail order companies," Production and Operations Management, Vol. 9, No. 4, pp. 319-335,(2000).
34. Petersen, C. G., "An evaluation of order picking routing policies", International Journal of Operations & Production Management, vol. 17, no. 11, pp.1098-1111, (1997).
35. Petersen, Chales, "An evaluation of order picking routing policies," International Journal of Operations & Production, Vol. 17, Iss. 11, pg.1098, (1997).
36. Portmann MC, Vignier A Performance study on crossover operators keeping goos schemata for some scheduling problems, preprint, (2002).
37. Rosenblatt, M. J., and A. Eynan, "Deriving the optimal boundaries for class-based automatic storage/retrieval systems", Management Science, vol. 35, no. 12, pp. 1519-1524 (1989).
38. Rosenwein, M. B., "A comparison of heuristics for the problem of batching orders for warehouse selection," International Journal of Production Research, vol. 34, no. 6, pp. 657-664, (1996).
39. Rosenwein, M.B., “An application of cluster analysis to the problem of locating items within a warehouse,” IIE Transactions, vol. 26, no. 1, pp. 101-103, (1994)
40. Srikanth K. Iyera, and Barkha Saxenab, “Improved genetic algorithm for the permutation flowshop scheduling problem,” Computers & Operations Research vol. 31 pp. 593-606, (2004).
41. Starkweather T et al. “A comparison of genetic sequencing operators,” Proceedings of Fourth IGCA, pp. 69-76, (1991).
42. Ulder NLJ. Genetic local search algorithms for the traveling salesman problem. In: Schwefel HP, Manner R, editors, (1990).
43. Van den Berg, J.P., G.P. Sharp Gademann, A.J.R.M. and Pochet Y., “Forward-reserve allocation in a warehouse with unit-load replenishments,” European Journal of Operational Research, vol. 111, no. 1, pp. 98-113, (1998).
44. Van Oudheusden, D.L. and Zhu, W., “Storage layout of AS/RS racks based on recurrent orders,” European Journal of Operational Research, vol. 58 no. 1, pp. 48-56, (1992).