دانلود رایگان مقاله انگلیسی مشکلات مسیریابی تولید با لجستیک معکوس و بازسازی - الزویر 2018

ABSTRACT

This paper introduces a mixed integer programming model for production routing problems with reverse logistics and remanufacturing, which are closed-loop production routing problems addressed for the first time. A solution method of branch-and-cut guided search algorithm is developed. Computational results from instances adapted from benchmarks of production routing problems show that, the algorithm is more effective when pickup requests are relative high. The problem is also easier to solve when production or transportation costs are lower. The optimal decisions are insensitive to the location of remanufacturing depot whether it is geographically centered or centered with gravity.

5. Conclusions

We have introduced, modeled and analyzed the PRPRPD, a generalization of the VRPSPD and IRPSPD. The contributions of this paper are (i) to describe a modeling approach enriching the production routing problems with remanufacturing, simultaneous pickups and deliveries; (ii) to offer a mixed integer linear programming formulation for the PRPRPD; (iii) to provide a branch-and-cut guided search algorithm; and (iv) to present extensive computational analyses that capture the effects of key remanufacturing parameters on the balance between manufacturing and remanufacturing, from which managerial insight can be drawn. Several extensions are possible for the PRPRPD. One worth mentioning here is the possibility of incorporating carbon emissions in vehicle routing. Another extension would be to consider the simultaneous pickups and deliveries in multi-level production and routing problems with time windows. Finally, a branch-price-and-cut algorithm could be developed when dealing with a limited number of customers per vehicle.