A discrete artificial bee colony algorithm for the economic lot scheduling problem

2011 IEEE Congress of Evolutionary Computation, CEC 2011

Volumn , Issue , 2011, Pages 347-353

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

^a YASAR UNIVERSITY   (Turkey)

^b IZMIR UNIVERSITY OF ECONOMICS   (Turkey)

Author keywords

artificial bee colony algorithm; economic lot scheduling problem; extended basic period; power of two policy

Indexed keywords

ARTIFICIAL BEE COLONIES; CONSTRAINT HANDLING; CYCLIC PRODUCTION; ECONOMIC LOT SCHEDULING PROBLEM; ECONOMIC LOT SCHEDULING PROBLEMS; EXTENDED BASIC PERIOD; FUNDAMENTAL CYCLES; NP-HARD; POWER-OF-TWO; POWER-OF-TWO POLICIES; PRODUCTION CYCLE; SINGLE MACHINES; SOLUTION QUALITY; SOLUTION REPRESENTATION; VARIABLE NEIGHBORHOOD SEARCH;

EVOLUTIONARY ALGORITHMS;

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

References (26)

1. W. Hsu, On the general feasibility test of scheduling lot sizes for several products on one machine, Management Science, vol. 29, pp. 93-105, 1983. (Pubitemid 13510730)
2. F. Hanssmann, Operation Research in Production and Inventory, Wiley, New York, 1962.
3. E. E. Bomberger, A dynamic programming approach to a lot size scheduling problem, Management Science, vol. 12, pp. 778-784, 1966.
4. S. E. Elmaghraby, The economic lot scheduling problem (ELSP): review and extensions, Management Science, vol. 24, pp. 587-598, 1978.
5. J. Grznar and C. Riggle, An optimal algorithm for the basic period approach to the economic lot schedule problem, Omega, vol. 25, pp. 355-64, 1997. (Pubitemid 127159908)
6. H. Sun, H. Huang and W. Jaruphongsa, The economic lot scheduling problem under extended basic period and power-of-two policy, Optimization Letters, vol. 4, pp. 157-172, 2010.
7. G. Dobson, The ELSP: achieving feasibility using time-varying lot sizes, Operations Research, vol. 35, pp. 764-71, 1987. (Pubitemid 18580408)
8. P. Zipkin, Computing optimal lot sizes in the ELSP, Operations Research, vol. 39, pp. 56-63, 1991.
9. H. Sun, H-C. Huang, W. Jaruphongsa, 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. D. Chatfield, The economic lot scheduling problem: a pure genetic search approach, Computers and Operations Research, vol. 34, pp. 2865-2881, 1987.
11. D. Karaboga, An idea based on honey bee swarm for numerical optimization, Technical Report TR06, Computer Engineering Department, Erciyes University, Turkey, 2005.
12. D. Karaboga, B. Basturk, A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm, Journal of Global Optimization 39 (2007) 459-471. (Pubitemid 47551831)
13. D. Karaboga, B. Basturk, On the performance of artificial bee colony (ABC) algorithm, Applied Soft Computing 8 (2008) 687-697. (Pubitemid 47374599)
14. D. Karaboga, A new design method based on artificial bee colony algorithm for digital IIR filters, Journal of The Franklin Institute 346 (2009) 328-348.
15. D. Karaboga, B. Akay, A comparative study of artificial bee colony algorithm, Applied Mathematics and Computation (2009), doi:10.1016/j.amc.2009. 03.90.
16. Coello Carlos A. Coello, 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.
17. K. Deb, "An efficient constraint handling method for genetic algorithms", Computer Methods in Applied Mechanics and Engineering, vol. 186, pp. 311-338, 2000.
18. T. Takahama and S. Sakai, 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. 2000.
19. T. Takahama and S. Sakai, 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.
20. T. Takahama and S. Sakai, Efficient Constrained Optimization by the ε Constrained Adaptive Differential Evolution, WCCI 2010 IEEE World Congress on Computational Intelligence July, 18-23, 2010, Barcelona, Spain.
21. T. Takahama and S. Sakai, "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. (Pubitemid 47130472)
22. N. Mladenovic, P. Hansen, Variable neighborhood search, Computers and Operations Research 24 (1997) 1097-1100.
23. R. Haessler, An improved extended basic period procedure for solving the economic lot scheduling problem, AIIE Transactions, 11(1979):336-340. (Pubitemid 10450560)
24. M. Khouja, Z. Michalewicz and M. Wilmot, The use of genetic algorithms to solve the economic lot size scheduling problem, European Journal of Operational Research, vol. 110, pp. 509-524, 1998. (Pubitemid 128386939)
25. K. S. Park, D. K. Yun, A stepwise partial enumeration algorithm for the economic lot scheduling problem, IIE Transactions, 16(1984), 363-370.
26. S. Fujita, The application of marginal analysis to the ELSP, AIIE Transactions, 1978, 10(4):354-361.