Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem. (2nd January 2022)

• Record Type: Journal Article
• Authors: Gharaei, Ali; Jolai, Fariborz
• Is Part Of: Optimization methods and software. Volume 37:Number 1(2022)
• Page Start: 150
• Page End: 174
• Publication Date: 2022-01-02
• Subjects: Batch delivery -- multi-agent scheduling -- routing decision -- decomposition; 90B06 -- 90B35; Mathematical optimization -- Periodicals; Algorithms -- Periodicals; 519.7
• DOI: 10.1080/10556788.2020.1714615
• Languages: English
• ISSNs: 1055-6788

Abstract

ABSTRACT: Supply chain integration has become one of the most attractive topics for researchers in recent years. One of the advantages of this integration is in improving overall profit in comparison to separate decisions. In this study, an integrated scheduling and distribution problem is investigated. One of the contributions of this paper is to study this problem from a multi-agent viewpoint. In this case, each agent has a set of jobs with its own objective and compete with each other to acquire supply chain resources. Here, a two-agent problem is discussed where the objectives of the agents are the minimization of the total tardiness and the total cost of distribution. A mathematical formulation and two heuristics based on decomposition approaches are presented. In the first approach, a modified Benders decomposition is presented. Also, some valid inequalities are introduced to increase the convergence speed of this algorithm. In the second approach, a decomposition and cutting approach is developed. The results represent the good performance of both algorithms in comparison to other exact methods.