A bi-objective multi-period closed-loop supply chain network under uncertain demand
by Marjan Olfati; Nikbakhsh Javadian
International Journal of Applied Decision Sciences (IJADS), Vol. 13, No. 3, 2020

Abstract: Due to the competitive environment, supply chain management is an important subject in the world of economy. It affects all of the activities including products manufacturing, flow between facilities and costs. In this research, a mixed-integer linear programming model is considered which included supplier, plants, demand markets, collection centres, and disposal centre. The closed-loop supply chain model is bi-objective. So, it is solved by the e-constraint method and non-dominated sorting genetic algorithm-II. In order to improve the meta-heuristic algorithm's efficiency, its parameters are tuned by Taguchi method. Afterward, the different dimensions of the model are considered and the problem is rewritten as a single-objective model and solved by LINGO software and the genetic algorithm using MATLAB software to compare the efficiency of the LINGO and meta-heuristic algorithm. In small-scale problems, solving by LINGO software and in large-scale problems, solving by meta-heuristic algorithms are more efficient.

Online publication date: Tue, 14-Jul-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Applied Decision Sciences (IJADS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com