An ERNSGA‐III algorithm for the production and distribution planning problem in the multiagent supply chain. (20th March 2019)

• Record Type: Journal Article
• Authors: Gharaei, Ali; Jolai, Fariborz
• Other Names: Crainic Teodor G. guestEditor.; Guajardo Mario guestEditor.; Roy Debjit guestEditor.; Wallace Stein W. guestEditor.
• Is Part Of: International transactions in operational research. Volume 28:Number 4(2021)
• Page Start: 2139
• Page End: 2168
• Publication Date: 2019-03-20
• Subjects: supply chain -- scheduling -- multiagent -- distribution -- reference point -- ERNSGA‐III; Operations research -- Periodicals; 003
• DOI: 10.1111/itor.12654
• Languages: English
• ISSNs: 0969-6016

Abstract

Abstract: Nowadays, new issues have been emerged in industry by increasing the supply chain boundaries, especially when some supply chain members seek their own interests. In the literature, this case is referred to as a multiagent problem in which each agent has his/her own set of jobs and objectives. Here, an integrated production scheduling and distribution problem in a multisite supply chain is investigated from the three‐agent perspective of the manufacturer, distributor, and customer. Due to the complexity of the problem, a novel evolutionary‐based reference point determination of the third version of the non‐dominated sorting genetic algorithm (ERNSGA‐III) is proposed. In this algorithm, some modifications to the classic version of NSGA‐III have been made and a novel reference point determination method based on Bees algorithm is used in the selection operation. Some statistical tests are performed to compare the proposed algorithm with three other algorithms in the literature. The results show that the proposed algorithm is more effective than other algorithms.