考虑路径可行性与仓储集货模式下的回收车辆路径问题研究

doi:10.16381/j.cnki.issn1003-207x.2016.12.012

中国管理科学 ›› 2016, Vol. 24 ›› Issue (12): 98-107.doi: 10.16381/j.cnki.issn1003-207x.2016.12.012

考虑路径可行性与仓储集货模式下的回收车辆路径问题研究

刘艳秋^1,2, 徐世达¹, 张颖², 李佳¹

1. 沈阳工业大学管理学院, 辽宁沈阳 110870;
2. 沈阳工业大学理学院, 辽宁沈阳 110870

收稿日期:2015-01-26 修回日期:2015-12-18 发布日期:2017-03-07
通讯作者: 徐世达(1990-),男(汉族),黑龙江五常人,沈阳工业大学管理学院,博士研究生,研究方向:物流工程与管理,E-mail:xushida@live.com. E-mail:xushida@live.com
基金资助:
国家自然科学基金资助项目（70431003）；辽宁省科学技术计划基金资助项目（2013216015）；沈阳市科技计划基金资助项目（F13-051-2-00，F14-231-1-24）

Research on Recycling Path Optimization Problem with Feasibility of Path and Concentrated Treatment Mode

LIU Yan-qiu^1,2, XU Shi-da¹, ZHANG Ying², LI Jia¹

1. School of management, Shenyang University of technology, Shenyang 110870, China;
2. School of Sciences, Shenyang University of technology, Shenyang 110870, China

Received:2015-01-26 Revised:2015-12-18 Published:2017-03-07

摘要/Abstract

摘要： 逆向物流回收车辆调度过程中，往往出现由于需求节点位置及需求量信息的不确定性导致难以合理决策完成回收任务所需派出回收车辆的数目，此时，第三方物流逐渐被应用于回收产品的运输服务中。然而在实际的回收过程中，通常各物流需求节点的需求量较小，需要对多个物流节点的产品集中后统一进行处理；同时由于外界因素的限制，不能保证任意两个节点间均存在可行路径，需要通过中转运输的方式寻找替代路线。针对以上问题，本文提出一种基于路径可行性与仓储集货运输模式的回收车辆路径设计方案，并根据问题的特点对传统蚁群算法（ACO）中编码方式以及概率选择操作方式进行改进，提出一种逆选择操作蚁群算法（ACO-nso）。最后通过算例证明提出模型与算法的有效性。

关键词: 路径可行性, 仓储集货模式, 回收车辆路径问题, 逆选择操作蚁群算法

Abstract: In recycling path optimization, Third Party Logistics are gradually used to transport Product Recovery Management, due to the uncertainty of information of demand point location and quantity affected manager making policy by optimal vehicle number. However, demand of node are small in the actual operation process. In general, concentrated treatment mode was used in the transport activity. And due to the limited of environmental factors, cannot ensure every path is feasible, transport vehicle need to find alternative routes. In this context, how to work with the Third Party Logistics, how to determine the location and capacity Q_j of recovery stations for manufacturers; How to respond to the need and situation of consumers and manufactures, to determine the optimal recycling path; As well as how to transform concentrated treatment mode to the mathematical model in this paper, all these are the problems to be solved.Based on the above issues, an approach base-on Feasibility of Path and Concentrated Treatment Mode is developed for recycling path optimization. Firstly, a computerized model of based on vehicle routing problem in reverse logistics is established after comparing and analyzing the model of LRP and OVRP. Furtherly, an improved ACO algorithm by improving the coding mode and possible selection(ACO-nso) is proposed. Finally, The convergence of the ACO-nso proposed is proved,and the effectiveness of the algorithm is proven with an example and the applicable scope pf the problem is discussed.It is shown that the model and ACO-nso algorithm improved in this paper is suitable for under-intermediate-level scale recycling path routing problem, moreover requires a shorter time of calculation and better global searching ability than traditional intelligent optimization algorithms. The data used in numerical simulation, is primarily references to the relevant literatures and simulation data. The ACO-nso also promotes the research about path optimization and other combinatorial optimization problems.

Key words: feasibility of path, concentrated treatment mode, recycling path optimization problem, ACO-nso

中图分类号:

C939

刘艳秋, 徐世达, 张颖, 李佳. 考虑路径可行性与仓储集货模式下的回收车辆路径问题研究[J]. 中国管理科学, 2016, 24(12): 98-107.

LIU Yan-qiu, XU Shi-da, ZHANG Ying, LI Jia. Research on Recycling Path Optimization Problem with Feasibility of Path and Concentrated Treatment Mode[J]. Chinese Journal of Management Science, 2016, 24(12): 98-107.

参考文献

[1] Dantzig G B, Ramser J H. The truck dispatching problem[J]. Management science, 1959, 6(1): 80-91.

[2] Bing Xiaoyun, de Keizer M, Bloemhof-Ruwaard J M, et al. Vehicle routing for the eco-efficient collection of household plastic waste[J]. Waste Management, 2014, 34(4): 719-729.

[3] Wen Liang, Eglese R. Minimum cost VRP with time-dependent speed data and congestion charge[J]. Computers & Operations Research, 2015,56: 41-50.

