Bi-objective reliable multi-product location-inventory problem design with perishable products and freshness-dependent demands Online publication date: Tue, 18-May-2021
by Mohsen Aghajani; Parviz Fattahi; Vahid Hajipour
International Journal of Industrial and Systems Engineering (IJISE), Vol. 38, No. 1, 2021
Abstract: This paper tackles a bi-objective location-inventory problem (LIP) in a three-echelon multi-product supply chain with perishable products. Demands from customers are stochastic and freshness-dependent. Moreover, reliability issues are considered in terms of three different levels of failures for the distribution centres, namely disastrous, serious and partial. We also assess how well the customers' demands are met with products that are fresh enough and regard this as a reliability indicator from the viewpoint of customers. The problem is formulated as a mixed integer nonlinear programming (MINLP) model and six multi-objective decision-making (MODM) methods namely individual optimisation method, goal programming method, LP metrics/global criteria method, utility function method, goal attainment method, and maxi-min method are applied to solve test problems of different sizes. Finally, to select the best method, we used the filtering/displaced ideal solution (DIS) method where the goal programming method turned out to outperform other methods. Goal programming was then applied for sensitivity analysis of the problem.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and 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