Energy Resource Management of Assembly Line Balancing Problem using Modified Current Search Method

Full Text (PDF, 683KB), PP.1-11

Views: 0 Downloads: 0


Supaporn Suwannarongsri 1,* Tika Bunnag 1 Waraporn Klinbun 1

1. Rattanakosin College for Sustainable Energy and Environment (RCSEE), Rajamangala University of Technology Rattanakosin, Nakhon Pathom, Thailand

* Corresponding author.


Received: 5 May 2013 / Revised: 10 Sep. 2013 / Accepted: 4 Dec. 2013 / Published: 8 Feb. 2014

Index Terms

Metaheuristics, Adaptive Current Search, Tabu Search, Assembly Line Balancing, Energy Resource Management


This paper aims to apply a modified current search method, adaptive current search (ACS), for assembly line balancing problems. The ACS algorithm possesses the memory list (ML) to escape from local entrapment and the adaptive radius (AR) mechanism to speed up the search process. The ACS is tested against five benchmark unconstrained and three constrained optimization problems compared with genetic algorithm (GA), tabu search (TS) and current search (CS). As results, the ACS outperforms other algorithms and provides superior results. The ACS is used to address the number of tasks assigned for each workstation, while the heuristic sequencing (HS) technique is conducted to assign the sequence of tasks for each workstation according to precedence constraints. The workload variance and the idle time are performed as the multiple-objective functions. The proposed approach is tested against four benchmark ALB problems compared with the GA, TS and CS. As results, the ACS associated with the HS technique is capable of producing solutions superior to other techniques. In addition, the ACS is an alternative potential algorithm to solve other optimization problems.

Cite This Paper

Supaporn Suwannarongsri, Tika Bunnag, Waraporn Klinbun, "Energy Resource Management of Assembly Line Balancing Problem using Modified Current Search Method", International Journal of Intelligent Systems and Applications(IJISA), vol.6, no.3, pp.1-11, 2014. DOI:10.5815/ijisa.2014.03.01


[1]W. C. Turner. Energy Management Handbook Fairmont Press, USA., 2004.

[2]B. L. Capehart, W. C. Turner, W. J. Kennedy. Guide to Energy Management. Fairmont Press, USA., 1983.

[3]S. S. Rao. Engineering Optimization: Theory and Practice. John Wiley & Sons, 2009.

[4]X. S. Yang. Engineering Optimization: An Introduction with Metaheuristic Applications. John Wiley & Sons, 2010.

[5]D. T. Pham, D. Karaboga. Intelligent Optimization Techniques. Springer, London, 2000.

[6]F. Glover, G. A. Kochenberger. Handbook of Metaheuristics. Kluwer Academic Publishers, 2003.

[7]E. G. Talbi. Metaheuristics form Design to Implementation. John Wiley & Sons, 2009.

[8]X. S. Yang. Nature-Inspired Metaheuristic Algorithms. Luniver Press, 2010.

[9]A. Sukulin, D. Puangdownreong. A novel meta-heuristic optimization algorithm: current search. Proceeding of the 11th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases (AIKED '12), 2012, pp.125-130.

[10]A. Sukulin, D. Puangdownreong. Control synthesis for unstable systems via current search. Proceeding of the 11th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases (AIKED '12), 2012, pp.131-136.

[11]A. Sukulin, D. Puangdownreong. Current search and applications in analog filter design problems. Communication and Computer, v9, n9, 2012, pp. 1083-1096. 

[12]D. E. Goldberg. Genetic Algorithms in Search Optimization and Machine Learning. Addison Wesley Publishers, Boston, 1989. 

[13]MathWorks. Genetic Algorithm and Direct Search Tool- box: For Use with MATLAB. User’s Guide, v1, MathWorks, Natick, Mass, 2005. 

[14]F. Glover. Tabu search - part I. ORSA Journal on Computing, v1, n3, 1989, pp.190-206. 

[15]F. Glover. Tabu search - part II. ORSA Journal on Computing, v2, n1, 1990, pp.4-32. 

[16]M. M. Ali, C. Khompatraporn, Z. B. Zabinsky. A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems. Journal of Global Optimization, v31, n4, 2005, pp.635-672.

[17]K. Deb. An efficient constraint handing method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering, v186, 2000, pp. 311-338. 

[18]J. Braken, G. P. McCormick. Selected Applications of Nonlinear Programming. John Wiley & Sons, New York, 1968.

[19]A. L. Gutjahr, G. L. Nemhauser. An algorithm for the balancing problem. Management Science, v11, 1964, pp.23-25.

[20]M. D. Kilbridge, L. Wester. A heuristic method of assembly line balancing. The Journal of Industrial Engineering, v12, n4, 1961, pp.292-298. 

[21]A. L. Arcus. COMSOAL: a computer method of sequencing operations for assembly line. International Journal of Production Research, v4, 1966, pp.25-32.

[22]M. Amen. Heuristic methods for cost-oriented assembly line balancing: a comparison on solution quality and computing time. International Journal of Production Economics, v69, 2001, pp.255-264.

[23]A. Scholl. Balancing and Sequencing of Assembly Lines. Physica, Heidelberg, 1999.