Journal
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
Volume 111, Issue -, Pages 87-100Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.tre.2018.01.009
Keywords
Reverse logistics; Re-manufacturing; Vehicle routing; Production planning; Branch-and-cut guided search
Categories
Funding
- National Natural Science Foundation of China [71571092]
- Priority Academic Program Development of Jiangsu Higher Education Institutions (PAPD)
- General Research Project for Humanities and Social Sciences from Chinese Ministry of Education [11YJCZH137]
- Paul and Heidi Brown Professorship
Ask authors/readers for more resources
This paper introduces a mixed integer programming model for production routing problems with reverse logistics and remanufacturing, which are dosed-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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available