IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v121y2009i1p88-98.html
   My bibliography  Save this article

Quantized Hopfield networks and tabu search for manufacturing cell formation problems

Author

Listed:
  • Ateme-Nguema, Barthélemy
  • Dao, Thiên-My

Abstract

The use of neural networks in the design of cellular manufacturing system is not new. This paper presents an application of modified Hopfield neural networks in order to solve cell formation problems: the quantized and fluctuated Hopfield neural networks (QFHN). This kind of Hopfield network combined with the "tabu search" approach were primarily used in a hybrid procedure in order to solve the cell formation for big sizes industrial data set. The problem is formulated as a 0/1 linear and integer programming model in order to minimize the dissimilarities between machines and/or parts. Our hybrid approach allows us to obtain optimal or nearly optimal solutions very frequently and much more quickly than traditional Hopfield networks. It is also illustrated that the fluctuation associated with this quantization may enable the network to escape from local minima, to converge to global minima, and consequently to obtain optimal solutions very frequently and much more quickly than pure quantized Hopfield networks (QHN). The effectiveness of the proposed approach is flexibility it gives us, for example, in time problem-solving for large-scale and speed of execution when we apply it.

Suggested Citation

  • Ateme-Nguema, Barthélemy & Dao, Thiên-My, 2009. "Quantized Hopfield networks and tabu search for manufacturing cell formation problems," International Journal of Production Economics, Elsevier, vol. 121(1), pages 88-98, September.
    • Handle: RePEc:eee:proeco:v:121:y:2009:i:1:p:88-98
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(09)00108-X
    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. Nsakanda, Aaron Luntala & Diaby, Moustapha & Price, Wilson L., 2006. "Hybrid genetic approach for solving large-scale capacitated cell formation problems with multiple routings," European Journal of Operational Research, Elsevier, vol. 171(3), pages 1051-1070, June.
    2. Hamed Hendizadeh, S. & Faramarzi, Hamidreza & Mansouri, S.Afshin & Gupta, Jatinder N.D. & Y ElMekkawy, Tarek, 2008. "Meta-heuristics for scheduling a flowline manufacturing cell with sequence dependent family setup times," International Journal of Production Economics, Elsevier, vol. 111(2), pages 593-605, February.
    3. Farahani, Reza Zanjirani & Elahipanah, Mahsa, 2008. "A genetic algorithm to optimize the total cost and service level for just-in-time distribution in a supply chain," International Journal of Production Economics, Elsevier, vol. 111(2), pages 229-243, February.
    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. Lin, Shih-Wei & Ying, Kuo-Ching & Lu, Chung-Cheng & Gupta, Jatinder N.D., 2011. "Applying multi-start simulated annealing to schedule a flowline manufacturing cell with sequence dependent family setup times," International Journal of Production Economics, Elsevier, vol. 130(2), pages 246-254, April.

    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. Og[breve]uz, Ceyda & Sibel Salman, F. & Bilgintürk YalçIn, Zehra, 2010. "Order acceptance and scheduling decisions in make-to-order systems," International Journal of Production Economics, Elsevier, vol. 125(1), pages 200-211, May.
    2. Wang, Yulan & Wallace, Stein W. & Shen, Bin & Choi, Tsan-Ming, 2015. "Service supply chain management: A review of operational models," European Journal of Operational Research, Elsevier, vol. 247(3), pages 685-698.
    3. Tamás Bányai & Béla Illés & Miklós Gubán & Ákos Gubán & Fabian Schenk & Ágota Bányai, 2019. "Optimization of Just-In-Sequence Supply: A Flower Pollination Algorithm-Based Approach," Sustainability, MDPI, vol. 11(14), pages 1-26, July.
    4. Nekoiemehr, Nooshin & Selvarajah, Esaignani & Zhang, Guoqing, 2015. "Scheduling of jobs with cross families in two stage manufacturing systems," International Journal of Production Economics, Elsevier, vol. 167(C), pages 88-96.
    5. Zhuang Huang & Jianjun Yang, 2020. "Scheduling Optimization in Flowline Manufacturing Cell Considering Intercell Movement with Harmony Search Approach," Mathematics, MDPI, vol. 8(12), pages 1-21, December.
    6. Manupati, V.K. & Schoenherr, Tobias & Ramkumar, M. & Panigrahi, Suraj & Sharma, Yash & Mishra, Prakriti, 2022. "Recovery strategies for a disrupted supply chain network: Leveraging blockchain technology in pre- and post-disruption scenarios," International Journal of Production Economics, Elsevier, vol. 245(C).
    7. Liao, Ching-Jong & Shyu, Cian-Ci & Tseng, Chao-Tang, 2009. "A least flexibility first heuristic to coordinate setups in a two- or three-stage supply chain," International Journal of Production Economics, Elsevier, vol. 117(1), pages 127-135, January.
    8. Costantino, Nicola & Dotoli, Mariagrazia & Falagario, Marco & Fanti, Maria Pia & Mangini, Agostino Marcello, 2012. "A model for supply management of agile manufacturing supply chains," International Journal of Production Economics, Elsevier, vol. 135(1), pages 451-457.
    9. Liji Shen & Jatinder N. D. Gupta, 2018. "Family scheduling with batch availability in flow shops to minimize makespan," Journal of Scheduling, Springer, vol. 21(2), pages 235-249, April.
    10. Dolgui, Alexandre & Kovalev, Sergey & Kovalyov, Mikhail Y. & Nossack, Jenny & Pesch, Erwin, 2014. "Minimizing setup costs in a transfer line design problem with sequential operation processing," International Journal of Production Economics, Elsevier, vol. 151(C), pages 186-194.
    11. He, Xuan & Pan, Quan-Ke & Gao, Liang & Neufeld, Janis S., 2023. "An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem," European Journal of Operational Research, Elsevier, vol. 310(2), pages 597-610.
    12. Liou, Cheng-Dar & Hsieh, Yi-Chih, 2015. "A hybrid algorithm for the multi-stage flow shop group scheduling with sequence-dependent setup and transportation times," International Journal of Production Economics, Elsevier, vol. 170(PA), pages 258-267.
    13. Ma, Jun & Nault, Barrie R. & Tu, Yiliu (Paul), 2023. "Customer segmentation, pricing, and lead time decisions: A stochastic-user-equilibrium perspective," International Journal of Production Economics, Elsevier, vol. 264(C).
    14. Ziyang Li & Qianwei Ying & Wu Yan & Chenjun Fan, 2022. "Does just‐in‐time adoption have an impact on corporate innovation: evidence from China," Accounting and Finance, Accounting and Finance Association of Australia and New Zealand, vol. 62(S1), pages 1599-1635, April.
    15. Antonio Costa & Fulvio Antonio Cappadonna & Sergio Fichera, 2017. "A hybrid genetic algorithm for minimizing makespan in a flow-shop sequence-dependent group scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 28(6), pages 1269-1283, August.
    16. Hsin Chang & Chung-Jye Hung & Kit Wong & Chin-Ho Lee, 2013. "Using the balanced scorecard on supply chain integration performance—a case study of service businesses," Service Business, Springer;Pan-Pacific Business Association, vol. 7(4), pages 539-561, December.
    17. Papaioannou, Grammatoula & Wilson, John M., 2010. "The evolution of cell formation problem methodologies based on recent studies (1997-2008): Review and directions for future research," European Journal of Operational Research, Elsevier, vol. 206(3), pages 509-521, November.
    18. Darmawan, Agus & Wong, Hartanto & Thorstenson, Anders, 2021. "Supply chain network design with coordinated inventory control," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
    19. Mohammad Najjartabar Bisheh & G. Reza Nasiri & Esmaeil Esmaeili & Hamid Davoudpour & Shing I. Chang, 2022. "A new supply chain distribution network design for two classes of customers using transfer recurrent neural network," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(5), pages 2604-2618, October.
    20. Agndal, Henrik & Nilsson, Ulf, 2008. "Supply chain decision-making supported by an open books policy," International Journal of Production Economics, Elsevier, vol. 116(1), pages 154-167, November.

    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:proeco:v:121:y:2009:i:1:p:88-98. 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/ijpe .

    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.