供应链系统节点设施选址研究
|
摘要
在经济全球化快速推进、市场竞争日益加剧和客户对供货时间越来越敏感的背景下,企业之间的竞争转向供应链与供应链之间的竞争。供应链系统的网络拓朴结构是供应链整体运作的实体支撑,对供应链整体的响应速度、服务质量、运作成本、运作效率和一体化运作的流畅性等有重要影响作用,因此,优良的网络结构是供应链系统合理化和科学性运作的前提和保证。
本文运用供应链管理理论和优化决策理论,对现有服务设施选址的研究现状与存在问题进行认真分析的前提下,依据供应链不同层次结构节点设施(如生产设施、物流设施、零售设施等)的功能与特性,对供应链系统节点设施选址模型与算法做了一些基础性和创新性研究。首先,分析了供应链系统设施选址中设施容量确定的局限性,把设施容量也作为决策变量,研究了静态环境和需求不确定环境下的供应链系统节点设施选址和容量的一体化决策问题,以固定成本和运营成本最小为目标,分别建立相应的数学模型,此处的固定成本随容量扩大而增加,运营成本随生产量的增加而减小,设计模型求解的Benders分解算法,并用算例进行仿真计算,说明算法的有效性和实用性。其次,论文分析了供应链系统动态多变特性对供应链终端设施选址的影响,不同阶段客户需求分布和设施运营成本有较大差异,研究了适应供应链环境变动的多阶段竞争性设施选址问题。设计了较为全面的设施引力评价指标体系,提出了设施引力的测定方法,建立客户选择服务设施的效用函数,在此基础上构建多阶段竞争性设施选址模型。分析模型特点,设计了模型求解的分散搜索算法。一组算例分别用Lingo和分散搜索算法计算比较,检验分散搜索算法的求解速度和收敛性。第三,论文分析了时间在供应链竞争中的作用,研究了基于时间约束的多级供应链系统物流中心调整问题以及工厂和物流中心一体化的调整问题,对这两个问题分别建立混合整数规划模型,考虑供应链中物流资源的整合利用以及关闭物流中心的成本,通过引入参数,把模型中的时间约束问题转化成为无时间约束问题,以降低模型的求解难度,并以实例分析基于不同时间约束的各成本及在总成本中所占比重。第四,生产者责任延伸制下,供应链系统不仅要承担产品的库存、运输和配送等物流任务,废弃产品的回收再资源化也是供应链管理的重要内容。本文分析了单个企业独立实施废弃产品回收存在的问题,以多企业联合回收废弃产品为着眼点,研究了多回收源点、多种废弃产品的处理站选址问题,以回收成本最小为优化目标,分别建立了每种废弃品有最大处理容量限制以及有最大和最小处理容量限制的处理站选址模型,分析两个模型特点,设计拉格朗日松驰启发式算法,并用一组算例对算法的可行性进行检验。
本文所做的一些研究是对现有设施选址模型与算法的深入和发展,弥补了供应链系统设施选址研究方面的不足,使选址模型和算法能更好地应用于解决实际问题。本文所做的研究有利于优化供应链系统的服务设施规划和进行战略调整,实现客户需求分布与设施布局的有效均衡,提高对客户需求的反应速度,减少物流成本,增强供应链整体的竞争能力。
The competition among supply chains substitutes for the competition among corporations under the surroundings of global economy, increasingly intense competition of marketing and decreasing response time from customers sending out demand to meeting their demand. The network framework of supply chain system that consist of facilities is playing an import work for the supply chain operation such as clipping response coming from customs’demand, improving service, decreasing cost, upgrading work efficiency, and smoothing manipulate in the integrated supply chain. Thus an excellent design of supply chain network is basic guarantee for the scientific and economic operation of the supply chain system.
In this paper, several supply chains facilities location models and efficient algorithms for solving these models are developed by the facilities’characteristic and function at the special sites in the supply chain, which large numbers of existing location articles are studied and some out of line for supply chain facilities location are analyzed before writing this paper. Supply chain management theory, optimization and decision-making science are basic tools for these researches. Firstly, the limitation of decided capacity for production and logistics facilities in location research is analyzed and then the problems of facilities locations and capacity decision-marking are studied for supply chain system for certain and uncertain surroundings. Two mixed-integer programming models which the capacities are also decision-making variable are built for certain and uncertain surroundings, Benders decomposed algorithms are developed, and a set of examples are solved for testing these algorithms. Secondly, the dynamically changing trait of supply chain systems for the effect of terminal facilities is analyzed. There are considerable difference about demand and running cost at different stages so multistage competitive facilities locations problem in supply chain terminal is researched. A criterion system for facilities’attraction is designed, a measure for facilities attraction is proposed, and an extended utility function is developed. Based on these studies, a multistage competitive facilities locations model is developed, an effective scatter search heuristic algorithm is devised according to the model property, and also compares the results of scatter search heuristic algorithm solving examples for Lingo solving to same examples so that can show the solving speed and convergence for the provided algorithm. Thirdly, detailed study the time function in the competitive supply chains. The problems of logistics facilities locations and integrated logistics and plants facilities locations based on time restriction for multilayer supply chain system are studied. Two mixed-integer programming models with time restriction are proposed. These researches take into account integrating supply chain system resource, closing logistics facilities cost, transform the model to no time restriction by introducing parameters so that reducing the complicacy of solving models and examples give costs and each cost proportion in the total cost for different time restriction. Fourthly, with extended producer responsibility implementing, supply chain system not only want to produce, store, transport, allot products to customers, but also want to take back used products from customers. The problem for single plant taking-back is analyzed. According to consortium of manufactures takeback used products together; the disposal sites locations and flows distribution problem for used productions are researched. Two models which have multiple initial collection sites, multi-manufacturer, multi-used-product and multi-disposal-site are developed for only involving upper bound of disposing capacity as well as involving lowest and the utmost disposing capacity for each disposal facility at every disposal site. Due to the complexity of models, the heuristic algorithms based on Lagrangean relaxation for these problems are elaborated.
The developed models and algorithms in the dissertation succeed and improve the existing researches about facilities location so that these results can be put into facilities locations practice in supply chain system. These works support optimization of facilities locations and relocations in supply chain system and can urge the equilibriums between customers’demand distributing and facilities sites, improve the answer for customers demand, decrease logistics cost and strengthen competition for total corporations in the supply chain system.
本文运用供应链管理理论和优化决策理论,对现有服务设施选址的研究现状与存在问题进行认真分析的前提下,依据供应链不同层次结构节点设施(如生产设施、物流设施、零售设施等)的功能与特性,对供应链系统节点设施选址模型与算法做了一些基础性和创新性研究。首先,分析了供应链系统设施选址中设施容量确定的局限性,把设施容量也作为决策变量,研究了静态环境和需求不确定环境下的供应链系统节点设施选址和容量的一体化决策问题,以固定成本和运营成本最小为目标,分别建立相应的数学模型,此处的固定成本随容量扩大而增加,运营成本随生产量的增加而减小,设计模型求解的Benders分解算法,并用算例进行仿真计算,说明算法的有效性和实用性。其次,论文分析了供应链系统动态多变特性对供应链终端设施选址的影响,不同阶段客户需求分布和设施运营成本有较大差异,研究了适应供应链环境变动的多阶段竞争性设施选址问题。设计了较为全面的设施引力评价指标体系,提出了设施引力的测定方法,建立客户选择服务设施的效用函数,在此基础上构建多阶段竞争性设施选址模型。分析模型特点,设计了模型求解的分散搜索算法。一组算例分别用Lingo和分散搜索算法计算比较,检验分散搜索算法的求解速度和收敛性。第三,论文分析了时间在供应链竞争中的作用,研究了基于时间约束的多级供应链系统物流中心调整问题以及工厂和物流中心一体化的调整问题,对这两个问题分别建立混合整数规划模型,考虑供应链中物流资源的整合利用以及关闭物流中心的成本,通过引入参数,把模型中的时间约束问题转化成为无时间约束问题,以降低模型的求解难度,并以实例分析基于不同时间约束的各成本及在总成本中所占比重。第四,生产者责任延伸制下,供应链系统不仅要承担产品的库存、运输和配送等物流任务,废弃产品的回收再资源化也是供应链管理的重要内容。本文分析了单个企业独立实施废弃产品回收存在的问题,以多企业联合回收废弃产品为着眼点,研究了多回收源点、多种废弃产品的处理站选址问题,以回收成本最小为优化目标,分别建立了每种废弃品有最大处理容量限制以及有最大和最小处理容量限制的处理站选址模型,分析两个模型特点,设计拉格朗日松驰启发式算法,并用一组算例对算法的可行性进行检验。
本文所做的一些研究是对现有设施选址模型与算法的深入和发展,弥补了供应链系统设施选址研究方面的不足,使选址模型和算法能更好地应用于解决实际问题。本文所做的研究有利于优化供应链系统的服务设施规划和进行战略调整,实现客户需求分布与设施布局的有效均衡,提高对客户需求的反应速度,减少物流成本,增强供应链整体的竞争能力。
The competition among supply chains substitutes for the competition among corporations under the surroundings of global economy, increasingly intense competition of marketing and decreasing response time from customers sending out demand to meeting their demand. The network framework of supply chain system that consist of facilities is playing an import work for the supply chain operation such as clipping response coming from customs’demand, improving service, decreasing cost, upgrading work efficiency, and smoothing manipulate in the integrated supply chain. Thus an excellent design of supply chain network is basic guarantee for the scientific and economic operation of the supply chain system.
In this paper, several supply chains facilities location models and efficient algorithms for solving these models are developed by the facilities’characteristic and function at the special sites in the supply chain, which large numbers of existing location articles are studied and some out of line for supply chain facilities location are analyzed before writing this paper. Supply chain management theory, optimization and decision-making science are basic tools for these researches. Firstly, the limitation of decided capacity for production and logistics facilities in location research is analyzed and then the problems of facilities locations and capacity decision-marking are studied for supply chain system for certain and uncertain surroundings. Two mixed-integer programming models which the capacities are also decision-making variable are built for certain and uncertain surroundings, Benders decomposed algorithms are developed, and a set of examples are solved for testing these algorithms. Secondly, the dynamically changing trait of supply chain systems for the effect of terminal facilities is analyzed. There are considerable difference about demand and running cost at different stages so multistage competitive facilities locations problem in supply chain terminal is researched. A criterion system for facilities’attraction is designed, a measure for facilities attraction is proposed, and an extended utility function is developed. Based on these studies, a multistage competitive facilities locations model is developed, an effective scatter search heuristic algorithm is devised according to the model property, and also compares the results of scatter search heuristic algorithm solving examples for Lingo solving to same examples so that can show the solving speed and convergence for the provided algorithm. Thirdly, detailed study the time function in the competitive supply chains. The problems of logistics facilities locations and integrated logistics and plants facilities locations based on time restriction for multilayer supply chain system are studied. Two mixed-integer programming models with time restriction are proposed. These researches take into account integrating supply chain system resource, closing logistics facilities cost, transform the model to no time restriction by introducing parameters so that reducing the complicacy of solving models and examples give costs and each cost proportion in the total cost for different time restriction. Fourthly, with extended producer responsibility implementing, supply chain system not only want to produce, store, transport, allot products to customers, but also want to take back used products from customers. The problem for single plant taking-back is analyzed. According to consortium of manufactures takeback used products together; the disposal sites locations and flows distribution problem for used productions are researched. Two models which have multiple initial collection sites, multi-manufacturer, multi-used-product and multi-disposal-site are developed for only involving upper bound of disposing capacity as well as involving lowest and the utmost disposing capacity for each disposal facility at every disposal site. Due to the complexity of models, the heuristic algorithms based on Lagrangean relaxation for these problems are elaborated.
The developed models and algorithms in the dissertation succeed and improve the existing researches about facilities location so that these results can be put into facilities locations practice in supply chain system. These works support optimization of facilities locations and relocations in supply chain system and can urge the equilibriums between customers’demand distributing and facilities sites, improve the answer for customers demand, decrease logistics cost and strengthen competition for total corporations in the supply chain system.
引文
3国家统计局.2004全国经济普查年鉴,北京:中国统计出版社,2006.
[1] Akinc, U., Khumawala, B.M. An effcient branch and bound algorithm for the capacitated warehouse location problem. Management Science, 1977(23): 585-594.
[2] Ali Amiri. Designing a distribution network in a supply chain system: Formulation and efficient solution procedure [J]. European Journal of Operational Research 2006(171): 567-576
[3] Amara R., Lipinski A. J. Business planning for an uncertain future. Pergamon Press, Oxford, 1983
[4] Andreas Klose, Andreas Drexl. Facility location models for distribution system design [J]. European Journal of Operational Research, 2005(162): 4-29
[5] Averbakh I., Berman O. Minimax regret robust median location on a network under uncertainty. Working Paper, 1997
[6] Balakrishnan, A., Magnanti, T.L., Wong, R.T. A dualascent procedure for arge-scale uncapacitated network design [J]. Operations Research, 1989(37): 716-740.
[7] Barney,T.B. Firm resources and sustained competitive advantage [J]. Journal of Management. 1991,117(1): 99-120.
[8] Barros A. and M. Labbe. A general model for the uncapacitated facility and depot location problem [J]. Location Science 1994(2): 173-191
[9] Beasley J. E. and Jornsten. K. Enhancing an algorithm for set covering problems [J]. European Journal of Operational Research, 1992( 58 ): 293-300
[10] Beasley J. E. and Chu P. C. A genetic algorithm for the set covering problem [J]. European Journal of Operational Research, 1996( 94 ): 392-404
[11] Benders J.F., Partitioning procedures for solving mixed-variables programming problems [J]. Numerische Mathematik, 1962(4): 238-252
[12] Benedict J. Three hierarchical objective models which incorporate the concept of excess coverage for locating EMS vehicles or hospital. M. Sc. Thesis. Northwestern University, EvanstonⅡ, 1983
[13] Bendiner J. Understanding supply chain optimization [J]. APICS-the performance advantage, 1998(1): 34-40.
[14] Berman O, Krass D, Drezner Z. The gradual covering decay location problem on anetwork [J]. European Journal of Operational Research, 2003, 151(3): 474-480
[15] Berman O., Krass D. Expenditures locating multiple competitive facilities: Spatial interaction models with variable expenditures [J]. Annals of Operations Research, 2002( 111): 197-225.
[16] Berman O, Krass D. The generalizedm maximal covering location problem [J]. Computers and Operations Research, 2002, 29(6): 563-581
[17] Bilde, O, Krarup, J. Sharp. Lower bounds and efficient algorithms for the simple plant location problem. Annals of Discrete Mathematics, 1977(1): 79-97
[18] Berman O. The p maximal cover: p partial center problem on networks [J]. European Journal of Operation Research, 1994 ( 72 ): 432-442
[19] Berman, O., Larson, R.C. Optimal 2-facility network districting in the presence of queuing. Transportation Science,1985(19): 261-277.
[20] Berman,O. Krass, D. Expenditures locating multiple competitive facilities: Spatial interaction models with variable expenditures [J], Annals of Operations Research, 2002(111): 197–225.
[21] Bhadury,J., Eiselt,H.A. Brand positioning under lexicographic choice rules [J]. European Journal of Operational Research, 1999(113): 1-16
[22] Bloemhof Ruwaard J. M., Fleischmann,J.A.E.E van Nunen. Reviewing distribution issues in reverse logistics, in: New Trends in Distribution Lonistics [C]. (eds.Speranza and Stahly), Sprinner, 1999: 23-44.
[23] Bram Verweij, Shabbir Ahmed, Anton J. Kleywegt, George Nemhauser, et al. The sample average approximation method applied to stochastic routing problems: A cmputation study [J]. Computational Optimization and Applications, 2003(24): 289-333
[24] Burcu B. Keskin, Halitüster. A scatter search-based heuristic to locate capacitated transshipment points [J]. Computers & Operations Research, 2007(34): 3112 - 3125
[25] Caruso C., Colorni A., Aloi L. Dominant, an algorithm for the p-center problem [J]. European Journal of Operation Research, 2003(149): 53-64
[26] Chen R. Solution of minisum and minimax location-allocation problem with euclidean distances [J]. Naval Research Logistics Quarterly, 1983(30): 449-459
[27] Chen R, Handler G. Y. A relaxation method for the solution of the minimax location-allocation problem in euclidean space [J]. Naval Research Logistics Quarterly, 1987(34): 775-788
[28] Christofides N, Beasley J. Extensions to a lagrangean relaxation approach for the capacitated warehouse location problem [J]. European Journal of Operational Research. 1983(12):19-28.
[29] Church R L, ReVelle C. Maximal covering location problem [J]. Papers of the Regional Science Association, 1974(32):101-118
[30] Church RL, Meadows ME. Location modeling uilizing maximum service distance criteria [J]. Geographical Analysis, 1979(11): 358-373
[31] Cornuejols G., M. Fisher and G. L. Nemhauser. On the uncapacitated location problem [J]. Annals of Discrete Mathmatics, 1977( 1 ): 163-177
[32] Conant, Denise T. Smart and Roberto Solano-Mendez. Generic retailing types, distinctive marketing competencies, and competitive advantage [J]. Journal of Retailing, Issue, Autumn 1993,69(3): 254-279
[33] Daniels N C, Essaides G. Time-based Competition [M]. Economic Intelligence Unit, London, 1993
[34] Dantzig G.B, Infanger G. Large-scale stochastic linear programs: Importance sampling and benders decomposition, Technical Report SOL 91-4, Operations Research Department, Stanford University, Stanford, CA, 1991.
[35] Daskin, M.S., E. H. Stern. A hierarchical objective set covering model for emergency medical service vehicle deployment [J]. Transportation Science, 1981, 15(2): 137-152
[36] Daskin, M.S. Network and discrete location: Models algorithms and applications [M]. Wiley, New York, 1995
[37] Daskin M.S. A maximum expected covering location model: Formulation properties and heuristic solution [J]. Transportation Science, 1983, 17 (1): 48-70
[38] Daskin, M.S. Coullard,C.R. Shen, Z.-J.M. An inventory-location model: Formulation, solution algorithm and computational results [J]. Annals of Operations Research, 2002(110): 83-106.
[39] Davis, P.S., Ray, T.L. A branch-bound algorithm for capacitated facilities location problem. Naval Research Logistics Quarterly, 1969(16): 331-344.
[40] Densham P., Rushton G. A more efficient heuristic for solving large p-median problems [J]. Regional Science 1992(71): 307-329.
[41] Diaz, J.A., Fernandez, E. A branch-and-price algorithm for the single source capacitated plant location problem. Technical Report, Dpt. d_Estad_?stica i Investigaci_o Operativa, Universitat Polit_ecnica de Catalunya, Barcelona, Spain,2001
[42] Dobson D, Karmarkar US. Competitive location on a network [J]. Operations Research 1987(35):565-574.
[43] Drezner T, Drezner D. Validating the gravity-based competitive location model using inferred attractiveness [J]. Annals of operations research, 2002, 111(2): 227-237
[44] Drezner T, Drezner Z. Facility location in anticipation of future competition [J]. Location Science, 1998, 6(14): 155-173
[45] Drezner T. Drezner Z. and Salhi S. Solving the multiple competitive facilities location problem [J]. European Journal of Operational research, 2002(142): 138-151
[46] Drezner Z. On the conditional p-median problem [J]. Computers and Operations Research, 1995, 22(4): 525-530
[47] Drezner Z, Wesolowsky G. O. A new method for the multifacility minimax location problem [J]. Journal of the operational research society, 1978(24): 1507-1514
[48] Eduardo Conde. Minmax regret location–allocation problem on a network under uncertainty [J]. European Journal of Operational Research, 2007(179): 1025-1039
[49] Eiselt,H.A. Laporte,G. Demand allocation functions [J]. Location Science 1998 (6): 175-187.
[50] Eiselt,H.A. Laporte,G. Sequential location problems [J]. European Journal of Operational Research 1996(96): 217-231.
[51] Eiselt H.A., Laporte G. Demand allocation functions [J]. Location Science 1998(6): 175-187.
[52] Emanuel Melachrinoudis, Hokey Min. The dynamic relocation and phase-out of a hybrid, two-echelon plant/warehousing facility: A multiple objective approach [J]. European Journal of Operational Research, 2000(123): 1-5
[53] Emanuel Melachrinoudis, Hokey Min. Redesigning a warehouse network [J]. European Journal of Operational Research 2007(176): 210-229
[54] Erlenkotter, D. A dual-based procedure for uncapacitated facility location [J]. Operations Research,1978(26): 992-1009
[55] European Parliament and Council Directive 2000/53/EC of 18 September 2000 on end-of-life vehicles. OJ L 269 21.10.2000, 34-42.
[56] Fernando Y. Chiyoshi, Roberto D. Galvao, Reinaldo Morabito. A note on solutionsto the maximal expected covering location problem [J]. Computers & Operation Research, 2002( 30 ): 87-96
[57] Fisher M. L. and Kedia P. Optimal soluteion of set covering/partitioning problems using dual heuristics [J]. Management Sience, 1990(36): 674-688
[58] Frank Plastria. Formulating logical implications in ombinatorial optimization [J]. European Journal of Operational Research. 2002 (140): 338-353
[59] Fraser Johnson P. Managing vlue in reverse logistics systems [J]. Transpn Res.-E (Logistics and Transpn Rev ),1998,34(3):217-227.
[60] Galvao, R., 1993. The use of lagrangean relaxation in the solution of uncapacitated facility location problems [J]. Location Science, 1993(1): 57-79.
[61] Garcia Perez, M.D., Pelegrin, B. A new maxprofit location model. Technical Report I-2003-07, Operations Research Center,Universidad Miguel Hernandez, Elche, Spain.
[62] Geoffrion AM, Graves GW. Multicommodity distribution system design by benders decomposition [J]. Management Science 1974,20(5): 822-44.
[63] Ghosh A., McLafferty S.L., Craig C.S. Multifacility retail networks [M]. in: Z. Drezner (Ed.), Facility Location, Springer-Verlag, 1995
[64] Glover F. Heuristics for integer programming using surrogate constraints [J]. Decision Sciences, 1977(8):156-166.
[65] Goldengorin, B., Ghosh, D., Sierksma, G. Branch and peg algorithms for the simple plant location problem [J]. Computers & Operations Research, 2003(30): 967-981.
[66] Goldman, A.J. Optimal center location in simple networks. Transportation Science, 1971(5): 212-221.
[67] Goodchild M. F. Spatial choice in location-allocation problems: the role of endogenous attraction [J]. Geographical Analysis, 1978( 10 ): 65-72
[68] Goodchild M. F. The aggregation problem in location-allocation [J]. Geographical Analysis, 1979( 11 ): 240-255
[69] Guignard, M., A lagrangean dual ascent algorithm for simple plant location problems [J]. European Journal of Operational Research, 1988(35): 193-200.
[70] Guinard M, Kim S. A strong lagrangian relaxation for capacited plant location problem [J]. Math Program, 1987(1):215-28.
[71] Guiltinan, J.P., Nwokoye, N.G. Deeloping distribution channels and systems in the emerging recycling industries [J]. International Journal of Physical Distribution,1975, 6(1), 28-38.
[72] Hakimi S.L.. Locations with spatial interactions: Competitive locations and games [M].in: P.B. Mirchandani, Discrete Location Theory, Wiley Interscience, 1990.
[73] Hakimi S.L. Optimum locations of switching centers and the absolute centers and medians of a graph [J]. Operations Research, 1964(12): 450-459
[74] Hakimi S.L. Optimum distribution of switching centers in a communication network and some related graph theoretic problems [J]. Operation Research, 1965 (13):462~475
[75] Hakimi S.L. P-median theorems for competitive location [J]. Annals of Operations Research, 1986, 5(1): 79-88
[76] Haldun Aytug and Cem Saydam. Solving large-scale maximum expected covering location problems by genetic algorithms: A comparative study [J]. European Journal of Operation Research, 2002(141): 480-494
[77] Hansen, P., Labbe, M. Algorithm for voting and competitive location on a network [J]. Transportation Science, 1988(22): 278–288
[78] Hogan K and ReVelle. C. S. Conception and applications of backup coverage [J]. Management Science, 1986( 32 ): 1432-1444
[79] Hokey Mina, Emanuel Melachrinoudis. The relocation of a hybrid manufacturing/distribution facility from supply chain perspectives: a case study [J]. Omega, Int. J. Mgmt. Sci, 1999(27): 75-85
[80] Holmberg, K. Exact solution methods for uncapacitated location with convex transportation costs [J]. European Journal of Operational Research, 1998(114): 127-140
[81] Hotelling H. Stability in competition [J], Economic Journal 1929(39): 41-57
[82] Huff D.L. Defining and estimating a trade area [J]. Journal of Marketing 1964(28): 34-38
[83] Jacobsen, S.K. Heuristics for the capacitated plant location model [J]. European Journal of Operational Research, 1983(12):253-261.
[84] Jayaraman V, Pirkul H. Planning and coordination of production and distribution facilities for multiple commodities [J]. European Journal of Operational Research 2001(133):394-408.
[85] Jianzhong Zhang, Zhenhong Liu, Zhongfan Ma. Some reverse location problems [J]. European Journal of Operational Research, 2000(124): 77-88
[86] Jorge H. Jaramillo, Joy Bhadury, Rajan Batta. On the use of genetic algorithms tosolve location problems [J]. Computers & Operations Research, 2002(29): 761-779
[87] Kaj Holmberg, Jonas Ling. A lagrangean heuristic for the facility location problem with staircase costs [J]. European Journal of Operational Research, 1997(97):63-74
[88] Kalai E, Kamien M I , Rubinovitch M. Optimal service speed in a competitive environment [J ]. Management Science, 1992, 38(8): 1154-1163
[89] Kariv, O., Hakimi, S.L. An algorithmic approach to network location problems. Part I: The p-centers. SIAM Journal of Applied Mathematics [J]. 1979(37): 513-538
[90] Kariv O, Hakimi SL. An algorithmic approach to network location problems. part 2: the p-medians [J]. SIAM Journal of Applied Mathematics, 1979(37):539-60
[91] Karp R.M. Reducibility among combinatorial problems, in: R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations. Plenium Press, New York, 1972
[92] Kariv O, Hakimi SL. An algorithmic approach to network location problems. part 2: the p-medians [J]. SIAM Journal of Applied Mathematics, 1979(37):539-60
[93] Korkel, M. On the exact solution of large-scale simple plant location problems. European Journal of Operational Research, 1989(39):157-173
[94] Laporte, G., Louveaux, F., van Hamme, L. Exact solution to a location problem with stochastic demands [J]. Transportation Science, 1994(28): 95-103.
[95] Lindhqvist T. Extended producer responsibility in cleaner production; Policy principle to promote environmental improvements of product systems. PhD thesis, Lund University,Sweden, 2000
[96] Listes, O., Dekker, R. Stochastic approaches for product recovery network design: A case study. Econometric Institute Report, Erasmus University Rotterdam , EI 2001-08
[97] Li L. The role of inventory in delivery2time competition[J ] . Management Science , 1992 , 38 (2) : 182—197.
[98] Magnanti, T.L., Wong, R.T. Network design and transportation planning: Models and algorithms [J]. Transportation Science, 1984(18):1-55.
[99] Magretta Joan. Fast, global, and entrepreneurial: Supply chain management, HongKong style, an interview with victor fund[J]. Harvard Business Review, 1998 (5):103-114
[100] Marcos Alminana, Jesus T. Pastor. An adaptation of SH heuristic to the location setcovering problem [J]. European Journal of Operational Research, 1997(100): 586-593
[101] Marianov V, Serra D. Location-allocation of multiple-server service centers with constrained queues or waiting times [J]. Annals of Operations Research, 2002, 111(1): 35-50
[102] Mark S. Daskin, Susan M. Hesse. A-rellable p-minmax regert: A new model for strategic facility location modeling [J]. Location Science, 1998, 5(4):227-246
[103] Morgan, M.G., Henrion, M. Uncertainty: A guide to dealing with uncertainty in quantitative risk and policy analysis. Cambridge University Press, New York. 1990
[104] Minieka E. The m-center problem [J]. Siam Review 1970(12):138-141.
[105] Mirchandani P.B., Francis RL (editors). Discrete location theory[M]. New York: Wiley,1990
[106] Moore G., ReVelle C. The hierarchical service location problem [J]. Management Science, 1982(28): 775-780
[107] Mortiz Fleischmann, Hans Ronald Krikke, Rommert Dekker, Simme Douwe P. Flapper. A characterisation of logistics networks for product recovery [J]. The International Journal of Managemental Science, 2000(28): 653-666.
[108] Mukundan S., Daskin M. Joint. Location/Sizing maximum profit covering models [J]. INFOR, 1991, 29(2): 139-152
[109] Nakanishi M. Cooper L. G. Parameter estimates for multiplicative competitive interaction models least square approach [J]. Journal of Marketing Research, 1974(11): 201-311
[110] Nenad Mladenovic, Jack Brimberg, Pierre Hansen, Jose Moreno-Perez. The p-median problem: A survey of metaheuristic approaches [J]. Eropean Journal of Operational Research 2007 (79):27-939
[111] Oded Berman, Dmitry Krass. The generalized maximal covering location problem [J]. Computers & Operations Research, 2002(29): 563-581
[112] Oded Berman, Dmitry Krass, Zvi Drezner. The gradual covering decay location problem on a network [J]. European Journal of Operational Reseach, 2003(151): 474-480
[113] Qian Wang, Rajan Batta; Joyendu Bhadury, Christopher M. Rump. Budget constrained location problem with opening and closing of facilities [J]. Computers & Operations Research, 2003(30):2047-2069
[114] Orhan Karasakal, Esra K. Karasaka. A maximal covering location model in thepresence of partial coverage [J]. Computers & Operations Research, 2004(31):1515-1526
[115] Ovidiu Listes, Rommert Dekker. A stochastic approach to a case study for product recovery network design [J].European Journal of Operational Research, 2005 (160):269-287
[116] Pirkul H, Jayaraman V. A multi commodity, multi-plant, capacitated facility location problem: formulation and efficient heuristic solution [J]. Computers and Operations Research, 1998(25):869-78.
[117] Plane D, R. T. E. Hendrick. Mathematical programming and the location of fire companies for the denver fire department [J]. Operations Research, 1977(25): 563-578
[118] Plastria, F. Static competitive facility location: An overview of optimisation approaches [J]. European Journal of Operational Research, 2001(129):461-470.
[119] Pohlen, T.L., Farris II,M. Reverse logistiscs in plastic recycling [J]. International Journal of Physical Distribution & Logistics management, 1992, 22(7):35-47
[120] Qian Wang, Rajan Batta, Joyendu Bhadury, Christopher M. Rumpa. Budget constrained location problem with opening and closing of facilities [J]. Computers & Operations Research, 2003(30): 2047-2069
[121] Rafael Marti, Manuel Laguna. Fred Glover Principles of scatter search [J]. European Journal of Operational Research, 2006(169):359-372
[122] ReVelle C, Serra S. Competitive location in discrete space [M]. In: Drezner Z, editor. Facility location: a survey of applications and methods. Berlin: Springer, 1995.
[123] ReVelle, C.S., Swain, R.W., Central facilities location. Geographical Analysis [J]. 1970(2): 30-42
[124] ReVelle C.S., Toregas C., Falkson L. Applications of the location set covering problem [J]. Geographical Analysis, 1976(8): 67-76.
[125] ReVelle C.S. The maximum capture or sphere of influence location problem: hotelling revisited on a network [J]. Journal of Regional Science, 1986, 26 (2): 343-358
[126] Risto Lahdelma, Pekka Salminen, Joonas Hokkanen. Locating a waste treatment facility by using stochastic multicriteria acceptability analysis with ordinal criteria [J]. European Journal of Operational Research, 2002(142): 345-356
[127] Robert Aboolian, Oded Berman, Dmitry Krass. Competitive facility location modelwith concave demand [J]. European Journal of Operational Research, 2007(181):598-619.
[128] Robert Aboolian, Oded Berman, Dmitry Krass.Competitive facility location and design problem [J].European Journal of Operational Research,2007(182):40-62
[129] Roberto Baldacci, Eleni Hadjiconstantinou, Bittorio Maniezzo, Aristide Mingozzi. A new method for solving capacitated location problems based on a set partitioning approach [J]. Computers & Operation Research, 2002(29): 365-386
[130] Roberto D. Galvao, Luis Gonzalo Acosta Espejo, Brian Boffey. A comparison of lagrangean and surrogate relaxations for the maximal covering location problem [J]. European Journal of Operational Research, 2000(124):377-389
[131] Rosing K.E, ReVelle C.S. Heuristic concentration: two stage solution construction [J]. European Journal of Operational Research, 1997(97): 75-86.
[132] Rosing K.E.,C.S. ReVelle,D.A. Schilling. A gamma heuristic for the p-median problem [J]. European Journal of Operational Research, 1999(117): 522-532.
[133] Rosing, K.E, ReVelle, C., Rolland, E., Schilling, D., Current, J. Heuristic concentration and Tabu search: A head to head comparison [J]. European Journal of Operational Research, 1998( 104 ): 93-99
[134] Roth. R. Computer solutions to minimum cover problems [J]. Operation Research, 1969(17): 455-465
[135] Roy T.J. A cross decomposition algorithm for capacitated facility location [J]. Operations Research, 1986(34): 145-163
[136] Sarkis, J., Darnall, N., Nehman, G., Priest, J. The role of supply chain management with in the industrial ecosystem [C]. In Proceedings of the IEEE International Symposium on Electronics and the Environment, Orlando, FL, 1995:229-234
[137] Sanjay Melkote, Marks S. Daskin. An integration model of facility location and transportation network design [J]. Transportation Research Part A 2001(35):515-538
[138] Sanjay Melkote, Mark S. Daskin. Capacitated facility location/network design problems [J]. European Journal of Operational Research 2001 (129):481-495
[139] Serra, S. Ratick, Revelle C. The maximum capture problem with uncertainty [J]. Environment and Planning, 1996(23): 49-59
[140] Shen, Z.J.M. Coullard,C.R. Daskin,M.S. A joint location-inventory model [J]. Transportation Science, 2003(37): 40-55.
[141] Shine-Der Lee. On solving unreliable planar location problems [J]. Computers & Operations Research, 2001(28): 329-344
[142] Siddhartha S. Syam. A model and methodologies for the location problem with logistical componentsm [J]. Computers &Operations Research, 2002(29):1173-1193
[143] Spicer, A.J. Johnson, M.R. Third-party demanufacturing as a solution for extended producer responsibility [J]. Journal of Cleaner Production, 2004(12): 37-45
[144] Stalk GJ, Hout TM. Competing against time: How time based competition is reshaping global markets [M] . New York : Free Press, 1990
[145] Stefano Benati , Pierre Hansen. The maximum capture problem with random utilities: Problem formulation and algorithms [J]. European Journal of Operational Research, 2002(143):518-530
[146] Swain R. A parametric decomposition approach for the solution of uncapacitated location problems [J]. Management Science, 1974(21): 189-198
[147] Tapiero C. S. Transportation-location-allocation problems over time [J]. Journal of Regional Science, 1971, 11(3): 377-384
[148] Teitz, M., Bart, P. Heuristic methods for estimating the generalized vertex median of a weighted graph [J]. Operations Research, 1968(16): 955-961
[149] Toregas C., Swain R., ReVelle C., Bergman L. The location of emergency service facilities [J]. Operations Research, 1971(19):1363-1373
[150] Tragantalerngsak S, Holt J, Ronnqvist M. An exact method for the two-echelon, single source, capacitated facility location problem [J]. European Journal of Operational Research, 2000(123):473-89
[151] Vaidyanathan Jayaraman, Raymond A. Patterson, Erik Rolland. The design of reverse distribution network: Models and solution procedures [J]. European Jouranal of Operational Research, 2003(150):128-149
[152] Van Roy T.J. A cross decomposition algorithm for capacitated facility location [J]. Operations Research, 1986(4): 145-163
[153] Van der Heijden K. Probabilistic planning and scenario planning. in: G. Wright, P. Ayton(Eds. ), Subjective Probability, Ch. 22, Wiley, New York, 1994: 549-572
[154] Vanston J. H., Frisbie W. P., S. C. Lopreato, D. L. Poston. Alternate scenario planning [J]. Technological Forecasting and Social Change, 1977(10): 159-180
[155] Ward J. E. and R. E. Wendell. Using block norms for location modeling [J]. Operations Research, 1985(33): 1074-1090
[156] Webber A. Ueber den standort der industrien. Erster Teil. Reine Theorie der Standorte. Mit einem mathematixchen Anhang von G. Pick. Tubingen, Germany: Verlag J. C. B. Mohr, 1909
[157] Wesolowsky G. O. Truscott W. G. The multiperiod location-allocation problem with relocation of facilities [J]. Management Science, 1976, 22 (1): 57-65
[158] Yuri Levin, Adi Ben-Israel. A heuristic method for large-scale multi-facility location problems [J]. Computers & Operations Research, 2004( 31): 257-272
[159] Zvi Drezner, Gerrge O. Wsolowsky. Allocation of demand when cost is demand-dependent [J]. Computers & Operation Research, 1999(26):1-15
[160]陈功玉,阳明明.论中国企业的供应链管理[J].中山大学学报, 2003(6):76-82
[161]柴跃廷,刘义.敏捷供需链管理[M].北京:清华大学出版社,2001.9
[162]葛亚军,金宜英,聂永丰.电子废弃物回收管理现状与研究[J].环境科学与技术, 2006(3):61-63
[163]黄昌富.国际零售业巨头在华战略布局与中国零售企业对策[J].商业研究, 2003(24):4- 6
[164]罗洪程.我国零售业态的区域竞争态势分析[J].消费导报,2007(10):63-64.
[165]李步祥等.我国电子废弃物管理与资源化对策[J].环境污染治理技术与设备, 2005(10):13- 20
[166]达庆利,黄祖庆,张钦.逆向物流系统结构研究的现状及展望[J].中国管理科学,2004(2): 131-138
[167]马士华,林勇,陈志祥.供应链管理[M].北京机械工业出版社,2004.
[168]马祖军,代颖.产品回收逆向物流网络优化设计模型[J].管理工程学报2005(4):114-117
[169]马云峰等.基于时间满意的最大覆盖选址问题[J].中国管理科学,2006(2):45-50
[170]沈厚才,陶青,陈煜波.供应链管理理论与方法[J].中国管理科学,2000(3):1-9
[171]孙元欣,黄培清.竞争型连锁经营网点选址模型与遗传算法.科学学与科学技术管理, 2001(10): 60-63
[172]滕吉,林逢春.电子废物立法及其实施效果国际比较[J].环境保护,2004(1):21- 28
[173]彭锦,刘宝碇.不确定规划的研究现状及其发展前景[J].运筹与管理, 2002(2):12-16
[174]王嘉鹏.基于企业边界理论的物流联盟经营模式研究[J].兰州学刊,2007(3):60-61
[175]王微.全球采购与供应链整合对中国经济的影响[J].铁道货运,2004(6):10-12
[176]王兆华,尹建华.基于生产者责任延伸制度的我国电子废弃物管理研究[J].北京理工大学学报(社会科学版),2006(4):16-20
[177]汪旭晖.跨国零售企业进军中国市场的动因与策略[J].市场营销导报,2007(3):14-18
[178]魏洁,李军.EPR下的逆向物流回收模式选择研究[J].中国管理科学,2005(6):18-22
[179]戢守峰.我国零售业竞争取胜的法宝—核心竞争力分析.商业研究, 2002(5): 1-3
[180]杨波,梁木梁,唐启鹤.物流配送中心选址的随机数学模型[J].中国管理科学,2002(10): 57-61
[181]杨丰梅,华国伟,黎建强.一个竞争选址问题的新模型及其求解算法[J].系统工程理论与实践, 2006(7): 18-24
[182]叶耀华,丁文霞,蒋怡乐.一种需求不确定的有容量网络设计问题求解方法[J].复旦大学(自然科学版),2005(12): 1004-1015
[183]周根贵,曹振宇.遗传算法在逆向物流网络选址问题中的应用研究[J].中国管理科学,2005(2):42-47
[184]张莉丽,姚恩瑜.一类带单源约束的选址运输问题算法研究[J].运筹与管理, 2006(4): 61-17
[1] Akinc, U., Khumawala, B.M. An effcient branch and bound algorithm for the capacitated warehouse location problem. Management Science, 1977(23): 585-594.
[2] Ali Amiri. Designing a distribution network in a supply chain system: Formulation and efficient solution procedure [J]. European Journal of Operational Research 2006(171): 567-576
[3] Amara R., Lipinski A. J. Business planning for an uncertain future. Pergamon Press, Oxford, 1983
[4] Andreas Klose, Andreas Drexl. Facility location models for distribution system design [J]. European Journal of Operational Research, 2005(162): 4-29
[5] Averbakh I., Berman O. Minimax regret robust median location on a network under uncertainty. Working Paper, 1997
[6] Balakrishnan, A., Magnanti, T.L., Wong, R.T. A dualascent procedure for arge-scale uncapacitated network design [J]. Operations Research, 1989(37): 716-740.
[7] Barney,T.B. Firm resources and sustained competitive advantage [J]. Journal of Management. 1991,117(1): 99-120.
[8] Barros A. and M. Labbe. A general model for the uncapacitated facility and depot location problem [J]. Location Science 1994(2): 173-191
[9] Beasley J. E. and Jornsten. K. Enhancing an algorithm for set covering problems [J]. European Journal of Operational Research, 1992( 58 ): 293-300
[10] Beasley J. E. and Chu P. C. A genetic algorithm for the set covering problem [J]. European Journal of Operational Research, 1996( 94 ): 392-404
[11] Benders J.F., Partitioning procedures for solving mixed-variables programming problems [J]. Numerische Mathematik, 1962(4): 238-252
[12] Benedict J. Three hierarchical objective models which incorporate the concept of excess coverage for locating EMS vehicles or hospital. M. Sc. Thesis. Northwestern University, EvanstonⅡ, 1983
[13] Bendiner J. Understanding supply chain optimization [J]. APICS-the performance advantage, 1998(1): 34-40.
[14] Berman O, Krass D, Drezner Z. The gradual covering decay location problem on anetwork [J]. European Journal of Operational Research, 2003, 151(3): 474-480
[15] Berman O., Krass D. Expenditures locating multiple competitive facilities: Spatial interaction models with variable expenditures [J]. Annals of Operations Research, 2002( 111): 197-225.
[16] Berman O, Krass D. The generalizedm maximal covering location problem [J]. Computers and Operations Research, 2002, 29(6): 563-581
[17] Bilde, O, Krarup, J. Sharp. Lower bounds and efficient algorithms for the simple plant location problem. Annals of Discrete Mathematics, 1977(1): 79-97
[18] Berman O. The p maximal cover: p partial center problem on networks [J]. European Journal of Operation Research, 1994 ( 72 ): 432-442
[19] Berman, O., Larson, R.C. Optimal 2-facility network districting in the presence of queuing. Transportation Science,1985(19): 261-277.
[20] Berman,O. Krass, D. Expenditures locating multiple competitive facilities: Spatial interaction models with variable expenditures [J], Annals of Operations Research, 2002(111): 197–225.
[21] Bhadury,J., Eiselt,H.A. Brand positioning under lexicographic choice rules [J]. European Journal of Operational Research, 1999(113): 1-16
[22] Bloemhof Ruwaard J. M., Fleischmann,J.A.E.E van Nunen. Reviewing distribution issues in reverse logistics, in: New Trends in Distribution Lonistics [C]. (eds.Speranza and Stahly), Sprinner, 1999: 23-44.
[23] Bram Verweij, Shabbir Ahmed, Anton J. Kleywegt, George Nemhauser, et al. The sample average approximation method applied to stochastic routing problems: A cmputation study [J]. Computational Optimization and Applications, 2003(24): 289-333
[24] Burcu B. Keskin, Halitüster. A scatter search-based heuristic to locate capacitated transshipment points [J]. Computers & Operations Research, 2007(34): 3112 - 3125
[25] Caruso C., Colorni A., Aloi L. Dominant, an algorithm for the p-center problem [J]. European Journal of Operation Research, 2003(149): 53-64
[26] Chen R. Solution of minisum and minimax location-allocation problem with euclidean distances [J]. Naval Research Logistics Quarterly, 1983(30): 449-459
[27] Chen R, Handler G. Y. A relaxation method for the solution of the minimax location-allocation problem in euclidean space [J]. Naval Research Logistics Quarterly, 1987(34): 775-788
[28] Christofides N, Beasley J. Extensions to a lagrangean relaxation approach for the capacitated warehouse location problem [J]. European Journal of Operational Research. 1983(12):19-28.
[29] Church R L, ReVelle C. Maximal covering location problem [J]. Papers of the Regional Science Association, 1974(32):101-118
[30] Church RL, Meadows ME. Location modeling uilizing maximum service distance criteria [J]. Geographical Analysis, 1979(11): 358-373
[31] Cornuejols G., M. Fisher and G. L. Nemhauser. On the uncapacitated location problem [J]. Annals of Discrete Mathmatics, 1977( 1 ): 163-177
[32] Conant, Denise T. Smart and Roberto Solano-Mendez. Generic retailing types, distinctive marketing competencies, and competitive advantage [J]. Journal of Retailing, Issue, Autumn 1993,69(3): 254-279
[33] Daniels N C, Essaides G. Time-based Competition [M]. Economic Intelligence Unit, London, 1993
[34] Dantzig G.B, Infanger G. Large-scale stochastic linear programs: Importance sampling and benders decomposition, Technical Report SOL 91-4, Operations Research Department, Stanford University, Stanford, CA, 1991.
[35] Daskin, M.S., E. H. Stern. A hierarchical objective set covering model for emergency medical service vehicle deployment [J]. Transportation Science, 1981, 15(2): 137-152
[36] Daskin, M.S. Network and discrete location: Models algorithms and applications [M]. Wiley, New York, 1995
[37] Daskin M.S. A maximum expected covering location model: Formulation properties and heuristic solution [J]. Transportation Science, 1983, 17 (1): 48-70
[38] Daskin, M.S. Coullard,C.R. Shen, Z.-J.M. An inventory-location model: Formulation, solution algorithm and computational results [J]. Annals of Operations Research, 2002(110): 83-106.
[39] Davis, P.S., Ray, T.L. A branch-bound algorithm for capacitated facilities location problem. Naval Research Logistics Quarterly, 1969(16): 331-344.
[40] Densham P., Rushton G. A more efficient heuristic for solving large p-median problems [J]. Regional Science 1992(71): 307-329.
[41] Diaz, J.A., Fernandez, E. A branch-and-price algorithm for the single source capacitated plant location problem. Technical Report, Dpt. d_Estad_?stica i Investigaci_o Operativa, Universitat Polit_ecnica de Catalunya, Barcelona, Spain,2001
[42] Dobson D, Karmarkar US. Competitive location on a network [J]. Operations Research 1987(35):565-574.
[43] Drezner T, Drezner D. Validating the gravity-based competitive location model using inferred attractiveness [J]. Annals of operations research, 2002, 111(2): 227-237
[44] Drezner T, Drezner Z. Facility location in anticipation of future competition [J]. Location Science, 1998, 6(14): 155-173
[45] Drezner T. Drezner Z. and Salhi S. Solving the multiple competitive facilities location problem [J]. European Journal of Operational research, 2002(142): 138-151
[46] Drezner Z. On the conditional p-median problem [J]. Computers and Operations Research, 1995, 22(4): 525-530
[47] Drezner Z, Wesolowsky G. O. A new method for the multifacility minimax location problem [J]. Journal of the operational research society, 1978(24): 1507-1514
[48] Eduardo Conde. Minmax regret location–allocation problem on a network under uncertainty [J]. European Journal of Operational Research, 2007(179): 1025-1039
[49] Eiselt,H.A. Laporte,G. Demand allocation functions [J]. Location Science 1998 (6): 175-187.
[50] Eiselt,H.A. Laporte,G. Sequential location problems [J]. European Journal of Operational Research 1996(96): 217-231.
[51] Eiselt H.A., Laporte G. Demand allocation functions [J]. Location Science 1998(6): 175-187.
[52] Emanuel Melachrinoudis, Hokey Min. The dynamic relocation and phase-out of a hybrid, two-echelon plant/warehousing facility: A multiple objective approach [J]. European Journal of Operational Research, 2000(123): 1-5
[53] Emanuel Melachrinoudis, Hokey Min. Redesigning a warehouse network [J]. European Journal of Operational Research 2007(176): 210-229
[54] Erlenkotter, D. A dual-based procedure for uncapacitated facility location [J]. Operations Research,1978(26): 992-1009
[55] European Parliament and Council Directive 2000/53/EC of 18 September 2000 on end-of-life vehicles. OJ L 269 21.10.2000, 34-42.
[56] Fernando Y. Chiyoshi, Roberto D. Galvao, Reinaldo Morabito. A note on solutionsto the maximal expected covering location problem [J]. Computers & Operation Research, 2002( 30 ): 87-96
[57] Fisher M. L. and Kedia P. Optimal soluteion of set covering/partitioning problems using dual heuristics [J]. Management Sience, 1990(36): 674-688
[58] Frank Plastria. Formulating logical implications in ombinatorial optimization [J]. European Journal of Operational Research. 2002 (140): 338-353
[59] Fraser Johnson P. Managing vlue in reverse logistics systems [J]. Transpn Res.-E (Logistics and Transpn Rev ),1998,34(3):217-227.
[60] Galvao, R., 1993. The use of lagrangean relaxation in the solution of uncapacitated facility location problems [J]. Location Science, 1993(1): 57-79.
[61] Garcia Perez, M.D., Pelegrin, B. A new maxprofit location model. Technical Report I-2003-07, Operations Research Center,Universidad Miguel Hernandez, Elche, Spain.
[62] Geoffrion AM, Graves GW. Multicommodity distribution system design by benders decomposition [J]. Management Science 1974,20(5): 822-44.
[63] Ghosh A., McLafferty S.L., Craig C.S. Multifacility retail networks [M]. in: Z. Drezner (Ed.), Facility Location, Springer-Verlag, 1995
[64] Glover F. Heuristics for integer programming using surrogate constraints [J]. Decision Sciences, 1977(8):156-166.
[65] Goldengorin, B., Ghosh, D., Sierksma, G. Branch and peg algorithms for the simple plant location problem [J]. Computers & Operations Research, 2003(30): 967-981.
[66] Goldman, A.J. Optimal center location in simple networks. Transportation Science, 1971(5): 212-221.
[67] Goodchild M. F. Spatial choice in location-allocation problems: the role of endogenous attraction [J]. Geographical Analysis, 1978( 10 ): 65-72
[68] Goodchild M. F. The aggregation problem in location-allocation [J]. Geographical Analysis, 1979( 11 ): 240-255
[69] Guignard, M., A lagrangean dual ascent algorithm for simple plant location problems [J]. European Journal of Operational Research, 1988(35): 193-200.
[70] Guinard M, Kim S. A strong lagrangian relaxation for capacited plant location problem [J]. Math Program, 1987(1):215-28.
[71] Guiltinan, J.P., Nwokoye, N.G. Deeloping distribution channels and systems in the emerging recycling industries [J]. International Journal of Physical Distribution,1975, 6(1), 28-38.
[72] Hakimi S.L.. Locations with spatial interactions: Competitive locations and games [M].in: P.B. Mirchandani, Discrete Location Theory, Wiley Interscience, 1990.
[73] Hakimi S.L. Optimum locations of switching centers and the absolute centers and medians of a graph [J]. Operations Research, 1964(12): 450-459
[74] Hakimi S.L. Optimum distribution of switching centers in a communication network and some related graph theoretic problems [J]. Operation Research, 1965 (13):462~475
[75] Hakimi S.L. P-median theorems for competitive location [J]. Annals of Operations Research, 1986, 5(1): 79-88
[76] Haldun Aytug and Cem Saydam. Solving large-scale maximum expected covering location problems by genetic algorithms: A comparative study [J]. European Journal of Operation Research, 2002(141): 480-494
[77] Hansen, P., Labbe, M. Algorithm for voting and competitive location on a network [J]. Transportation Science, 1988(22): 278–288
[78] Hogan K and ReVelle. C. S. Conception and applications of backup coverage [J]. Management Science, 1986( 32 ): 1432-1444
[79] Hokey Mina, Emanuel Melachrinoudis. The relocation of a hybrid manufacturing/distribution facility from supply chain perspectives: a case study [J]. Omega, Int. J. Mgmt. Sci, 1999(27): 75-85
[80] Holmberg, K. Exact solution methods for uncapacitated location with convex transportation costs [J]. European Journal of Operational Research, 1998(114): 127-140
[81] Hotelling H. Stability in competition [J], Economic Journal 1929(39): 41-57
[82] Huff D.L. Defining and estimating a trade area [J]. Journal of Marketing 1964(28): 34-38
[83] Jacobsen, S.K. Heuristics for the capacitated plant location model [J]. European Journal of Operational Research, 1983(12):253-261.
[84] Jayaraman V, Pirkul H. Planning and coordination of production and distribution facilities for multiple commodities [J]. European Journal of Operational Research 2001(133):394-408.
[85] Jianzhong Zhang, Zhenhong Liu, Zhongfan Ma. Some reverse location problems [J]. European Journal of Operational Research, 2000(124): 77-88
[86] Jorge H. Jaramillo, Joy Bhadury, Rajan Batta. On the use of genetic algorithms tosolve location problems [J]. Computers & Operations Research, 2002(29): 761-779
[87] Kaj Holmberg, Jonas Ling. A lagrangean heuristic for the facility location problem with staircase costs [J]. European Journal of Operational Research, 1997(97):63-74
[88] Kalai E, Kamien M I , Rubinovitch M. Optimal service speed in a competitive environment [J ]. Management Science, 1992, 38(8): 1154-1163
[89] Kariv, O., Hakimi, S.L. An algorithmic approach to network location problems. Part I: The p-centers. SIAM Journal of Applied Mathematics [J]. 1979(37): 513-538
[90] Kariv O, Hakimi SL. An algorithmic approach to network location problems. part 2: the p-medians [J]. SIAM Journal of Applied Mathematics, 1979(37):539-60
[91] Karp R.M. Reducibility among combinatorial problems, in: R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations. Plenium Press, New York, 1972
[92] Kariv O, Hakimi SL. An algorithmic approach to network location problems. part 2: the p-medians [J]. SIAM Journal of Applied Mathematics, 1979(37):539-60
[93] Korkel, M. On the exact solution of large-scale simple plant location problems. European Journal of Operational Research, 1989(39):157-173
[94] Laporte, G., Louveaux, F., van Hamme, L. Exact solution to a location problem with stochastic demands [J]. Transportation Science, 1994(28): 95-103.
[95] Lindhqvist T. Extended producer responsibility in cleaner production; Policy principle to promote environmental improvements of product systems. PhD thesis, Lund University,Sweden, 2000
[96] Listes, O., Dekker, R. Stochastic approaches for product recovery network design: A case study. Econometric Institute Report, Erasmus University Rotterdam , EI 2001-08
[97] Li L. The role of inventory in delivery2time competition[J ] . Management Science , 1992 , 38 (2) : 182—197.
[98] Magnanti, T.L., Wong, R.T. Network design and transportation planning: Models and algorithms [J]. Transportation Science, 1984(18):1-55.
[99] Magretta Joan. Fast, global, and entrepreneurial: Supply chain management, HongKong style, an interview with victor fund[J]. Harvard Business Review, 1998 (5):103-114
[100] Marcos Alminana, Jesus T. Pastor. An adaptation of SH heuristic to the location setcovering problem [J]. European Journal of Operational Research, 1997(100): 586-593
[101] Marianov V, Serra D. Location-allocation of multiple-server service centers with constrained queues or waiting times [J]. Annals of Operations Research, 2002, 111(1): 35-50
[102] Mark S. Daskin, Susan M. Hesse. A-rellable p-minmax regert: A new model for strategic facility location modeling [J]. Location Science, 1998, 5(4):227-246
[103] Morgan, M.G., Henrion, M. Uncertainty: A guide to dealing with uncertainty in quantitative risk and policy analysis. Cambridge University Press, New York. 1990
[104] Minieka E. The m-center problem [J]. Siam Review 1970(12):138-141.
[105] Mirchandani P.B., Francis RL (editors). Discrete location theory[M]. New York: Wiley,1990
[106] Moore G., ReVelle C. The hierarchical service location problem [J]. Management Science, 1982(28): 775-780
[107] Mortiz Fleischmann, Hans Ronald Krikke, Rommert Dekker, Simme Douwe P. Flapper. A characterisation of logistics networks for product recovery [J]. The International Journal of Managemental Science, 2000(28): 653-666.
[108] Mukundan S., Daskin M. Joint. Location/Sizing maximum profit covering models [J]. INFOR, 1991, 29(2): 139-152
[109] Nakanishi M. Cooper L. G. Parameter estimates for multiplicative competitive interaction models least square approach [J]. Journal of Marketing Research, 1974(11): 201-311
[110] Nenad Mladenovic, Jack Brimberg, Pierre Hansen, Jose Moreno-Perez. The p-median problem: A survey of metaheuristic approaches [J]. Eropean Journal of Operational Research 2007 (79):27-939
[111] Oded Berman, Dmitry Krass. The generalized maximal covering location problem [J]. Computers & Operations Research, 2002(29): 563-581
[112] Oded Berman, Dmitry Krass, Zvi Drezner. The gradual covering decay location problem on a network [J]. European Journal of Operational Reseach, 2003(151): 474-480
[113] Qian Wang, Rajan Batta; Joyendu Bhadury, Christopher M. Rump. Budget constrained location problem with opening and closing of facilities [J]. Computers & Operations Research, 2003(30):2047-2069
[114] Orhan Karasakal, Esra K. Karasaka. A maximal covering location model in thepresence of partial coverage [J]. Computers & Operations Research, 2004(31):1515-1526
[115] Ovidiu Listes, Rommert Dekker. A stochastic approach to a case study for product recovery network design [J].European Journal of Operational Research, 2005 (160):269-287
[116] Pirkul H, Jayaraman V. A multi commodity, multi-plant, capacitated facility location problem: formulation and efficient heuristic solution [J]. Computers and Operations Research, 1998(25):869-78.
[117] Plane D, R. T. E. Hendrick. Mathematical programming and the location of fire companies for the denver fire department [J]. Operations Research, 1977(25): 563-578
[118] Plastria, F. Static competitive facility location: An overview of optimisation approaches [J]. European Journal of Operational Research, 2001(129):461-470.
[119] Pohlen, T.L., Farris II,M. Reverse logistiscs in plastic recycling [J]. International Journal of Physical Distribution & Logistics management, 1992, 22(7):35-47
[120] Qian Wang, Rajan Batta, Joyendu Bhadury, Christopher M. Rumpa. Budget constrained location problem with opening and closing of facilities [J]. Computers & Operations Research, 2003(30): 2047-2069
[121] Rafael Marti, Manuel Laguna. Fred Glover Principles of scatter search [J]. European Journal of Operational Research, 2006(169):359-372
[122] ReVelle C, Serra S. Competitive location in discrete space [M]. In: Drezner Z, editor. Facility location: a survey of applications and methods. Berlin: Springer, 1995.
[123] ReVelle, C.S., Swain, R.W., Central facilities location. Geographical Analysis [J]. 1970(2): 30-42
[124] ReVelle C.S., Toregas C., Falkson L. Applications of the location set covering problem [J]. Geographical Analysis, 1976(8): 67-76.
[125] ReVelle C.S. The maximum capture or sphere of influence location problem: hotelling revisited on a network [J]. Journal of Regional Science, 1986, 26 (2): 343-358
[126] Risto Lahdelma, Pekka Salminen, Joonas Hokkanen. Locating a waste treatment facility by using stochastic multicriteria acceptability analysis with ordinal criteria [J]. European Journal of Operational Research, 2002(142): 345-356
[127] Robert Aboolian, Oded Berman, Dmitry Krass. Competitive facility location modelwith concave demand [J]. European Journal of Operational Research, 2007(181):598-619.
[128] Robert Aboolian, Oded Berman, Dmitry Krass.Competitive facility location and design problem [J].European Journal of Operational Research,2007(182):40-62
[129] Roberto Baldacci, Eleni Hadjiconstantinou, Bittorio Maniezzo, Aristide Mingozzi. A new method for solving capacitated location problems based on a set partitioning approach [J]. Computers & Operation Research, 2002(29): 365-386
[130] Roberto D. Galvao, Luis Gonzalo Acosta Espejo, Brian Boffey. A comparison of lagrangean and surrogate relaxations for the maximal covering location problem [J]. European Journal of Operational Research, 2000(124):377-389
[131] Rosing K.E, ReVelle C.S. Heuristic concentration: two stage solution construction [J]. European Journal of Operational Research, 1997(97): 75-86.
[132] Rosing K.E.,C.S. ReVelle,D.A. Schilling. A gamma heuristic for the p-median problem [J]. European Journal of Operational Research, 1999(117): 522-532.
[133] Rosing, K.E, ReVelle, C., Rolland, E., Schilling, D., Current, J. Heuristic concentration and Tabu search: A head to head comparison [J]. European Journal of Operational Research, 1998( 104 ): 93-99
[134] Roth. R. Computer solutions to minimum cover problems [J]. Operation Research, 1969(17): 455-465
[135] Roy T.J. A cross decomposition algorithm for capacitated facility location [J]. Operations Research, 1986(34): 145-163
[136] Sarkis, J., Darnall, N., Nehman, G., Priest, J. The role of supply chain management with in the industrial ecosystem [C]. In Proceedings of the IEEE International Symposium on Electronics and the Environment, Orlando, FL, 1995:229-234
[137] Sanjay Melkote, Marks S. Daskin. An integration model of facility location and transportation network design [J]. Transportation Research Part A 2001(35):515-538
[138] Sanjay Melkote, Mark S. Daskin. Capacitated facility location/network design problems [J]. European Journal of Operational Research 2001 (129):481-495
[139] Serra, S. Ratick, Revelle C. The maximum capture problem with uncertainty [J]. Environment and Planning, 1996(23): 49-59
[140] Shen, Z.J.M. Coullard,C.R. Daskin,M.S. A joint location-inventory model [J]. Transportation Science, 2003(37): 40-55.
[141] Shine-Der Lee. On solving unreliable planar location problems [J]. Computers & Operations Research, 2001(28): 329-344
[142] Siddhartha S. Syam. A model and methodologies for the location problem with logistical componentsm [J]. Computers &Operations Research, 2002(29):1173-1193
[143] Spicer, A.J. Johnson, M.R. Third-party demanufacturing as a solution for extended producer responsibility [J]. Journal of Cleaner Production, 2004(12): 37-45
[144] Stalk GJ, Hout TM. Competing against time: How time based competition is reshaping global markets [M] . New York : Free Press, 1990
[145] Stefano Benati , Pierre Hansen. The maximum capture problem with random utilities: Problem formulation and algorithms [J]. European Journal of Operational Research, 2002(143):518-530
[146] Swain R. A parametric decomposition approach for the solution of uncapacitated location problems [J]. Management Science, 1974(21): 189-198
[147] Tapiero C. S. Transportation-location-allocation problems over time [J]. Journal of Regional Science, 1971, 11(3): 377-384
[148] Teitz, M., Bart, P. Heuristic methods for estimating the generalized vertex median of a weighted graph [J]. Operations Research, 1968(16): 955-961
[149] Toregas C., Swain R., ReVelle C., Bergman L. The location of emergency service facilities [J]. Operations Research, 1971(19):1363-1373
[150] Tragantalerngsak S, Holt J, Ronnqvist M. An exact method for the two-echelon, single source, capacitated facility location problem [J]. European Journal of Operational Research, 2000(123):473-89
[151] Vaidyanathan Jayaraman, Raymond A. Patterson, Erik Rolland. The design of reverse distribution network: Models and solution procedures [J]. European Jouranal of Operational Research, 2003(150):128-149
[152] Van Roy T.J. A cross decomposition algorithm for capacitated facility location [J]. Operations Research, 1986(4): 145-163
[153] Van der Heijden K. Probabilistic planning and scenario planning. in: G. Wright, P. Ayton(Eds. ), Subjective Probability, Ch. 22, Wiley, New York, 1994: 549-572
[154] Vanston J. H., Frisbie W. P., S. C. Lopreato, D. L. Poston. Alternate scenario planning [J]. Technological Forecasting and Social Change, 1977(10): 159-180
[155] Ward J. E. and R. E. Wendell. Using block norms for location modeling [J]. Operations Research, 1985(33): 1074-1090
[156] Webber A. Ueber den standort der industrien. Erster Teil. Reine Theorie der Standorte. Mit einem mathematixchen Anhang von G. Pick. Tubingen, Germany: Verlag J. C. B. Mohr, 1909
[157] Wesolowsky G. O. Truscott W. G. The multiperiod location-allocation problem with relocation of facilities [J]. Management Science, 1976, 22 (1): 57-65
[158] Yuri Levin, Adi Ben-Israel. A heuristic method for large-scale multi-facility location problems [J]. Computers & Operations Research, 2004( 31): 257-272
[159] Zvi Drezner, Gerrge O. Wsolowsky. Allocation of demand when cost is demand-dependent [J]. Computers & Operation Research, 1999(26):1-15
[160]陈功玉,阳明明.论中国企业的供应链管理[J].中山大学学报, 2003(6):76-82
[161]柴跃廷,刘义.敏捷供需链管理[M].北京:清华大学出版社,2001.9
[162]葛亚军,金宜英,聂永丰.电子废弃物回收管理现状与研究[J].环境科学与技术, 2006(3):61-63
[163]黄昌富.国际零售业巨头在华战略布局与中国零售企业对策[J].商业研究, 2003(24):4- 6
[164]罗洪程.我国零售业态的区域竞争态势分析[J].消费导报,2007(10):63-64.
[165]李步祥等.我国电子废弃物管理与资源化对策[J].环境污染治理技术与设备, 2005(10):13- 20
[166]达庆利,黄祖庆,张钦.逆向物流系统结构研究的现状及展望[J].中国管理科学,2004(2): 131-138
[167]马士华,林勇,陈志祥.供应链管理[M].北京机械工业出版社,2004.
[168]马祖军,代颖.产品回收逆向物流网络优化设计模型[J].管理工程学报2005(4):114-117
[169]马云峰等.基于时间满意的最大覆盖选址问题[J].中国管理科学,2006(2):45-50
[170]沈厚才,陶青,陈煜波.供应链管理理论与方法[J].中国管理科学,2000(3):1-9
[171]孙元欣,黄培清.竞争型连锁经营网点选址模型与遗传算法.科学学与科学技术管理, 2001(10): 60-63
[172]滕吉,林逢春.电子废物立法及其实施效果国际比较[J].环境保护,2004(1):21- 28
[173]彭锦,刘宝碇.不确定规划的研究现状及其发展前景[J].运筹与管理, 2002(2):12-16
[174]王嘉鹏.基于企业边界理论的物流联盟经营模式研究[J].兰州学刊,2007(3):60-61
[175]王微.全球采购与供应链整合对中国经济的影响[J].铁道货运,2004(6):10-12
[176]王兆华,尹建华.基于生产者责任延伸制度的我国电子废弃物管理研究[J].北京理工大学学报(社会科学版),2006(4):16-20
[177]汪旭晖.跨国零售企业进军中国市场的动因与策略[J].市场营销导报,2007(3):14-18
[178]魏洁,李军.EPR下的逆向物流回收模式选择研究[J].中国管理科学,2005(6):18-22
[179]戢守峰.我国零售业竞争取胜的法宝—核心竞争力分析.商业研究, 2002(5): 1-3
[180]杨波,梁木梁,唐启鹤.物流配送中心选址的随机数学模型[J].中国管理科学,2002(10): 57-61
[181]杨丰梅,华国伟,黎建强.一个竞争选址问题的新模型及其求解算法[J].系统工程理论与实践, 2006(7): 18-24
[182]叶耀华,丁文霞,蒋怡乐.一种需求不确定的有容量网络设计问题求解方法[J].复旦大学(自然科学版),2005(12): 1004-1015
[183]周根贵,曹振宇.遗传算法在逆向物流网络选址问题中的应用研究[J].中国管理科学,2005(2):42-47
[184]张莉丽,姚恩瑜.一类带单源约束的选址运输问题算法研究[J].运筹与管理, 2006(4): 61-17