A comparative study on a selection of search design algorithms for solving the buffer allocation problem in serial production lines

C. T. Papadopoulos, M. E.J. O'Kelly, M. I. Vidalis, C. Petridis, N. Pistofidis, M. Nikita

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In the design of production lines the classical approach to the buffer allocation problem (BAP) is to use a search algorithm in association with an evaluative algorithm to obtain the mathematical optimum of the specified objective function. In practice, a choice has often to be made between which search algorithm to use for the efficient solution of the BAP. This paper gives results of a carefully selected set of experiments on short (K= number of stations = 3, 4,...,11 stations), medium length (K=12, 13,...,30 stations) and longer lines (K=40, 50, ...,100 stations) with small N (N=total number of buffer slots = K/2 if K is even; = (K-1)/2 if K is odd), medium N (N=K+1) and large N (N=2K) to evaluate the effectiveness of the following search algorithms: simulated annealing, genetic, Tabu search, myopic and complete enumeration (where possible). All the experiments were run on a readily available desktop PC with the following specifications: Windows XP Professional Version 2002 Service Pack 3, Pentium® Dual-Core CPU E5300@2.60 GHz, 2,00GB RAM. The measures of performance used are computer time and closeness to the maximum throughput achieved.

Original languageEnglish
Title of host publication41st International Conference on Computers and Industrial Engineering 2011
Pages208-213
Number of pages6
Publication statusPublished - Dec 1 2011
Event41st International Conference on Computers and Industrial Engineering 2011 - Los Angeles, CA, United States
Duration: Oct 23 2011Oct 25 2011

Publication series

Name41st International Conference on Computers and Industrial Engineering 2011

Other

Other41st International Conference on Computers and Industrial Engineering 2011
CountryUnited States
CityLos Angeles, CA
Period10/23/1110/25/11

Keywords

  • Buffer allocation problem
  • Comparative efficiency
  • Production lines
  • Search algorithms

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'A comparative study on a selection of search design algorithms for solving the buffer allocation problem in serial production lines'. Together they form a unique fingerprint.

  • Cite this

    Papadopoulos, C. T., O'Kelly, M. E. J., Vidalis, M. I., Petridis, C., Pistofidis, N., & Nikita, M. (2011). A comparative study on a selection of search design algorithms for solving the buffer allocation problem in serial production lines. In 41st International Conference on Computers and Industrial Engineering 2011 (pp. 208-213). (41st International Conference on Computers and Industrial Engineering 2011).