IDEAS home Printed from https://ideas.repec.org/a/spr/joinma/v32y2021i2d10.1007_s10845-020-01587-w.html
   My bibliography  Save this article

Metaheuristics for the template design problem: encoding, symmetry and hybridisation

Author

Listed:
  • David Rodríguez Rueda

    (Universidad Nacional Experimental del Táchira (UNET))

  • Carlos Cotta

    (Universidad de Málaga)

  • Antonio J. Fernández-Leiva

    (Universidad de Málaga)

Abstract

The template design problem (TDP) is a hard combinatorial problem with a high number of symmetries which makes solving it more complicated. A number of techniques have been proposed in the literature to optimise its resolution, ranging from complete methods to stochastic ones. However, although metaheuristics are considered efficient methods that can find enough-quality solutions at a reasonable computational cost, these techniques have not proven to be truly efficient enough to deal with this problem. This paper explores and analyses a wide range of metaheuristics to tackle the problem with the aim of assessing their suitability for finding template designs. We tackle the problem using a wide set of metaheuristics whose implementation is guided by a number of issues such as problem formulation, solution encoding, the symmetrical nature of the problem, and distinct forms of hybridisation. For the TDP, we also propose a slot-based alternative problem formulation (distinct to other slot-based proposals), which represents another option other than the classical variation-based formulation of the problem. An empirical analysis, assessing the performance of all the metaheuristics (i.e., basic, integrative and collaborative algorithms working on different search spaces and with/without symmetry breaking) shows that some of our proposals can be considered the state-of-the-art when they are applied to specific problem instances.

Suggested Citation

  • David Rodríguez Rueda & Carlos Cotta & Antonio J. Fernández-Leiva, 2021. "Metaheuristics for the template design problem: encoding, symmetry and hybridisation," Journal of Intelligent Manufacturing, Springer, vol. 32(2), pages 559-578, February.
  • Handle: RePEc:spr:joinma:v:32:y:2021:i:2:d:10.1007_s10845-020-01587-w
    DOI: 10.1007/s10845-020-01587-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10845-020-01587-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10845-020-01587-w?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. S. Prestwich, 2003. "Negative Effects of Modeling Techniques on Search Performance," Annals of Operations Research, Springer, vol. 118(1), pages 137-150, February.
    2. Les Proll & Barbara Smith, 1998. "Integer Linear Programming and Constraint Programming Approaches to a Template Design Problem," INFORMS Journal on Computing, INFORMS, vol. 10(3), pages 265-275, August.
    3. James T. Lin & Chun-Chih Chiu, 2018. "A hybrid particle swarm optimization with local search for stochastic resource allocation problem," Journal of Intelligent Manufacturing, Springer, vol. 29(3), pages 481-495, March.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Vipul Jain & Ignacio E. Grossmann, 2001. "Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 13(4), pages 258-276, November.
    3. Roberto Rossi & S. Armagan Tarim & Brahim Hnich & Steven Prestwich & Semra Karacaer, 2010. "Scheduling internal audit activities: a stochastic combinatorial optimization problem," Journal of Combinatorial Optimization, Springer, vol. 19(3), pages 325-346, April.
    4. Frédéric Lardeux & Eric Monfroy & Broderick Crawford & Ricardo Soto, 2015. "Set constraint model and automated encoding into SAT: application to the social golfer problem," Annals of Operations Research, Springer, vol. 235(1), pages 423-452, December.
    5. Brailsford, Sally C. & Potts, Chris N. & Smith, Barbara M., 1999. "Constraint satisfaction problems: Algorithms and applications," European Journal of Operational Research, Elsevier, vol. 119(3), pages 557-581, December.
    6. Lenin Nagarajan & Siva Kumar Mahalingam & Jayakrishna Kandasamy & Selvakumar Gurusamy, 2022. "A novel approach in selective assembly with an arbitrary distribution to minimize clearance variation using evolutionary algorithms: a comparative study," Journal of Intelligent Manufacturing, Springer, vol. 33(5), pages 1337-1354, June.
    7. Seyed Hossein Hashemi Doulabi & Louis-Martin Rousseau & Gilles Pesant, 2016. "A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 432-448, August.
    8. Raf Jans, 2009. "Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 123-136, February.
    9. Proll, Les, 2007. "ILP approaches to the blockmodel problem," European Journal of Operational Research, Elsevier, vol. 177(2), pages 840-850, March.
    10. Raghav Prasad Parouha & Pooja Verma, 2022. "An innovative hybrid algorithm for bound-unconstrained optimization problems and applications," Journal of Intelligent Manufacturing, Springer, vol. 33(5), pages 1273-1336, June.
    11. Steven Prestwich, 2007. "Exploiting relaxation in local search for LABS," Annals of Operations Research, Springer, vol. 156(1), pages 129-141, December.
    12. G. Cherif & E. Leclercq & D. Lefebvre, 2023. "Scheduling of a class of partial routing FMS in uncertain environments with beam search," Journal of Intelligent Manufacturing, Springer, vol. 34(2), pages 493-514, February.
    13. H.P. Williams & Hong Yan, 2001. "Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 13(2), pages 96-103, May.

    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:joinma:v:32:y:2021:i:2:d:10.1007_s10845-020-01587-w. 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.