A discrete harmony search algorithm for the economic lot scheduling problem with power of two policy

2012 IEEE Congress on Evolutionary Computation, CEC 2012

Volumn , Issue , 2012, Pages

  Tasgetiren, M Fatih ^a   Bulut, Onder ^a   Murat Fadiloglu, M ^a  

^a YASAR UNIVERSITY   (Turkey)

Author keywords

economic lot scheduling problem; extended basic period; harmony search algorithm; heuristic optimization; power of two policy

Indexed keywords

ECONOMIC LOT SCHEDULING PROBLEMS; EXTENDED BASIC PERIOD; HARMONY SEARCH ALGORITHMS; HEURISTIC OPTIMIZATION; POWER-OF-TWO POLICIES;

LEARNING ALGORITHMS; PRODUCTION CONTROL;

OPERATIONS RESEARCH;

EID: 84866870800     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2012.6256592     Document Type: Conference Paper

References (37)

1. Hsu W (1983) On the general feasibility test of scheduling lot sizes for several products on one machine. Management Science, vol. 29, pp. 93-105.
2. Hanssmann F (1962) Operation Research in Production and Inventory, Wiley, New York.
3. Bomberger E E (1966) A dynamic programming approach to a lot size scheduling problem. Management Science, vol. 12, pp. 778-784.
4. Elmaghraby S E (1978) The economic lot scheduling problem (ELSP): review and extensions. Management Science, vol. 24, pp. 587-598.
5. Grznar J and Riggle C (1997) An optimal algorithm for the basic period approach to the economic lot schedule problem. Omega, vol. 25, pp. 355-64.
6. Sun H, Huang H and Jaruphongsa W (2010) The economic lot scheduling problem under extended basic period and power-of-two policy. Optimization Letters, vol. 4, pp. 157-172.
7. Dobson G (1987) The ELSP: achieving feasibility using time-varying lot sizes. Operations Research, vol. 35, pp. 764-71, 1987.
8. Zipkin P (1991) Computing optimal lot sizes in the ELSP. Operations Research, vol. 39, pp. 56-63.
9. Sun H, Huang H and Jaruphongsa W (2009) A genetic algorithm for the economic lot scheduling problem under the extended basic period and power-of-two policy. CIRP Journal of Manufacturing Science and Technology, 2(2009) 29-34.
10. Chatfield D (1987) The economic lot scheduling problem: a pure genetic search approach. Computers and Operations Research, vol. 34, pp. 2865-2881, 1987.
11. Geem Z W, Kim J-H, Loganathan G V (2001) A new heuristic optimization algorithm: harmony earch. Simulations 2001; 76(2): 60-68.
12. Lee K S, Geem Z W, Lee-S-H, Bae K-W (2005) The harmony search heuristic algorithm for discrete structural optimization. Eng Optimiz 2005; 37(7):663-684.
13. Lee K S, Geem Z W (2005) A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Comput Methods Appl Mech Eng 2005; 194:3902-3933.
14. Mahdavi M, Fesanghary M, Damangir E (2007) An improved harmony search algorithm for solving optimization problems. Appl Math Comput 2007; 188:1567-1579.
15. Kim J H, Geem Z W, Kim E S (2001) Parameter estimation of the nonlinear Muskingum model using harmony search. J Am Water Resour Assoc 2001; 37(5):1131-8.
16. Geem Z W (2006) Optimal cost design of water distribution networks using harmony search. Eng Optimiz 2006; 38(3):259-280.
17. Lee K S, Geem Z W (2004) A new structural optimization method based on the harmony search algorithm. Comput Struct 2004; 82(9-10):781-798.
18. Geem Z W, Lee K S,Park Y J (2005) Application of harmony search to vehicle routing. American Journal of Applied Sciences 2005; 2(12):1552-1557.
19. Geem Z W (2007) Novel derivative of harmony search algorithm for discrete design variables. Applied Mathematics and Computation 2007; doi:10.1016/j.amc.2007.09.049.
20. Wang L, Pan Q-K, Tasgetiren M. Fatih, Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms, Expert Systems with Applications 37 (2010) 7929-7936.
21. Wang L, Pan Q-K, Tasgetiren M. F (2011) A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem, Computers and Industrial Engineering, 61 (2) pp: 76-83.
22. Pan Q-K, Suganthan P. N, Liang J. J, Tasgetiren M. F (2011) A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem, Expert Systems with Applications 38(4), pp: 3252-3259.
23. Zhao S-Z, Suganthan P N, Pan Q-K, Tasgetiren M F (2011) Dynamic multi-swarm optimizer with harmony search, Expert Systems with Applications, V. 38 (4), pp: 3735-3742.
24. Pan Q-K, Suganthan P N, Liang J J, Tasgetiren M F (2010) A self-adaptive global best harmony search algorithm for continuous optimization problems, Applied Mathematics and Computation, 216(3), pp: 830-848.
25. Mladenovic N, Hansen P (1997) Variable neighborhood search. Computers and Operations Research 24 (1997) 1097-1100.
26. Coello Carlos A. Coello (2002) Theoretical and Numerical Constraint- Handling Techniques Used with Evolutionary Algorithms: A Survey of the State of the Art. Comput. Methods Appl. Mech. Engrg., 191(11-12), 2002, pp. 1245-1287.
27. Deb K (2000) An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering, vol. 186, pp. 311-338.
28. Coit D W and Smith A E (1996), Penalty guided genetic search for reliability design optimization. Computers and Industrial Engineering, Vol. 30, No. 4, 895-904.
29. Mitsuo G and Cheng R ( 2000) Genetic Algorithms and Engineering Optimization, John Wiley and Sons.
30. Takahama T and Sakai S (2000) Tuning fuzzy control rules by the α constrained method which solves constrained nonlinear optimization problems. Electronics and Communications in Japan, Part3: Fundamental Electronic Science, vol. 83, no. 9, pp. 1-12, Sept.
31. Takahama T and Sakai S (2005) Constrained optimization by ε constrained particle swarm optimizer with ε-level control. in Proc. of the 4th IEEE International Workshop on Soft Computing as Transdisciplinary Science and Technology (WSTST'05), May 2005, pp. 1019-1029.
32. Takahama T and Sakai S (2010) Efficient Constrained Optimization by the ε Constrained Adaptive Differential Evolution. WCCI 2010 IEEE World Congress on Computational Intelligence July, 18-23, 2010, Barcelona, Spain.
33. Takahama T and Sakai S (2006) "Constrained Optimization by the Constrained Differential Evolution with Gradient-Based Mutation and Feasible Elites. in IEEE Congress on Evolutionary Computation Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada, 2006, pp. 1-8.
34. Haessler R (1979) An improved extended basic period procedure for solving the economic lot scheduling problem. AIIE Transactions, 11(1979): 336-340.
35. Khouja M , Michalewicz Z and Wilmot M (1998) The use of genetic algorithms to solve the economic lot size scheduling problem. European Journal of Operational Research, vol. 110, pp. 509-524.
36. Park K S, Yun D K (1984) A stepwise partial enumeration algorithm for the economic lot scheduling problem. IIE Transactions, 16(1984), 363-370.
37. Fujita S (1978) The application of marginal analysis to the ELSP. AIIE Transactions, 1978, 10(4):354-361.