A multi-objective optimization model for cooperative supply chain planning

Ben Yahia, Wafa (National School of Engineers of Sfax (ENIS), University of Sfax, Tunisia, Route de Sokra B.P.1173 - 3038, Sfax, Tunisia) ; Cheikhrouhou, Naoufel (Haute école de gestion de Genève, HES-SO // Haute Ecole Spécialisée de Suisse Occidentale) ; Ayadi, Omar (Mechanics, Modelling and Production Research Laboratory, National School of Engineers of Sfax (ENIS), University of Sfax, Tunisia Route de Sokra B.P.1173 - 3038, Sfax, Tunisia) ; et al.

Generally, each member of a supply chain (SC) optimizes his own individual objective and accordingly, plans his activities (e.g. production operations, inventories) without considering a global perspective. The goal of this work is the development of a multiobjective optimization model for cooperative planning between different manufacturing plants belonging to the same SC. The model aims at minimizing simultaneously the total production cost and the average of inventory level for several items and over a multi-period horizon. To solve this problem, a non-dominated sorting elitist genetic algorithm (NSGA-II) is developed to derive the Pareto frontsolutions. Several tests are developed to show the performance of the solution method and the behavior of the cooperative planning model with respect to different demand patterns. The proposed model shows high performance in the tested cases with comparison to the literature.


Mots-clés:
Type d'article:
scientifique
Ecole:
HEG-GE
Institut:
Centre de Recherche Appliquée en Gestion
Classification:
Économie/gestion
Date:
2017
Pagination:
25 p.
Titre du document hôte:
International Journal of Services and Operations Management
Numérotation (vol. no.):
2017, vol. 26, no. 2, pp. 211-237
DOI:
ISSN:
ISSN: 1744-2370
Date d'embargo:
2017-07-01
Le document apparaît dans:

Note: The file is under embargo until: 2017-07-01


 Notice créée le 2016-05-25, modifiée le 2017-10-16

Fichiers:
Télécharger le document
PDF

Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)