设施定位和车辆路线问题模型及其启发式算法研究
|
摘要
随着物质需求的多样性和不规则性以及贸易呈全球化趋势的发展,作为“第三利润源泉”的物流,其作用和地位显得比任何时候都更为重要,对经济活动的影响也日益明显。目前,许多发达国家和地区已形成了比较成熟的物流管理理念、先进的物流技术和高效的物流运营系统。我国在进入21世纪之后,也逐渐加快了现代物流的发展,以提高生产企业在国际上的竞争能力。为此企业管理者都希望能协调物流系统中的各个环节,以最低的价格、最好的服务来满足顾客的需要,所以物流决策显得极为重要。
在传统的物流决策模型中,定位—配给问题(location allocation problems, LAP)和车辆运输路线问题(vehicle routing problem,VRP)是最值得关注的两个方面。但是在LAP模型中仅考虑设施(工厂、库存点、分销中心等)的定位与货物配给之间的相互关系,却忽视了对车辆巡回行程路线的考虑,这就有可能导致分销成本的增长;而在VRP模型中,虽然考虑了车辆在各个客户点间巡回访问的特性,使提高运输效率成为可能,但却没有分析设施的选址问题,这将会使得整个物流系统成本仍有一定的下降空间。因此,本文运用系统分析的思想和方法,研究了物流系统中的设施定位配给和车辆路线组合优化问题——定位车辆路线问题(location routing problem,LRP)。
由于LRP及其扩展模型属于NP-hard问题,在具有一定规模节点数情况下目前仍难以求得最优解。因此对LRP模型进行系统化优化求解研究具有重要的理论价值,其理论意义则在于针对NP-hard模型大规模数值计算的解法突破和创新,同时也是发展基于电子商务的城市物流配送理论的重要理论基础,这将为日后面对巨大交易量的电子商务环境下开发自动物流配送调度系统软件具有非常重要的现实意义。
本文在分析了物流系统中选址、运输以及库存的互相制约关系基础上,从提高物流系统整体效率为出发点,站在理论研究层面,针对物流集成化数学模型及其启发式解法进行了系统研究,即从系统化的角度分析和研究了复杂物流环境下的LRP优化问题,论文从问题的界定、模型的建立、模型的检验、启发式算法求解途径、组合优化求解思路、算法实现及数据分析等多个方面对LRP问题进行了深入、具体的研究分析,得到了如下研究成果:
(1)论文系统性地研究了LRP数学模型,对定位-配给问题、车辆路线问题、定位-车辆路线问题、带库存的定位-车辆路线问题典型数学模型及其构成进行了科学描述,通过小规模测试数据采用LINGO软件对LRP数学模型给予了标定,为今后人们在此方面的进一步研究奠定了模型基础;
(2)针对LRP数学模型属性特点,分别采用禁忌搜索算法(Tabu search algorithm,TS)、模拟退火算法(Simulated annealing algorithm,SA)对LRP数学模型进行了优化求解,编制了相应算法程序软件,并采用具有一定规模的仿真测试数据测算了所提出算法求解LRP模型的有效性,同时经过大量数值模拟计算找出了其算法求解LRP模型的优良参数搭配。通过与有关文献对比,证明本文提出的求解思路对于LRP模型求解更具有优良特性;
(3)提出了遗传-模拟退火组合算法和遗传-禁忌搜索组合算法求解LRP模型的思路,并进行了相应的算法研究,通过编制计算软件和具有一定规模的数据测试,实现了组合启发式算法求解LRP模型的设想,这对于发展和完善组合优化理论亦具有重要的科学理论价值。
(4)分析了在库存管理策略下,库存控制策略对设施选址和路线优化问题的影响,在此基础上建立了更为复杂的定位-路线-库存组合优化模型(Combined Location Routing and Inventory Problems,CLRIP),并设计了求解该模型的一种两阶段启发式算法,通过小规模测试数据测算证明带库存的定位路线组合优化模型比定位-路线问题和库存控制模型独立优化的情形更能有效降低物流系统成本,并为进一步深入研究该问题的解法提供了基本思路。
(5)提供了LRP模型从8个节点至200个节点不同规模情形下的系列测试数据源,为今后开展LRP研究者提供了算法科学对比途径,同时为建立LRP模型测试数据库做出了开创性基础工作。
Along with the development of substance needing variety and irregularly all over the world, logistics as“the third profit source”has played a more important role in the economic activity than any time. At present, many developed countries have formed comparatively mature logistics management concepts,advanced logistics techniques and effective logistics operating systems. Entering the 21th century, the Chinese government has made a rapid development in logistics, in order to enhance its international competition ability. Now all the business managers hope to run every link in the logistics system well to satisfy the client’s need with the lowest price and best service. So the decision-making of logistics is very important.
In the traditional decision-making of logistics model, location allocation problems (LAP) and vehicle routing problem (VRP) are the most concerned problems. But the LAP only considers the locations of facilities (such as factory, Inventory place, sale centers etc.) and the relationship between facilities and goods distributions, ignoring the vehicle’s route, which may has a significant effect on the cost. Although the VRP considers the characteristic of vehicle’s circuit visit in every client, which may improve the transport efficiency, but it doesn’t analyze the locations of facilities, which can makes the cost to drop in logistics systems. Therefore, by the means of systems analysis, this thesis studies the facilities location distribution and the vehicle routing combination optimize problem—location routing problem(LRP)in logistics systems.
As the LRP and its extending model belong to NP-hard problem, it is difficult to get the model’s optimal solving when nodes amount is so much. Consequently, it is meaningful to systematically get optimal solving of LRP models. Contribution of the research is the innovation in big scale mathematical calculation of NP-hard problem and it is also the academic foundation of developed city logistics distribution systems on account of electronic commerce. The research has extraordinary significance to developed self-action logistics distribution software in large amount of electronic commerce dealings.
This thesis bases on the restricted relationship in location choosing, transporting and inventory in logistics systems, in order to promote whole efficiency of logistics systems, from the theory research points of view, to systemically analyze the LRP models optimize problem in complex logistics environment. This thesis studies in a deep going the LRP by bounding the problem, establishing the model, testing the model, getting solving by heuristic algorithm, combination optimize algorithm achieving and analyzing data, in the end, gets the conclusions as:
(1)This thesis investigates the LRP math model, and describes the math model of location-distribution problem, vehicle routing problem, location routing problem, inventory location routing problem, and scales the LRP math problem by LINGO software with small scale data, which is the basic model base for the future study of LRP.
(2)According to the characteristics of LRP math model, this thesis uses Tabu search algorithm(TS) and Simulated annealing algorithm(SA) to get the optimize value of LRP math model, and programs corresponding algorithm software ,then uses the simulated data to substantiate the validity of the algorithm to LRP model. Meanwhile, it finds out the proper parameters corresponding to LRP model. Compared with relative literature, the thought of this thesis has a more excellent means to LRP model solving.
(3)This thesis develops the genetic -simulated annealing algorithm and genetic- tabu search algorithm to get the optimize value on the LRP math model. By programming the account software and testing with some data, the heuristic combined algorithm gets the optimize value of LRP come true. It has an important science role in improved and developed of combined optimize theory research.
(4)This thesis analyzes the effect of inventory control strategy on the facilities location and route optimize problems, and establishes more complex Combined Location Routing and Inventory Problems(CLRIP) model, and designs a two-stage heuristic algorithm to get the optimize value. By testing with small scale data, it proves that Combined Location Routing and Inventory Problems model can more effectively reduce the logistics cost than the Location-route problem model ,or the inventory control problem model. Besides the heuristic algorithm provided a basic thoughts for analyze solving process of the LRP model in depth.
(5)This thesis provides 8 to 200 nodes testing data source in different scales based on the LRP model, supplies an approach of every algorithm scientific contrasted for the future LRP researchers and does some initiative work for establishing LRP model testing data source.
在传统的物流决策模型中,定位—配给问题(location allocation problems, LAP)和车辆运输路线问题(vehicle routing problem,VRP)是最值得关注的两个方面。但是在LAP模型中仅考虑设施(工厂、库存点、分销中心等)的定位与货物配给之间的相互关系,却忽视了对车辆巡回行程路线的考虑,这就有可能导致分销成本的增长;而在VRP模型中,虽然考虑了车辆在各个客户点间巡回访问的特性,使提高运输效率成为可能,但却没有分析设施的选址问题,这将会使得整个物流系统成本仍有一定的下降空间。因此,本文运用系统分析的思想和方法,研究了物流系统中的设施定位配给和车辆路线组合优化问题——定位车辆路线问题(location routing problem,LRP)。
由于LRP及其扩展模型属于NP-hard问题,在具有一定规模节点数情况下目前仍难以求得最优解。因此对LRP模型进行系统化优化求解研究具有重要的理论价值,其理论意义则在于针对NP-hard模型大规模数值计算的解法突破和创新,同时也是发展基于电子商务的城市物流配送理论的重要理论基础,这将为日后面对巨大交易量的电子商务环境下开发自动物流配送调度系统软件具有非常重要的现实意义。
本文在分析了物流系统中选址、运输以及库存的互相制约关系基础上,从提高物流系统整体效率为出发点,站在理论研究层面,针对物流集成化数学模型及其启发式解法进行了系统研究,即从系统化的角度分析和研究了复杂物流环境下的LRP优化问题,论文从问题的界定、模型的建立、模型的检验、启发式算法求解途径、组合优化求解思路、算法实现及数据分析等多个方面对LRP问题进行了深入、具体的研究分析,得到了如下研究成果:
(1)论文系统性地研究了LRP数学模型,对定位-配给问题、车辆路线问题、定位-车辆路线问题、带库存的定位-车辆路线问题典型数学模型及其构成进行了科学描述,通过小规模测试数据采用LINGO软件对LRP数学模型给予了标定,为今后人们在此方面的进一步研究奠定了模型基础;
(2)针对LRP数学模型属性特点,分别采用禁忌搜索算法(Tabu search algorithm,TS)、模拟退火算法(Simulated annealing algorithm,SA)对LRP数学模型进行了优化求解,编制了相应算法程序软件,并采用具有一定规模的仿真测试数据测算了所提出算法求解LRP模型的有效性,同时经过大量数值模拟计算找出了其算法求解LRP模型的优良参数搭配。通过与有关文献对比,证明本文提出的求解思路对于LRP模型求解更具有优良特性;
(3)提出了遗传-模拟退火组合算法和遗传-禁忌搜索组合算法求解LRP模型的思路,并进行了相应的算法研究,通过编制计算软件和具有一定规模的数据测试,实现了组合启发式算法求解LRP模型的设想,这对于发展和完善组合优化理论亦具有重要的科学理论价值。
(4)分析了在库存管理策略下,库存控制策略对设施选址和路线优化问题的影响,在此基础上建立了更为复杂的定位-路线-库存组合优化模型(Combined Location Routing and Inventory Problems,CLRIP),并设计了求解该模型的一种两阶段启发式算法,通过小规模测试数据测算证明带库存的定位路线组合优化模型比定位-路线问题和库存控制模型独立优化的情形更能有效降低物流系统成本,并为进一步深入研究该问题的解法提供了基本思路。
(5)提供了LRP模型从8个节点至200个节点不同规模情形下的系列测试数据源,为今后开展LRP研究者提供了算法科学对比途径,同时为建立LRP模型测试数据库做出了开创性基础工作。
Along with the development of substance needing variety and irregularly all over the world, logistics as“the third profit source”has played a more important role in the economic activity than any time. At present, many developed countries have formed comparatively mature logistics management concepts,advanced logistics techniques and effective logistics operating systems. Entering the 21th century, the Chinese government has made a rapid development in logistics, in order to enhance its international competition ability. Now all the business managers hope to run every link in the logistics system well to satisfy the client’s need with the lowest price and best service. So the decision-making of logistics is very important.
In the traditional decision-making of logistics model, location allocation problems (LAP) and vehicle routing problem (VRP) are the most concerned problems. But the LAP only considers the locations of facilities (such as factory, Inventory place, sale centers etc.) and the relationship between facilities and goods distributions, ignoring the vehicle’s route, which may has a significant effect on the cost. Although the VRP considers the characteristic of vehicle’s circuit visit in every client, which may improve the transport efficiency, but it doesn’t analyze the locations of facilities, which can makes the cost to drop in logistics systems. Therefore, by the means of systems analysis, this thesis studies the facilities location distribution and the vehicle routing combination optimize problem—location routing problem(LRP)in logistics systems.
As the LRP and its extending model belong to NP-hard problem, it is difficult to get the model’s optimal solving when nodes amount is so much. Consequently, it is meaningful to systematically get optimal solving of LRP models. Contribution of the research is the innovation in big scale mathematical calculation of NP-hard problem and it is also the academic foundation of developed city logistics distribution systems on account of electronic commerce. The research has extraordinary significance to developed self-action logistics distribution software in large amount of electronic commerce dealings.
This thesis bases on the restricted relationship in location choosing, transporting and inventory in logistics systems, in order to promote whole efficiency of logistics systems, from the theory research points of view, to systemically analyze the LRP models optimize problem in complex logistics environment. This thesis studies in a deep going the LRP by bounding the problem, establishing the model, testing the model, getting solving by heuristic algorithm, combination optimize algorithm achieving and analyzing data, in the end, gets the conclusions as:
(1)This thesis investigates the LRP math model, and describes the math model of location-distribution problem, vehicle routing problem, location routing problem, inventory location routing problem, and scales the LRP math problem by LINGO software with small scale data, which is the basic model base for the future study of LRP.
(2)According to the characteristics of LRP math model, this thesis uses Tabu search algorithm(TS) and Simulated annealing algorithm(SA) to get the optimize value of LRP math model, and programs corresponding algorithm software ,then uses the simulated data to substantiate the validity of the algorithm to LRP model. Meanwhile, it finds out the proper parameters corresponding to LRP model. Compared with relative literature, the thought of this thesis has a more excellent means to LRP model solving.
(3)This thesis develops the genetic -simulated annealing algorithm and genetic- tabu search algorithm to get the optimize value on the LRP math model. By programming the account software and testing with some data, the heuristic combined algorithm gets the optimize value of LRP come true. It has an important science role in improved and developed of combined optimize theory research.
(4)This thesis analyzes the effect of inventory control strategy on the facilities location and route optimize problems, and establishes more complex Combined Location Routing and Inventory Problems(CLRIP) model, and designs a two-stage heuristic algorithm to get the optimize value. By testing with small scale data, it proves that Combined Location Routing and Inventory Problems model can more effectively reduce the logistics cost than the Location-route problem model ,or the inventory control problem model. Besides the heuristic algorithm provided a basic thoughts for analyze solving process of the LRP model in depth.
(5)This thesis provides 8 to 200 nodes testing data source in different scales based on the LRP model, supplies an approach of every algorithm scientific contrasted for the future LRP researchers and does some initiative work for establishing LRP model testing data source.
引文
[1] Silvano Martello, Erwin Pesch. Logistics: From theory to application (ECCO XIV) [J]. European Journal of Operational Research,2005,162:1-3.
[2] Hokey Min, Gengui Zhou. Supply chain modeling: past, present and future[J]. Computers & Industrial Engineering,2002,43:231-249.
[3]张潜,高立群,胡祥培.集成化物流中的定位-运输路线安排问题(LRP)优化算法评述[J].东北大学学报(自然科学版),2003,24(1):31-34
[4]汪寿阳,赵秋红,夏国平.集成物流管理系统中的定位—运输线路安排问题的研究[J].管理科学学报,2000,3(2):69-75.
[5] J. H. Bookbinder, K. E. Reece. Vehicle routing considerations in distribution system design [J]. European Journal of Operational Research , 1988 ,37 :204-213.
[6] Laporte G, Nobert Y. An exact algorithm for minimizing routing and operating costs in depot location[J]. European Journal of Operational Research. 1981,6:224-6. [7] Hokey Min, 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.
[8] Or I, Pierskalla WP. A transportation location-allocation model for regional blood banking[J]. AIIE Transactions 1979;11:86-95.
[9] Jacobsen SK, Madsen OB. A comparative study of heuristics for a two-level routing-location problem[J]. European Journal of Operational Research 1980;5:378-387.
[10] Hodgson MJ, Rosing KE, shmulevitz F. A review of location-allocation applications literature[J]. Isolde VI Survey paper. Studies in Locational Analysis.1993,5:3-29.
[11] Gendreau M, Hertz A, Laporte G. A tabu search heuristic for the vehiclerouting problem[J]. Management science.1994,40:1270-90.
[12] Tai-His Wu, Chinyao Low, Jiunn-Wei Bai.Heuristic solutions to multi-depot location-routing problems[J]. Computer & Operation Research,2002,29:1392-1417.
[13] Srikar B, Srivastava R. Solution methodology for the location-routing problem[J]. Presented at the ORSA/TIMS Conference, Orlando, USA,1983.
[14] Webb MH. Cost function in the location of depots for multi-delivery journeys[J]. Operations Research Quarterly.1968,19:311-28.
[15] Rajesh Srivastava, W. C. Benton. The location-routing problem: considerations in physical distribution system design [J]. Computers & Operations Research, 1990, 17:427-435.
[16] Laporte G, Nobert Y, Taillefer S. Solving a family of mutil-depot vehicle routing and location-routing problems[J]. Transportation Science. 1988;22:172.
[17] Von Boventer. The relation between transportation costs and location rent in transportation problems[J]. Journal of Regional Science.1961,3(2):27-40.
[18] Cooper L, The transportation-location problem[J]. Journal of Operational Research 1972;20:94-108.
[19] Watson Gandy C, Dohrn P. Depot location with van salesmen-a practical approach [J].Omega Journal of Management Science,1973,1(3):321-329.
[20] Laporte G, Nobert Y, Arpin D. An exact algorithm for solving a copacitated location-routing problem [J]. Annals of Operations Research 1986,239:310.
[21] Golden, B.L., Baker, E.K.. Future direction in logistics research[J]. Transportation Research,1985,19A(5&6),405-409.
[22] Dilek Tuzun, Laura I. Burke, A two-phase tabu search approach to the location routing problem[J]. European Journal of Operational Research 116(1999)87-99.
[23] Perl, J., Daskin M.S. A unified warehouse location-routing methodology[J]. Journal of Logistics.1984,5(1):92-111.
[24] Perl, J., Daskin M.S. A warehouse location-routing problem[J]. Transportation Research.1985,19B(5):381-396.
[25] Laporte G., Nobert, Y., Pelletier, P.. Hamiltonian location problems[J]. European Journal of Operation Research.1983,12:82-89.
[26] Laporte G. Location-routing problems. In: Gloden BL, Assad AA, editors. Vehicle routing: methods and studies[R]. Amsterdam:North-Holland.1998,p.163-96.
[27] Laporte G, Louveaux F, Mercure H. Models and exact solutions for a class of stochastic location-routing problems[J]. European Journal of Operational Research 1989;39:71-78.
[28] Hansen PH, Hegedahl B, Hjortkjaer S, Obel B. A heuristic solution to the warehouse location-routing problem[J]. European Journal of Operational Research 1994;76:111-127.
[29] Srisvastava, R., Benton, W.C. The location-routing problem: Consideration in physical distribution system design[J]. Computers and Operational Research.1990,6:427-435.
[30] Chien TW. Heuristic procedures for practical-sized uncapacitated location-capacitated routing problems [J]. Decision Sciences. 1993,24(5) :995-1021.
[31] Salhi S, Fraser M. An integrated heuristic approach for the combined location vehicle feet mix problem[J]. Studies in Locational Analysis 1996;8:3-21.
[32] Nagy G, Salhi S. Nested heuristic methods for the location-routing problem[J]. Journal of Operational Research Society 1996;47:1166-74.
[33] Nagy G, Salhi S. A nested location-routing heuristic using route length estimation[J]. Studies in Locational Analysis.1996,10:109-127.
[34] Min H, Jayaraman V, Srivastava R. Combined location-routing problems: a synthesis and future research directions[J]. European Journal of Operational Research.1998,108:1-15.
[35] S.C. Liu·C.C. Lin. A heuristic method for the combined location routing and inventory problem[J]. Int J Adv Manuf Technol. 2004
[36] Maria Albareda-sambola, A compact model and tight bounds for a combinedlocation-routingproblem[J].Computer&Operations Research 32 (2005)407-428.
[37] Wang, Xuefeng; Sun, Xiaoming; Fang, Yang , A two-phase hybrid heuristic search approach to the location-routing problem(C). Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics.(2005).3338-3343.
[38] Bouhafs, Lyamine; Hajjam, Amir; Koukam, Abder , A combination of simulated annealing and Ant Colony System for the capacitated location-routing problem[J]. Lecture Notes in Computer Science.(2006.9-11).409-416.
[39] Albareda-Sambola, Maria; Fernandez, Elena; Laporte, Gilbert, Heuristic and lower bound for a stochastic location-routing problem[J]. European Journal of Operational Research(2007), 940-955.
[40] Barreto, Sergio; Ferreira, Carlos; Paixao, Jose; Santos, Beatriz Sousa, Using clustering analysis in a capacitated location-routing problem[J]. European Journal of Operational Research(2007).968-977.
[41] Rosemary T. Berger, Collette R. Coullard, Mark S. Daskin,Location-Routing Problems with Distance Constraints[J].Transportation Science,2007,41:29-34.
[42] Robert Russell, Wen-Chyuan Chiang and David Zepeda , Integrating multi-product production and distribution in newspaper logistics[J]. Computers & Operations Research,2008, 35:1576-1588.
[43]林岩,胡祥培,王旭茵.物流系统优化中的定位—运输路线安排问题LRP研究评述[J].管理工程学报,2004,4:45-49.
[44]张长星,党延忠.定位一运输路线安排问题的遗传算法研究[J].计算机工程与应用,2004 12:65-68
[45]黄春雨,马士华,周晓.基于缩短物流多阶响应周期的LRP模型研究[J].工业工程管理,2004,(1):55-59
[46]章海峰,张敏,杨超.一类运输工具带双重能力约束的LRP问题[J].武汉理工大学学报,2006,30(2):220-223
[47]马小伟.一类带时间窗口的定位—路径问题的启发式算法[N].科技导报,2006,24(05):72-75
[48]胡大伟,陈诚.遗传算法(GA)和禁忌搜索算法(TS)在配送中心选址和路线问题中的应用[J].系统工程理论与实践,2007,27(9):171-176
[49]刑文训,谢金星,现代优化计算方法[M],清华大学出版社,2003,12.
[50] Cook S A. The complexity of theorem proving procedures[C]. In : Proc 3rd ACM Symp on the Theory of Computing ACM. 1971:151-158.
[51] Polya G.. How to Solve It[R]. Princeton: Princeton University Press,1948.
[52] Leon Cooper. Location-allocation problems[J]. Operational Research. 1963,11:331-343.
[53] Marshall L. Fisher, Ramchandran Jaikumar. A Generalized Assignment Heuristic for Vehicle Routing[J]. NETWORKS.1981,11:109-124.
[54]王明春,定位—配送路线最优安排问题及其算法研究[D],武汉大学,2005.4.
[55] Daskin, M.S.. Location, dispatching, and routing models for emergency services with stochastic travel times. In: Ghost, A., Rushton, G.(Eds),Spatial Analysis and Location-Allocation Models. 1987,Von Nostrand Reinhold Company. New York,NY.pp:224-265.
[56] Averbakh, I., Berman, O.. Routing and location-routing p-delivery men problems on a path[J]. Transportation Science. 1994,28(2):162-166.
[57] Revelle,C., Cohon,J.,Shobrys, D.. Simultaneous siting and routing in the disposal of hazardous wastes[J]. Transportation Science. 1991,25(2):138-145.
[58] Min, H., Consolidation terminal location-allocation and consolidated routing problems[J]. Journal of Business Logistics. 1996,17(2):235-263.
[59] Ghosh, J.K., Sinha, S.B., Acharya, D.. A generalized reduced gradient based approach to round-trip location problem[J]. In: Jaiswal,N.K(Ed.). Science Management of Transport system. North-Holland, Amsterdam, Holland. 1981,pp:209-213.
[60] Stowers, C.L.. Palekar, US.. Location models with routing considerations for a single obnoxious facility[J]. Transportation Science.1993,27(4):350-362.
[61] Averbakh, I.. Berman, O.. Probabilistic sales-delivery man and sales-delivery facility location problems on a tree[J]. Transportation Science.1995,29(2):184-197.
[62] Laporte G, Dejax P J. Dynamic location-routing problems [J].Journal of the Operational Research Society, 1989, 40(5):471-482.
[63] Clarke G, Wright J. Scheduling of vehicles from a central depot to a number of delivery point.[J] Operations Research,1964,12:568-581.
[64] Rosenkrantz D, Steams R, Lew is P. Approximate algorithms for the traveling sales person problem[J]. SIAM Journal on Computing. 1977, 6:563-581.
[65] Lin S.Computer solutions of the traveling salesman problem[J]. Be1l System Technical Journa1.1965,44: 2245-2269.
[66] JOHN J. BARTHOLDI, III AND LOREN K.PLATZMAN, Heuristics based on Space filling Curves for combinatorial problems in Euclidean space[J]. Management science,1988;(5):291-305.
[67].杨瑞臣,周永付,云庆夏,寻找车辆最优化路径的混合算法[J],交通运输工程学报,2005,3:102-105
[68]马立肖,王江晴,遗传算法在组合优化问题中的应用[J],计算机工程与科学,2005,7:72-74
[69]郎茂祥,物流配送车辆调度问题的模型和算法研究[D],北京:北方交通大学博士论文,2002.2
[70] Christian Prins. A simple and effective evolutionary algorithm for the vehicle routing problem [J].Computers & Operations Reasearch.2004,31:1985-2002
[71] Oliver IM, Smith DJ, Holland JRC,.A study of permutation crossover operations on the traveling salesman problem[C]. In: Proceedings of the Fourth International Conference on Genetic Algorithms. 1991.
[72]李军,郭耀煌.物流配送车辆优化理论与方法[M],中国物资出版社,2001.6.
[73]姜大立,杨西龙,杜文等.车辆路径问题的遗传算法研究[J],系统工程理论与实践,1999.(6):40-45
[74]李建.城市物流系统中基于随机需求的库存和运输组合优化[D],长安大学,2005.4.
[75]唐坤,车辆路径问题中的遗传算法设计[J],东华大学学报(自然科学版),2002,28(1):66-70
[76]吴坚,史忠科.基于遗传算法的配送中心选址问题[J].华南理工大学学报(自然科学版),2004,32(6):71-74.
[77] Sunil Chopra. Designing the distribution network in a supply chain[J]. Transportation Research Part E. 2003(39) :123-140.
[78]赵秋红,汪寿阳,黎建强.物流管理中的优化方法与应用分析[M].科学出版社, 2006.5
[79] S.C.Liu, S.B.Lee, A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration[J]. Int Adv Manuf Technol,2003(22):941-950.
[80] Hadely G, Whitin T (1963) Analysis of inventory systems[D]. Prentice Hall, Englewood Cliffs.
[81] Tersine RT (1994) Principles of inventory and materials management[D]. Prentice Hall, Englewood Cliffs.
[82]张潜,高立群,刘雪梅,胡祥培.定位—运输路线安排问题的两阶段启发式算法[J].控制与决策,2004,7:773-777.
[83]潘正君,康立山,陈毓屏,演化计算[M]。北京:清华大学出版社,1998年7月。
[84] Kenny Q Z and Kar L O.A reactive method for real time dynamic vehicle routing problem[A].12th ICTAI 2000, Vancouver, Canada, 2000.
[85] K.C.Tan,L.H.Lee,K.Ou,2001.Artificial intelligence heuristics in solving vehicle routing problems with time window constraints[J].Engineering Applications of Artificial Intelligence 14:825-837.
[86]郎茂祥,基于遗传算法的物流配送路径优化问题研究[J].中国公路学报,2002.3.P:76-79
[87] Srisvastava, R.. Alternate solution procedures for the location-routing problem[J]. 1993,Omega21(4):497-506.
[88] Qiu, Hanguang; Zhang, Xumei, Research on open location routing problem based on improved particle swarm optimization algorithm[J], Zhongguo Jixie Gongcheng. (2006.12):2359-2361.
[89] Labbe, Martine; Yaman, Hande; Gourdin, Eric , A branch and cut algorithm for hub location problems with single assignment[J],. MathematicalProgramming. (2005.3):371-405.
[90] Gabor Nagy , Salhd Salhi, Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries[J].European Journal of Operational Research 162 (2005) 126–141.
[91] Olli Br?ysy,Michel Gendreau,Vehicle routing problem with time windows[J]. Transportation Science Vol.39 No.1,February 2005,104-118.
[92] Keng-Hoo Chuah,Jon C.Yingling,Routing for a Just-in-time supply pickup and delivery system[J]. Transportation Science Vol.39 No.3,August 2005,328-339.
[93] T.Ibaraki,S.Imahori,M.Kubo,T.Masuda,T.Uno,M.Yagiura, Effective local search algorithms for routing and scheduling problem with general time-windows constraints[J]. Transportation Science Vol.39 No.2,May 2005,206-232.
[94] Yingjie Zhong,Michael H.Cole, A vehicle routing problem with backhauls and time windows: a guided local search solution[J].Transportation Reaserch Part E 41(2005)131-144.
[95] Yuri Levina, Adi Ben-Israelb, A heuristic method for large-scale multi-facility location problems[J]. Computers & Operations Research 31 (2004) 257–272.
[96] Laurent Michel, Pascal Van Hentenryck, A simple tabu search for warehouse location[J]. European Journal of Operational Research 157 (2004) 576–591.
[97] Hoong Chuin Lau, Melvyn Sim, Kwong Meng Teo,Vehicle routing problem with time windows and a limited number of vehicles[J]. European Journal of Operational Research 148 (2003) 559–569.
[98] Yupo Chan,William B. Carter,Michael D. Burnes, A multiple-depot, Multiple-vehicle, Location-routing problem with stochastically processed demands[J].Computer&Operations Research 28(2001)803-826.
[99] Jean-Yves Potvin, Tanguy Kervahut, The Vehicle Routing Problem with Time Windows[J]. INFORMS Journal on Computing,1996,No.2.
[100] Alex Van Breedam, Improvement heuristics for the vehicle routing problem based on simulated annealing[J]. European Journal of Operational Research 86(1995)480-490.17:427-435.
[101]张建勇,李军,郭耀煌.具有模糊预约时间的VRP混合遗传算法[J].管理科学学报,2005,8(3):64-71
[102]杨茂盛,魏宝红.启发式算法在物流配送中心选址中的应用[J].现代物流, 2005,(5):18-21
[103]周凯.随机时间定位—运输路线安排问题研究[D].中南大学硕士学位论文,2005.11.
[104]郭伏,王红梅.城市物流配送系统的配送多目标优化LRP模型研究[J].工业工程管理,2005,10(5):1-4
[105]吕新福,蔡临宁,曲志伟.废弃物回收物流中的选址-路径问题[J].系统工程与实践,2005,25(5):89-94
[106]王景恒.物流配送区域与配送路线的优化算法[J].长春理工大学学报,2005,28(2):15-16
[107]于波,李引珍.基于改进遗传算法的物流配送点选址问题研究[J].兰州交通大学)学报,2005,24(4):135-137
[108]刘浩,钱小燕.路径长度受限的随机需求VRP的模型和算法[J].南京工业大学学报,27(3):36-38
[109]罗荣桂,彭伟华.物流配送中心选址优化模型与算法实现[J].经济·管理, 2005,
[110]郎茂祥,胡思继,车辆路径问题的禁忌搜索算法研究[J].管理工程学报, 2004,18(1):81-84
[111]于海生,赵林度,物流网络中多设施选址模型[J].物流技术,2004,(1):33-35
[112]张培林,魏巧云.物流配送中心选址模型及启发式算法[J].交通运输工程学报,2003,3(2):65-68
[113]袁健,刘晋,卢厚清.随机需求情形VRP的退火网络解法[J].系统工程理论与实践, 2002,(3):109-113
[114]张涛,王梦光.不确定车辆数的车辆路径问题模型和混合算法[J].系统工程理论方法应用,2002,11(2):121-124
[115]袁庆达,闫昱,周再玲.Tabu Search算法在优化配送路线问题中的应用[J].计算机工程, 2001,27(11):86-89
[116]蔡延光,钱积新,孙优贤.多重运输调度问题的模拟退火算法[J].系统工程理论与实践,1998,18(10):11-15
[117]胡大伟,陈诚,王来军,带硬时间窗车辆路线问题的混合遗传启发式算法[J].交通运输工程学报,2007,7(5):112-117
[118]胡大伟,刘贵英,基于空间填充曲线和or ? opt搜索求解旅行商问题[J].长安大学学报(自然科学版),2007,27(2):85-88
[119]王来军,胡大伟,史忠科,开放型设施定位问题的理论模型和应用[J].西北大学学报(自然科学版),2007,37(4):556-560
[120]李建,胡大伟.同济大学,中国旅美交通协会,上海市公路协会.遗传( GA)与模拟退火( SA)组合算法在车辆路线优化中的应用[A].第七届世界华人交通运输学术大会论文集[C],北京:人民交通出版社,2007:573-578
[121]赵姣,胡大伟.基于LINGO检验的VRPTW数学模型的修正[A].同济大学,中国旅美交通协会,上海市公路协会.第七届世界华人交通运输学术大会论文集[C],北京:人民交通出版社,2007,579-583
[122]胡大伟,陈诚,郭晓汾.带集货和配送的多站点VRP优化算法研究[J].数学的实践与认识,2007,37(2):98-104
[123]胡大伟,朱志强,胡勇.车辆路径问题的模拟退火算法[J].中国公路学报,2006,19(4):123-126
[124]胡大伟,胡勇,朱志强.基于空间填充曲线和动态规划解定位路线问题[J].长安学学报(自然科学版),2006,26(3):80-83
[125]胡大伟,胡勇.基于SFC和模拟退火算法求解多源选址问题[A].Prof.John Jianhua Liu,Prof.Chung-Lun Li,Dr Hon-Shu Wong,Dr Tsz Leung Yip.Proceedings of the International Conference on Greater China Supply Chain and Logistics 2006 [C],Hong Kong :Department of Logistics,Faculty of Bisiness,The Hong Kong Polytechnic University ,2006:581-587
[126]王来军,胡大伟,史忠科.容量受限型设施定位模型及遗传算法[J].长安大学学报(自然科学版),2006,26(7):65-68
[127]徐丽蕊,胡大伟,崔亚雷.基于并行遗传算法的配送中心选址问题研究[A].赵胜川,王生武,胡祥培.交通与物流-第六届交通运输领域国际学术会议论文集[C],大连:大连理工大学出版社,2006:860-865
[128]赵建有,阎旺,胡大伟.配送网络规划蚁群算法[J].交通运输工程学报,2004.4(3):79-81
[2] Hokey Min, Gengui Zhou. Supply chain modeling: past, present and future[J]. Computers & Industrial Engineering,2002,43:231-249.
[3]张潜,高立群,胡祥培.集成化物流中的定位-运输路线安排问题(LRP)优化算法评述[J].东北大学学报(自然科学版),2003,24(1):31-34
[4]汪寿阳,赵秋红,夏国平.集成物流管理系统中的定位—运输线路安排问题的研究[J].管理科学学报,2000,3(2):69-75.
[5] J. H. Bookbinder, K. E. Reece. Vehicle routing considerations in distribution system design [J]. European Journal of Operational Research , 1988 ,37 :204-213.
[6] Laporte G, Nobert Y. An exact algorithm for minimizing routing and operating costs in depot location[J]. European Journal of Operational Research. 1981,6:224-6. [7] Hokey Min, 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.
[8] Or I, Pierskalla WP. A transportation location-allocation model for regional blood banking[J]. AIIE Transactions 1979;11:86-95.
[9] Jacobsen SK, Madsen OB. A comparative study of heuristics for a two-level routing-location problem[J]. European Journal of Operational Research 1980;5:378-387.
[10] Hodgson MJ, Rosing KE, shmulevitz F. A review of location-allocation applications literature[J]. Isolde VI Survey paper. Studies in Locational Analysis.1993,5:3-29.
[11] Gendreau M, Hertz A, Laporte G. A tabu search heuristic for the vehiclerouting problem[J]. Management science.1994,40:1270-90.
[12] Tai-His Wu, Chinyao Low, Jiunn-Wei Bai.Heuristic solutions to multi-depot location-routing problems[J]. Computer & Operation Research,2002,29:1392-1417.
[13] Srikar B, Srivastava R. Solution methodology for the location-routing problem[J]. Presented at the ORSA/TIMS Conference, Orlando, USA,1983.
[14] Webb MH. Cost function in the location of depots for multi-delivery journeys[J]. Operations Research Quarterly.1968,19:311-28.
[15] Rajesh Srivastava, W. C. Benton. The location-routing problem: considerations in physical distribution system design [J]. Computers & Operations Research, 1990, 17:427-435.
[16] Laporte G, Nobert Y, Taillefer S. Solving a family of mutil-depot vehicle routing and location-routing problems[J]. Transportation Science. 1988;22:172.
[17] Von Boventer. The relation between transportation costs and location rent in transportation problems[J]. Journal of Regional Science.1961,3(2):27-40.
[18] Cooper L, The transportation-location problem[J]. Journal of Operational Research 1972;20:94-108.
[19] Watson Gandy C, Dohrn P. Depot location with van salesmen-a practical approach [J].Omega Journal of Management Science,1973,1(3):321-329.
[20] Laporte G, Nobert Y, Arpin D. An exact algorithm for solving a copacitated location-routing problem [J]. Annals of Operations Research 1986,239:310.
[21] Golden, B.L., Baker, E.K.. Future direction in logistics research[J]. Transportation Research,1985,19A(5&6),405-409.
[22] Dilek Tuzun, Laura I. Burke, A two-phase tabu search approach to the location routing problem[J]. European Journal of Operational Research 116(1999)87-99.
[23] Perl, J., Daskin M.S. A unified warehouse location-routing methodology[J]. Journal of Logistics.1984,5(1):92-111.
[24] Perl, J., Daskin M.S. A warehouse location-routing problem[J]. Transportation Research.1985,19B(5):381-396.
[25] Laporte G., Nobert, Y., Pelletier, P.. Hamiltonian location problems[J]. European Journal of Operation Research.1983,12:82-89.
[26] Laporte G. Location-routing problems. In: Gloden BL, Assad AA, editors. Vehicle routing: methods and studies[R]. Amsterdam:North-Holland.1998,p.163-96.
[27] Laporte G, Louveaux F, Mercure H. Models and exact solutions for a class of stochastic location-routing problems[J]. European Journal of Operational Research 1989;39:71-78.
[28] Hansen PH, Hegedahl B, Hjortkjaer S, Obel B. A heuristic solution to the warehouse location-routing problem[J]. European Journal of Operational Research 1994;76:111-127.
[29] Srisvastava, R., Benton, W.C. The location-routing problem: Consideration in physical distribution system design[J]. Computers and Operational Research.1990,6:427-435.
[30] Chien TW. Heuristic procedures for practical-sized uncapacitated location-capacitated routing problems [J]. Decision Sciences. 1993,24(5) :995-1021.
[31] Salhi S, Fraser M. An integrated heuristic approach for the combined location vehicle feet mix problem[J]. Studies in Locational Analysis 1996;8:3-21.
[32] Nagy G, Salhi S. Nested heuristic methods for the location-routing problem[J]. Journal of Operational Research Society 1996;47:1166-74.
[33] Nagy G, Salhi S. A nested location-routing heuristic using route length estimation[J]. Studies in Locational Analysis.1996,10:109-127.
[34] Min H, Jayaraman V, Srivastava R. Combined location-routing problems: a synthesis and future research directions[J]. European Journal of Operational Research.1998,108:1-15.
[35] S.C. Liu·C.C. Lin. A heuristic method for the combined location routing and inventory problem[J]. Int J Adv Manuf Technol. 2004
[36] Maria Albareda-sambola, A compact model and tight bounds for a combinedlocation-routingproblem[J].Computer&Operations Research 32 (2005)407-428.
[37] Wang, Xuefeng; Sun, Xiaoming; Fang, Yang , A two-phase hybrid heuristic search approach to the location-routing problem(C). Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics.(2005).3338-3343.
[38] Bouhafs, Lyamine; Hajjam, Amir; Koukam, Abder , A combination of simulated annealing and Ant Colony System for the capacitated location-routing problem[J]. Lecture Notes in Computer Science.(2006.9-11).409-416.
[39] Albareda-Sambola, Maria; Fernandez, Elena; Laporte, Gilbert, Heuristic and lower bound for a stochastic location-routing problem[J]. European Journal of Operational Research(2007), 940-955.
[40] Barreto, Sergio; Ferreira, Carlos; Paixao, Jose; Santos, Beatriz Sousa, Using clustering analysis in a capacitated location-routing problem[J]. European Journal of Operational Research(2007).968-977.
[41] Rosemary T. Berger, Collette R. Coullard, Mark S. Daskin,Location-Routing Problems with Distance Constraints[J].Transportation Science,2007,41:29-34.
[42] Robert Russell, Wen-Chyuan Chiang and David Zepeda , Integrating multi-product production and distribution in newspaper logistics[J]. Computers & Operations Research,2008, 35:1576-1588.
[43]林岩,胡祥培,王旭茵.物流系统优化中的定位—运输路线安排问题LRP研究评述[J].管理工程学报,2004,4:45-49.
[44]张长星,党延忠.定位一运输路线安排问题的遗传算法研究[J].计算机工程与应用,2004 12:65-68
[45]黄春雨,马士华,周晓.基于缩短物流多阶响应周期的LRP模型研究[J].工业工程管理,2004,(1):55-59
[46]章海峰,张敏,杨超.一类运输工具带双重能力约束的LRP问题[J].武汉理工大学学报,2006,30(2):220-223
[47]马小伟.一类带时间窗口的定位—路径问题的启发式算法[N].科技导报,2006,24(05):72-75
[48]胡大伟,陈诚.遗传算法(GA)和禁忌搜索算法(TS)在配送中心选址和路线问题中的应用[J].系统工程理论与实践,2007,27(9):171-176
[49]刑文训,谢金星,现代优化计算方法[M],清华大学出版社,2003,12.
[50] Cook S A. The complexity of theorem proving procedures[C]. In : Proc 3rd ACM Symp on the Theory of Computing ACM. 1971:151-158.
[51] Polya G.. How to Solve It[R]. Princeton: Princeton University Press,1948.
[52] Leon Cooper. Location-allocation problems[J]. Operational Research. 1963,11:331-343.
[53] Marshall L. Fisher, Ramchandran Jaikumar. A Generalized Assignment Heuristic for Vehicle Routing[J]. NETWORKS.1981,11:109-124.
[54]王明春,定位—配送路线最优安排问题及其算法研究[D],武汉大学,2005.4.
[55] Daskin, M.S.. Location, dispatching, and routing models for emergency services with stochastic travel times. In: Ghost, A., Rushton, G.(Eds),Spatial Analysis and Location-Allocation Models. 1987,Von Nostrand Reinhold Company. New York,NY.pp:224-265.
[56] Averbakh, I., Berman, O.. Routing and location-routing p-delivery men problems on a path[J]. Transportation Science. 1994,28(2):162-166.
[57] Revelle,C., Cohon,J.,Shobrys, D.. Simultaneous siting and routing in the disposal of hazardous wastes[J]. Transportation Science. 1991,25(2):138-145.
[58] Min, H., Consolidation terminal location-allocation and consolidated routing problems[J]. Journal of Business Logistics. 1996,17(2):235-263.
[59] Ghosh, J.K., Sinha, S.B., Acharya, D.. A generalized reduced gradient based approach to round-trip location problem[J]. In: Jaiswal,N.K(Ed.). Science Management of Transport system. North-Holland, Amsterdam, Holland. 1981,pp:209-213.
[60] Stowers, C.L.. Palekar, US.. Location models with routing considerations for a single obnoxious facility[J]. Transportation Science.1993,27(4):350-362.
[61] Averbakh, I.. Berman, O.. Probabilistic sales-delivery man and sales-delivery facility location problems on a tree[J]. Transportation Science.1995,29(2):184-197.
[62] Laporte G, Dejax P J. Dynamic location-routing problems [J].Journal of the Operational Research Society, 1989, 40(5):471-482.
[63] Clarke G, Wright J. Scheduling of vehicles from a central depot to a number of delivery point.[J] Operations Research,1964,12:568-581.
[64] Rosenkrantz D, Steams R, Lew is P. Approximate algorithms for the traveling sales person problem[J]. SIAM Journal on Computing. 1977, 6:563-581.
[65] Lin S.Computer solutions of the traveling salesman problem[J]. Be1l System Technical Journa1.1965,44: 2245-2269.
[66] JOHN J. BARTHOLDI, III AND LOREN K.PLATZMAN, Heuristics based on Space filling Curves for combinatorial problems in Euclidean space[J]. Management science,1988;(5):291-305.
[67].杨瑞臣,周永付,云庆夏,寻找车辆最优化路径的混合算法[J],交通运输工程学报,2005,3:102-105
[68]马立肖,王江晴,遗传算法在组合优化问题中的应用[J],计算机工程与科学,2005,7:72-74
[69]郎茂祥,物流配送车辆调度问题的模型和算法研究[D],北京:北方交通大学博士论文,2002.2
[70] Christian Prins. A simple and effective evolutionary algorithm for the vehicle routing problem [J].Computers & Operations Reasearch.2004,31:1985-2002
[71] Oliver IM, Smith DJ, Holland JRC,.A study of permutation crossover operations on the traveling salesman problem[C]. In: Proceedings of the Fourth International Conference on Genetic Algorithms. 1991.
[72]李军,郭耀煌.物流配送车辆优化理论与方法[M],中国物资出版社,2001.6.
[73]姜大立,杨西龙,杜文等.车辆路径问题的遗传算法研究[J],系统工程理论与实践,1999.(6):40-45
[74]李建.城市物流系统中基于随机需求的库存和运输组合优化[D],长安大学,2005.4.
[75]唐坤,车辆路径问题中的遗传算法设计[J],东华大学学报(自然科学版),2002,28(1):66-70
[76]吴坚,史忠科.基于遗传算法的配送中心选址问题[J].华南理工大学学报(自然科学版),2004,32(6):71-74.
[77] Sunil Chopra. Designing the distribution network in a supply chain[J]. Transportation Research Part E. 2003(39) :123-140.
[78]赵秋红,汪寿阳,黎建强.物流管理中的优化方法与应用分析[M].科学出版社, 2006.5
[79] S.C.Liu, S.B.Lee, A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration[J]. Int Adv Manuf Technol,2003(22):941-950.
[80] Hadely G, Whitin T (1963) Analysis of inventory systems[D]. Prentice Hall, Englewood Cliffs.
[81] Tersine RT (1994) Principles of inventory and materials management[D]. Prentice Hall, Englewood Cliffs.
[82]张潜,高立群,刘雪梅,胡祥培.定位—运输路线安排问题的两阶段启发式算法[J].控制与决策,2004,7:773-777.
[83]潘正君,康立山,陈毓屏,演化计算[M]。北京:清华大学出版社,1998年7月。
[84] Kenny Q Z and Kar L O.A reactive method for real time dynamic vehicle routing problem[A].12th ICTAI 2000, Vancouver, Canada, 2000.
[85] K.C.Tan,L.H.Lee,K.Ou,2001.Artificial intelligence heuristics in solving vehicle routing problems with time window constraints[J].Engineering Applications of Artificial Intelligence 14:825-837.
[86]郎茂祥,基于遗传算法的物流配送路径优化问题研究[J].中国公路学报,2002.3.P:76-79
[87] Srisvastava, R.. Alternate solution procedures for the location-routing problem[J]. 1993,Omega21(4):497-506.
[88] Qiu, Hanguang; Zhang, Xumei, Research on open location routing problem based on improved particle swarm optimization algorithm[J], Zhongguo Jixie Gongcheng. (2006.12):2359-2361.
[89] Labbe, Martine; Yaman, Hande; Gourdin, Eric , A branch and cut algorithm for hub location problems with single assignment[J],. MathematicalProgramming. (2005.3):371-405.
[90] Gabor Nagy , Salhd Salhi, Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries[J].European Journal of Operational Research 162 (2005) 126–141.
[91] Olli Br?ysy,Michel Gendreau,Vehicle routing problem with time windows[J]. Transportation Science Vol.39 No.1,February 2005,104-118.
[92] Keng-Hoo Chuah,Jon C.Yingling,Routing for a Just-in-time supply pickup and delivery system[J]. Transportation Science Vol.39 No.3,August 2005,328-339.
[93] T.Ibaraki,S.Imahori,M.Kubo,T.Masuda,T.Uno,M.Yagiura, Effective local search algorithms for routing and scheduling problem with general time-windows constraints[J]. Transportation Science Vol.39 No.2,May 2005,206-232.
[94] Yingjie Zhong,Michael H.Cole, A vehicle routing problem with backhauls and time windows: a guided local search solution[J].Transportation Reaserch Part E 41(2005)131-144.
[95] Yuri Levina, Adi Ben-Israelb, A heuristic method for large-scale multi-facility location problems[J]. Computers & Operations Research 31 (2004) 257–272.
[96] Laurent Michel, Pascal Van Hentenryck, A simple tabu search for warehouse location[J]. European Journal of Operational Research 157 (2004) 576–591.
[97] Hoong Chuin Lau, Melvyn Sim, Kwong Meng Teo,Vehicle routing problem with time windows and a limited number of vehicles[J]. European Journal of Operational Research 148 (2003) 559–569.
[98] Yupo Chan,William B. Carter,Michael D. Burnes, A multiple-depot, Multiple-vehicle, Location-routing problem with stochastically processed demands[J].Computer&Operations Research 28(2001)803-826.
[99] Jean-Yves Potvin, Tanguy Kervahut, The Vehicle Routing Problem with Time Windows[J]. INFORMS Journal on Computing,1996,No.2.
[100] Alex Van Breedam, Improvement heuristics for the vehicle routing problem based on simulated annealing[J]. European Journal of Operational Research 86(1995)480-490.17:427-435.
[101]张建勇,李军,郭耀煌.具有模糊预约时间的VRP混合遗传算法[J].管理科学学报,2005,8(3):64-71
[102]杨茂盛,魏宝红.启发式算法在物流配送中心选址中的应用[J].现代物流, 2005,(5):18-21
[103]周凯.随机时间定位—运输路线安排问题研究[D].中南大学硕士学位论文,2005.11.
[104]郭伏,王红梅.城市物流配送系统的配送多目标优化LRP模型研究[J].工业工程管理,2005,10(5):1-4
[105]吕新福,蔡临宁,曲志伟.废弃物回收物流中的选址-路径问题[J].系统工程与实践,2005,25(5):89-94
[106]王景恒.物流配送区域与配送路线的优化算法[J].长春理工大学学报,2005,28(2):15-16
[107]于波,李引珍.基于改进遗传算法的物流配送点选址问题研究[J].兰州交通大学)学报,2005,24(4):135-137
[108]刘浩,钱小燕.路径长度受限的随机需求VRP的模型和算法[J].南京工业大学学报,27(3):36-38
[109]罗荣桂,彭伟华.物流配送中心选址优化模型与算法实现[J].经济·管理, 2005,
[110]郎茂祥,胡思继,车辆路径问题的禁忌搜索算法研究[J].管理工程学报, 2004,18(1):81-84
[111]于海生,赵林度,物流网络中多设施选址模型[J].物流技术,2004,(1):33-35
[112]张培林,魏巧云.物流配送中心选址模型及启发式算法[J].交通运输工程学报,2003,3(2):65-68
[113]袁健,刘晋,卢厚清.随机需求情形VRP的退火网络解法[J].系统工程理论与实践, 2002,(3):109-113
[114]张涛,王梦光.不确定车辆数的车辆路径问题模型和混合算法[J].系统工程理论方法应用,2002,11(2):121-124
[115]袁庆达,闫昱,周再玲.Tabu Search算法在优化配送路线问题中的应用[J].计算机工程, 2001,27(11):86-89
[116]蔡延光,钱积新,孙优贤.多重运输调度问题的模拟退火算法[J].系统工程理论与实践,1998,18(10):11-15
[117]胡大伟,陈诚,王来军,带硬时间窗车辆路线问题的混合遗传启发式算法[J].交通运输工程学报,2007,7(5):112-117
[118]胡大伟,刘贵英,基于空间填充曲线和or ? opt搜索求解旅行商问题[J].长安大学学报(自然科学版),2007,27(2):85-88
[119]王来军,胡大伟,史忠科,开放型设施定位问题的理论模型和应用[J].西北大学学报(自然科学版),2007,37(4):556-560
[120]李建,胡大伟.同济大学,中国旅美交通协会,上海市公路协会.遗传( GA)与模拟退火( SA)组合算法在车辆路线优化中的应用[A].第七届世界华人交通运输学术大会论文集[C],北京:人民交通出版社,2007:573-578
[121]赵姣,胡大伟.基于LINGO检验的VRPTW数学模型的修正[A].同济大学,中国旅美交通协会,上海市公路协会.第七届世界华人交通运输学术大会论文集[C],北京:人民交通出版社,2007,579-583
[122]胡大伟,陈诚,郭晓汾.带集货和配送的多站点VRP优化算法研究[J].数学的实践与认识,2007,37(2):98-104
[123]胡大伟,朱志强,胡勇.车辆路径问题的模拟退火算法[J].中国公路学报,2006,19(4):123-126
[124]胡大伟,胡勇,朱志强.基于空间填充曲线和动态规划解定位路线问题[J].长安学学报(自然科学版),2006,26(3):80-83
[125]胡大伟,胡勇.基于SFC和模拟退火算法求解多源选址问题[A].Prof.John Jianhua Liu,Prof.Chung-Lun Li,Dr Hon-Shu Wong,Dr Tsz Leung Yip.Proceedings of the International Conference on Greater China Supply Chain and Logistics 2006 [C],Hong Kong :Department of Logistics,Faculty of Bisiness,The Hong Kong Polytechnic University ,2006:581-587
[126]王来军,胡大伟,史忠科.容量受限型设施定位模型及遗传算法[J].长安大学学报(自然科学版),2006,26(7):65-68
[127]徐丽蕊,胡大伟,崔亚雷.基于并行遗传算法的配送中心选址问题研究[A].赵胜川,王生武,胡祥培.交通与物流-第六届交通运输领域国际学术会议论文集[C],大连:大连理工大学出版社,2006:860-865
[128]赵建有,阎旺,胡大伟.配送网络规划蚁群算法[J].交通运输工程学报,2004.4(3):79-81