scholarly journals A hybrid algorithm for solving the economic lot and delivery scheduling problem in the common cycle case

2006 ◽  
Vol 175 (2) ◽  
pp. 1141-1150 ◽  
Author(s):  
Jens Clausen ◽  
Suquan Ju
2017 ◽  
Vol 9 (2) ◽  
pp. 168781401668689 ◽  
Author(s):  
Hamidreza Kia ◽  
Seyed Hassan Ghodsypour ◽  
Hamid Davoudpour

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.


1998 ◽  
Vol 35 (1-4) ◽  
pp. 113-123 ◽  
Author(s):  
Moutaz Khouja ◽  
Zbigniew Michalewicz ◽  
Poorani Vijayaragavan

Sign in / Sign up

Export Citation Format

Share Document