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

On solving manufacturing cell formation via Bicluster Editing

Author

Listed:
  • Pinheiro, Rian G.S.
  • Martins, Ivan C.
  • Protti, Fábio
  • Ochi, Luiz S.
  • Simonetti, Luidi G.
  • Subramanian, Anand

Abstract

This work investigates the Bicluster Graph Editing Problem (BGEP) and how it can be applied to solve the Manufacturing Cell Formation Problem (MCFP). We develop an exact method for the BGEP with a new separation algorithm. We also describe a new preprocessing procedure for the BGEP derived from theoretical results on vertex distances in the input graph. Computational experiments performed on randomly generated instances with various levels of difficulty show that our separation algorithm accelerates the convergence speed, and our preprocessing procedure is effective for low density instances. Another contribution of this work is to take advantage of the fact that the BGEP and the MCFP share the same solution space. This leads to the proposal of two new exact approaches for the MCFP that are based on mathematical formulations for the BGEP. Both approaches use the grouping efficacy measure as the objective function. Up to the authors’ knowledge, these are the first exact methods that employ such a measure to optimally solve instances of the MCFP. The first approach is based on a new ILP formulation for the MCFP, and the second consists of iteratively running several calls to a parameterized version of the BGEP. Computational experiments performed on instances of the MCFP found in the literature show that our exact methods for the MCFP are able to prove several previously unknown optima.

