Please use this identifier to cite or link to this item:
Title: Bi-objective optimization of three echelon supply chain involving truck selection and loading using NSGA-II with heuristics algorithm
Authors: Chan, FTS 
Jha, A
Tiwari, MK
Keywords: Genetic algorithm
Multi-objective programming
Supply chain management
Issue Date: 2016
Publisher: Elsevier
Source: Applied soft computing, 2016, v. 38, p. 978-987 How to cite?
Journal: Applied soft computing 
Abstract: This paper models a three echelon supply chain distribution problem considering multiple time periods, multi-products and uncertain demands. To take the problem closer to reality we consider multiple truck types and focus on the truck selection and loading sub-problem. Truck selection is important because the quantity of goods to be transported varies regularly and also because different trucks have different hiring cost, mileage and speed. Truck loading is important when considering the optimal loading pattern of products having different shapes and sizes on trucks, which themselves have distinct loading capacities. The two objectives considered here are the cost and responsiveness of the supply chain. The distribution problem is solved using the non-dominated sorting genetic algorithm (NSGA-II). However, the genetic algorithms compromise the optimality of the sub-problems while optimizing the entire system. But the optimality of truck selection and loading sub-problem is non-compromisable in nature. Hence a heuristic algorithm is used innovatively along with the NSGA-II to produce much better solutions. To make our model more realistic, the distribution chain is modelled as a push-pull based supply chain having multiple time periods and using demand aggregation over time. Using a separate algorithm also gives the advantage of utilizing the difference in nature of the push and pull part of the supply chain by giving every individual truck different objectives. Real life like data is generated and the optimality gap between the heuristic and non-heuristic approach is calculated. A clear improvement in objectives can be seen while using the heuristic approach.
ISSN: 1568-4946
EISSN: 1872-9681
DOI: 10.1016/j.asoc.2015.10.067
Appears in Collections:Journal/Magazine Article

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


Last Week
Last month
Citations as of Aug 9, 2018


Last Week
Last month
Citations as of Aug 16, 2018

Page view(s)

Last Week
Last month
Citations as of Aug 19, 2018

Google ScholarTM



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