Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/74873
Title: Maximizing recyclability and reuse of tertiary packaging in production and distribution network
Authors: Chung, SH 
Ma, HL 
Chan, HK
Keywords: Genetic algorithm
Logistics network
Production and distribution
Recycle and reuse
Tertiary packaging
Issue Date: 2018
Publisher: Elsevier B.V.
Source: Resources, conservation and recycling, 2018, v. 128, p. 259-266 How to cite?
Journal: Resources, conservation and recycling 
Abstract: Tertiary packaging is necessary for transportation in any production and distribution network because of the benefits in enhancing the logistics efficiency. However, in the meantime, it produces a lot of packaging waste every day. In fact, some tertiary packaging after transportation may still be in good condition and can be collected back for reuse. However, this has not been widely studied in the existing literature. The purpose of this research is to fulfill this research gap. Accordingly, the contribution of this paper is to propose a new optimization methodology, named modified Genetic Algorithm with Crossing Date heuristic, to maximize the collection of used tertiary packaging for reuse, meanwhile minimize the total operating cost by taking the advantages of simultaneous optimization of a multi-day planning. From the numerical experiments, it is found that the optimization ability of proposed new optimization methodology outperform the traditional genetic algorithm by a maximum of about 10%. In addition, the total operating cost is found can be reduced by using the proposed multi-day planning approach.
URI: http://hdl.handle.net/10397/74873
ISSN: 0921-3449
DOI: 10.1016/j.resconrec.2016.06.025
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

3
Last Week
0
Last month
Citations as of Oct 20, 2018

Page view(s)

14
Citations as of Oct 14, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.