[4] Kalayci C B, Kaya C. An ant colony system empowerred variable neighborhood search algorithm for the vehicle routing problem with simultaneous pickup and delivery[J]. Expert Systems with Applications, 2016, 66: 163-175.

[5] Lai D S W, Demirag O C, Leung J M Y. A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph[J]. Transportation Research Part E: Logistics and Transportation Review, 2016, 86: 32-52.

[6] Jayaraman V, Patterson R A, Rolland E. The design of reverse distribution networks: Models and solution procedures[J]. European Journal of Operational Research, 2003, 150(1): 128-149.

[7] Lo H K, Szeto W Y. Time-dependent transport network design under cost-recovery[J]. Transportation Research Part B: Methodological, 2009, 43(1): 142-158.

[8] Dat L Q, Linh D T T, Chou S Y, et al. Optimizing reverse logistic costs for recycling end-of-life electrical and electronic products[J]. Expert Systems with Applications, 2012, 39(7): 6380-6387.

[9] Demir E, Burgholzer W, Hrušovsky M, et al. A green intermodal service network design problem with travel time uncertainty[J]. Transportation Research Part B: Methodological, 2016,93(B):789-807.

[10] 何波,杨超,张华.废弃物回收的多层逆向物流网络优化设计问题研究[J].中国管理科学,2007,15(3): 61-67.

[11] 罗耀波,孙延明,廖鹏.带退货和软时间窗的多仓库选址-路径问题研究[J].运筹与管理,2014,23(5): 78-85.

[12] Escobar J W, Linfati R, Baldoquin M G, et al. A granular variable tabu neighborhood search for the capacitated location-routing problem[J]. Transportation Research Part B: Methodological,2014,67: 344-356.

[13] 代颖,马祖军,朱道立.震后应急物资配送的模糊动态定位-路径问题[J].管理科学学报,2012,(07):60-70.

[14] 熊中楷,方衍,张聪誉.以旧换新收购方式下的逆向物流网络优化设计[J].中国管理科学, 2011,19(6):65-72.

[15] Cai Xiaoqiang, Chen Jian, Xiao Yongbo, et al. Fresh-product supply chain management with logistics outsourcing[J].Omega,2013,41(4):752-765.

[16] López-Sánchez A D, Hernández-Díaz A G, Vigo D, et al. A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem[J]. European Journal of Operational Research, 2014, 238(1): 104-113.

[17] Marinakis Y, Marinaki M. A bumble bees mating optimization algorithm for the open vehicle routing problem[J]. Swarm and Evolutionary Computation, 2014, 15: 80-94.

[18] 符卓. 带装载能力约束的开放式车辆路径问题及其禁忌搜索算法研究[J].系统工程理论与实践,2004, 24(3): 123-128.

[19] 张江华,李进,高敏刚.同时集散货物的开放式车辆路径问题研究[J].中国管理科学, 2013, 21(4): 187-192.

[20] Dorigo M,Di Caro G,Gambardella L M.Ant algorithms for discrete optimization[J]. Artificial life, 1999, 5(2): 137-172.

[21] Santos L, Coutinho-Rodrigues J, Current J R. An improved ant colony optimization based algorithm for the capacitated arc routing problem[J]. Transportation Research Part B: Methodological, 2010, 44(2): 246-266.

[22] 蔡婉君,王晨宇,于滨,等.改进蚁群算法优化周期性车辆路径问题[J].运筹与管理, 2014, 23(5): 70-77.

[23] Schyns M. An ant colony system for responsive dynamic vehicle routing[J]. European Journal of Operational Research, 2015, 245(3): 704-718.

[24] Kuo R J, Wibowo B S, Zulvia F E. Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service time[J]. Applied Mathematical Modelling, 2016, 40(23): 9990-10001.

[25] 张建勇,李军.具有同时配送和回收需求的车辆路径问题的混合遗传算法[J].中国公路学报,2006,19(4):118-122.

[26] 马华伟,叶浩然,夏维.允许分割配送的多时间窗车辆调度问题的改进蚁群算法求解[J].中国管理科学,2012,(1):43-47

考虑路径可行性与仓储集货模式下的回收车辆路径问题研究

Research on Recycling Path Optimization Problem with Feasibility of Path and Concentrated Treatment Mode

PDF (PC)

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 5

Metrics

本文评价

推荐阅读 10

[1]	许淑君. 基于双版面Hotelling模型的在线广告灵活版面定价策略研究[J]. 中国管理科学, 2017, 25(12): 117-125.
[2]	余顺坤, 杨文茵. 基于网络组织的企业-部门绩效评价信息集成方法研究[J]. 中国管理科学, 2017, 25(7): 176-183.
[3]	王建军, 刘晓盼, 刘锋, 王杜娟. 随机机器故障下加工时间可控的并行机鲁棒调度[J]. 中国管理科学, 2017, 25(3): 137-146.
[4]	葛怀志, 张金隆. 基于公理设计和功能过剩的公共住房撮合分配方法[J]. 中国管理科学, 2015, 23(1): 111-120.
[5]	余顺坤, 王巧莲, 尹昌洁. 基于绩效源分析的组织-员工发展匹配集结决策模型研究[J]. 中国管理科学, 2014, 22(4): 142-148.