�OPTIMIZATION OF MULTI-COMMODITIES CONSUMER SUPPLY CHAINS FOR-PART I-MODELING�? | Science Publications

Journal of Computer Science

Zeinab Haji Abolhasani¹  Lee Loung¹  Romeo M. Marian¹ 

关键词: Supply Chain;    Genetic Algorithm;    Optimization;    Simulation;    Discrete Event System;   

DOI  :  10.3844/jcssp.2013.1830.1846

学科分类：计算机科学（综合）

来源: Science Publications

【 摘 要 】

This study and its companions (Part II, Part III) will concentrate on optimizing a class of supply chain problems known as Multi-Commodities Consumer Supply Chain (MCCSC) problem. MCCSC problem belongs to Production-Distribution (P-D) planning category. It aims to determine facilities location, consumers’ allocation and facilities configuration to minimize total Cost (C_T) of the entire network. These facilities can be manufacturer units (MUs), Distribution Centres (DCs) and Retailers/End-users (REs) but not limited to them. To address this problem, three major tasks should be undertaken. At the first place, a Mixed Integer Non-Linear Programming (MINP) mathematical model is developed. Then, system’s behaviors under different conditions will be observed using a simulation modeling tool. Finally, the most optimum solution (minimum C_T) of the system will be obtained using a multi-objective optimization technique. Due to the large size of the problem and the uncertainties in finding the most optimum solution, integration of modeling and simulation methodologies is proposed followed by developing new approach known as GASG. It is a genetic algorithm on the basis of granular simulation which is the subject of the methodology of this research. In part II, MCCSC is simulated using Discrete-Event Simulation (DES) device within an integrated environment of SimEvents and Simulink of MATLAB^® software package followed by a comprehensive case study to examine the given strategy. Also, the effect of genetic operators on the obtained optimal/near optimal solution by the simulation model will be discussed in part III.

【 授权许可】

Unknown