[1] Mitra S. Revenue management for remanufactured products[J]. Omega, 2007, 35(5): 553-562. [2] Sundin E, Lee H M. In what way is remanufacturing good for the environment[J]. Design for Innovative Value Towards A Sustainable Society, 2012: 552-557. [3] Wei S, Cheng D, Sundin E, et al. Motives and barriers of the remanufacturing industry in China[J]. Journal of Cleaner Production, 2015, 94: 340-351. [4] 李一峰,武红江.基于代理和遗传算法的供应链优化模拟[J].工业工程与管理,2003,8(4):59-62. [5] Mont O K. Clarifying the concept of product-service system[J]. Journal of cleaner production, 2002, 10(3): 237-245. [6] Manzini E, Vezzoli C. A strategic design approach to develop sustainable product service systems: examples taken from the ‘environmentally friendly innovation'Italian prize[J]. Journal of cleaner production, 2003, 11(8): 851-857. [7] 刘宇熹,谢家平.可持续发展下的制造企业商业模式创新:闭环产品服务系统[J].科学学与科学技术管理,2015(1):53-62. [8] Liu S C, Lee S B. A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration[J]. The International Journal of Advanced Manufacturing Technology, 2003, 22(11): 941-950. [9] Guerrero W J, Prodhon C, Velasco N, et al. A relax-and-price heuristic for the inventory-location-routing problem[J]. International Transactions in Operational Research, 2014, 22(1): 129-148. [10] 唐金环,戢守峰,蓝海燕,等.考虑碳配额差值的选址-路径-库存联合优化多目标模型与求解[J].管理工程学报,2017(1):162-168. [11] Li Y, Guo H, Wang L, et al. A hybrid genetic-simulated annealing algorithm for the location-inventory-routing problem considering returns under e-supply Chain environment[J]. Scientific World Journal, 2013(11): 1653-1656. [12] Deng S, Li Y, Guo H, et al. Solving a closed-loop location-inventory-routing problem with mixed quality defects returns in e-commerce by hybrid ant colony optimization algorithm[J]. Discrete Dynamics in Nature and Society, 2016(2): 1-12. [13] Zhalechian M, Tavakkoli-Moghaddam R, Zahiri B, et al. Sustainable design of a closed-loop location-routing-inventory supply chain network under mixed uncertainty[J]. Transportation Research Part E Logistics & Transportation Review, 2016, 89: 182-214. [14] Forouzanfar F, Tavakkoli-Moghaddam R, Bashiri M, et al. New mathematical modeling for a location-routing-inventory problem in a multi-period closed-loop supply chain in a car industry[J]. Journal of Industrial Engineering International, 2017(6): 1-17. [15] Belenguer J M, Benavent E, Prins C, et al.. A branch-and-cut method for the capacitated location-routing problem[J]. Computers & Operations Research, 2011, 38(6): 931-941. [16] Glover F. Future paths for integer programming and links to artificial intelligence[J]. Computers & operations research, 1986, 13(5): 533-549. [17] Javid A A, Azad N. Incorporating location, routing and inventory decisions in supply chain network design[J]. Transportation Research Part E: Logistics and Transportation Review, 2010, 46(5): 582-597. [18] Zhang Y, Qi M, Miao L, et al. Hybrid metaheuristic solutions to inventory location routing problem[J]. Transportation Research Part E: Logistics and Transportation Review, 2014, 70: 305-323. [19] Vincent F Y, Lin S W, Lee W, et al. A simulated annealing heuristic for the capacitated location routing problem[J]. Computers & Industrial Engineering, 2010, 58(2): 288-299. [20] Rosenkrantz D J, Stearns R E, Lewis P M. Approximate algorithms for the traveling salesperson problem[J]. Foundations of Computer Science Annual Symposium on, 1974, 15(4): 33-42. [21] Prins C, Prodhon C, Ruiz A, et al. Solving the capacitated location-routing problem by a cooperative lagrangean relaxation-granular tabu search heuristic[J]. Transportation Science, 2007, 41(4): 470-483. |