Study on Planning of Recycling Reverse Logistics System and the Campus Based Case Study

Regarding low-carbon and sustainable development as themes of the era, people concentrate more on resources recycling. However the current social recycling system loses substantial potential recyclable resources and causes additional waste of energy and resources itself, due to the lack of an appropriate and effective mechanism. Based on the studies of modern logistics and reverse logistics, this article proposes a technique as Recycling Reverse Logistics System to solve the problem in order to improve the situation. Combined with E-business and IT technology, the technique provides measures to construct and assess the system. In addition, the article provides a case-study of the campus paper recycling system, so that the technique is tested and validated.

[1]  J. Christopher Beck,et al.  Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics , 2000, Artif. Intell..

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Andrew V. Goldberg,et al.  Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.

[4]  A. E. Eiben,et al.  Genetic algorithms with multi-parent recombination , 1994, PPSN.

[5]  J. Christopher Beck,et al.  A Hybrid Approach to Scheduling with Earliness and Tardiness Costs , 2003, Ann. Oper. Res..

[6]  Philippe Baptiste,et al.  Constraint - based scheduling : applying constraint programming to scheduling problems , 2001 .

[7]  Marjan A. Milenkov,et al.  Logistics information system , 2010 .

[8]  D. Mollenkopf,et al.  The returns management process in supply chain strategy , 2007 .

[9]  Benny Tjahjono,et al.  Towards an improved tool to facilitate simulation modelling of complex manufacturing systems , 2009 .

[10]  Danny Ziyi Chen.  Developing algorithms and software for geometric path planning problems , 1996, CSUR.

[11]  Xiaolei Ma,et al.  Vehicle Routing Problem , 2013 .

[12]  Wim Nuijten,et al.  Solving Scheduling Problems with Setup Times and Alternative Resources , 2000, AIPS.

[13]  Philippe Laborie,et al.  Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results , 2003, Artif. Intell..

[14]  Edward Tsang,et al.  Constraint Based Scheduling: Applying Constraint Programming to Scheduling Problems , 2003, J. Sched..

[15]  Bala Ramachandran,et al.  An Ant-bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions , 2008, Advances in Metaheuristics for Hard Optimization.

[16]  Adrian Kapczyński,et al.  Internet - Technical Development and Applications , 2009 .

[17]  A. Kaufmann,et al.  Methods and models of operations research , 1963 .

[18]  Mark E. J. Newman,et al.  Structure and Dynamics of Networks , 2009 .

[19]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[20]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.