物流网络协同优化理论与方法研究
|
摘要
在经济社会发展中,降低物流成本成为企业降低生产经营成本,提高产品市场竞争力的重要途径。但是人们对物流的认识只是“冰山的一角”,还需对物流的内在规律进行深入的研究和探索。如何运用科学方法搭建合理的物流平台,合理组织物流配送,对于降低企业的经营成本、增加经济效益具有重要的实践和理论意义。
本文的主要工作和创新点如下:
第一,发展物流产业首先要搭建合理的物流平台,这就是物流中心和配送中心的选址问题。首先对物流网络中物流中心和配送中心进行了区分并分别给出了定义,然后就配送中心和物流中心的选址问题进行了研究。对于无竞争情况下配送中心的选址问题,本文构造了非线性规划数学模型,并采用协同差异演化方法进行了求解。对于有竞争情况下的配送中心选址问题,本文充分考虑了客户的选择行为,构造了已有多个(包括一个)配送中心存在条件下获取最大市场占有量的配送中心选址模型。
第二,对于物流中心的选址问题,首先确定了物流中心选址的评价指标体系。由于各专家自身知识背景不同,对评判方案了解程度不同,以及专家自身偏好等因素的干扰,必须确定专家的权重,然后通过群决策的方法对物流中心选址问题进行评价,并作出决策,为物流中心选址提出了新的思路。
第三,在单向物流配送车辆路径问题的基础上,提出了双向物流配送路径问题。分别构造了硬时间窗和软时间窗的双向物流配送车辆路径问题的数学模型,并采用合作式协同差异演化算法进行了求解。
第四,对供应商管理库存情况下的车辆路径问题进行了分析,经分析得知供应商管理库存能进一步降低物流的配送费用。
第五,在对车辆配载作业本身特点分析的基础上,建立了车辆配送装车问题的多目标函数,采用协同演化算法进行求解,通过算例比较说明了本文模型与方法的有效性。
With the development of economics and society, reduction of logistics cost become an important approach to reduce cost of production and management, and raise market competition power. However, knowledge to logistics exists in elementary phase. So, it is necessary to research and explore immanent disciplinarian of logistics. How to exercise scientific plan to construct reasonable flat roof of logistics and organize logistics distribution in reason possesses important significance in practice and theory to reduce cost of production and management and raise market
competition power. The textual main work and innovation points include:
Firstly, rational logistics flat roof must be put up in the first place in order to expand logistics industry, namely, it is logistics and distribution centers location elected. Logistics centers and distribution centers are distinguished and defined separately. Then, the problem of logistics and distribution centers location elected is researched partly. For the problem of non-competition distribution centers location elected, non-linear programming mathematics model is structured, and resolved by cooperative co-evolutionary differential evolution. For the problem of competitive distribution centers location elected, selective actions of clients are taken into account sufficiently. With multi- distribution centers existed, the location model of distribution center location selected is constructed based on most market occupancy.
Secondly, for the problem of logistics center evaluation target system is ascertained for one thing. Weights of experts need to be confirmed because of experts’various knowledge background, acquaintance with projects and selves prejudice. Then, logistics centers locations selected are appraised and decided by group decision-making. A new way is brought forward for logistics centers location selected.
Thirdly, double logistics vehicle routing problem is brought forward based on unilateralism logistics vehicle routing problem. Then, the mathematics models of double logistics vehicle routing problem of hard time windows and soft time windows are structured and resolved based on cooperative differential evolution.
Fourthly, vehicle routing problem of Vendor Managed Inventory is analyzed. Distribution cost can be more reduced by Vendor Managed Inventory.
Fifthly, Multi-objective function of vehicle deliver loading is structured based on the characters of vehicle assembly and solved by cooperative differential evolution .At last, result shows validity of textual method.
本文的主要工作和创新点如下:
第一,发展物流产业首先要搭建合理的物流平台,这就是物流中心和配送中心的选址问题。首先对物流网络中物流中心和配送中心进行了区分并分别给出了定义,然后就配送中心和物流中心的选址问题进行了研究。对于无竞争情况下配送中心的选址问题,本文构造了非线性规划数学模型,并采用协同差异演化方法进行了求解。对于有竞争情况下的配送中心选址问题,本文充分考虑了客户的选择行为,构造了已有多个(包括一个)配送中心存在条件下获取最大市场占有量的配送中心选址模型。
第二,对于物流中心的选址问题,首先确定了物流中心选址的评价指标体系。由于各专家自身知识背景不同,对评判方案了解程度不同,以及专家自身偏好等因素的干扰,必须确定专家的权重,然后通过群决策的方法对物流中心选址问题进行评价,并作出决策,为物流中心选址提出了新的思路。
第三,在单向物流配送车辆路径问题的基础上,提出了双向物流配送路径问题。分别构造了硬时间窗和软时间窗的双向物流配送车辆路径问题的数学模型,并采用合作式协同差异演化算法进行了求解。
第四,对供应商管理库存情况下的车辆路径问题进行了分析,经分析得知供应商管理库存能进一步降低物流的配送费用。
第五,在对车辆配载作业本身特点分析的基础上,建立了车辆配送装车问题的多目标函数,采用协同演化算法进行求解,通过算例比较说明了本文模型与方法的有效性。
With the development of economics and society, reduction of logistics cost become an important approach to reduce cost of production and management, and raise market competition power. However, knowledge to logistics exists in elementary phase. So, it is necessary to research and explore immanent disciplinarian of logistics. How to exercise scientific plan to construct reasonable flat roof of logistics and organize logistics distribution in reason possesses important significance in practice and theory to reduce cost of production and management and raise market
competition power. The textual main work and innovation points include:
Firstly, rational logistics flat roof must be put up in the first place in order to expand logistics industry, namely, it is logistics and distribution centers location elected. Logistics centers and distribution centers are distinguished and defined separately. Then, the problem of logistics and distribution centers location elected is researched partly. For the problem of non-competition distribution centers location elected, non-linear programming mathematics model is structured, and resolved by cooperative co-evolutionary differential evolution. For the problem of competitive distribution centers location elected, selective actions of clients are taken into account sufficiently. With multi- distribution centers existed, the location model of distribution center location selected is constructed based on most market occupancy.
Secondly, for the problem of logistics center evaluation target system is ascertained for one thing. Weights of experts need to be confirmed because of experts’various knowledge background, acquaintance with projects and selves prejudice. Then, logistics centers locations selected are appraised and decided by group decision-making. A new way is brought forward for logistics centers location selected.
Thirdly, double logistics vehicle routing problem is brought forward based on unilateralism logistics vehicle routing problem. Then, the mathematics models of double logistics vehicle routing problem of hard time windows and soft time windows are structured and resolved based on cooperative differential evolution.
Fourthly, vehicle routing problem of Vendor Managed Inventory is analyzed. Distribution cost can be more reduced by Vendor Managed Inventory.
Fifthly, Multi-objective function of vehicle deliver loading is structured based on the characters of vehicle assembly and solved by cooperative differential evolution .At last, result shows validity of textual method.
引文
[1] 张钦岳.开发第三利润源的物流管理整合[J].山东化工,2002,31(2):32~33
[2] 曾剑,王景锋,邹敏.物流管理基础[M].北京:机械工业出版社,2004
[3] 孔健.企业的第三利润源泉——走进现代物流管理领域[J].华东经济管理,2001, 15(2):46~47
[4] 杨青,张迁.物流成本:企业第三利润源泉[J]. 财会通讯(理财版),2006,(1):62
[5] 阎子刚,赵继新.供应链管理[M].北京:机械工业出版社.2004
[6] 孟庆红.区域经济学概论[M].北京:经济科学出版社,2003
[7] 李玉民.现代企业物流中心选址决策研究[D].浙江大学硕士学位论文. 2003, 12
[8] 杨华,符卓.基于 GIS 的配送车辆调度系统的设计与实现[J]. 物流科技,2006,29(125):20~23
[9] H. W. Hamacher, S. Nickel. Multicriteria planar location problems[J]. European Journal of operational Research,1996,94(1):66~86
[10] 鲁晓春,詹菏生.关于配送中心重心法选址的研究[J].北方交通大学学报,2000,24(6):108~110
[11] 周梅华.论集约化商品配送中心的选址[J].中国矿业大学学报,2000,29(6):647~650
[12] 王战权,杨东援,汪超.配送中心选址的遗传算法研究[J].物流技术,2001,(3):11~14
[13] 姜大立,杜文. 易腐物品物流配送中心选址的遗传算法[J].西南交通大学学报,1998,33(4):425~429
[14] 戴更新,于龙振,陈常菊.基于混合遗传算法的多配送中心选址问题研究[J].物流技术,2006,(6):38~42
[15] 刘海燕,李宗平,叶怀珍.物流配送中心选址模型[J].西南交通大学学报(自然科学版),2000,35(3):311~314
[16] 袁庆达,陈旭梅,黎青松.基于“服务型”物流战略的 P-Center 选址问题研究[J].西南交通大学学报(自然科学版),2001,36(3):250~253
[17] 孟大伟,吴慧德,王向安.多目标多配送中心选址问题[J].物流技术,2002,(2):28~32
[18] 黄敏,赵一平,程长兵. 深圳引入国际理念 描绘区域性现代物流中心城市蓝图——高起点、高标准做好深圳市“十五”及 2015 年现代物流业发展规划[J].综合运输,2000,(11):26~29
[19] 戴禾,刘兴景,扬东援.物流园区选址问题研究[J].综合运输,2001,(2):30~33
[20] 王战权,杨东援.现代物流业发展系统规划研究[J].西安公路交通大学学报,2001,21(3):61~65
[21] 徐天亮,刘小群.多品种货物配装的优化方法[J].华中科技大学学报(自然科学版),2003,31(9):15~17
[22] 贺国先,刘凯.优化物流中心配送方案的遗传算法[J].系统工程理论与实践. 2003,4:76~81
[23] 贺国先,刘凯.模拟退火算法在铁路货运站危险货物配装中的应用[J].铁道学报,2003,25(1):9~14
[24] 雷定猷,陈德良.平衡装载问题的优化模型和算法[J].系统工程学报,2004, 19 (3):251~157
[25] 卜雷,尹传忠,蒲云. 普零货物多车配装优化问题的遗传算法[J].科技通报,2004,20(6):497~500
[26] 王景恒. 物流中心货物最优配装问题的动态规划解法[J]. 长春理工大学学报,2004,27(1):9~11
[27] 卜雷,刘海旭,蒲云等. 遗传算法确定零担货物的选择装箱方式[J].交通运输工程学报,2002,2(3):93~96
[28] 刘小群,马士华,徐天亮.装载能力有限下多品种货物配装的容重比平衡法[J].工业工程与管理,2004(3):62~66
[29] Dantizig G., Rmser J.. The Truck Dispatching Problem [J]. Management Science, 1959,(6): 80~91
[30] Roberto Baldacci, Lawrence Bodin, Aristide Mingozzi. The multiple disposal facilities and multiple inventory locations rollon–rolloff vehicle routing problem [J].Computers&Operations Research,2006,33(9):26672702
[31] G. Laporte, Y. Nobert, S. Taillefer. A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem [J]. Mathematical Modelling,1987,9(12):857~868.
[32] Patrice Perny, Olivier Spanjaard. A preference-based approach to spanning trees and shortest paths problems [J]. European Journal of OperationalResearch,2005,162(3): 584~601
[33] Fisher M.L. Optimal Solution of Vehicle Routing Problems Using Minimum K-trees[J].Operation Research,1994,42(4):626~642.
[34] EilonS.,Watson D.,Cluistorfides N, Distribution Management:Mathematical Modeling and Practice Analysis[M].London:Grifin,1971.
[35] Balinske M., Quandt R. On an Integer Program for a Delivery Problem[J].Operation Research,1962,(12):300~304.
[36] Mark Vroblefski, R. Ramesh, Stanley Zionts. Efficient lot-sizing under a differential transportation cost structure for serially distributed warehouses[J]. European Journal of Operational Research, 2000,127(3):574~593
[37] Akio Imai, Etsuko Nishimura and John Current .A Lagrangian relaxation-based heuristic for the vehicle routing with full container load[J].European Journal of Operational Research, 2006,176(1): 87~105
[38] Laporte G., Nobert Y.,Desrocher M. Optimal Routing Under Capacity and Distance Restriction[J].Operations Research,1985,33:1050-1073
[39]Clark G.,Wright J.W.. Scheduling of Vehicles form a Central Depot to a Number of Delivery Points[J]. Operations Research,1964,(12):568~581
[40] Marc Reimann, Karl Doerner, Richard F. Hartl. D-Ants: Savings Based Ants divide and conquer the vehicle routing problem[J].Computers & Operations Research, 2004, 31(4):563~591
[41] Manfred Gronalt, Richard F. Hartl, Marc Reimann.New savings based algorithms for time constrained pickup and delivery of full truckloads[J]. European Journal of Operational Research, 2003,151(3): 520~535
[42] Mondher Hachicha, M. John Hodgson, Gilbert Laporte et.al. Heuristics for the multi-vehicle covering tour problem[J]. Computers & Operations Research, 2000,27(1): 29~42
[43] Billy E Gillett,Jerry G Johnson. Multi-terminal vehicle-dispatch algorithm[J].Omega, 1976, 4(6): 711~718
[44] J. E. Beasley, N. Christofides.Vehicle routing with a sparse feasibility graph[J]. European Journal of Operational Research, 1997, 98(3):499~511
[45] K.Ganesh, T.T. Narendran. CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up[J].European Journal of Operational Research,2006, 178(3): 699717
[46] Jacques Renaud, Gilbert Laporte, Fayez F. Boctor. A tabu search heuristic for the multi-depot vehicle routing problem [J]. Computers & Operations Research, 1996, 23 (3):229~235
[47] Philippe Lacomme, Christian Prins, Wahiba Ramdane-Chérif. Evolutionary algorithms for periodic arc routing problems [J]. European Journal of Operational Research, 2005,165(2):535~553
[48] Philippe BadeauFran?ois Guertin, Michel Gendreau, Jean-Yves PotvinEric Taillard. A parallel tabu search heuristic for the vehicle routing problem with time windows [J]. Transportation Research Part C: Emerging Technologies,1997,5(2):109~122
[49] Michel Gendreau.A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers [J]. Operation Research,1996,44 (3):469~477
[50] Michel Gendreau, Gilbert Laporte, Christophe Musaraganyi and éric D. Taillard.A tabu search heuristic for the heterogeneous fleet vehicle routing problem [J]. Computers & Operations Research,1999,26(12):1153~1173
[51] Stephan Scheuerer. A tabu search heuristic for the truck and trailer routing problem [J]. Computers & Operations Research, 2006,33(4):894~909
[52] Soumia Ichoua, Michel Gendreau, Jean-Yves Potvin. Vehicle dispatching with time- dependent travel times[J].European Journal of Operational Research, 2003, 144(2):379~396
[53] Barbarosoglu Gulay, Demet Ozgun. Tabu Search Algorithm for the Vehicle Routing Problem [J].Computers & Operations Research,1999,26(3):255~270.
[54] Gilbert Laporte, Michel Gendreau, Jean-Yves Potvin, Frédéric Semet. Classical and modern heuristics for the vehicle routing problem[J].International Transactions in Operational Research, 2000, 7(4):285~300
[55] Stephan Scheuerer. A tabu search heuristic for the truck and trailer routing problem[J].Computers & Operations Research, 2006,33(4):894~909
[56] Laporte G.,Osman I.H.. Metaheuristics in Combinatorial Optimization: a Bibliography [J].Ann. Operations Research,1996,63(2):513~628.
[57] Alex Van Breedam. Improvement heuristics for the Vehicle Routing Problem based on simulated annealing[J].European Journal of Operational Research, 1995, 86 (3):480~490
[58] Barrie M. Baker, M. A. Ayechew. A genetic algorithm for the vehicle routing problem [J].Computers & Operations Research,2003, 30(5): 787~800
[59] S.A. Torabi, S.M.T. Fatemi Ghomi, B. Karimi. A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains [J].European Journal of Operational Research, 2006,173(1): 173~189
[60] Gen M.,Cheng R..Genetic Algorithms & Engineering Design[A].Wiley, New York,1997
[61] Jean Berger, Mohamed Barkaoui. A parallel hybrid genetic algorithm for the vehicle routing problem with time windows[J]. Computers & Operations Research, 2004, 31(12): 2037~2053
[62] Charles J. Malmborg. A genetic algorithm for service level based vehicle scheduling [J]. European Journal of Operational Research,1996, 93(1): 121~134
[63] Chen Xiong, Wan Weishui, Xu Xinhe. Modeling rolling batch planning as vehicle routing problem with time windows[J]. Computers & Operations Research, 1998, 25(12):1127~1136
[64] 李大卫,王莉,王梦光.一个求带有时间窗口约束的车辆路径问题的启发式算法[J].系统工程,1998,16(4):20~24
[65] 张震.城市货运汽车营运组织最理论与方法[J].管理工程学报,1995,9 (3):143~152
[66] 郎茂祥.基于遗传算法的物流配送路径优化问题研究[J]中国公路学报,2002,15(3):76~79
[67] 郎茂祥. 用单亲遗传算法求解配送车辆调度问题的研究[J]. 交通与计算机,2006,24(1):119~122
[68] 郎茂祥.物流配送车辆调度问题的模型与算法研究[D].北方交通大学博士学位论文.2002,2.
[69] 刘浩,袁健,卢厚清.两种类型车辆随机需求路由问题[J].南京航空航天大学学报,2001,33(2):155~158
[70] 刘诚,陈治亚,封全喜. 带软时间窗物流配送车辆路径问题的并行遗传算法[J].系统工程,2005,23(10):7~11
[71] 吕树红,姚丹霖,何文强.车辆路径问题的一种遗传算法求解方法[J].计算机应用,2005,25(12):314~316
[72] 周双贵.基于 MATLAB 的车辆路径系统研究[C].北方交通大学博士后科研工作报告,2001
[73] 张涛,张玥杰,王梦光.不确定车辆数的车辆路径问题模型和混合算法[J]. 系统工程理论方法应用,2002,11(2):121~125
[74] 袁健,刘晋.随机需求情形 VRP 的 Hopfield 神经网络解法[J].南京航空航天大学学报,2000,32(5):579~585
[75] 李军,郭耀煌.物流配送车辆优化调度理论与方法[M].中国物资出版社,北京:2001,11
[76] R. Storn, K. Price. DE ——A simple and efficient heuristic for global optimization over continuous space. Journal of Global Optimization,1997, 11(4):341~359.
[77] 杨坤德,马远良.用差异进化算法进行海洋环境参数反演[J].西北工业大学学报,2003,21(3):45~51
[78] Babu B V, Munawar S A. Differential Evolution for the Optimal Design of Heat Exchangers. Proceedings of All India Seminar on Chemical Engineering Progress on Resource Development: A Vision 2010 and Beyond, 2000
[79] Vasan A, Srinivasa Raju K. Optimal Reservoir Operation Using Differential Evolution. Exchangers,Proceedings of All India Seminar on Chemical Engineering Progress on Resource Development: A Vision 2010 and Beyond, 2000.
[80] Shiakolas P S, Koladiya D, Kebrle J. On the optimum synthesis of six-bar linkages using differential evolution and the geometric centroid of precision positions technique. Mechanism and Machine Theory, in Press, 2004.
[81] Rogalsky T, Derksen R W, Kocabiyik S. Differential Evolution in Aerodynamic Optimization [J]. Canadian Aeronautics and Space Journal, 2000, 46(3):183~190
[82] Lopez Cruz I. L, Van Willigenburg L.G. Van Straten G. Efficient Differential Evolution algorithms for multimodal optimal control problems.Aplied Soft Computing[J], 2003, 12(2):397~422
[83] Bohuslav Ruzek, Michal Kvasnicka. Differential Evolution Alogrithm in the Earthquake Hypocenter Location. Pure and Applied Geophysics[J], 2001, 158 (5):667~ 693
[84] Hui-Yuan Fan, Jouni Lampinen. A Trigonometric Mutation Operation to Differential Evolution [J]. Journal of Global Optimization, 2003, 27(2):105~129
[85] Ji-Pyng Chiou, Chung-Fu Chang and Ching-Tzong Su. Capacitor placement in large-scale distribution systems using variable scaling hybrid differential evolution [J]. International Journal of Electrical Power & Energy Systems, 2006, 28(10): 739~745
[86] Zhang W J, Xie X F. DEPSO:hybrid particle swarm with differential evolutionoperator. IEEE International Conference on System, Man & Cybernetics (SMCC) [C]: Washington D C, USA, 2003, 3816~3821
[87] Thomsen R. Multimodal Optimization Using Crowding-Based Differential Evolution Proceedings of the 2004 Congress on Evolutionary Computation, 2004, 2:1382~1389
[88] 任春玉,王晓博,李子群.基于供应链下物 流 配 送 网 络 规 划 研 究[J].物流科技,28(5):54~57
[89] Hokey Mina, Vaidyanathan Jayaraman, Rajesh Srivastava. Combined location-routing problems: a synthesis and future research directions[J]. European Journal of Operational Research, 1998,108(1):1~15
[90] Dilek Tuzun, Laura I. Burke.:A two-phase tabu search approach to the location routing Problem[J]. European Journal of Operational Research,1999 116(1): 87~99
[91] Maria Albareda-Sambola, Juan A. Díaz, Elena Fernández. A compact model and tight bounds for a combined location-routing problem[J].Computers & Operations Research, 2005,32(3):407~428
[92] 汪寿阳,赵秋红,夏国平.集成物流管理系统中定位——运输路线安排问题的研究[J].管理科学学报,2000,3(2):69~75
[93] Susan Hesse Owen, Mark S. Daskin. Strategic facility location: a review[J]. European Journal of Operational Research. 1998,111(3):423447
[94] Refael Hassin,Shlomi Rubinstein. On the complexity of the k-customer vehicle routing problem [J]. Operations Research Letters, 2005,33(1):71~76
[95] 元霞.物流配送中车辆路径优化问题的研究[D].东南大学博士学位论文,2004
[96] 姜大立,杜文,张拥军.易腐物品物流配送中心选址的遗传算法[J].西南交通大学学报(自然科学版),1998,33(4):425~429
[97] 陆琳琳,张仁颐.物流中心选址的一种综合方法.工业工程与管理.2003,(6):59~61
[98] 李云清.物流系统规划[M].上海:同济大学出版社,2004
[99] Barrie M. Baker, Janice Sheasby. Extensions to the generalised assignment heuristic for vehicle routing[J].European Journal of Operational Research, 1999,119(1):147~157
[100] Jean-Yves Potvin, Jean-Marc Rousseau. A parallel route building algorithm for the vehicle routing and scheduling problem with time windows[J].European Journal of Operational Research, 1993,66(3):331~340
[101] Dimitris Bertsimas, Dessislava Pachamanova, Melvyn Sim. Robust linear optimization under general norms[J].Operations Research Letters,2004,32(6):510~516
[102] G.B. Alvarenga, G.R. Mateus, G.de Tomi. A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows[J].Computers & Operations Research, 2006,34(6):1561~1584
[103] 刘朝晖,范荣华,万毅.物资管理系统工程[M],北京:中国物资出版社,1997
[104] 中国科学院数学研究所运筹室,北京市运输公司.线形规划在汽车运输中的应用[M].北京:人民交通出版社,1962
[105] 林治勋.动态规划与序贯最优化[M].开封:河南大学出版社,1997
[106] 刘明广.差异演化算法及其改进[J].系统工程,2005,23(2):108~111
[107] 陈世展,任长明,吴启权. 基于竞争方程的竞争型协同进化算法及应用[J].微处理机,2005(1):33~36
[108] DE Homepage. Http://www.icsi.Berkeley. edu/storn/code.htm.
[109] M.M. Ali, A. torn. Population Set-based Global Optimization Algorithms: Some Modifications and Numerical Studies[J]. Computer &operations research, 2004,31:1703-1725
[110] R Storn. System Design by Constraint Adaptation and Differential Evolution[J]. IEEE Transactions on Evolutionary Computation, 1999, 3(1):22~34.
[111] R. Storn, K. Price. DE - A simple and efficient heuristic for global optimization over continuous space [J]. Journal of Global Optimization, 1997, 11(4):341~359.
[112] 蓝盛芳.试论达尔文进化论与协同进化论[J].生态科学,1995,(2):167~170
[113] 孙关龙.达尔文进化论的局限性[J].科技潮,2002(11):20~21
[114] 刘静.协同进化算法及其应用研究[D].西安电子科技大学博士论文.2004,9
[115] Ehrlich P R, Raven P H. Butterflies and plants: a study in co-evolution[J]. Evolution,1965, 18(4): 586~608
[116] Jazen D. H. When is it coevolution. Evolution[J]. 1980, 34(4): 611-612.
[117] Allaby M. The Oxford Dictionary of Natural History, Oxford, England. Oxford University Press, 1985
[118] 张树义.协同进化(一)——相互作用与进化理论[J].生物学通报, 1996, 31(11): 35~36
[119] 张树义.协同进化(三)——竞争、捕食、拟态[J].生物学通报,1997,32(1): 19~21
[120] Yeo Keun Kim, Jae Yun Kim, Yeongho Kim. An endosymbiotic evolutionary algorithm for the integration of balancing and sequencing in mixed~model U-lines[J].European Journal of Operational Research, 2006,168(3): 838~852
[121] Mitchell A. Potter, Kenneth A, De Jong. A cooperative coevolutionary approach to function optimization[J]. The Third Parallel Problem Solving From Nature, 1994,(5):249~257
[122] Frans van den Bergh, Andries P. Engelbrecht. A Cooperative Approach to Particle Swarm Optimization[J]. IEEE Transactions On Evolutionaiy Computation, 2004, 8(3):225~239
[123] Thomas Jansen, R. Paul Wiegand. The Cooperative Coevolutionary (1+1) EA[J]. Evolutionary Computation, 2004, 12(4):405~434
[124] 钟求喜,陈火旺.基于共同进化计算模型的基因连锁问题求解[J].软件学报,2002,13(4):561~566
[125] 钟求喜,胡华平,祈悦.基于共进化的多任务分配与调度[J].国防科学技术大学学报,2002,24(4):69~72
[126]荔建琦,陈火旺,王兵山.一种异构合作共进化算法[J].计算机科学,2000,27(11):6~10
[127] 陈浩勇,王锡凡,别朝红.协同进化算法及其在电力系统中的应用前景[J].电力系统自动化,2003,27(23):94~100
[128] Kenneth Price, Rainer Storn and Jouni Lampinen. Differential Evolution A Practical Approach to Global Optimization[M]. Springer Berlin Heidelberg, 2005
[129] 钟求喜.网络计算中任务分配与调度的遗传算法研究[D]. 国防科学技术大学博士学位论文,2000
[130] Yeo Keun Kim, Kitae Park and Jesuk Ko. A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling [J].Computers & Operations Research, 30, 2003(8):1151~1171
[131] Moeko Nerome, Koji Yamada, Satoshi Endo and Hayao Miyaji. Simulated Evolution and Learning[M]. Springer Berlin/Heidelberg,1997
[132] Xiping Sun and Yongji Wan. Robust output-feedback stabilization of a class of nonlinear systems with the nonlinearities of varied form[J]. Journal of Systems Engineering and Electronics, 2006,17(3):629~634
[133] 邱世明.复杂适应系统协同理论、方法与应用研究[D].天津大学博士学位论文,2002,12
[134] Assaf Zaritsky, Moshe Sipper. Coevolving solutions to the shortest common superstring problem[J]. 2004,76(1):209~216
[135] Wiegand RP, Liles WC, De Jong KA. An empirical analysis of collaboration methods in cooperative coevolutionary algorithms. In Proceedings of Genetic and Evolutionary Computation Conference, 2001
[136] Wiegand RP. An analysis of cooperative coevolutionary algorithms[D]. George Mason University PhD dissertation, 2003
[137] Potter MA. The design and analysis of a computational model of cooperative coevolution[D]. George Mason University PhD dissertation,1997
[138] 史彦军.复杂布局的协同差异演化方法与应用研究[D].大连理工大学博士学位论文.2005,6
[139] 李旭宏,胡文友.区域物流中心规划方法[J].交通运输工程学报,2002,2(1):85~87
[140] Clarke, G. & Wright, J. W.. Scheduling of vehicles from a central depot to a number of delivery points[J]. Operations Research 12(2): 568~581
[141] Xiao H Y. Model of location in many suppliers[J]. Operations Research and Management Science, 2000,9(1):7~10
[142] Holmberg K. Exact solution methods for uncapacitate location problem with convex transportation costs[J].European Journal of Operational Oesearch, 1999. 114(2):127~ 140
[143] Francisco B, David J. Plant location with minimum inventory[J]. Mathematical Programming, 1998, 83(1):101~111
[144] Owen S H, Daskin M S. Strategic facility location: areview[J]. European Journal of Operational Research, 1998,111(4):423~447
[145] Xiao H Y. Model of location in many suppliers[J]. Operations Research and Management Science, 2000, 9 (1):7~10
[146] 孙会君,高自友.一类有竞争的物流配送中心选址模型[J]交通运输工程学报,2002,2(4):54~57
[147] [美]Ronald H. Ballou. 企业物流管理——供应链的规划、组织和控制[M]北京:机械工业出版社,2002
[148] 李玉民.现代企业物流中心选址决策研究[D].浙江大学硕士学位论文,2003,12
[149] 吴云燕,华中生,查勇. AHP 中群决策权重的确定与判断矩阵的合并[J].运筹 与管理,2003,12(4):16~21
[150] 孟波.有限方案模糊多目标群决策方法的研究[J].系统工程,1995,13(4): 43~46
[151] 孟波,付微.一种有限方案多目标群决策方法[J].系统工程,1998,16(4):57~61
[152] 胡毓达,田川.求解群体多指标决策问题的偏爱度法[J].系统工程理论与实践,1996(3):52~56
[153] 宋光兴,邹平.多属性群决策中决策者权重的确定方法[J].系统工程. 2001,19 (4):84~89
[154] 郭文明,相景丽,肖楷生.群组 AHP 权重系数的确定[J].华北工学院学报, 2000 ,21(2):110~113
[155] 华中生,吴云燕,徐晓燕.一种 AHP 判断矩阵一致性调整的新方法[J].系统工程与电子技术,2003,25(1):38~40
[156] 荆海霞.物流配送中双向运输车辆路径优化问题研究[D].武汉大学硕士学位论文,2004,5
[157] 郭耀煌,李军.车辆优化调度问题的研究现状评述[J].西南交通大学学报,1995,30(4):376~382
[158] 邓连波,史峰,莫辉辉.物流配送车辆路径问题多代竞争遗传算法[J].铁道科学与工程学报,2005,2(5):75~79
[159] 元霞,陈森发,黄鹃等.基于免疫算法的物流配送车辆路径优化问题研究[J].土木工程学报,2003,36(7):43~46
[160] 肖健梅,黄有方,李军军等.基于离散微粒群优化的物流配送车辆路径问题[J]. 系统工程,2005,23(4):97~100
[161] 张建勇,郭耀煌,李军.基于顾客满意度的多目标模糊车辆优化调度问题研究[J].铁道学报,2003,25(2):15~17
[162] 陈一永,韩红,龚延成.带时间约束的配载车辆调度问题研究[J].物流技术,2005,(3):48~50
[163] 张爱文,陈俊芳.供应商管理库存对供应商的成本分析[J].预测,2004,23(4): 72~74
[164] Yan Dong, Xu Kefeng. A supply model of vendor managed inventory [J]. Transportation Research Part E, 2002, 38(4): 75~89
[165] 徐玖平,胡知能,李军.运筹学[M].北京: 科学出版社,2004
[166] 徐文亮,徐青川,乔卓. VMI 下的供应链库存系统分析[J].物流技术,2002,22(11):18~19
[167] 阎子刚,赵继新.供应链管理[M].北京:机械工业出版社,2004
[168] 王晓晶,刘长斌.VMI——现实离理论有多远[J].物流技术,2004,24(1):10
[169]Wenxun Xing. A bin packing problem with over-sized items[J],Operations Research Leters, 2002,30(2):83~88
[170] 现代物流管理课题组.保管与装卸管理[M].广东经济出版社,2002
[171] 贺国先.现代物流配送装车及车辆调度问题优化方法研究[D].北京交通大学博士学位论文,2004,1
[172] 王景恒.物流中心货物最优配装问题的动态规划解法[J].长春理工大学学报,2004,27(1):9~11
[173]刘丽文. 供应链管理思想及其理论和方法的发展过程[J].管理科学学报,2003,6(2):81～88
[174]叶建勇.物流中心选址研究[D].长安大学. 2002,5
[175]余福茂. 关于物流系统规划若干关键技术的研究[D].浙江大学博士学位论文.2003,11
[176] 舒彩霞 廖庆喜 . 配送系统运营效率的综合评价模型 [J]. 物流科技, 2005,28(3):87～89
[177]杨家其.现代物流与运输〔M〕.北京:人民交通出版社,2003
[2] 曾剑,王景锋,邹敏.物流管理基础[M].北京:机械工业出版社,2004
[3] 孔健.企业的第三利润源泉——走进现代物流管理领域[J].华东经济管理,2001, 15(2):46~47
[4] 杨青,张迁.物流成本:企业第三利润源泉[J]. 财会通讯(理财版),2006,(1):62
[5] 阎子刚,赵继新.供应链管理[M].北京:机械工业出版社.2004
[6] 孟庆红.区域经济学概论[M].北京:经济科学出版社,2003
[7] 李玉民.现代企业物流中心选址决策研究[D].浙江大学硕士学位论文. 2003, 12
[8] 杨华,符卓.基于 GIS 的配送车辆调度系统的设计与实现[J]. 物流科技,2006,29(125):20~23
[9] H. W. Hamacher, S. Nickel. Multicriteria planar location problems[J]. European Journal of operational Research,1996,94(1):66~86
[10] 鲁晓春,詹菏生.关于配送中心重心法选址的研究[J].北方交通大学学报,2000,24(6):108~110
[11] 周梅华.论集约化商品配送中心的选址[J].中国矿业大学学报,2000,29(6):647~650
[12] 王战权,杨东援,汪超.配送中心选址的遗传算法研究[J].物流技术,2001,(3):11~14
[13] 姜大立,杜文. 易腐物品物流配送中心选址的遗传算法[J].西南交通大学学报,1998,33(4):425~429
[14] 戴更新,于龙振,陈常菊.基于混合遗传算法的多配送中心选址问题研究[J].物流技术,2006,(6):38~42
[15] 刘海燕,李宗平,叶怀珍.物流配送中心选址模型[J].西南交通大学学报(自然科学版),2000,35(3):311~314
[16] 袁庆达,陈旭梅,黎青松.基于“服务型”物流战略的 P-Center 选址问题研究[J].西南交通大学学报(自然科学版),2001,36(3):250~253
[17] 孟大伟,吴慧德,王向安.多目标多配送中心选址问题[J].物流技术,2002,(2):28~32
[18] 黄敏,赵一平,程长兵. 深圳引入国际理念 描绘区域性现代物流中心城市蓝图——高起点、高标准做好深圳市“十五”及 2015 年现代物流业发展规划[J].综合运输,2000,(11):26~29
[19] 戴禾,刘兴景,扬东援.物流园区选址问题研究[J].综合运输,2001,(2):30~33
[20] 王战权,杨东援.现代物流业发展系统规划研究[J].西安公路交通大学学报,2001,21(3):61~65
[21] 徐天亮,刘小群.多品种货物配装的优化方法[J].华中科技大学学报(自然科学版),2003,31(9):15~17
[22] 贺国先,刘凯.优化物流中心配送方案的遗传算法[J].系统工程理论与实践. 2003,4:76~81
[23] 贺国先,刘凯.模拟退火算法在铁路货运站危险货物配装中的应用[J].铁道学报,2003,25(1):9~14
[24] 雷定猷,陈德良.平衡装载问题的优化模型和算法[J].系统工程学报,2004, 19 (3):251~157
[25] 卜雷,尹传忠,蒲云. 普零货物多车配装优化问题的遗传算法[J].科技通报,2004,20(6):497~500
[26] 王景恒. 物流中心货物最优配装问题的动态规划解法[J]. 长春理工大学学报,2004,27(1):9~11
[27] 卜雷,刘海旭,蒲云等. 遗传算法确定零担货物的选择装箱方式[J].交通运输工程学报,2002,2(3):93~96
[28] 刘小群,马士华,徐天亮.装载能力有限下多品种货物配装的容重比平衡法[J].工业工程与管理,2004(3):62~66
[29] Dantizig G., Rmser J.. The Truck Dispatching Problem [J]. Management Science, 1959,(6): 80~91
[30] Roberto Baldacci, Lawrence Bodin, Aristide Mingozzi. The multiple disposal facilities and multiple inventory locations rollon–rolloff vehicle routing problem [J].Computers&Operations Research,2006,33(9):26672702
[31] G. Laporte, Y. Nobert, S. Taillefer. A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem [J]. Mathematical Modelling,1987,9(12):857~868.
[32] Patrice Perny, Olivier Spanjaard. A preference-based approach to spanning trees and shortest paths problems [J]. European Journal of OperationalResearch,2005,162(3): 584~601
[33] Fisher M.L. Optimal Solution of Vehicle Routing Problems Using Minimum K-trees[J].Operation Research,1994,42(4):626~642.
[34] EilonS.,Watson D.,Cluistorfides N, Distribution Management:Mathematical Modeling and Practice Analysis[M].London:Grifin,1971.
[35] Balinske M., Quandt R. On an Integer Program for a Delivery Problem[J].Operation Research,1962,(12):300~304.
[36] Mark Vroblefski, R. Ramesh, Stanley Zionts. Efficient lot-sizing under a differential transportation cost structure for serially distributed warehouses[J]. European Journal of Operational Research, 2000,127(3):574~593
[37] Akio Imai, Etsuko Nishimura and John Current .A Lagrangian relaxation-based heuristic for the vehicle routing with full container load[J].European Journal of Operational Research, 2006,176(1): 87~105
[38] Laporte G., Nobert Y.,Desrocher M. Optimal Routing Under Capacity and Distance Restriction[J].Operations Research,1985,33:1050-1073
[39]Clark G.,Wright J.W.. Scheduling of Vehicles form a Central Depot to a Number of Delivery Points[J]. Operations Research,1964,(12):568~581
[40] Marc Reimann, Karl Doerner, Richard F. Hartl. D-Ants: Savings Based Ants divide and conquer the vehicle routing problem[J].Computers & Operations Research, 2004, 31(4):563~591
[41] Manfred Gronalt, Richard F. Hartl, Marc Reimann.New savings based algorithms for time constrained pickup and delivery of full truckloads[J]. European Journal of Operational Research, 2003,151(3): 520~535
[42] Mondher Hachicha, M. John Hodgson, Gilbert Laporte et.al. Heuristics for the multi-vehicle covering tour problem[J]. Computers & Operations Research, 2000,27(1): 29~42
[43] Billy E Gillett,Jerry G Johnson. Multi-terminal vehicle-dispatch algorithm[J].Omega, 1976, 4(6): 711~718
[44] J. E. Beasley, N. Christofides.Vehicle routing with a sparse feasibility graph[J]. European Journal of Operational Research, 1997, 98(3):499~511
[45] K.Ganesh, T.T. Narendran. CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up[J].European Journal of Operational Research,2006, 178(3): 699717
[46] Jacques Renaud, Gilbert Laporte, Fayez F. Boctor. A tabu search heuristic for the multi-depot vehicle routing problem [J]. Computers & Operations Research, 1996, 23 (3):229~235
[47] Philippe Lacomme, Christian Prins, Wahiba Ramdane-Chérif. Evolutionary algorithms for periodic arc routing problems [J]. European Journal of Operational Research, 2005,165(2):535~553
[48] Philippe BadeauFran?ois Guertin, Michel Gendreau, Jean-Yves PotvinEric Taillard. A parallel tabu search heuristic for the vehicle routing problem with time windows [J]. Transportation Research Part C: Emerging Technologies,1997,5(2):109~122
[49] Michel Gendreau.A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers [J]. Operation Research,1996,44 (3):469~477
[50] Michel Gendreau, Gilbert Laporte, Christophe Musaraganyi and éric D. Taillard.A tabu search heuristic for the heterogeneous fleet vehicle routing problem [J]. Computers & Operations Research,1999,26(12):1153~1173
[51] Stephan Scheuerer. A tabu search heuristic for the truck and trailer routing problem [J]. Computers & Operations Research, 2006,33(4):894~909
[52] Soumia Ichoua, Michel Gendreau, Jean-Yves Potvin. Vehicle dispatching with time- dependent travel times[J].European Journal of Operational Research, 2003, 144(2):379~396
[53] Barbarosoglu Gulay, Demet Ozgun. Tabu Search Algorithm for the Vehicle Routing Problem [J].Computers & Operations Research,1999,26(3):255~270.
[54] Gilbert Laporte, Michel Gendreau, Jean-Yves Potvin, Frédéric Semet. Classical and modern heuristics for the vehicle routing problem[J].International Transactions in Operational Research, 2000, 7(4):285~300
[55] Stephan Scheuerer. A tabu search heuristic for the truck and trailer routing problem[J].Computers & Operations Research, 2006,33(4):894~909
[56] Laporte G.,Osman I.H.. Metaheuristics in Combinatorial Optimization: a Bibliography [J].Ann. Operations Research,1996,63(2):513~628.
[57] Alex Van Breedam. Improvement heuristics for the Vehicle Routing Problem based on simulated annealing[J].European Journal of Operational Research, 1995, 86 (3):480~490
[58] Barrie M. Baker, M. A. Ayechew. A genetic algorithm for the vehicle routing problem [J].Computers & Operations Research,2003, 30(5): 787~800
[59] S.A. Torabi, S.M.T. Fatemi Ghomi, B. Karimi. A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains [J].European Journal of Operational Research, 2006,173(1): 173~189
[60] Gen M.,Cheng R..Genetic Algorithms & Engineering Design[A].Wiley, New York,1997
[61] Jean Berger, Mohamed Barkaoui. A parallel hybrid genetic algorithm for the vehicle routing problem with time windows[J]. Computers & Operations Research, 2004, 31(12): 2037~2053
[62] Charles J. Malmborg. A genetic algorithm for service level based vehicle scheduling [J]. European Journal of Operational Research,1996, 93(1): 121~134
[63] Chen Xiong, Wan Weishui, Xu Xinhe. Modeling rolling batch planning as vehicle routing problem with time windows[J]. Computers & Operations Research, 1998, 25(12):1127~1136
[64] 李大卫,王莉,王梦光.一个求带有时间窗口约束的车辆路径问题的启发式算法[J].系统工程,1998,16(4):20~24
[65] 张震.城市货运汽车营运组织最理论与方法[J].管理工程学报,1995,9 (3):143~152
[66] 郎茂祥.基于遗传算法的物流配送路径优化问题研究[J]中国公路学报,2002,15(3):76~79
[67] 郎茂祥. 用单亲遗传算法求解配送车辆调度问题的研究[J]. 交通与计算机,2006,24(1):119~122
[68] 郎茂祥.物流配送车辆调度问题的模型与算法研究[D].北方交通大学博士学位论文.2002,2.
[69] 刘浩,袁健,卢厚清.两种类型车辆随机需求路由问题[J].南京航空航天大学学报,2001,33(2):155~158
[70] 刘诚,陈治亚,封全喜. 带软时间窗物流配送车辆路径问题的并行遗传算法[J].系统工程,2005,23(10):7~11
[71] 吕树红,姚丹霖,何文强.车辆路径问题的一种遗传算法求解方法[J].计算机应用,2005,25(12):314~316
[72] 周双贵.基于 MATLAB 的车辆路径系统研究[C].北方交通大学博士后科研工作报告,2001
[73] 张涛,张玥杰,王梦光.不确定车辆数的车辆路径问题模型和混合算法[J]. 系统工程理论方法应用,2002,11(2):121~125
[74] 袁健,刘晋.随机需求情形 VRP 的 Hopfield 神经网络解法[J].南京航空航天大学学报,2000,32(5):579~585
[75] 李军,郭耀煌.物流配送车辆优化调度理论与方法[M].中国物资出版社,北京:2001,11
[76] R. Storn, K. Price. DE ——A simple and efficient heuristic for global optimization over continuous space. Journal of Global Optimization,1997, 11(4):341~359.
[77] 杨坤德,马远良.用差异进化算法进行海洋环境参数反演[J].西北工业大学学报,2003,21(3):45~51
[78] Babu B V, Munawar S A. Differential Evolution for the Optimal Design of Heat Exchangers. Proceedings of All India Seminar on Chemical Engineering Progress on Resource Development: A Vision 2010 and Beyond, 2000
[79] Vasan A, Srinivasa Raju K. Optimal Reservoir Operation Using Differential Evolution. Exchangers,Proceedings of All India Seminar on Chemical Engineering Progress on Resource Development: A Vision 2010 and Beyond, 2000.
[80] Shiakolas P S, Koladiya D, Kebrle J. On the optimum synthesis of six-bar linkages using differential evolution and the geometric centroid of precision positions technique. Mechanism and Machine Theory, in Press, 2004.
[81] Rogalsky T, Derksen R W, Kocabiyik S. Differential Evolution in Aerodynamic Optimization [J]. Canadian Aeronautics and Space Journal, 2000, 46(3):183~190
[82] Lopez Cruz I. L, Van Willigenburg L.G. Van Straten G. Efficient Differential Evolution algorithms for multimodal optimal control problems.Aplied Soft Computing[J], 2003, 12(2):397~422
[83] Bohuslav Ruzek, Michal Kvasnicka. Differential Evolution Alogrithm in the Earthquake Hypocenter Location. Pure and Applied Geophysics[J], 2001, 158 (5):667~ 693
[84] Hui-Yuan Fan, Jouni Lampinen. A Trigonometric Mutation Operation to Differential Evolution [J]. Journal of Global Optimization, 2003, 27(2):105~129
[85] Ji-Pyng Chiou, Chung-Fu Chang and Ching-Tzong Su. Capacitor placement in large-scale distribution systems using variable scaling hybrid differential evolution [J]. International Journal of Electrical Power & Energy Systems, 2006, 28(10): 739~745
[86] Zhang W J, Xie X F. DEPSO:hybrid particle swarm with differential evolutionoperator. IEEE International Conference on System, Man & Cybernetics (SMCC) [C]: Washington D C, USA, 2003, 3816~3821
[87] Thomsen R. Multimodal Optimization Using Crowding-Based Differential Evolution Proceedings of the 2004 Congress on Evolutionary Computation, 2004, 2:1382~1389
[88] 任春玉,王晓博,李子群.基于供应链下物 流 配 送 网 络 规 划 研 究[J].物流科技,28(5):54~57
[89] Hokey Mina, Vaidyanathan Jayaraman, Rajesh Srivastava. Combined location-routing problems: a synthesis and future research directions[J]. European Journal of Operational Research, 1998,108(1):1~15
[90] Dilek Tuzun, Laura I. Burke.:A two-phase tabu search approach to the location routing Problem[J]. European Journal of Operational Research,1999 116(1): 87~99
[91] Maria Albareda-Sambola, Juan A. Díaz, Elena Fernández. A compact model and tight bounds for a combined location-routing problem[J].Computers & Operations Research, 2005,32(3):407~428
[92] 汪寿阳,赵秋红,夏国平.集成物流管理系统中定位——运输路线安排问题的研究[J].管理科学学报,2000,3(2):69~75
[93] Susan Hesse Owen, Mark S. Daskin. Strategic facility location: a review[J]. European Journal of Operational Research. 1998,111(3):423447
[94] Refael Hassin,Shlomi Rubinstein. On the complexity of the k-customer vehicle routing problem [J]. Operations Research Letters, 2005,33(1):71~76
[95] 元霞.物流配送中车辆路径优化问题的研究[D].东南大学博士学位论文,2004
[96] 姜大立,杜文,张拥军.易腐物品物流配送中心选址的遗传算法[J].西南交通大学学报(自然科学版),1998,33(4):425~429
[97] 陆琳琳,张仁颐.物流中心选址的一种综合方法.工业工程与管理.2003,(6):59~61
[98] 李云清.物流系统规划[M].上海:同济大学出版社,2004
[99] Barrie M. Baker, Janice Sheasby. Extensions to the generalised assignment heuristic for vehicle routing[J].European Journal of Operational Research, 1999,119(1):147~157
[100] Jean-Yves Potvin, Jean-Marc Rousseau. A parallel route building algorithm for the vehicle routing and scheduling problem with time windows[J].European Journal of Operational Research, 1993,66(3):331~340
[101] Dimitris Bertsimas, Dessislava Pachamanova, Melvyn Sim. Robust linear optimization under general norms[J].Operations Research Letters,2004,32(6):510~516
[102] G.B. Alvarenga, G.R. Mateus, G.de Tomi. A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows[J].Computers & Operations Research, 2006,34(6):1561~1584
[103] 刘朝晖,范荣华,万毅.物资管理系统工程[M],北京:中国物资出版社,1997
[104] 中国科学院数学研究所运筹室,北京市运输公司.线形规划在汽车运输中的应用[M].北京:人民交通出版社,1962
[105] 林治勋.动态规划与序贯最优化[M].开封:河南大学出版社,1997
[106] 刘明广.差异演化算法及其改进[J].系统工程,2005,23(2):108~111
[107] 陈世展,任长明,吴启权. 基于竞争方程的竞争型协同进化算法及应用[J].微处理机,2005(1):33~36
[108] DE Homepage. Http://www.icsi.Berkeley. edu/storn/code.htm.
[109] M.M. Ali, A. torn. Population Set-based Global Optimization Algorithms: Some Modifications and Numerical Studies[J]. Computer &operations research, 2004,31:1703-1725
[110] R Storn. System Design by Constraint Adaptation and Differential Evolution[J]. IEEE Transactions on Evolutionary Computation, 1999, 3(1):22~34.
[111] R. Storn, K. Price. DE - A simple and efficient heuristic for global optimization over continuous space [J]. Journal of Global Optimization, 1997, 11(4):341~359.
[112] 蓝盛芳.试论达尔文进化论与协同进化论[J].生态科学,1995,(2):167~170
[113] 孙关龙.达尔文进化论的局限性[J].科技潮,2002(11):20~21
[114] 刘静.协同进化算法及其应用研究[D].西安电子科技大学博士论文.2004,9
[115] Ehrlich P R, Raven P H. Butterflies and plants: a study in co-evolution[J]. Evolution,1965, 18(4): 586~608
[116] Jazen D. H. When is it coevolution. Evolution[J]. 1980, 34(4): 611-612.
[117] Allaby M. The Oxford Dictionary of Natural History, Oxford, England. Oxford University Press, 1985
[118] 张树义.协同进化(一)——相互作用与进化理论[J].生物学通报, 1996, 31(11): 35~36
[119] 张树义.协同进化(三)——竞争、捕食、拟态[J].生物学通报,1997,32(1): 19~21
[120] Yeo Keun Kim, Jae Yun Kim, Yeongho Kim. An endosymbiotic evolutionary algorithm for the integration of balancing and sequencing in mixed~model U-lines[J].European Journal of Operational Research, 2006,168(3): 838~852
[121] Mitchell A. Potter, Kenneth A, De Jong. A cooperative coevolutionary approach to function optimization[J]. The Third Parallel Problem Solving From Nature, 1994,(5):249~257
[122] Frans van den Bergh, Andries P. Engelbrecht. A Cooperative Approach to Particle Swarm Optimization[J]. IEEE Transactions On Evolutionaiy Computation, 2004, 8(3):225~239
[123] Thomas Jansen, R. Paul Wiegand. The Cooperative Coevolutionary (1+1) EA[J]. Evolutionary Computation, 2004, 12(4):405~434
[124] 钟求喜,陈火旺.基于共同进化计算模型的基因连锁问题求解[J].软件学报,2002,13(4):561~566
[125] 钟求喜,胡华平,祈悦.基于共进化的多任务分配与调度[J].国防科学技术大学学报,2002,24(4):69~72
[126]荔建琦,陈火旺,王兵山.一种异构合作共进化算法[J].计算机科学,2000,27(11):6~10
[127] 陈浩勇,王锡凡,别朝红.协同进化算法及其在电力系统中的应用前景[J].电力系统自动化,2003,27(23):94~100
[128] Kenneth Price, Rainer Storn and Jouni Lampinen. Differential Evolution A Practical Approach to Global Optimization[M]. Springer Berlin Heidelberg, 2005
[129] 钟求喜.网络计算中任务分配与调度的遗传算法研究[D]. 国防科学技术大学博士学位论文,2000
[130] Yeo Keun Kim, Kitae Park and Jesuk Ko. A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling [J].Computers & Operations Research, 30, 2003(8):1151~1171
[131] Moeko Nerome, Koji Yamada, Satoshi Endo and Hayao Miyaji. Simulated Evolution and Learning[M]. Springer Berlin/Heidelberg,1997
[132] Xiping Sun and Yongji Wan. Robust output-feedback stabilization of a class of nonlinear systems with the nonlinearities of varied form[J]. Journal of Systems Engineering and Electronics, 2006,17(3):629~634
[133] 邱世明.复杂适应系统协同理论、方法与应用研究[D].天津大学博士学位论文,2002,12
[134] Assaf Zaritsky, Moshe Sipper. Coevolving solutions to the shortest common superstring problem[J]. 2004,76(1):209~216
[135] Wiegand RP, Liles WC, De Jong KA. An empirical analysis of collaboration methods in cooperative coevolutionary algorithms. In Proceedings of Genetic and Evolutionary Computation Conference, 2001
[136] Wiegand RP. An analysis of cooperative coevolutionary algorithms[D]. George Mason University PhD dissertation, 2003
[137] Potter MA. The design and analysis of a computational model of cooperative coevolution[D]. George Mason University PhD dissertation,1997
[138] 史彦军.复杂布局的协同差异演化方法与应用研究[D].大连理工大学博士学位论文.2005,6
[139] 李旭宏,胡文友.区域物流中心规划方法[J].交通运输工程学报,2002,2(1):85~87
[140] Clarke, G. & Wright, J. W.. Scheduling of vehicles from a central depot to a number of delivery points[J]. Operations Research 12(2): 568~581
[141] Xiao H Y. Model of location in many suppliers[J]. Operations Research and Management Science, 2000,9(1):7~10
[142] Holmberg K. Exact solution methods for uncapacitate location problem with convex transportation costs[J].European Journal of Operational Oesearch, 1999. 114(2):127~ 140
[143] Francisco B, David J. Plant location with minimum inventory[J]. Mathematical Programming, 1998, 83(1):101~111
[144] Owen S H, Daskin M S. Strategic facility location: areview[J]. European Journal of Operational Research, 1998,111(4):423~447
[145] Xiao H Y. Model of location in many suppliers[J]. Operations Research and Management Science, 2000, 9 (1):7~10
[146] 孙会君,高自友.一类有竞争的物流配送中心选址模型[J]交通运输工程学报,2002,2(4):54~57
[147] [美]Ronald H. Ballou. 企业物流管理——供应链的规划、组织和控制[M]北京:机械工业出版社,2002
[148] 李玉民.现代企业物流中心选址决策研究[D].浙江大学硕士学位论文,2003,12
[149] 吴云燕,华中生,查勇. AHP 中群决策权重的确定与判断矩阵的合并[J].运筹 与管理,2003,12(4):16~21
[150] 孟波.有限方案模糊多目标群决策方法的研究[J].系统工程,1995,13(4): 43~46
[151] 孟波,付微.一种有限方案多目标群决策方法[J].系统工程,1998,16(4):57~61
[152] 胡毓达,田川.求解群体多指标决策问题的偏爱度法[J].系统工程理论与实践,1996(3):52~56
[153] 宋光兴,邹平.多属性群决策中决策者权重的确定方法[J].系统工程. 2001,19 (4):84~89
[154] 郭文明,相景丽,肖楷生.群组 AHP 权重系数的确定[J].华北工学院学报, 2000 ,21(2):110~113
[155] 华中生,吴云燕,徐晓燕.一种 AHP 判断矩阵一致性调整的新方法[J].系统工程与电子技术,2003,25(1):38~40
[156] 荆海霞.物流配送中双向运输车辆路径优化问题研究[D].武汉大学硕士学位论文,2004,5
[157] 郭耀煌,李军.车辆优化调度问题的研究现状评述[J].西南交通大学学报,1995,30(4):376~382
[158] 邓连波,史峰,莫辉辉.物流配送车辆路径问题多代竞争遗传算法[J].铁道科学与工程学报,2005,2(5):75~79
[159] 元霞,陈森发,黄鹃等.基于免疫算法的物流配送车辆路径优化问题研究[J].土木工程学报,2003,36(7):43~46
[160] 肖健梅,黄有方,李军军等.基于离散微粒群优化的物流配送车辆路径问题[J]. 系统工程,2005,23(4):97~100
[161] 张建勇,郭耀煌,李军.基于顾客满意度的多目标模糊车辆优化调度问题研究[J].铁道学报,2003,25(2):15~17
[162] 陈一永,韩红,龚延成.带时间约束的配载车辆调度问题研究[J].物流技术,2005,(3):48~50
[163] 张爱文,陈俊芳.供应商管理库存对供应商的成本分析[J].预测,2004,23(4): 72~74
[164] Yan Dong, Xu Kefeng. A supply model of vendor managed inventory [J]. Transportation Research Part E, 2002, 38(4): 75~89
[165] 徐玖平,胡知能,李军.运筹学[M].北京: 科学出版社,2004
[166] 徐文亮,徐青川,乔卓. VMI 下的供应链库存系统分析[J].物流技术,2002,22(11):18~19
[167] 阎子刚,赵继新.供应链管理[M].北京:机械工业出版社,2004
[168] 王晓晶,刘长斌.VMI——现实离理论有多远[J].物流技术,2004,24(1):10
[169]Wenxun Xing. A bin packing problem with over-sized items[J],Operations Research Leters, 2002,30(2):83~88
[170] 现代物流管理课题组.保管与装卸管理[M].广东经济出版社,2002
[171] 贺国先.现代物流配送装车及车辆调度问题优化方法研究[D].北京交通大学博士学位论文,2004,1
[172] 王景恒.物流中心货物最优配装问题的动态规划解法[J].长春理工大学学报,2004,27(1):9~11
[173]刘丽文. 供应链管理思想及其理论和方法的发展过程[J].管理科学学报,2003,6(2):81～88
[174]叶建勇.物流中心选址研究[D].长安大学. 2002,5
[175]余福茂. 关于物流系统规划若干关键技术的研究[D].浙江大学博士学位论文.2003,11
[176] 舒彩霞 廖庆喜 . 配送系统运营效率的综合评价模型 [J]. 物流科技, 2005,28(3):87～89
[177]杨家其.现代物流与运输〔M〕.北京:人民交通出版社,2003