[1]ROSS A, JAYARAMAN V. An evaluation of new heuristics for the location of cross-docks distribution centers in supply chain network design [J]. Computers & Industrial Engineering,2008,55(1):64-79.[2]van BELLE J, VALCKENAERS P, CATTRYSSE D. Cross-docking: State of the art[J]. Omega, 2012(40):827-846.[3]LI Y, LIM A. Cross docking-JIT scheduling with time windows [J]. Journal of the Operational Research Society, 2004,55(12):1342-1351.[4]ALPAN G, LADIER A, LARBI R, et al. Heuristic solutions for transshipment problems in a multiple door cross[J]. Computers & Industrial Engineering,2011,61(2):402-408.[5]LARBI R, ALPAN G, BAPTISTE P, et al. Scheduling cross docking operations under full, partial and no information[J]. Computers & Operational Research,2011,38(6):889-900.[6]BARTHOLDI J J, GUE K R. The best shape for a crossdock [J]. Transportation Science, 2004,38(2):235-244.[7]MIAO Z W, LIM A, MA H. Truck dock assignment problem with operational time constraint within crossdocks[J].Production, Manufacturing and Logistics, 2009(192): 105-115.[8]MUSA R, AMAOUT J, JUNG H. Ant colony optimization algorithm to solve for the transportation problem of cross-docking network [J]. Computers & Industrial Engineering, 2010,59(1):85-92.[9]但斌, 刘波. 物流配送中心直通配送运作时间优化研究[J]. 管理学报, 2010,7(2):233-237.[10]马东彦, 陈峰. 以总加权完工时间为目标的两台机越库排序的动态规划算法[J]. 上海交通大学学报, 2007,41(5):852-856.[11]CHEN F, LEE C Y. Minimizing the makespan in a two-machine cross-docking flow shop problem[J]. European Journal of Operational Research,2009,193(1):59-72.[12]俞亮, 陈峰. 最小化误工个数的越库调度模型与启发式算法[J]. 上海交通大学学报, 2009,43(12):1984-1988.[13]REYNOLDS R G. An introduction to cultural algorithms[C]// Proceedings of the 3rd Annual Conference Evolution Programming. Singapore:World Scientific Publishing,1994:131-136.[14]郭一楠, 王辉. 文化算法研究综述[J].计算机工程与应用, 2009,45(9):41-46.[15]张琦,曹江,冯柯,等. 基于两层决策和遗传算法的工程装备运用优化配置方法[J].解放军理工大学学报,2011,12(4):383-386. |