Suggested Citation

  • Pinheiro, Rian G.S. & Martins, Ivan C. & Protti, Fábio & Ochi, Luiz S. & Simonetti, Luidi G. & Subramanian, Anand, 2016. "On solving manufacturing cell formation via Bicluster Editing," European Journal of Operational Research, Elsevier, vol. 254(3), pages 769-779.
    • Handle: RePEc:eee:ejores:v:254:y:2016:i:3:p:769-779
    DOI: 10.1016/j.ejor.2016.05.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221716303307
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2016.05.010?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. Fred Glover, 1975. "Improved Linear Integer Programming Formulations of Nonlinear Integer Problems," Management Science, INFORMS, vol. 22(4), pages 455-460, December.
    2. Wu, Tai-Hsi & Chung, Shu-Hsing & Chang, Chin-Chih, 2010. "A water flow-like algorithm for manufacturing cell formation problems," European Journal of Operational Research, Elsevier, vol. 205(2), pages 346-360, September.
    3. Defersha, Fantahun M. & Chen, Mingyuan, 2006. "A comprehensive mathematical model for the design of cellular manufacturing systems," International Journal of Production Economics, Elsevier, vol. 103(2), pages 767-783, October.
    4. Boutsinas, Basilis, 2013. "Machine-part cell formation using biclustering," European Journal of Operational Research, Elsevier, vol. 230(3), pages 563-572.
    5. Wu, Tai-Hsi & Chang, Chin-Chih & Yeh, Jinn-Yi, 2009. "A hybrid heuristic algorithm adopting both Boltzmann function and mutation operator for manufacturing cell formation problems," International Journal of Production Economics, Elsevier, vol. 120(2), pages 669-688, August.
    6. Werner Dinkelbach, 1967. "On Nonlinear Fractional Programming," Management Science, INFORMS, vol. 13(7), pages 492-498, March.
    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. Garwood, Tom Lloyd & Hughes, Ben Richard & Oates, Michael R. & O’Connor, Dominic & Hughes, Ruby, 2018. "A review of energy simulation tools for the manufacturing sector," Renewable and Sustainable Energy Reviews, Elsevier, vol. 81(P1), pages 895-911.

    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. Andrés Gómez & Oleg A. Prokopyev, 2021. "A Mixed-Integer Fractional Optimization Approach to Best Subset Selection," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 551-565, May.
    2. Hahsler, Michael, 2017. "An experimental comparison of seriation methods for one-mode two-way data," European Journal of Operational Research, Elsevier, vol. 257(1), pages 133-143.
    3. Juan S. Borrero & Colin Gillen & Oleg A. Prokopyev, 2017. "Fractional 0–1 programming: applications and algorithms," Journal of Global Optimization, Springer, vol. 69(1), pages 255-282, September.
    4. Billionnet, Alain, 2013. "Mathematical optimization ideas for biodiversity conservation," European Journal of Operational Research, Elsevier, vol. 231(3), pages 514-534.
    5. Tunjo Perić & Josip Matejaš & Zoran Babić, 2023. "Advantages, sensitivity and application efficiency of the new iterative method to solve multi-objective linear fractional programming problem," 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. 31(3), pages 751-767, September.
    6. Tien Mai & Arunesh Sinha, 2022. "Safe Delivery of Critical Services in Areas with Volatile Security Situation via a Stackelberg Game Approach," Papers 2204.11451, arXiv.org.
    7. Park, Chong Hyun & Lim, Heejong, 2021. "A parametric approach to integer linear fractional programming: Newton’s and Hybrid-Newton methods for an optimal road maintenance problem," European Journal of Operational Research, Elsevier, vol. 289(3), pages 1030-1039.
    8. Yong Xia & Longfei Wang & Xiaohui Wang, 2020. "Globally minimizing the sum of a convex–concave fraction and a convex function based on wave-curve bounds," Journal of Global Optimization, Springer, vol. 77(2), pages 301-318, June.
    9. H. Konno & K. Tsuchiya & R. Yamamoto, 2007. "Minimization of the Ratio of Functions Defined as Sums of the Absolute Values," Journal of Optimization Theory and Applications, Springer, vol. 135(3), pages 399-410, December.
    10. Henk Kiers, 1995. "Maximization of sums of quotients of quadratic forms and some generalizations," Psychometrika, Springer;The Psychometric Society, vol. 60(2), pages 221-245, June.
    11. Yokoyama, Ryohei & Kitano, Hiroyuki & Wakui, Tetsuya, 2017. "Optimal operation of heat supply systems with piping network," Energy, Elsevier, vol. 137(C), pages 888-897.
    12. Tian, Xueyu & You, Fengqi, 2019. "Carbon-neutral hybrid energy systems with deep water source cooling, biomass heating, and geothermal heat and power," Applied Energy, Elsevier, vol. 250(C), pages 413-432.
    13. Boutsinas, Basilis, 2013. "Machine-part cell formation using biclustering," European Journal of Operational Research, Elsevier, vol. 230(3), pages 563-572.
    14. Luca Consolini & Marco Locatelli & Jiulin Wang & Yong Xia, 2020. "Efficient local search procedures for quadratic fractional programming problems," Computational Optimization and Applications, Springer, vol. 76(1), pages 201-232, May.
    15. Harald Dyckhoff & Katrin Allen, 1999. "Theoretische Begründung einer Effizienzanalyse mittels Data Envelopment Analysis (DEA)," Schmalenbach Journal of Business Research, Springer, vol. 51(5), pages 411-436, May.
    16. Longinidis, Pantelis & Georgiadis, Michael C., 2014. "Integration of sale and leaseback in the optimal design of supply chain networks," Omega, Elsevier, vol. 47(C), pages 73-89.
    17. 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.
    18. Unai Aldasoro & María Merino & Gloria Pérez, 2019. "Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic," Annals of Operations Research, Springer, vol. 280(1), pages 151-187, September.
    19. Smail Addoune & Karima Boufi & Ahmed Roubi, 2018. "Proximal Bundle Algorithms for Nonlinearly Constrained Convex Minimax Fractional Programs," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 212-239, October.
    20. Christodoulos Floudas & Xiaoxia Lin, 2005. "Mixed Integer Linear Programming in Process Scheduling: Modeling, Algorithms, and Applications," Annals of Operations Research, Springer, vol. 139(1), pages 131-162, October.

    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:254:y:2016:i:3:p:769-779. 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.