A Pareto-based optimisation algorithm for a multi-objective integrated production-distribution planning problem of a multi-echelon supply chain network design
by Keyvan Sarrafha; Abolfazl Kazemi; Alireza Alinezhad; Seyed Taghi Akhavan Niaki
International Journal of Services and Operations Management (IJSOM), Vol. 38, No. 1, 2021

Abstract: This paper addresses a multi-periodic supply chain network design (SCND) problem involving suppliers, manufacturers, distribution centres (DCs), and customer zones (CZs). Logistic decisions made in each time period have a tactical nature. Location/strategic decisions are made at the beginning of the time horizon and remain unchanged until the last period. While both backorders and lost sales are considered, the aim is to design the supply chain network (SCN) under three minimisation objectives including total costs, the transfer time of products to CZs, and backorder level and lost sale of products. A multi-objective mixed-integer linear programming (MILP) model is developed and a meta-heuristic algorithm named multi-objective vibration damping optimisation (MOVDO) with tuned parameters is proposed to find non-dominated solutions. The performance of this method is compared with two popular existing algorithms called NSGA-II and NRGA when they solve some randomly generated problems.

Online publication date: Wed, 20-Jan-2021

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 Services and Operations Management (IJSOM):
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