IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v157y2004i3p592-606.html
   My bibliography  Save this article

Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing

Author

Listed:
  • Solimanpur, M.
  • Vrat, P.
  • Shankar, R.

Abstract

No abstract is available for this item.

Suggested Citation

  • Solimanpur, M. & Vrat, P. & Shankar, R., 2004. "Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing," European Journal of Operational Research, Elsevier, vol. 157(3), pages 592-606, September.
    • Handle: RePEc:eee:ejores:v:157:y:2004:i:3:p:592-606
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00248-0
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Bazargan-Lari, Massoud, 1999. "Layout designs in cellular manufacturing," European Journal of Operational Research, Elsevier, vol. 112(2), pages 258-272, January.
    2. Paolo Carraresi & Federico Malucelli, 1992. "A New Lower Bound for the Quadratic Assignment Problem," Operations Research, INFORMS, vol. 40(1-supplem), pages 22-27, February.
    3. Thomas E. Vollmann & Elwood S. Buffa, 1966. "The Facilities Layout Problem in Perspective," Management Science, INFORMS, vol. 12(10), pages 450-468, June.
    4. Kusiak, Andrew & Heragu, Sunderesh S., 1987. "The facility layout problem," European Journal of Operational Research, Elsevier, vol. 29(3), pages 229-251, June.
    5. Vittorio Maniezzo, 1999. "Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 11(4), pages 358-369, November.
    6. Eugene L. Lawler, 1963. "The Quadratic Assignment Problem," Management Science, INFORMS, vol. 9(4), pages 586-599, July.
    7. Connolly, David T., 1990. "An improved annealing scheme for the QAP," European Journal of Operational Research, Elsevier, vol. 46(1), pages 93-100, May.
    8. Mauricio G. C. Resende & K. G. Ramakrishnan & Zvi Drezner, 1995. "Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming," Operations Research, INFORMS, vol. 43(5), pages 781-791, October.
    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. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    2. I. Jerin Leno & S. Saravana Sankar & S. G. Ponnambalam, 2018. "MIP model and elitist strategy hybrid GA–SA algorithm for layout design," Journal of Intelligent Manufacturing, Springer, vol. 29(2), pages 369-387, February.
    3. Lan Nguyen-Ngoc & Quyet Nguyen-Huu & Guido De Roeck & Thanh Bui-Tien & Magd Abdel-Wahab, 2024. "Deep Neural Network and Evolved Optimization Algorithm for Damage Assessment in a Truss Bridge," Mathematics, MDPI, vol. 12(15), pages 1-25, July.
    4. Keller, Birgit & Buscher, Udo, 2015. "Single row layout models," European Journal of Operational Research, Elsevier, vol. 245(3), pages 629-644.
    5. Nsakanda, Aaron Luntala & Price, Wilson L. & Diaby, Moustapha & Gravel, Marc, 2007. "Ensuring population diversity in genetic algorithms: A technical note with application to the cell formation problem," European Journal of Operational Research, Elsevier, vol. 178(2), pages 634-638, April.
    6. Mariem Besbes & Marc Zolghadri & Roberta Costa Affonso & Faouzi Masmoudi & Mohamed Haddar, 2020. "A methodology for solving facility layout problem considering barriers: genetic algorithm coupled with A* search," Journal of Intelligent Manufacturing, Springer, vol. 31(3), pages 615-640, March.
    7. Hani, Y. & Amodeo, L. & Yalaoui, F. & Chen, H., 2007. "Ant colony optimization for solving an industrial layout problem," European Journal of Operational Research, Elsevier, vol. 183(2), pages 633-642, December.

    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. Vittorio Maniezzo, 1999. "Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 11(4), pages 358-369, November.
    2. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    3. Bolte, Andreas & Thonemann, Ulrich Wilhelm, 1996. "Optimizing simulated annealing schedules with genetic programming," European Journal of Operational Research, Elsevier, vol. 92(2), pages 402-416, July.
    4. Chiang, Wen-Chyuan & Chiang, Chi, 1998. "Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 457-488, April.
    5. Caprara, Alberto, 2008. "Constrained 0-1 quadratic programming: Basic approaches and extensions," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1494-1503, June.
    6. Hao Hu & Renata Sotirov, 2021. "The linearization problem of a binary quadratic problem and its applications," Annals of Operations Research, Springer, vol. 307(1), pages 229-249, December.
    7. Stutzle, Thomas, 2006. "Iterated local search for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1519-1539, November.
    8. Hahn, Peter M. & Kim, Bum-Jin & Stutzle, Thomas & Kanthak, Sebastian & Hightower, William L. & Samra, Harvind & Ding, Zhi & Guignard, Monique, 2008. "The quadratic three-dimensional assignment problem: Exact and approximate solution methods," European Journal of Operational Research, Elsevier, vol. 184(2), pages 416-428, January.
    9. Arjang Assad & Weixuan Xu, 1992. "The quadratic minimum spanning tree problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(3), pages 399-417, April.
    10. Ravi Kumar, K. & Hadjinicola, George C. & Lin, Ting-li, 1995. "A heuristic procedure for the single-row facility layout problem," European Journal of Operational Research, Elsevier, vol. 87(1), pages 65-73, November.
    11. Jerzy Grobelny & Rafał Michalski, 2020. "Effects of scatter plot initial solutions on regular grid facility layout algorithms in typical production models," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(2), pages 601-632, June.
    12. Taillard, Eric D. & Gambardella, Luca M. & Gendreau, Michel & Potvin, Jean-Yves, 2001. "Adaptive memory programming: A unified view of metaheuristics," European Journal of Operational Research, Elsevier, vol. 135(1), pages 1-16, November.
    13. Frank Meijer & Renata Sotirov, 2020. "The quadratic cycle cover problem: special cases and efficient bounds," Journal of Combinatorial Optimization, Springer, vol. 39(4), pages 1096-1128, May.
    14. Ramachandran, Bala & Pekny, J. F., 1998. "Lower bounds for nonlinear assignment problems using many body interactions," European Journal of Operational Research, Elsevier, vol. 105(1), pages 202-215, February.
    15. Adams, Warren P. & Guignard, Monique & Hahn, Peter M. & Hightower, William L., 2007. "A level-2 reformulation-linearization technique bound for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 180(3), pages 983-996, August.
    16. Rostami, Borzou & Chassein, André & Hopf, Michael & Frey, Davide & Buchheim, Christoph & Malucelli, Federico & Goerigk, Marc, 2018. "The quadratic shortest path problem: complexity, approximability, and solution methods," European Journal of Operational Research, Elsevier, vol. 268(2), pages 473-485.
    17. Kazuhiro Tsuchiya & Sunil Bharitkar & Yoshiyasu Takefuji, 1996. "A neural network approach to facility layout problems," European Journal of Operational Research, Elsevier, vol. 89(3), pages 556-563, March.
    18. Jerzy Grobelny & Rafal Michalski, 2016. "A concept of a flexible approach to the facilities layout problems in logistics systems," WORking papers in Management Science (WORMS) WORMS/16/11, Department of Operations Research and Business Intelligence, Wroclaw University of Science and Technology.
    19. Kim, J. -Y. & Kim, Y. -D., 1995. "Graph theoretic heuristics for unequal-sized facility layout problems," Omega, Elsevier, vol. 23(4), pages 391-401, August.
    20. Mans, Bernard & Mautor, Thierry & Roucairol, Catherine, 1995. "A parallel depth first search branch and bound algorithm for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 81(3), pages 617-628, March.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:157:y:2004:i:3:p:592-606. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.