Please use this identifier to cite or link to this item:
Afrouzy, Zahra Alizadeh
Paydar, Mohammad Mahdi
Nasseri, Seyed Hadi
Mahdavi, Iraj
Year of Publication: 
[Journal:] Journal of Industrial Engineering International [ISSN:] 2251-712X [Volume:] 14 [Year:] 2018 [Issue:] 1 [Pages:] 95-109
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 multi-product 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.
Supply chain
New product development
Tri-objective problem
Persistent Identifier of the first edition: 
Creative Commons License:
Document Type: 

Files in This Item:

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.