A hybrid imperialist competitive algorithm for solving economic lot and delivery scheduling problem in a four-stage supply chain
Open Access
- 8 February 2017
- journal article
- research article
- Published by SAGE Publications in Advances in Mechanical Engineering
- Vol. 9 (2)
Abstract
In this article, we study the economic lot and delivery scheduling problem for a four-stage supply chain that includes suppliers, fabricators, assemblers, and retailers. All of the parameters such as demand rate are deterministic and production setup times are sequence-dependent. The common cycle time and integer multipliers policies are adapted as replenishment policies for synchronization throughout the supply chain. A new mixed integer nonlinear programming model is developed for both policies, the objective of which is the minimization of inventory, transportation, and production setup costs. We propose a new hybrid algorithm including a modified imperialist competitive algorithm which is purposed to the assimilation policy of imperialist competitive algorithm and teaching learning–based optimization which is added to improve local search. A hybrid modified imperialist competitive algorithm and teaching learning–based optimization is applied to find a near-optimum solution of mixed integer nonlinear programming in large-sized problems. The results denoted that our proposed algorithm can solve different size of problem in reasonable time. This procedure showed its efficiency in medium- and large-sized problems as compared to imperialist competitive algorithm, modified imperialist competitive algorithm, and other methods reported in the literature.Keywords
This publication has 17 references indexed in Scilit:
- Economic lot and delivery scheduling problem for multi-stage supply chainsInternational Journal of Production Economics, 2011
- Colonial competitive algorithmInternational Journal of Intelligent Computing and Cybernetics, 2008
- An algorithm for the generalized quadratic assignment problemComputational Optimization and Applications, 2007
- A hybrid algorithm for solving the economic lot and delivery scheduling problem in the common cycle caseEuropean Journal of Operational Research, 2006
- A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chainsEuropean Journal of Operational Research, 2006
- A simple recipe for concise mixed 0-1 linearizationsOperations Research Letters, 2005
- An optimal polynomial time algorithm for the common cycle economic lot and delivery scheduling problemEuropean Journal of Operational Research, 2004
- The economic lot and delivery scheduling problem: common cycle, rework, and variable production rateIIE Transactions, 2000
- The economic lot and delivery scheduling problem: the common cycle caseIIE Transactions, 1995
- The economic lot and delivery scheduling problem: The single item caseInternational Journal of Production Economics, 1992