基于收益管理的汽车租赁车队优化调度模型及算法研究
|
摘要
当前,收益管理的应用研究已经涉及到很多行业,在汽车租赁业中主要包括四个方面,即需求预测、预订、车队调度和定价策略,其中,车队调度是一项核心的研究内容。租赁车队调度是汽车租赁商对车辆物流的优化过程,可以具体分为战略车队调度和战术车队调度,在战略车队调度之前,还需要进行联营区的划分。租赁车队优化调度的研究目的是合理配置车队资源,降低车辆物流成本,提高企业的物流运作效率。由于汽车租赁站点的需求波动较大,顾客的租车行为随机性较强,车辆的种类较多,而且还存在车辆升级供应的情况,因此,车队调度问题是收益管理在汽车租赁业应用研究的难点之一。
本文围绕租赁车队优化调度过程研究了几个关键问题,包括联营区划分、战略车队调度、战术车队调度和车辆路径问题,主要工作和研究成果如下:
(1)根据租赁站点联营区划分的原则和三个限制性条件,提出一种基于P中值模型的联营区划分方法,并设计了启发式算法求解该问题,可以一次性获得联营区划分的结果和区域管理中心的位置。当租赁站点的需求或站点个数发生变化,需要调整部分联营区归属时,该模型可以获得满意解。
(2)介绍了战略车队调度的主要任务,并以物流成本最小为目标建立了战略车队调度模型,保证了各联营区的车辆供给能够充分满足实际需求。在满足需求的同时,考虑了车辆调运过程中专用运输车的数量及其行驶路线,并借用集送货可拆分的车辆路径问题解决该难题,保证了物流成本最小。
(3)介绍了车辆路径问题中常用的几种线路构造法和线路改进法,在已有算法的基础上,提出一种三阶段启发式算法求解集送货可拆分的车辆路径问题。首先根据任务点的集送货需求量确定所需车辆数目,然后采用足够多的车辆访问能够同时满载送货和满载集货的任务点,接着根据送货量、集货量和车辆剩余容量间的动态关系,采用剩余的车辆完成剩余的集送货任务,最后对已有线路进行改进,得到车辆的最终行驶线路。算例结果表明,该算法与已有算法相比可以明显降低运输成本。
(4)由物流成本、车辆使用成本和企业收益的角度出发,基于租赁站点对各类车型的巢式需求特征,分别考虑需求固定和随机情况下问题的复杂性,给出单个联营区内多站点多车型条件下,采用升级供应策略实现车队资源优化配置的求解模型和求解思路,并设计算法进行求解。对于需求随机的情况,借助企业的车辆使用成本构建出一个产销平衡的运输问题,以求得各站点各车型的具体配置量。
(5)将车辆调配情况抽象到时空网络结构中,并根据车辆需求的供应策略和时空节点的流量平衡得到约束条件,以企业运营成本最小为目标建立优化模型。针对模型特点采用奔德斯分解算法将原问题分解为两类子问题,给出对应的算法步骤。以一周为战术调度期设计算例,对模型和算法的有效性进行检验,结果表明能够为车队优化调配提供较好的辅助决策支持。
Currently, the application of revenue management has been involved in many industries. The application in car rental industry include mainly four aspects, i.e., demand forecasting, booking, fleet planning and pricing, in which fleet planning is a core team of content. Rental fleet planning is the vehicle logistics optimization process by the car rental company, it can be divided into strategic fleet planning and tactical fleet planning, and before the strategic fleet planning, there needs to segment the pools. Optimizing planningof rental fleet is to optimize the allocation of fleet resources, and reduce the vehicle logistics costs as well as improve the efficiency of logistics operation. As the fluctuation of demand at car rental locations, the customers’random behavior, the distinct types of cars, and the upgrade supply policy, fleet planning in car rental industry is one of the most difficult problems in the application of revenue management.
This paper focuses on several key issues in the process of optimizing rental fleet planning, including the pool segmentation, strategic fleet planning and tactical fleet planning. The main work and research results are as follows:
According to the pool segmentation principle and three constraint conditions, this paper puts forward a pool segmentation method based on the P-median model, and designs a heuristic algorithm to solve the question, which can obtain the pool segmentation results and regional logistics center position. The model need to adjust the ownership of some sites and can get the satisfactory solution when the demand or the number of leasing sites change.
The main tasks of the strategic fleet planning are described, and relevant mathematic model is proposed according to the aim of minimum logistics cost, which can guarantee the actual demand in each pool to be meet. The number and their routes of Car/auto shipping truck is optimized by the vehicle routing problem with split deliveries and pickups, which can meet the demand and make sure the minimum logistics costs.
Several common construction methods and improving methods are described, and a three-phase heuristic algorithm to solve the vehicle routing problem with split deliveries and pickups is proposed based on the existing algorithms. First, according to the deliveries and pickups demands of task points, the number of vehicles can be confirmed. Second, visit task points which can delivery and pickup fully at the same time with the sufficient vehicles. And then, the remaining tasks of deliveries and pickups are accomplished by the remaining vehicles, in the light of the dynamic relations among deliveries, pickups and the remaining capacity of currently vehicle. At last, improve the existing routes and get the ultimate vehicle routes. The results of examples show that the algorithm can significantly reduce the transportation costs than the existing algorithms.
From the angle of logistics costs, vehicle using costs and company revenue, and based on the nested demand characters of leasing sites, this study builds one-stage models to optimize resource allocation for multi-site and multi-type in a pool and puts forward solution methods for the circumstance of fixed demand and stochastic demand, respectively. By the aid of car use cost, a dummy balanced transportation problem is given for stochastic demand, which can obtain the detailed allocation amount at each site.
Optimization model is set up with an objective of minimum operation cost. The fleet planning among rental locations is abstracted as a time-space network, and constraints are obtained according to the supply policy and flow balance at each node. Aimed at the characters of model, original problem is divided into two kinds of sub-problem by the use of Benders decomposition, and corresponding algorithm is proposed subsequently. A numerical example based on one week demonstrates the effectiveness of the proposed model and algorithm. The results indicate that the model and algorithm could be a promising way to improve the management quality of fleet planning.
本文围绕租赁车队优化调度过程研究了几个关键问题,包括联营区划分、战略车队调度、战术车队调度和车辆路径问题,主要工作和研究成果如下:
(1)根据租赁站点联营区划分的原则和三个限制性条件,提出一种基于P中值模型的联营区划分方法,并设计了启发式算法求解该问题,可以一次性获得联营区划分的结果和区域管理中心的位置。当租赁站点的需求或站点个数发生变化,需要调整部分联营区归属时,该模型可以获得满意解。
(2)介绍了战略车队调度的主要任务,并以物流成本最小为目标建立了战略车队调度模型,保证了各联营区的车辆供给能够充分满足实际需求。在满足需求的同时,考虑了车辆调运过程中专用运输车的数量及其行驶路线,并借用集送货可拆分的车辆路径问题解决该难题,保证了物流成本最小。
(3)介绍了车辆路径问题中常用的几种线路构造法和线路改进法,在已有算法的基础上,提出一种三阶段启发式算法求解集送货可拆分的车辆路径问题。首先根据任务点的集送货需求量确定所需车辆数目,然后采用足够多的车辆访问能够同时满载送货和满载集货的任务点,接着根据送货量、集货量和车辆剩余容量间的动态关系,采用剩余的车辆完成剩余的集送货任务,最后对已有线路进行改进,得到车辆的最终行驶线路。算例结果表明,该算法与已有算法相比可以明显降低运输成本。
(4)由物流成本、车辆使用成本和企业收益的角度出发,基于租赁站点对各类车型的巢式需求特征,分别考虑需求固定和随机情况下问题的复杂性,给出单个联营区内多站点多车型条件下,采用升级供应策略实现车队资源优化配置的求解模型和求解思路,并设计算法进行求解。对于需求随机的情况,借助企业的车辆使用成本构建出一个产销平衡的运输问题,以求得各站点各车型的具体配置量。
(5)将车辆调配情况抽象到时空网络结构中,并根据车辆需求的供应策略和时空节点的流量平衡得到约束条件,以企业运营成本最小为目标建立优化模型。针对模型特点采用奔德斯分解算法将原问题分解为两类子问题,给出对应的算法步骤。以一周为战术调度期设计算例,对模型和算法的有效性进行检验,结果表明能够为车队优化调配提供较好的辅助决策支持。
Currently, the application of revenue management has been involved in many industries. The application in car rental industry include mainly four aspects, i.e., demand forecasting, booking, fleet planning and pricing, in which fleet planning is a core team of content. Rental fleet planning is the vehicle logistics optimization process by the car rental company, it can be divided into strategic fleet planning and tactical fleet planning, and before the strategic fleet planning, there needs to segment the pools. Optimizing planningof rental fleet is to optimize the allocation of fleet resources, and reduce the vehicle logistics costs as well as improve the efficiency of logistics operation. As the fluctuation of demand at car rental locations, the customers’random behavior, the distinct types of cars, and the upgrade supply policy, fleet planning in car rental industry is one of the most difficult problems in the application of revenue management.
This paper focuses on several key issues in the process of optimizing rental fleet planning, including the pool segmentation, strategic fleet planning and tactical fleet planning. The main work and research results are as follows:
According to the pool segmentation principle and three constraint conditions, this paper puts forward a pool segmentation method based on the P-median model, and designs a heuristic algorithm to solve the question, which can obtain the pool segmentation results and regional logistics center position. The model need to adjust the ownership of some sites and can get the satisfactory solution when the demand or the number of leasing sites change.
The main tasks of the strategic fleet planning are described, and relevant mathematic model is proposed according to the aim of minimum logistics cost, which can guarantee the actual demand in each pool to be meet. The number and their routes of Car/auto shipping truck is optimized by the vehicle routing problem with split deliveries and pickups, which can meet the demand and make sure the minimum logistics costs.
Several common construction methods and improving methods are described, and a three-phase heuristic algorithm to solve the vehicle routing problem with split deliveries and pickups is proposed based on the existing algorithms. First, according to the deliveries and pickups demands of task points, the number of vehicles can be confirmed. Second, visit task points which can delivery and pickup fully at the same time with the sufficient vehicles. And then, the remaining tasks of deliveries and pickups are accomplished by the remaining vehicles, in the light of the dynamic relations among deliveries, pickups and the remaining capacity of currently vehicle. At last, improve the existing routes and get the ultimate vehicle routes. The results of examples show that the algorithm can significantly reduce the transportation costs than the existing algorithms.
From the angle of logistics costs, vehicle using costs and company revenue, and based on the nested demand characters of leasing sites, this study builds one-stage models to optimize resource allocation for multi-site and multi-type in a pool and puts forward solution methods for the circumstance of fixed demand and stochastic demand, respectively. By the aid of car use cost, a dummy balanced transportation problem is given for stochastic demand, which can obtain the detailed allocation amount at each site.
Optimization model is set up with an objective of minimum operation cost. The fleet planning among rental locations is abstracted as a time-space network, and constraints are obtained according to the supply policy and flow balance at each node. Aimed at the characters of model, original problem is divided into two kinds of sub-problem by the use of Benders decomposition, and corresponding algorithm is proposed subsequently. A numerical example based on one week demonstrates the effectiveness of the proposed model and algorithm. The results indicate that the model and algorithm could be a promising way to improve the management quality of fleet planning.
引文
[1]何登峰.融资租赁为何屡屡受挫[N].北京青年报, 2009-12-16(E25).
[2] Ridge P. The Hertz Corporation to Expand in 2010 [EB/OL]. (2010-2-17)[2010-2-20]. http://www.hertz.com/rentacar/abouthertz/index.jsp?targetPage=pressWireView.jsp.
[3] News a R. Hertz Reports Year-over-Year Improvement [EB/OL]. (2010-2-24) [2010- 2-25]. http://www.autorentalnews.com/t_inside.cfm?action=news_pick&story ID=362 32.
[4]中华人民共和国交通部. 2005中国道路运输发展报告[R].北京:人民交通出版社. 2006.
[5]至尊租赁.至尊汽车租赁股份有限公司[EB/OL]. (2010-2-20)[2010-2-25]. http:// www.toponecn.cn/AboutTopOne/CompanyIntroduce.aspx.
[6] Center I R. 2007-2008 Annual Report on China's Car Rental Market [R]. Beijing: CCID Consulting. 2008.
[7]陈煜儒.骗卖车祸罚单汽车租赁业的三道法律沟壑[N].法制日报, 2005-11- 22(E11).
[8]中国道路运输协会出租汽车与汽车租赁分会.汽车租赁行业经营环境持续改善[EB/OL]. (2009-12-03)[2010-2-25]. http://www.crta.org.cn/?action=newshow|rich|97| cn|785,559|559.
[9]郭基元,谢元.汽车租赁经营与管理[M].北京:人民交通出版社, 2000.
[10]张一兵,范永耀,刘冬丽.汽车租赁[M].北京:人民交通出版社, 2009.
[11] American Airlines Annual Report: The Art of Managing Yield [R]. 1987.
[12] Phillip E P. The Airline Discount Fare Allocation Problem [J]. Decision Sciences, 1989, 20(1): 149-157.
[13] Smith B C, Leimkuhler J F, Darrow R M. Yield Management at American Airlines [J]. Interfaces, 1992, 22(1): 8-31.
[14] Kimes S E. Yield Management: A Tool for Capacity-Constrained Service Firms [J]. Journal of Operations Management, 1989, 8(4): 348-363.
[15] Weatherford L R, Bodily S E. A Taxonomy and Research Overview of Perishable-Asset Revenue Management: Yield Management, Overbooking, and Pricing [J]. Operations Research, 1992, 40(5): 831-844.
[16] Cross R G. The Handbook of Airline Economics [M]. New York, USA: Aviation Weekly Group of McGraw-Hill Companies, 1995.
[17] Talluri K T, Van Ryzin G. The Theory and Practice of Revenue Management [M]. New York, USA: Springer Verlag, 2005.
[18] Mcgill J I, Van Ryzin G J. Revenue Management: Research Overview and Prospects [J]. Transportation Science, 1999, 33(2): 233-256.
[19] Chiang W C, Chen J C H, Xu X. An Overview of Research on Revenue Management: Current Issues and Future Research [J]. International Journal of Revenue Management, 2007, 1(1): 97-128.
[20]樊玮,吴桐水.航空公司收益管理研究综述[J].中国民航学院学报, 2006, 24(5): 42-50.
[21] Feldman J M. To Rein in Those Crss [J]. Air Transport World, 1991, 28(12): 89-92.
[22] Boyd A. Airline Alliance Revenue Management: Global Alliances within the Airline Industry Add Complexity to the Yield Management Problem [J]. OR/MS Today, 1998, 25(5): 28-31.
[23] Cook B M. Sabre Soars [J]. OR/MS Today, 1998, 25(3): 26-31.
[24] Pak K, Piersma N. Airline Revenue Management: An Overview of or Techniques 1982-2001 [R]. Rotterdam, Holand: Erasmus University. 2002.
[25] Bitran G, Caldentey R. An Overview of Pricing Models for Revenue Management [J]. Manufacturing & Service Operations Management, 2003, 5(3): 203-229.
[26] Boyd E A, Bilegan I C. Revenue Management and E-Commerce [J]. Management Science, 2003, 49(10): 1363-1386.
[27] Kimes S E. Revenue Management: A Retrospective [J]. Cornell Hotel and Restaurant Administration Quarterly, 2003, 44(5-6): 131-138.
[28] Elmaghraby W, Keskinocak P. Dynamic Pricing in the Presence of Inventory Considerations: Research Overview, Current Practices, and Future Directions [J]. Management Science, 2003, 49(10): 1287-1309.
[29]陈旭.酒店收益管理的研究进展与前景[J].管理科学学报, 2003, 6(6): 72-78.
[30]罗利,萧柏春.收入管理理论的研究现状及发展前景[J].管理科学学报, 2004, 7(5): 75-83.
[31]肖文莉,周蓉,王昊.租车行业收益管理研究现状及前景展望[J].物流科技, 2007, 1: 80-84.
[32] Carroll W J, Grimes R C. Evolutionary Change in Product Management: Experiences in the Car Rental Industry [J]. Interfaces, 1995, 25(5): 84-104.
[33] Geraghty M K, Johnson E. Revenue Management Saves National Car Rental [J]. Interfaces, 1997, 27(1): 107-127.
[34] Julian E P. Strategic and Tactical Fleet Planning for the Car Rental Industry [D]. Coral Gables, USA: University of Miami, 2000.
[35] Julian E P, Eleftherios I, Chi I, et al. A Synthesis of Tactical Fleet Planning Models for the Car Rental Industry [J]. IIE Transactions, 2003, 35(9): 907-916.
[36] Julian E P, Eleftherios I, Ip C. Vehicle Fleet Planning in the Car Rental Industry [J]. Journal of Revenue and Pricing Management, 2006, 5(3): 221-236.
[37] Anderson C K, Davison M, Rasmussen H. Revenue Management: A Real Options Approach [J]. Naval Research Logistics, 2004, 51(5): 686-703.
[38] Evise K. Revenue Management in the Car Rental Industry [D]. London, Canada: University of Western Ontario, 2005.
[39]陈旭.基于收益管理的汽车出租定价与车辆配置[J].系统工程理论方法应用, 2005, 14(3): 264-267.
[40] Fink A, Reiners T. Modeling and Solving the Short-Term Car Rental Logistics Problem [J]. Transportation Research Part E: Logistics and Transportation Review, 2006, 42(4): 272-292.
[41] Zhu J S. Using Turndowns to Estimate the Latent Demand in a Car Rental Unconstrained Demand Forecast [J]. Journal of Revenue and Pricing Management, 2006, 4(4): 344-353.
[42] Hong W C, Lai Y J, Pai P F, et al. Composite of Support Vector Regression and Evolutionary Algorithms in Car-Rental Revenue Forecasting[C]// Proceedings of the IEEE Congress on Evolutionary Computation. 2007: 2872-2878.
[43] Hertz A, Schindl D, Zufferey N. A Solution Method for a Car Fleet Management Problem with Maintenance Constraints [J]. Journal of Heuristics, 2009, 15(5): 425-450.
[44]王仙凤,曾向荣,郝红星.考虑汽车租赁公司维修能力的汽车调度研究[J].计算机仿真, 2009, 26(1): 256-259.
[45] Li Z, Tao F. On Determining Optimal Fleet Size and Vehicle Transfer Policy for a Car Rental Company [J]. Computers & Operations Research, 2010, 37(2): 341-350.
[46] Ladany S P, Arbel A. Optimal Cruise-Liner Passenger Cabin Pricing Policy [J]. European Journal of Operational Research, 1991, 55(2): 136-147.
[47] Lieberman W H, Dieck T. Expanding the Revenue Management Frontier: Optimal Air Planning in the Cruise Industry [J]. Journal of Revenue and Pricing Management, 2002, 1(1): 7-24.
[48] Coulter K S. Decreasing Price Sensitivity Involving Physical Product Inventory: A Yield Management Application [J]. Journal of Product and Brand Management, 2001, 10(5): 301-317.
[49] Hawtin M. The Practicalities and Benefits of Applying Revenue Management to Grocery Retailing, and the Need for Effective Business Rule Management [J]. Journal of Revenue and Pricing Management, 2003, 2(1): 61-68.
[50] Aviv Y, Pazgal A. A Partially Observed Markov Decision Process for Dynamic Pricing [J]. Management Science, 2005, 51(9): 1400-1416.
[51] Netessine S, Savin S, Xiao W. Revenue Management through Dynamic Cross Selling in E-Commerce Retailing [J]. Operations Research, 2006, 54(5): 893-913.
[52] Tsai W H, Hung S J. Dynamic Pricing and Revenue Management Process in Internet Retailing under Uncertainty: An Integrated Real Options Approach [J]. Omega- International Journal of Management Science, 2009, 37(2): 471-481.
[53] Jauncey S, Mitchell I, Slamet P. The Meaning and Management of Yield in Hotels [J]. International Journal of Contemporary Hospitality Management, 1995, 7(4): 23-26.
[54] Donaghy K, Mcmahon U, Mcdowell D. Yield Management: An Overview [J]. International Journal of Hospitality Management, 1995, 14(2): 139-150.
[55] Choi T Y, Cho V. Towards a Knowledge Discovery Framework for Yield Management in the Hong Kong Hotel Industry [J]. International Journal of Hospitality Management, 2000, 19(1): 17-31.
[56] Kimes S E, Mcguire K A. Function-Space Revenue Management [J]. Cornell Hotel and Restaurant Administration Quarterly: A Case Study from Singapore, 2001, 42(6): 33-46.
[57] Orkin E. The Emerging Role of Function Space Optimisation in Hotel Revenue Management [J]. Journal of Revenue and Pricing Management, 2003, 2(2): 172-174.
[58] Weatherford L R, Kimes S E. A Comparison of Forecasting Methods for Hotel Revenue Management [J]. International Journal of Forecasting, 2003, 19(3): 401-415.
[59]尤勤,赵英才,郭立夫.收益管理优化模型—以宾馆业为例的研究[J].工业技术经济, 2004, 23(3): 67-68.
[60] Jain S, Bowman H B. Measuring the Gain Attributable to Revenue Management [J]. Journal of Revenue and Pricing Management, 2005, 4(1): 83-94.
[61] Metters R, Queenan C, Ferguson M, et al. The "Killer Application" Of Revenue Management: Harrah's Cherokee Casino & Hotel [J]. Interfaces, 2008, 38(3): 161-175.
[62] Bodea T, Ferguson M, Garrow L. Choice-Based Revenue Management: Data from a Major Hotel Chain [J]. M&Som-Manufacturing and Service Operations Management, 2009, 11(2): 356-361.
[63] Nair S K, Bapna R, Brine L. An Application of Yield Management for Internet Service Providers [R]. Storrs, USA: School of Business Administration, University of Connecticut. 1997.
[64] Paschalidis I C, Tsitsiklis J, N. . Congestion-Dependent Pricing of Network Services [J]. IEEE/ACM Trans Netw, 2000, 8(2): 171-184.
[65] Dube P, Hayel Y, Wynter L. Yield Management for It Resources on Demand: Analysis and Validation of a New Paradigm for Managing Computing Centres [J]. Journal of Revenue and Pricing Management, 2005, 4(1): 24-38.
[66] Rautio T, Anttila M, Tuominen M. Bundling of Information Goods: A Value Driver for New Mobile TV Services [J]. International Journal of Revenue Management, 2007, 1(1): 45-64.
[67]刘保卫.网络数据流价格变动的收益管理研究[J].阴山学刊, 2009, 23(1): 56-58.
[68] Strasser S. The Effect of Yield Management on Railroads [J]. Transportation Quarterly, 1996, 50(2): 47-55.
[69] Ciancimino A, Inzerillo G, Lucidi S, et al. A Mathematical Programming Approach for the Solution of the Railway Yield Management Problem [J]. Transportation Science, 1999, 33(2): 168-181.
[70] Kraft E R, Srikar B N, Phillips R L. Revenue Management in Railroad Applications [J]. Transportation Quarterly, 2000, 54(1): 157-176.
[71]张秀敏,文曙东.基于投标价格法的铁路客运收益管理方法改进[J].华东交通大学学报, 2005, 22(3): 63-66.
[72]王海春,夏剑锋.铁路客运收益管理模型及算法研究[J].铁路客运收益管理模型及算法研究, 2009, 31(1): 81-83.
[73]蓝伯雄,张力.高速铁路客运专线的收益管理模型[J].中国管理科学, 2009, 17(4): 53-59.
[74]李军,郭耀煌.物流配送车辆优化调度理论与方法[M].北京:中国物资出版社, 2001.
[75] Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of Np-Completeness [M]. San Francisco, USA: WH Freeman and Company, 1979.
[76] Kalantari B, Hill a V, Arora S R. An Algorithm for the Traveling Salesman Problem with Pickup and Delivery Customers [J]. European Journal of Operational Research, 1985, 22(3): 377-386.
[77] Min H, Current J, Schilling D. The Multiple Depot Vehicle Routing Problem with Backhauling [J]. Journal of Business Logistics, 1992, 13(1): 259-288.
[78] Gendreau M, Laporte G, Hertz A. An Approximation Algorithm for the Traveling Salesman Problem with Backhauls [J]. Operations Research, 1997, 45(4): 639-641.
[79] Osman I H, Wassan N A. A Reactive Tabu Search Meta-Heuristic for the Vehicle Routing Problem with Back-Hauls [J]. Journal of Scheduling, 2002, 5(4): 263-285.
[80] Goetschalckx M, Jacobs-Blecha C. The Vehicle Routing Problem with Backhauls [J]. European Journal of Operational Research, 1989, 42(1): 39-51.
[81] Toth P, Vigo D. An Exact Algorithm for the Vehicle Routing Problem with Backhauls [J]. Transportation Science, 1997, 31(4): 372-385.
[82] Golden B, Baker E, Alfaro J, et al. The Vehicle Routing Problem with Backhauling: Two Approaches[C]// Proceedings of the Proceedings of the Twenty-first annual meeting of SETIMS. Myrtle Beach, USA: R.D. Hammesfahr, 1985: 90-92.
[83] Salhi S, Nagy G. A Cluster Insertion Heuristic for Single and Multiple Depot Vehicle Routing Problems with Backhauling [J]. Journal of the Operational Research Society, 1999, 50(10): 1034-1042.
[84] Wade a C, Salhi S. An Investigation into a New Class of Vehicle Routing Problem with Backhauls [J]. Omega, 2002, 30(6): 479-487.
[85] Min H. The Multiple Vehicle Routing Problem with Simultaneous Delivery and Pick-up Points [J]. Transportation Research Part A: General, 1989, 23(5): 377-386.
[86] Halse K. Modeling and Solving Complex Vehicle Routing Problems [D]. Lyngby, Denmark: Technical University of Denmark, 1992.
[87] Gendreau M, Laporte G, Vigo D. Heuristics for the Traveling Salesman Problem with Pickup and Delivery [J]. Computers & Operations Research, 1999, 26(7): 699-714.
[88] Dethloff J. Vehicle Routing and Reverse Logistics: The Vehicle Routing Problem with Simultaneous Delivery and Pick-Up [J]. Or Spectrum, 2001, 23(1): 79-96.
[89] Nagy G, Salhi S. Heuristic Algorithms for Single and Multiple Depot Vehicle Routing Problems with Pickups and Deliveries [J]. European Journal of Operational Research, 2005, 162(1): 126-141.
[90] Chen J F, Wu T H. Vehicle Routing Problem with Simultaneous Deliveries and Pickups [J]. The Journal of the Operational Research Society, 2006, 57(5): 579-587.
[91]胡大伟,陈诚,郭晓汾.带集货和配送的多站点VRP优化算法研究[J].数学的实践与认识, 2007, 37(2): 98-104.
[92] Bianchessi N, Righini G. Heuristic Algorithms for the Vehicle Routing Problem with Simultaneous Pick-up and Delivery [J]. Computers & Operations Research, 2007, 34(2): 578-594.
[93] Dror M, Trudeau P. Savings by Split Delivery Routing [J]. Transportation Science, 1989, 23(2): 141-145.
[94] Dror M, Trudeau P. Split Delivery Routing [J]. Naval Research Logistics, 1990, 37(3): 383-402.
[95] Mullaseril P A, Dror M, Leung J. Split-Delivery Routeing Heuristics in Livestock Feed Distribution [J]. Journal of the Operational Research Society, 1997, 48(2): 107-116.
[96] Belenguer J M, Martinez M C, Mota E. A Lower Bound for the Split Delivery Vehicle Routing Problem [J]. Operations Research, 2000, 48(5): 801-810.
[97]谢毅.需求可拆分的物流车辆路线问题研究[D].上海:同济大学经济与管理学院, 2006.
[98] Archetti C, Savelsbergh M W P, Speranza M G. Worst-Case Analysis for Split Delivery Vehicle Routing Problems [J]. Transportation science, 2006, 40(2): 226-234.
[99] Archetti C, Savelsbergh M W P, Grazia Speranza M. To Split or Not to Split: That Is the Question [J]. Transportation Research Part E: Logistics and Transportation Review, 2008, 44(1): 114-123.
[100] Nowak M, Ergun O, White C C. Pickup and Delivery with Split Loads [J]. Transportation Science, 2008, 42(1): 32-43.
[101] Mitra S. An Algorithm for the Generalized Vehicle Routing Problem with Backhauling [J]. Asia - Pacific Journal of Operational Research, 2005, 22(2): 153- 169.
[102] Mitra S. A Parallel Clustering Technique for the Vehicle Routing Problem with Split Deliveries and Pickups [J]. Journal of the Operational Research Society, 2008, 59(11): 1532-1546.
[103] Bell P C. Revenue Management: That’s the Ticket [J]. OR/MS Today, 1998, 25(2): 430-439.
[104] Lehmann D R, Weinberg C B. Sales through Sequential Distribution Channels: An Application to Movies and Videos [J]. Journal of Marketing, 2000, 64(3): 18-33.
[105]梁喜,熊中楷.汽车制造商与租赁服务提供商的回购合同[J].工业工程, 2008, 11(4): 45-49.
[106]梁喜,熊中楷.汽车租赁供应链中汽车制造商的回购定价策略[J].工业工程与管理, 2009, 1: 85-89.
[107] Nahmias S. Production and Operations Analysis [M]. 3rd ed. Chicago, USA: Richard D. Irwin, Inc., 1997.
[108] Guo Y X, Xu Z D. Risk Management of Car Rental Industry in China[C]// Proceedings of the International Conference on Service Systems and Service Management. Chengdu, China: Institute of Electrical and Electronics Engineers, Computer Society, 2007: 1-7.
[109]何小川.依靠科技手段提升汽车租赁行业管理服务能力[EB/OL]. (2009-12-03) [2010-3-1]. http://www.crta.org.cn/?action=newshow|rich|97|cn|788,559|559.
[110] Nahmias S. Perishable Inventory Theory: A Review [J]. Operations Research, 1982, 30(4): 680-708.
[111]刘德文,鲁若愚,俞言兵.易逝性高新技术产品的收益管理应用的影响因素分析[J].电子科技大学学报社科版, 2004, 6(2): 24-28.
[112]王妍,周晶,周旭.谈收益管理在通信业中的应用[J].现代管理科学, 2007, 6: 14-16.
[113] Fitzsimmons J A, Fitzsimmons M J. Service Management: Operations, Strategy, and Information Technology [M]. 3th ed. New York: McGraw Hill Higher Education, 2008.
[114] Edelstein M, Melnyk M. The Pool Control System [J]. Interfaces, 1977, 8(1): 21-36.
[115] Taniguchi E, Noritake M, Yamada T, et al. Optimal Size and Location Planning of Public Logistics Terminals [J]. Transportation Research Part E, 1999, 35(3): 207-222.
[116]杨丽徙,王金凤,段嘉平.变电站定位及供电区域划分的计算几何方法[J].郑州大学学报(工学版), 2003, 24(4): 16-18.
[117]袁长伟,王建伟,林文新.中国运输区域划分方法[J].长安大学学报(自然科学版), 2006, 26(4): 79-82.
[118]阎立华,刘丽英,马婷婷.图论法研究多水源管网供水分区[J].沈阳建筑大学学报(自然科学版), 2007, 23(1): 113-116.
[119]李旸,刘建中,丁仁源.基于计算机网络路由行为方案的春运旅客区域划分探讨[J].中国铁路, 2008, 12: 9-12.
[120]左妍妍,宋世俊,周永务.基于梯森分割的库存运输模型[J].合肥工业大学学报(自然科学版), 2008, 31(6): 959-962.
[121] Hakimi S L. Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph [J]. Operations Research, 1964, 12(3): 450-459.
[122] Hakimi S L. Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems [J]. Operations Research, 1965, 13(3): 462-475.
[123] Kariv O, Hakimi S L. An Algorithmic Approach to Network Location Problems, II: The P-Medians [J]. SIAM Journal on Applied Mathematics, 1979, 37(3): 539-560.
[124] Kariv O, Hakimi S L. An Algorithmic Approach to Network Location Problems, I: The P-Centers [J]. SIAM Journal on Applied Mathematics, 1979, 37(3): 513-538.
[125]吕海峰,马维忠,王衍华.基于网络分析方法的物流配送中心选址的研究[J].运筹与管理, 2004, 13(6): 80-85.
[126]潘又佳.中国汽车租赁业发展的问题与建议[EB/OL]. (2006-8-11)[2010-3-9]. http://www.chinaleasing.org/doc2/doc1760.htm.
[127]Hart M K. Quality Tools for Decreasing Variation and Defining Process Capability [J]. Production and Inventory Management Journal, 1992, 33(2): 6-11.
[128] Alex T I. Why Car Rental Drive Your Nuts [J]. Fortune, 1987, 116(5): 74-78.
[129] Altman R F, Helms M M. Quantifying Service Quality: Case Study of a Rental Car Agency [J]. Production and Inventory Management Journal, 1995, 36(2): 45-50.
[130]谢金星,薛毅.优化建模与Lindo/Lingo软件[M].北京:清华大学出版社, 2005.
[131]张宏伟,牛志广. Lingo 8.0及其在环境系统优化中的应用[M].天津:天津大学出版社, 2005.
[132] Schrage L. Optimization Modeling with Lingo [M]. 6th ed. Chicago: Lindo Systems Inc., 2006.
[133] Clarke G, Wright J W. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points [J]. Operations Research, 1964, 12(4): 568-581.
[134] Solomon M M. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints [J]. Operations Research, 1987, 35(2): 254-265.
[135] Potvin J Y, Rousseau J M. A Parallel Route Building Algorithm for the Vehicle Routing and Scheduling Problem with Time Windows [J]. European Journal of Operational Research, 1993, 66(3): 331-340.
[136] Wren A. Computers in Transport Planning and Operation [M]. London: Ian Allan, 1971.
[137] Wren A, Holliday A. Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points [J]. Operational Research Quarterly (1970-1977), 1972, 23(3): 333-344.
[138] Gillett B E, Leland R M. A Heuristic Algorithm for the Vehicle-Dispatch Problem [J]. Operations Research, 1974, 22(2): 340-349.
[139] Christofides N, Mingozzi A, Toth P. The Vehicle Routing Problem [M]// Christofides N, Mingozzi A, Toth P, et al. Combinatorial Optimization. New York, USA: John Wiley & Sons, 1979: 315-338.
[140] Braysy O, Gendreau M. Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms [J]. Transportation Science, 2005, 39(1): 104-118.
[141] Osman I H. Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem [J]. Annals of Operations Research, 1993, 41(4): 421-451.
[142] Lin S. Computer Solutions of the Traveling Salesman Problem [J]. Bell System Technical Journal, 1965, 44(10): 2245-2269.
[143] Russell R A. An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions [J]. Operations Research, 1977, 25(3): 517-524.
[144] Gillett B E, Johnson J. Sweep Algorithm for the Multiple Depot Vehicle Dispatch Problem[C]// Proceedings of the ORSA/TIMS Meeting. San Juan, Puerto Rico, 1974.
[145] Baker E K, Schaffer J R. Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints [J]. American Journal of Mathematical and Management Sciences, 1986, 6(3): 261-300.
[146] Garcia B L, Potvin J Y, Rousseau J M. A Parallel Implementation of the Tabu Search Heuristic for Vehicle Routing Problems with Time Window Constraints [J]. Computers & Operations Research, 1994, 21(9): 1025-1033.
[147] Potvin J Y, Rousseau J M. An Exchange Heuristic for Routeing Problems with Time Windows [J]. The Journal of the Operational Research Society, 1995, 46(12): 1433- 1446.
[148] Or I. Travelling Salesman-Type Combinatorial Problems and Their Relation to the Logistics of Regional Blood Banking [D]. Evanston, USA: Northwestern University, 1976.
[149] Savelsbergh M W P. The Vehicle Routing Problem with Time Windows: Minimizing Route Duration [J]. INFORMS Journal on Computing 1992, 4(2): 146-154.
[150] Prosser P, Shaw P. Study of Greedy Search with Multiple Improvement Heuristics for Vehicle Routing Problems [R]. Glasglow, Scotland: Department of Computer Science, University of Strathclyde. 1996.
[151] De Backer B, Furnon V, Kilby P, et al. Local Search in Constraint Programming: Application to the Vehicle Routing Problem[C]// Proceedings of the CP-97 Workshop on Industrial Constraint-Directed Scheduling. Schloss Hagenberg, Austria: Citeseer, 1997: 1-15.
[152] Backer B D, Furnon V, Shaw P, et al. Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics [J]. Journal of Heuristics, 2000, 6(4): 501-523.
[153] Taillard E, Badeau P, Gendreau M, et al. A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows [J]. Transportation Science, 1997, 31(2): 170-186.
[154] Gendreau M, Hertz A, Laporte G. New Insertion and Postoptimization Procedures for the Traveling Salesman Problem [J]. Operations Research, 1992, 40(6): 1086-1094.
[155] Glover F. Multilevel Tabu Search and Embedded Search Neighborhoods for the Traveling Salesman Problem [R]. Boulder, USA: College of Business & Administration, University of Colorado. 1996.
[156] Glover F. Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems [J]. Discrete Applied Mathematics, 1996, 65(1): 223-254.
[157]Caseau Y, Laburthe F. Heuristics for Large Constrained Vehicle Routing Problems [J]. Journal of Heuristics, 1999, 5(3): 281-303.
[158] Rousseau L M, Gendreau M, Pesant G. Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows [J]. Journal of Heuristics, 2002, 8(1): 43-58.
[159] Thompson P M, Psaraftis H N. Cyclic Transfer Algorithms for Multivehicle Routing and Scheduling Problems [J]. Operations Research, 1993, 41(5): 935-946.
[160]李世珣,朱忠平,王亮,等.运输决策与库存控制整合优化研究综述[J].青岛理工大学学报, 2006, 27(3): 126-130.
[161] Herron D P. Managing Physical Distribution for Profit [J]. Harvard Business Review, 1979, 57(3): 121-132.
[162] Harris F W. How Many Parts to Make at Once [J]. Operations Research, 1990, 38(6): 947-950.
[163]金志扬,张孝祖,江浩斌,等.现代物流系统中库存—运输联合优化的博弈分析[J].物流技术, 2005, 10: 284-286.
[164]袁庆达,游斌.库存——运输联合优化问题简介[J].物流技术, 2001, 5: 9-17.
[165]唐加福,董颖,潘震东,等.租赁车辆运输外包模式下多次直接运输策略的集成库存运输计划[J].计算机集成制造系统, 2007, 13(6): 1158-1164.
[166] Federgruen A, Zipkin P. A Combined Vehicle Routing and Inventory Allocation Problem [J]. Operations Research, 1984, 32(5): 1019-1037.
[167] Bramel J, Simchi-Levi D. A Location Based Heuristic for General Routing Problems [J]. Operations Research, 1995, 43(4): 649-660.
[168] Campbell a M, Savelsbergh M W P. A Decomposition Approach for the Inventory- Routing Problem [J]. Transportation Science, 2004, 38(4): 488-502.
[169] Aghezzaf E-H, Raa B, Van Landeghem H. Modeling Inventory Routing Problems in Supply Chains of High Consumption Products [J]. European Journal of Operational Research, 2006, 169(3): 1048-1063.
[170] Sindhuchao S, Romeijn H E, Akcali E, et al. An Integrated Inventory-Routing System for Multi-Item Joint Replenishment with Limited Vehicle Capacity [J]. Journal of Global Optimization, 2005, 32(1): 93-118.
[171]赵达,李军,李妍峰,等.随机需求库存—路径问题:研究现状及展望[J].系统工程, 2007, 25(8): 38-44.
[172]刘立辉,叶春明.库存路径问题的研究综述[J].工业工程, 2009, 12(3): 1-6.
[173] Bertazzi L, Speranza M G. Inventory Control on Sequences of Links with Given Transportation Frequencies [J]. International Journal of Production Economics, 1999, 59(1-3): 261-270.
[174] Rusdiansyah A, Tsao D. Coordinating Deliveries and Inventories for a Supply Chain under Vendor Managed Inventory System [J]. JSME International Journal, Series A, 2005, 48(2): 85-90.
[175] Ahn B, Seo K K. Multi-Items Ordering Model Considering Transportation Constraint on the Inventory Management [J]. The International Journal of Advanced Manufacturing Technology, 2005, 25(1): 88-92.
[176] Anily S, Bramel J. Vehicle Routing and the Supply Chain in Quantitative Models for Supply Chain Management [M]. London, UK: Kluwer Academic Publisher, 1999.
[177] Bertazzi L, Speranza M G. Models and Algorithms for the Minimization of Inventory and Transportation Costs: A Survey, New Trends in Distribution Logistics [J]. Lecture Notes in Economics and Mathematical Systems 1999, 137-157.
[178] Burns L D, Hall R W, Blumenfeld D E, et al. Distribution Strategies That Minimize Transportation and Inventory Costs [J]. Operations Research, 1985, 33(3): 469-490.
[179] Mccann P. A Proof of the Relationship between Optimal Vehicle Size, Haulage Length and the Structure of Distance-Transport Costs [J]. Transportation Research Part A, 2001, 35(8): 671-693.
[180] Viswanathan S, Mathur K. Integrating Routing and Inventory Decisions in One-Warehouse Multiretailer Multiproduct Distribution Systems [J]. Management Science, 1997, 43(3): 294-312.
[181] Robinson L W. Optimal and Approximate Policies in Multiperiod, Multilocation Inventory Models with Transshipments [J]. Operations Research, 1990, 38(2): 278- 295.
[182] Fleischmann B. Transport and Inventory Planning with Discrete Shipment Times [J]. New trends in distribution logistics, 1999, 159–178.
[183] Speranza M G, Ukovich W. An Algorithm for Optimal Shipments with Given Frequencies [J]. Naval Research Logistics, 1996, 43(5): 655-671.
[184]傅成红,符卓.单周期离散随机需求的库存—运输整合优化[J].系统工程, 2007, 25(1): 9-12.
[185]黄红选,韩继业.数学规划[M].北京:清华大学出版社, 2006.
[186] Benders J F. Partitioning Procedures for Solving Mixed-Variables Programming Problems [J]. Numerische Mathematik, 1962, 4(1): 238-252.
[187]朱道立.大系统优化理论和应用[M].上海:上海交通大学出版社, 1987.
[188]田俊峰,杨梅.随机需求条件下生产-库存系统优化与仿真[J].系统仿真学报, 2004, 16(11): 2522-2524.
[189]付蓉,魏萍,万秋兰,等.市场环境下基于Benders分解的输电网规划决策[J].电力系统及其自动化学报, 2006, 18(6): 1-5.
[190] Wu P L, Hartman J C, Wilson G R. A Demand-Shifting Feasibility Algorithm for Benders Decomposition [J]. European Journal of Operational Research, 2003, 148(3): 570-583.
[191]张毅华,陈森发.奔德斯分解法与分支定界法在物流网络设计中的对比研究[J].物流技术, 2008, 27(9): 54-57.
[192]任鸣鸣,杨超,何波.需求不确定状态下的工厂选址和规模决策的综合优化方法[J].系统工程, 2007, 25(6): 1-5.
[193]任鸣鸣.不确定状态下的一种整合的工厂选址模型与求解方法[J].武汉理工大学学报(交通科学与工程版), 2009, 33(6): 1183-1186.
[194] Geoffrion a M. Generalized Benders Decomposition [J]. Journal of Optimization Theory and Applications, 1972, 10(4): 237-260.
[195] Geoffrion a M, Graves G W. Multicommodity Distribution System Design by Benders Decomposition [J]. Management Science, 1974, 20(5): 822-844.
[2] Ridge P. The Hertz Corporation to Expand in 2010 [EB/OL]. (2010-2-17)[2010-2-20]. http://www.hertz.com/rentacar/abouthertz/index.jsp?targetPage=pressWireView.jsp.
[3] News a R. Hertz Reports Year-over-Year Improvement [EB/OL]. (2010-2-24) [2010- 2-25]. http://www.autorentalnews.com/t_inside.cfm?action=news_pick&story ID=362 32.
[4]中华人民共和国交通部. 2005中国道路运输发展报告[R].北京:人民交通出版社. 2006.
[5]至尊租赁.至尊汽车租赁股份有限公司[EB/OL]. (2010-2-20)[2010-2-25]. http:// www.toponecn.cn/AboutTopOne/CompanyIntroduce.aspx.
[6] Center I R. 2007-2008 Annual Report on China's Car Rental Market [R]. Beijing: CCID Consulting. 2008.
[7]陈煜儒.骗卖车祸罚单汽车租赁业的三道法律沟壑[N].法制日报, 2005-11- 22(E11).
[8]中国道路运输协会出租汽车与汽车租赁分会.汽车租赁行业经营环境持续改善[EB/OL]. (2009-12-03)[2010-2-25]. http://www.crta.org.cn/?action=newshow|rich|97| cn|785,559|559.
[9]郭基元,谢元.汽车租赁经营与管理[M].北京:人民交通出版社, 2000.
[10]张一兵,范永耀,刘冬丽.汽车租赁[M].北京:人民交通出版社, 2009.
[11] American Airlines Annual Report: The Art of Managing Yield [R]. 1987.
[12] Phillip E P. The Airline Discount Fare Allocation Problem [J]. Decision Sciences, 1989, 20(1): 149-157.
[13] Smith B C, Leimkuhler J F, Darrow R M. Yield Management at American Airlines [J]. Interfaces, 1992, 22(1): 8-31.
[14] Kimes S E. Yield Management: A Tool for Capacity-Constrained Service Firms [J]. Journal of Operations Management, 1989, 8(4): 348-363.
[15] Weatherford L R, Bodily S E. A Taxonomy and Research Overview of Perishable-Asset Revenue Management: Yield Management, Overbooking, and Pricing [J]. Operations Research, 1992, 40(5): 831-844.
[16] Cross R G. The Handbook of Airline Economics [M]. New York, USA: Aviation Weekly Group of McGraw-Hill Companies, 1995.
[17] Talluri K T, Van Ryzin G. The Theory and Practice of Revenue Management [M]. New York, USA: Springer Verlag, 2005.
[18] Mcgill J I, Van Ryzin G J. Revenue Management: Research Overview and Prospects [J]. Transportation Science, 1999, 33(2): 233-256.
[19] Chiang W C, Chen J C H, Xu X. An Overview of Research on Revenue Management: Current Issues and Future Research [J]. International Journal of Revenue Management, 2007, 1(1): 97-128.
[20]樊玮,吴桐水.航空公司收益管理研究综述[J].中国民航学院学报, 2006, 24(5): 42-50.
[21] Feldman J M. To Rein in Those Crss [J]. Air Transport World, 1991, 28(12): 89-92.
[22] Boyd A. Airline Alliance Revenue Management: Global Alliances within the Airline Industry Add Complexity to the Yield Management Problem [J]. OR/MS Today, 1998, 25(5): 28-31.
[23] Cook B M. Sabre Soars [J]. OR/MS Today, 1998, 25(3): 26-31.
[24] Pak K, Piersma N. Airline Revenue Management: An Overview of or Techniques 1982-2001 [R]. Rotterdam, Holand: Erasmus University. 2002.
[25] Bitran G, Caldentey R. An Overview of Pricing Models for Revenue Management [J]. Manufacturing & Service Operations Management, 2003, 5(3): 203-229.
[26] Boyd E A, Bilegan I C. Revenue Management and E-Commerce [J]. Management Science, 2003, 49(10): 1363-1386.
[27] Kimes S E. Revenue Management: A Retrospective [J]. Cornell Hotel and Restaurant Administration Quarterly, 2003, 44(5-6): 131-138.
[28] Elmaghraby W, Keskinocak P. Dynamic Pricing in the Presence of Inventory Considerations: Research Overview, Current Practices, and Future Directions [J]. Management Science, 2003, 49(10): 1287-1309.
[29]陈旭.酒店收益管理的研究进展与前景[J].管理科学学报, 2003, 6(6): 72-78.
[30]罗利,萧柏春.收入管理理论的研究现状及发展前景[J].管理科学学报, 2004, 7(5): 75-83.
[31]肖文莉,周蓉,王昊.租车行业收益管理研究现状及前景展望[J].物流科技, 2007, 1: 80-84.
[32] Carroll W J, Grimes R C. Evolutionary Change in Product Management: Experiences in the Car Rental Industry [J]. Interfaces, 1995, 25(5): 84-104.
[33] Geraghty M K, Johnson E. Revenue Management Saves National Car Rental [J]. Interfaces, 1997, 27(1): 107-127.
[34] Julian E P. Strategic and Tactical Fleet Planning for the Car Rental Industry [D]. Coral Gables, USA: University of Miami, 2000.
[35] Julian E P, Eleftherios I, Chi I, et al. A Synthesis of Tactical Fleet Planning Models for the Car Rental Industry [J]. IIE Transactions, 2003, 35(9): 907-916.
[36] Julian E P, Eleftherios I, Ip C. Vehicle Fleet Planning in the Car Rental Industry [J]. Journal of Revenue and Pricing Management, 2006, 5(3): 221-236.
[37] Anderson C K, Davison M, Rasmussen H. Revenue Management: A Real Options Approach [J]. Naval Research Logistics, 2004, 51(5): 686-703.
[38] Evise K. Revenue Management in the Car Rental Industry [D]. London, Canada: University of Western Ontario, 2005.
[39]陈旭.基于收益管理的汽车出租定价与车辆配置[J].系统工程理论方法应用, 2005, 14(3): 264-267.
[40] Fink A, Reiners T. Modeling and Solving the Short-Term Car Rental Logistics Problem [J]. Transportation Research Part E: Logistics and Transportation Review, 2006, 42(4): 272-292.
[41] Zhu J S. Using Turndowns to Estimate the Latent Demand in a Car Rental Unconstrained Demand Forecast [J]. Journal of Revenue and Pricing Management, 2006, 4(4): 344-353.
[42] Hong W C, Lai Y J, Pai P F, et al. Composite of Support Vector Regression and Evolutionary Algorithms in Car-Rental Revenue Forecasting[C]// Proceedings of the IEEE Congress on Evolutionary Computation. 2007: 2872-2878.
[43] Hertz A, Schindl D, Zufferey N. A Solution Method for a Car Fleet Management Problem with Maintenance Constraints [J]. Journal of Heuristics, 2009, 15(5): 425-450.
[44]王仙凤,曾向荣,郝红星.考虑汽车租赁公司维修能力的汽车调度研究[J].计算机仿真, 2009, 26(1): 256-259.
[45] Li Z, Tao F. On Determining Optimal Fleet Size and Vehicle Transfer Policy for a Car Rental Company [J]. Computers & Operations Research, 2010, 37(2): 341-350.
[46] Ladany S P, Arbel A. Optimal Cruise-Liner Passenger Cabin Pricing Policy [J]. European Journal of Operational Research, 1991, 55(2): 136-147.
[47] Lieberman W H, Dieck T. Expanding the Revenue Management Frontier: Optimal Air Planning in the Cruise Industry [J]. Journal of Revenue and Pricing Management, 2002, 1(1): 7-24.
[48] Coulter K S. Decreasing Price Sensitivity Involving Physical Product Inventory: A Yield Management Application [J]. Journal of Product and Brand Management, 2001, 10(5): 301-317.
[49] Hawtin M. The Practicalities and Benefits of Applying Revenue Management to Grocery Retailing, and the Need for Effective Business Rule Management [J]. Journal of Revenue and Pricing Management, 2003, 2(1): 61-68.
[50] Aviv Y, Pazgal A. A Partially Observed Markov Decision Process for Dynamic Pricing [J]. Management Science, 2005, 51(9): 1400-1416.
[51] Netessine S, Savin S, Xiao W. Revenue Management through Dynamic Cross Selling in E-Commerce Retailing [J]. Operations Research, 2006, 54(5): 893-913.
[52] Tsai W H, Hung S J. Dynamic Pricing and Revenue Management Process in Internet Retailing under Uncertainty: An Integrated Real Options Approach [J]. Omega- International Journal of Management Science, 2009, 37(2): 471-481.
[53] Jauncey S, Mitchell I, Slamet P. The Meaning and Management of Yield in Hotels [J]. International Journal of Contemporary Hospitality Management, 1995, 7(4): 23-26.
[54] Donaghy K, Mcmahon U, Mcdowell D. Yield Management: An Overview [J]. International Journal of Hospitality Management, 1995, 14(2): 139-150.
[55] Choi T Y, Cho V. Towards a Knowledge Discovery Framework for Yield Management in the Hong Kong Hotel Industry [J]. International Journal of Hospitality Management, 2000, 19(1): 17-31.
[56] Kimes S E, Mcguire K A. Function-Space Revenue Management [J]. Cornell Hotel and Restaurant Administration Quarterly: A Case Study from Singapore, 2001, 42(6): 33-46.
[57] Orkin E. The Emerging Role of Function Space Optimisation in Hotel Revenue Management [J]. Journal of Revenue and Pricing Management, 2003, 2(2): 172-174.
[58] Weatherford L R, Kimes S E. A Comparison of Forecasting Methods for Hotel Revenue Management [J]. International Journal of Forecasting, 2003, 19(3): 401-415.
[59]尤勤,赵英才,郭立夫.收益管理优化模型—以宾馆业为例的研究[J].工业技术经济, 2004, 23(3): 67-68.
[60] Jain S, Bowman H B. Measuring the Gain Attributable to Revenue Management [J]. Journal of Revenue and Pricing Management, 2005, 4(1): 83-94.
[61] Metters R, Queenan C, Ferguson M, et al. The "Killer Application" Of Revenue Management: Harrah's Cherokee Casino & Hotel [J]. Interfaces, 2008, 38(3): 161-175.
[62] Bodea T, Ferguson M, Garrow L. Choice-Based Revenue Management: Data from a Major Hotel Chain [J]. M&Som-Manufacturing and Service Operations Management, 2009, 11(2): 356-361.
[63] Nair S K, Bapna R, Brine L. An Application of Yield Management for Internet Service Providers [R]. Storrs, USA: School of Business Administration, University of Connecticut. 1997.
[64] Paschalidis I C, Tsitsiklis J, N. . Congestion-Dependent Pricing of Network Services [J]. IEEE/ACM Trans Netw, 2000, 8(2): 171-184.
[65] Dube P, Hayel Y, Wynter L. Yield Management for It Resources on Demand: Analysis and Validation of a New Paradigm for Managing Computing Centres [J]. Journal of Revenue and Pricing Management, 2005, 4(1): 24-38.
[66] Rautio T, Anttila M, Tuominen M. Bundling of Information Goods: A Value Driver for New Mobile TV Services [J]. International Journal of Revenue Management, 2007, 1(1): 45-64.
[67]刘保卫.网络数据流价格变动的收益管理研究[J].阴山学刊, 2009, 23(1): 56-58.
[68] Strasser S. The Effect of Yield Management on Railroads [J]. Transportation Quarterly, 1996, 50(2): 47-55.
[69] Ciancimino A, Inzerillo G, Lucidi S, et al. A Mathematical Programming Approach for the Solution of the Railway Yield Management Problem [J]. Transportation Science, 1999, 33(2): 168-181.
[70] Kraft E R, Srikar B N, Phillips R L. Revenue Management in Railroad Applications [J]. Transportation Quarterly, 2000, 54(1): 157-176.
[71]张秀敏,文曙东.基于投标价格法的铁路客运收益管理方法改进[J].华东交通大学学报, 2005, 22(3): 63-66.
[72]王海春,夏剑锋.铁路客运收益管理模型及算法研究[J].铁路客运收益管理模型及算法研究, 2009, 31(1): 81-83.
[73]蓝伯雄,张力.高速铁路客运专线的收益管理模型[J].中国管理科学, 2009, 17(4): 53-59.
[74]李军,郭耀煌.物流配送车辆优化调度理论与方法[M].北京:中国物资出版社, 2001.
[75] Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of Np-Completeness [M]. San Francisco, USA: WH Freeman and Company, 1979.
[76] Kalantari B, Hill a V, Arora S R. An Algorithm for the Traveling Salesman Problem with Pickup and Delivery Customers [J]. European Journal of Operational Research, 1985, 22(3): 377-386.
[77] Min H, Current J, Schilling D. The Multiple Depot Vehicle Routing Problem with Backhauling [J]. Journal of Business Logistics, 1992, 13(1): 259-288.
[78] Gendreau M, Laporte G, Hertz A. An Approximation Algorithm for the Traveling Salesman Problem with Backhauls [J]. Operations Research, 1997, 45(4): 639-641.
[79] Osman I H, Wassan N A. A Reactive Tabu Search Meta-Heuristic for the Vehicle Routing Problem with Back-Hauls [J]. Journal of Scheduling, 2002, 5(4): 263-285.
[80] Goetschalckx M, Jacobs-Blecha C. The Vehicle Routing Problem with Backhauls [J]. European Journal of Operational Research, 1989, 42(1): 39-51.
[81] Toth P, Vigo D. An Exact Algorithm for the Vehicle Routing Problem with Backhauls [J]. Transportation Science, 1997, 31(4): 372-385.
[82] Golden B, Baker E, Alfaro J, et al. The Vehicle Routing Problem with Backhauling: Two Approaches[C]// Proceedings of the Proceedings of the Twenty-first annual meeting of SETIMS. Myrtle Beach, USA: R.D. Hammesfahr, 1985: 90-92.
[83] Salhi S, Nagy G. A Cluster Insertion Heuristic for Single and Multiple Depot Vehicle Routing Problems with Backhauling [J]. Journal of the Operational Research Society, 1999, 50(10): 1034-1042.
[84] Wade a C, Salhi S. An Investigation into a New Class of Vehicle Routing Problem with Backhauls [J]. Omega, 2002, 30(6): 479-487.
[85] Min H. The Multiple Vehicle Routing Problem with Simultaneous Delivery and Pick-up Points [J]. Transportation Research Part A: General, 1989, 23(5): 377-386.
[86] Halse K. Modeling and Solving Complex Vehicle Routing Problems [D]. Lyngby, Denmark: Technical University of Denmark, 1992.
[87] Gendreau M, Laporte G, Vigo D. Heuristics for the Traveling Salesman Problem with Pickup and Delivery [J]. Computers & Operations Research, 1999, 26(7): 699-714.
[88] Dethloff J. Vehicle Routing and Reverse Logistics: The Vehicle Routing Problem with Simultaneous Delivery and Pick-Up [J]. Or Spectrum, 2001, 23(1): 79-96.
[89] Nagy G, Salhi S. Heuristic Algorithms for Single and Multiple Depot Vehicle Routing Problems with Pickups and Deliveries [J]. European Journal of Operational Research, 2005, 162(1): 126-141.
[90] Chen J F, Wu T H. Vehicle Routing Problem with Simultaneous Deliveries and Pickups [J]. The Journal of the Operational Research Society, 2006, 57(5): 579-587.
[91]胡大伟,陈诚,郭晓汾.带集货和配送的多站点VRP优化算法研究[J].数学的实践与认识, 2007, 37(2): 98-104.
[92] Bianchessi N, Righini G. Heuristic Algorithms for the Vehicle Routing Problem with Simultaneous Pick-up and Delivery [J]. Computers & Operations Research, 2007, 34(2): 578-594.
[93] Dror M, Trudeau P. Savings by Split Delivery Routing [J]. Transportation Science, 1989, 23(2): 141-145.
[94] Dror M, Trudeau P. Split Delivery Routing [J]. Naval Research Logistics, 1990, 37(3): 383-402.
[95] Mullaseril P A, Dror M, Leung J. Split-Delivery Routeing Heuristics in Livestock Feed Distribution [J]. Journal of the Operational Research Society, 1997, 48(2): 107-116.
[96] Belenguer J M, Martinez M C, Mota E. A Lower Bound for the Split Delivery Vehicle Routing Problem [J]. Operations Research, 2000, 48(5): 801-810.
[97]谢毅.需求可拆分的物流车辆路线问题研究[D].上海:同济大学经济与管理学院, 2006.
[98] Archetti C, Savelsbergh M W P, Speranza M G. Worst-Case Analysis for Split Delivery Vehicle Routing Problems [J]. Transportation science, 2006, 40(2): 226-234.
[99] Archetti C, Savelsbergh M W P, Grazia Speranza M. To Split or Not to Split: That Is the Question [J]. Transportation Research Part E: Logistics and Transportation Review, 2008, 44(1): 114-123.
[100] Nowak M, Ergun O, White C C. Pickup and Delivery with Split Loads [J]. Transportation Science, 2008, 42(1): 32-43.
[101] Mitra S. An Algorithm for the Generalized Vehicle Routing Problem with Backhauling [J]. Asia - Pacific Journal of Operational Research, 2005, 22(2): 153- 169.
[102] Mitra S. A Parallel Clustering Technique for the Vehicle Routing Problem with Split Deliveries and Pickups [J]. Journal of the Operational Research Society, 2008, 59(11): 1532-1546.
[103] Bell P C. Revenue Management: That’s the Ticket [J]. OR/MS Today, 1998, 25(2): 430-439.
[104] Lehmann D R, Weinberg C B. Sales through Sequential Distribution Channels: An Application to Movies and Videos [J]. Journal of Marketing, 2000, 64(3): 18-33.
[105]梁喜,熊中楷.汽车制造商与租赁服务提供商的回购合同[J].工业工程, 2008, 11(4): 45-49.
[106]梁喜,熊中楷.汽车租赁供应链中汽车制造商的回购定价策略[J].工业工程与管理, 2009, 1: 85-89.
[107] Nahmias S. Production and Operations Analysis [M]. 3rd ed. Chicago, USA: Richard D. Irwin, Inc., 1997.
[108] Guo Y X, Xu Z D. Risk Management of Car Rental Industry in China[C]// Proceedings of the International Conference on Service Systems and Service Management. Chengdu, China: Institute of Electrical and Electronics Engineers, Computer Society, 2007: 1-7.
[109]何小川.依靠科技手段提升汽车租赁行业管理服务能力[EB/OL]. (2009-12-03) [2010-3-1]. http://www.crta.org.cn/?action=newshow|rich|97|cn|788,559|559.
[110] Nahmias S. Perishable Inventory Theory: A Review [J]. Operations Research, 1982, 30(4): 680-708.
[111]刘德文,鲁若愚,俞言兵.易逝性高新技术产品的收益管理应用的影响因素分析[J].电子科技大学学报社科版, 2004, 6(2): 24-28.
[112]王妍,周晶,周旭.谈收益管理在通信业中的应用[J].现代管理科学, 2007, 6: 14-16.
[113] Fitzsimmons J A, Fitzsimmons M J. Service Management: Operations, Strategy, and Information Technology [M]. 3th ed. New York: McGraw Hill Higher Education, 2008.
[114] Edelstein M, Melnyk M. The Pool Control System [J]. Interfaces, 1977, 8(1): 21-36.
[115] Taniguchi E, Noritake M, Yamada T, et al. Optimal Size and Location Planning of Public Logistics Terminals [J]. Transportation Research Part E, 1999, 35(3): 207-222.
[116]杨丽徙,王金凤,段嘉平.变电站定位及供电区域划分的计算几何方法[J].郑州大学学报(工学版), 2003, 24(4): 16-18.
[117]袁长伟,王建伟,林文新.中国运输区域划分方法[J].长安大学学报(自然科学版), 2006, 26(4): 79-82.
[118]阎立华,刘丽英,马婷婷.图论法研究多水源管网供水分区[J].沈阳建筑大学学报(自然科学版), 2007, 23(1): 113-116.
[119]李旸,刘建中,丁仁源.基于计算机网络路由行为方案的春运旅客区域划分探讨[J].中国铁路, 2008, 12: 9-12.
[120]左妍妍,宋世俊,周永务.基于梯森分割的库存运输模型[J].合肥工业大学学报(自然科学版), 2008, 31(6): 959-962.
[121] Hakimi S L. Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph [J]. Operations Research, 1964, 12(3): 450-459.
[122] Hakimi S L. Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems [J]. Operations Research, 1965, 13(3): 462-475.
[123] Kariv O, Hakimi S L. An Algorithmic Approach to Network Location Problems, II: The P-Medians [J]. SIAM Journal on Applied Mathematics, 1979, 37(3): 539-560.
[124] Kariv O, Hakimi S L. An Algorithmic Approach to Network Location Problems, I: The P-Centers [J]. SIAM Journal on Applied Mathematics, 1979, 37(3): 513-538.
[125]吕海峰,马维忠,王衍华.基于网络分析方法的物流配送中心选址的研究[J].运筹与管理, 2004, 13(6): 80-85.
[126]潘又佳.中国汽车租赁业发展的问题与建议[EB/OL]. (2006-8-11)[2010-3-9]. http://www.chinaleasing.org/doc2/doc1760.htm.
[127]Hart M K. Quality Tools for Decreasing Variation and Defining Process Capability [J]. Production and Inventory Management Journal, 1992, 33(2): 6-11.
[128] Alex T I. Why Car Rental Drive Your Nuts [J]. Fortune, 1987, 116(5): 74-78.
[129] Altman R F, Helms M M. Quantifying Service Quality: Case Study of a Rental Car Agency [J]. Production and Inventory Management Journal, 1995, 36(2): 45-50.
[130]谢金星,薛毅.优化建模与Lindo/Lingo软件[M].北京:清华大学出版社, 2005.
[131]张宏伟,牛志广. Lingo 8.0及其在环境系统优化中的应用[M].天津:天津大学出版社, 2005.
[132] Schrage L. Optimization Modeling with Lingo [M]. 6th ed. Chicago: Lindo Systems Inc., 2006.
[133] Clarke G, Wright J W. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points [J]. Operations Research, 1964, 12(4): 568-581.
[134] Solomon M M. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints [J]. Operations Research, 1987, 35(2): 254-265.
[135] Potvin J Y, Rousseau J M. A Parallel Route Building Algorithm for the Vehicle Routing and Scheduling Problem with Time Windows [J]. European Journal of Operational Research, 1993, 66(3): 331-340.
[136] Wren A. Computers in Transport Planning and Operation [M]. London: Ian Allan, 1971.
[137] Wren A, Holliday A. Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points [J]. Operational Research Quarterly (1970-1977), 1972, 23(3): 333-344.
[138] Gillett B E, Leland R M. A Heuristic Algorithm for the Vehicle-Dispatch Problem [J]. Operations Research, 1974, 22(2): 340-349.
[139] Christofides N, Mingozzi A, Toth P. The Vehicle Routing Problem [M]// Christofides N, Mingozzi A, Toth P, et al. Combinatorial Optimization. New York, USA: John Wiley & Sons, 1979: 315-338.
[140] Braysy O, Gendreau M. Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms [J]. Transportation Science, 2005, 39(1): 104-118.
[141] Osman I H. Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem [J]. Annals of Operations Research, 1993, 41(4): 421-451.
[142] Lin S. Computer Solutions of the Traveling Salesman Problem [J]. Bell System Technical Journal, 1965, 44(10): 2245-2269.
[143] Russell R A. An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions [J]. Operations Research, 1977, 25(3): 517-524.
[144] Gillett B E, Johnson J. Sweep Algorithm for the Multiple Depot Vehicle Dispatch Problem[C]// Proceedings of the ORSA/TIMS Meeting. San Juan, Puerto Rico, 1974.
[145] Baker E K, Schaffer J R. Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints [J]. American Journal of Mathematical and Management Sciences, 1986, 6(3): 261-300.
[146] Garcia B L, Potvin J Y, Rousseau J M. A Parallel Implementation of the Tabu Search Heuristic for Vehicle Routing Problems with Time Window Constraints [J]. Computers & Operations Research, 1994, 21(9): 1025-1033.
[147] Potvin J Y, Rousseau J M. An Exchange Heuristic for Routeing Problems with Time Windows [J]. The Journal of the Operational Research Society, 1995, 46(12): 1433- 1446.
[148] Or I. Travelling Salesman-Type Combinatorial Problems and Their Relation to the Logistics of Regional Blood Banking [D]. Evanston, USA: Northwestern University, 1976.
[149] Savelsbergh M W P. The Vehicle Routing Problem with Time Windows: Minimizing Route Duration [J]. INFORMS Journal on Computing 1992, 4(2): 146-154.
[150] Prosser P, Shaw P. Study of Greedy Search with Multiple Improvement Heuristics for Vehicle Routing Problems [R]. Glasglow, Scotland: Department of Computer Science, University of Strathclyde. 1996.
[151] De Backer B, Furnon V, Kilby P, et al. Local Search in Constraint Programming: Application to the Vehicle Routing Problem[C]// Proceedings of the CP-97 Workshop on Industrial Constraint-Directed Scheduling. Schloss Hagenberg, Austria: Citeseer, 1997: 1-15.
[152] Backer B D, Furnon V, Shaw P, et al. Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics [J]. Journal of Heuristics, 2000, 6(4): 501-523.
[153] Taillard E, Badeau P, Gendreau M, et al. A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows [J]. Transportation Science, 1997, 31(2): 170-186.
[154] Gendreau M, Hertz A, Laporte G. New Insertion and Postoptimization Procedures for the Traveling Salesman Problem [J]. Operations Research, 1992, 40(6): 1086-1094.
[155] Glover F. Multilevel Tabu Search and Embedded Search Neighborhoods for the Traveling Salesman Problem [R]. Boulder, USA: College of Business & Administration, University of Colorado. 1996.
[156] Glover F. Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems [J]. Discrete Applied Mathematics, 1996, 65(1): 223-254.
[157]Caseau Y, Laburthe F. Heuristics for Large Constrained Vehicle Routing Problems [J]. Journal of Heuristics, 1999, 5(3): 281-303.
[158] Rousseau L M, Gendreau M, Pesant G. Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows [J]. Journal of Heuristics, 2002, 8(1): 43-58.
[159] Thompson P M, Psaraftis H N. Cyclic Transfer Algorithms for Multivehicle Routing and Scheduling Problems [J]. Operations Research, 1993, 41(5): 935-946.
[160]李世珣,朱忠平,王亮,等.运输决策与库存控制整合优化研究综述[J].青岛理工大学学报, 2006, 27(3): 126-130.
[161] Herron D P. Managing Physical Distribution for Profit [J]. Harvard Business Review, 1979, 57(3): 121-132.
[162] Harris F W. How Many Parts to Make at Once [J]. Operations Research, 1990, 38(6): 947-950.
[163]金志扬,张孝祖,江浩斌,等.现代物流系统中库存—运输联合优化的博弈分析[J].物流技术, 2005, 10: 284-286.
[164]袁庆达,游斌.库存——运输联合优化问题简介[J].物流技术, 2001, 5: 9-17.
[165]唐加福,董颖,潘震东,等.租赁车辆运输外包模式下多次直接运输策略的集成库存运输计划[J].计算机集成制造系统, 2007, 13(6): 1158-1164.
[166] Federgruen A, Zipkin P. A Combined Vehicle Routing and Inventory Allocation Problem [J]. Operations Research, 1984, 32(5): 1019-1037.
[167] Bramel J, Simchi-Levi D. A Location Based Heuristic for General Routing Problems [J]. Operations Research, 1995, 43(4): 649-660.
[168] Campbell a M, Savelsbergh M W P. A Decomposition Approach for the Inventory- Routing Problem [J]. Transportation Science, 2004, 38(4): 488-502.
[169] Aghezzaf E-H, Raa B, Van Landeghem H. Modeling Inventory Routing Problems in Supply Chains of High Consumption Products [J]. European Journal of Operational Research, 2006, 169(3): 1048-1063.
[170] Sindhuchao S, Romeijn H E, Akcali E, et al. An Integrated Inventory-Routing System for Multi-Item Joint Replenishment with Limited Vehicle Capacity [J]. Journal of Global Optimization, 2005, 32(1): 93-118.
[171]赵达,李军,李妍峰,等.随机需求库存—路径问题:研究现状及展望[J].系统工程, 2007, 25(8): 38-44.
[172]刘立辉,叶春明.库存路径问题的研究综述[J].工业工程, 2009, 12(3): 1-6.
[173] Bertazzi L, Speranza M G. Inventory Control on Sequences of Links with Given Transportation Frequencies [J]. International Journal of Production Economics, 1999, 59(1-3): 261-270.
[174] Rusdiansyah A, Tsao D. Coordinating Deliveries and Inventories for a Supply Chain under Vendor Managed Inventory System [J]. JSME International Journal, Series A, 2005, 48(2): 85-90.
[175] Ahn B, Seo K K. Multi-Items Ordering Model Considering Transportation Constraint on the Inventory Management [J]. The International Journal of Advanced Manufacturing Technology, 2005, 25(1): 88-92.
[176] Anily S, Bramel J. Vehicle Routing and the Supply Chain in Quantitative Models for Supply Chain Management [M]. London, UK: Kluwer Academic Publisher, 1999.
[177] Bertazzi L, Speranza M G. Models and Algorithms for the Minimization of Inventory and Transportation Costs: A Survey, New Trends in Distribution Logistics [J]. Lecture Notes in Economics and Mathematical Systems 1999, 137-157.
[178] Burns L D, Hall R W, Blumenfeld D E, et al. Distribution Strategies That Minimize Transportation and Inventory Costs [J]. Operations Research, 1985, 33(3): 469-490.
[179] Mccann P. A Proof of the Relationship between Optimal Vehicle Size, Haulage Length and the Structure of Distance-Transport Costs [J]. Transportation Research Part A, 2001, 35(8): 671-693.
[180] Viswanathan S, Mathur K. Integrating Routing and Inventory Decisions in One-Warehouse Multiretailer Multiproduct Distribution Systems [J]. Management Science, 1997, 43(3): 294-312.
[181] Robinson L W. Optimal and Approximate Policies in Multiperiod, Multilocation Inventory Models with Transshipments [J]. Operations Research, 1990, 38(2): 278- 295.
[182] Fleischmann B. Transport and Inventory Planning with Discrete Shipment Times [J]. New trends in distribution logistics, 1999, 159–178.
[183] Speranza M G, Ukovich W. An Algorithm for Optimal Shipments with Given Frequencies [J]. Naval Research Logistics, 1996, 43(5): 655-671.
[184]傅成红,符卓.单周期离散随机需求的库存—运输整合优化[J].系统工程, 2007, 25(1): 9-12.
[185]黄红选,韩继业.数学规划[M].北京:清华大学出版社, 2006.
[186] Benders J F. Partitioning Procedures for Solving Mixed-Variables Programming Problems [J]. Numerische Mathematik, 1962, 4(1): 238-252.
[187]朱道立.大系统优化理论和应用[M].上海:上海交通大学出版社, 1987.
[188]田俊峰,杨梅.随机需求条件下生产-库存系统优化与仿真[J].系统仿真学报, 2004, 16(11): 2522-2524.
[189]付蓉,魏萍,万秋兰,等.市场环境下基于Benders分解的输电网规划决策[J].电力系统及其自动化学报, 2006, 18(6): 1-5.
[190] Wu P L, Hartman J C, Wilson G R. A Demand-Shifting Feasibility Algorithm for Benders Decomposition [J]. European Journal of Operational Research, 2003, 148(3): 570-583.
[191]张毅华,陈森发.奔德斯分解法与分支定界法在物流网络设计中的对比研究[J].物流技术, 2008, 27(9): 54-57.
[192]任鸣鸣,杨超,何波.需求不确定状态下的工厂选址和规模决策的综合优化方法[J].系统工程, 2007, 25(6): 1-5.
[193]任鸣鸣.不确定状态下的一种整合的工厂选址模型与求解方法[J].武汉理工大学学报(交通科学与工程版), 2009, 33(6): 1183-1186.
[194] Geoffrion a M. Generalized Benders Decomposition [J]. Journal of Optimization Theory and Applications, 1972, 10(4): 237-260.
[195] Geoffrion a M, Graves G W. Multicommodity Distribution System Design by Benders Decomposition [J]. Management Science, 1974, 20(5): 822-844.