主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

Chinese Journal of Management Science ›› 2016, Vol. 24 ›› Issue (12): 98-107.doi: 10.16381/j.cnki.issn1003-207x.2016.12.012

• Articles • Previous Articles     Next Articles

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

LIU Yan-qiu1,2, XU Shi-da1, ZHANG Ying2, LI Jia1   

  1. 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: 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 Qj 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

CLC Number: