2024 : 11 : 22
Seyed Hadi Nasseri

Seyed Hadi Nasseri

Academic rank: Associate Professor
ORCID:
Education: PhD.
ScopusId:
HIndex:
Faculty: Faculty of Mathematical Sciences
Address:
Phone: 01135302472

Research

Title
A meta-heuristic approach supported by NSGA-II for the design and plan of supply chain networks considering new product development
Type
JournalPaper
Keywords
Supply chain ,New product development , NSGA-II NRGA ,Tri-objective problem
Year
2017
Journal journal of industrial engineering international
DOI
Researchers Zahra Alizadeh ، Mohammad Mahdi Paydar ، Seyed Hadi Nasseri ، Iraj Mahdavi

Abstract

There are many reasons for the growing interest in developing new product projects for any firm. The most embossed reason is surviving in a highly competitive industry which the customer tastes are changing rapidly. A well-managed supply chain network can provide the most profit for firms due to considering new product development. Along with profit, customer satisfaction and production of new products are goals which lead to a more efficient supply chain. As new products appear in the market, the old products could become obsolete, and then phased out. The most important parameter in a supply chain which considers new and developed products is the time that developed and new products are introduced and old products are phased out. With consideration of the factors noted above, this study proposes to design a tri-objective multi-echelon multiproduct multi-period supply chain model, which incorporates product development and new product production and their effects on supply chain configuration. The supply chain under consideration is assumed to consist of suppliers, manufacturers, distributors and customer groups. In terms of overcoming NP-hardness of the proposed model and in order to solve the complicated problem, a non-dominated sorting genetic algorithm is employed. As there is no benchmark available in the literature, the non-dominated ranking genetic algorithm is developed to validate the results obtained and some test problems are provided to show the applicability of the proposed methodology and evaluate the performance of the algorithms.