IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v134y2005i1p137-15110.1007-s10479-005-5728-8.html
   My bibliography  Save this article

Application of the Cross-Entropy Method to the Buffer Allocation Problem in a Simulation-Based Environment

Author

Listed:
  • G. Alon
  • D. Kroese
  • T. Raviv
  • R. Rubinstein

Abstract

The buffer allocation problem (BAP) is a well-known difficult problem in the design of production lines. We present a stochastic algorithm for solving the BAP, based on the cross-entropy method, a new paradigm for stochastic optimization. The algorithm involves the following iterative steps: (a) the generation of buffer allocations according to a certain random mechanism, followed by (b) the modification of this mechanism on the basis of cross-entropy minimization. Through various numerical experiments we demonstrate the efficiency of the proposed algorithm and show that the method can quickly generate (near-)optimal buffer allocations for fairly large production lines. Copyright Springer Science + Business Media, Inc. 2005

Suggested Citation

  • G. Alon & D. Kroese & T. Raviv & R. Rubinstein, 2005. "Application of the Cross-Entropy Method to the Buffer Allocation Problem in a Simulation-Based Environment," Annals of Operations Research, Springer, vol. 134(1), pages 137-151, February.
  • Handle: RePEc:spr:annopr:v:134:y:2005:i:1:p:137-151:10.1007/s10479-005-5728-8
    DOI: 10.1007/s10479-005-5728-8
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-005-5728-8
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10479-005-5728-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Heavey, C. & Papadopoulos, H. T. & Browne, J., 1993. "The throughput rate of multistation unreliable production lines," European Journal of Operational Research, Elsevier, vol. 68(1), pages 69-89, July.
    2. Rubinstein, Reuven Y., 1997. "Optimization of computer simulation models with rare events," European Journal of Operational Research, Elsevier, vol. 99(1), pages 89-112, May.
    3. Leyuan Shi & Sigurdur Ólafsson, 2000. "Nested Partitions Method for Global Optimization," Operations Research, INFORMS, vol. 48(3), pages 390-407, June.
    4. Stanley Gershwin & James Schor, 2000. "Efficient algorithms for buffer space allocation," Annals of Operations Research, Springer, vol. 93(1), pages 117-144, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Fahimnia, Behnam & Sarkis, Joseph & Eshragh, Ali, 2015. "A tradeoff model for green supply chain planning:A leanness-versus-greenness analysis," Omega, Elsevier, vol. 54(C), pages 173-190.
    2. Pieter-Tjerk de Boer & Dirk Kroese & Shie Mannor & Reuven Rubinstein, 2005. "A Tutorial on the Cross-Entropy Method," Annals of Operations Research, Springer, vol. 134(1), pages 19-67, February.
    3. Illana Bendavid & Boaz Golany, 2009. "Setting gates for activities in the stochastic project scheduling problem through the cross entropy methodology," Annals of Operations Research, Springer, vol. 172(1), pages 259-276, November.
    4. Illana Bendavid & Boaz Golany, 2011. "Setting gates for activities in the stochastic project scheduling problem through the cross entropy methodology," Annals of Operations Research, Springer, vol. 189(1), pages 25-42, September.
    5. Benham, Tim & Duan, Qibin & Kroese, Dirk P. & Liquet, Benoît, 2017. "CEoptim: Cross-Entropy R Package for Optimization," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 76(i08).
    6. K.-P. Hui & N. Bean & M. Kraetzl & Dirk Kroese, 2005. "The Cross-Entropy Method for Network Reliability Estimation," Annals of Operations Research, Springer, vol. 134(1), pages 101-118, February.
    7. Ishai Menache & Shie Mannor & Nahum Shimkin, 2005. "Basis Function Adaptation in Temporal Difference Reinforcement Learning," Annals of Operations Research, Springer, vol. 134(1), pages 215-238, February.
    8. Fahimnia, Behnam & Sarkis, Joseph & Choudhary, Alok & Eshragh, Ali, 2015. "Tactical supply chain planning under a carbon tax policy scheme: A case study," International Journal of Production Economics, Elsevier, vol. 164(C), pages 206-215.
    9. Illana Bendavid & Boaz Golany, 2011. "Predetermined intervals for start times of activities in the stochastic project scheduling problem," Annals of Operations Research, Springer, vol. 186(1), pages 429-442, June.
    10. Altiparmak, Fulya & Dengiz, Berna, 2009. "A cross entropy approach to design of reliable networks," European Journal of Operational Research, Elsevier, vol. 199(2), pages 542-552, December.
    11. Douek-Pinkovich, Yifat & Ben-Gal, Irad & Raviv, Tal, 2022. "The stochastic test collection problem: Models, exact and heuristic solution approaches," European Journal of Operational Research, Elsevier, vol. 299(3), pages 945-959.
    12. Krishna Chepuri & Tito Homem-de-Mello, 2005. "Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method," Annals of Operations Research, Springer, vol. 134(1), pages 153-181, February.
    13. Sagron, Ruth & Pugatch, Rami, 2021. "Universal distribution of batch completion times and time-cost tradeoff in a production line with arbitrary buffer size," European Journal of Operational Research, Elsevier, vol. 293(3), pages 980-989.
    14. Ad Ridder, 2005. "Importance Sampling Simulations of Markovian Reliability Systems Using Cross-Entropy," Annals of Operations Research, Springer, vol. 134(1), pages 119-136, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sabry Shaaban & Tom Mcnamara & Sarah Hudson, 2015. "The impact of failure, repair and joint imbalance of processing time means & buffer sizes on the performance of unpaced production lines," Post-Print hal-01205567, HAL.
    2. Elisa Gebennini & Andrea Grassi & Cesare Fantuzzi & Stanley Gershwin & Irvin Schick, 2013. "Discrete time model for two-machine one-buffer transfer lines with restart policy," Annals of Operations Research, Springer, vol. 209(1), pages 41-65, October.
    3. Jiaqiao Hu & Michael C. Fu & Steven I. Marcus, 2007. "A Model Reference Adaptive Search Method for Global Optimization," Operations Research, INFORMS, vol. 55(3), pages 549-568, June.
    4. Stefan Helber & Katja Schimmelpfeng & Raik Stolletz & Svenja Lagershausen, 2011. "Using linear programming to analyze and optimize stochastic flow lines," Annals of Operations Research, Springer, vol. 182(1), pages 193-211, January.
    5. Chang, Kuo-Hao & Kuo, Po-Yi, 2018. "An efficient simulation optimization method for the generalized redundancy allocation problem," European Journal of Operational Research, Elsevier, vol. 265(3), pages 1094-1101.
    6. Lee, Loo Hay & Chew, Ek Peng & Manikam, Puvaneswari, 2006. "A general framework on the simulation-based optimization under fixed computing budget," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1828-1841, November.
    7. Mattrand, C. & Bourinet, J.-M., 2014. "The cross-entropy method for reliability assessment of cracked structures subjected to random Markovian loads," Reliability Engineering and System Safety, Elsevier, vol. 123(C), pages 171-182.
    8. Kin-Ping Hui, 2011. "Cooperative Cross-Entropy method for generating entangled networks," Annals of Operations Research, Springer, vol. 189(1), pages 205-214, September.
    9. Mathieu Balesdent & Jérôme Morio & Loïc Brevault, 2016. "Rare Event Probability Estimation in the Presence of Epistemic Uncertainty on Input Probability Distribution Parameters," Methodology and Computing in Applied Probability, Springer, vol. 18(1), pages 197-216, March.
    10. Eva K. Lee & Siddhartha Maheshwary & Jacquelyn Mason & William Glisson, 2006. "Large-Scale Dispensing for Emergency Response to Bioterrorism and Infectious-Disease Outbreak," Interfaces, INFORMS, vol. 36(6), pages 591-607, December.
    11. Alfieri, Arianna & Matta, Andrea, 2012. "Mathematical programming formulations for approximate simulation of multistage production systems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 773-783.
    12. David R. Morrison & Jason J. Sauppe & Wenda Zhang & Sheldon H. Jacobson & Edward C. Sewell, 2017. "Cyclic best first search: Using contours to guide branch‐and‐bound algorithms," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(1), pages 64-82, February.
    13. Konstantinos S. Boulas & Georgios D. Dounias & Chrissoleon T. Papadopoulos, 2023. "A hybrid evolutionary algorithm approach for estimating the throughput of short reliable approximately balanced production lines," Journal of Intelligent Manufacturing, Springer, vol. 34(2), pages 823-852, February.
    14. K.-P. Hui & N. Bean & M. Kraetzl & Dirk Kroese, 2005. "The Cross-Entropy Method for Network Reliability Estimation," Annals of Operations Research, Springer, vol. 134(1), pages 101-118, February.
    15. Juliane Müller & Christine Shoemaker & Robert Piché, 2014. "SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications," Journal of Global Optimization, Springer, vol. 59(4), pages 865-889, August.
    16. Mohammad Hassan Salmani & Kourosh Eshghi, 2017. "A Metaheuristic Algorithm Based on Chemotherapy Science: CSA," Journal of Optimization, Hindawi, vol. 2017, pages 1-13, February.
    17. Chen, Chin-Tai & Yuan, John, 2004. "Transient throughput analysis for a series type system of machines in terms of alternating renewal processes," European Journal of Operational Research, Elsevier, vol. 155(1), pages 178-197, May.
    18. Patelli, Edoardo & Feng, Geng & Coolen, Frank P.A. & Coolen-Maturi, Tahani, 2017. "Simulation methods for system reliability using the survival signature," Reliability Engineering and System Safety, Elsevier, vol. 167(C), pages 327-337.
    19. Saranya, K. & Prasanna, P. Krishna, 2018. "Estimating stochastic volatility with jumps and asymmetry in Asian markets," Finance Research Letters, Elsevier, vol. 25(C), pages 145-153.
    20. Fahimnia, Behnam & Sarkis, Joseph & Eshragh, Ali, 2015. "A tradeoff model for green supply chain planning:A leanness-versus-greenness analysis," Omega, Elsevier, vol. 54(C), pages 173-190.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:134:y:2005:i:1:p:137-151:10.1007/s10479-005-5728-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.