IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v44y2022i1d10.1007_s10878-021-00818-x.html
   My bibliography  Save this article

A speciation-based bilevel niching method for multimodal truss design problems

Author

Listed:
  • Md. Jakirul Islam

    (Dhaka University of Engineering and Technology (DUET))

  • Xiaodong Li

    (RMIT University)

  • Kalyanmoy Deb

    (Michigan State University)

Abstract

Truss design is a well-known structural optimization problem that has important practical applications in various fields. Truss design problems are typically multimodal by nature, meaning that it offers multiple optimal solutions concerning the topology (combinatorial optimization problem) and/or sizes (continuous optimization problem) of the members, but they are evaluated to have similar or equally good objective function values. From a practical standpoint, it is desirable to find as many alternative designs as possible, rather than finding a single design, as often practiced. Several techniques based on classical and metaheuristic optimization methods have been developed for simultaneous optimization of topology and size of a truss. However, all these methods unable to find multiple topologies and their corresponding size solutions in a single run. A few metaheuristics incorporating niching techniques have been developed for finding multiple topologies for the truss design problem, but these studies ignored the fact that for each known topology, multiple design solutions in terms of size can be found. To address this issue, this paper proposes a bi-level truss formulation and subsequently a speciation-based bilevel niching method (BiL-NM) using such a formulation. The BiL-NM consists of a modified SPSO niching method which is robust to find multiple topologies and a canonical PSO for their corresponding size solutions. Extensive empirical studies are carried out to analyze the accuracy, robustness, and efficiency of the BiL-NM. The results confirm that the proposed BiL-NM is superior in all these three aspects over the state-of-the-art methods on several low to high-dimensional truss design problems.

Suggested Citation

  • Md. Jakirul Islam & Xiaodong Li & Kalyanmoy Deb, 2022. "A speciation-based bilevel niching method for multimodal truss design problems," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 172-206, August.
  • Handle: RePEc:spr:jcomop:v:44:y:2022:i:1:d:10.1007_s10878-021-00818-x
    DOI: 10.1007/s10878-021-00818-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-021-00818-x
    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/s10878-021-00818-x?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. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
    2. Mavrotas, George & Diakoulaki, Danae & Kourentzis, Athanasios, 2008. "Selection among ranked projects under segmentation, policy and logical constraints," European Journal of Operational Research, Elsevier, vol. 187(1), pages 177-192, May.
    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. Ting Cai & Ziteng Qiao & Zhiwei Ye & Hu Pan & Mingwei Wang & Wen Zhou & Qiyi He & Peng Zhang & Wanfang Bai, 2024. "Dynamic Niches-Based Hybrid Breeding Optimization Algorithm for Solving Multi-Modal Optimization Problem," Mathematics, MDPI, vol. 12(17), pages 1-25, September.

    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. Akeb, Hakim & Moncef, Btissam & Durand, Bruno, 2018. "Building a collaborative solution in dense urban city settings to enhance parcel delivery: An effective crowd model in Paris," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 119(C), pages 223-233.
    2. Jean-François Côté & Manuel Iori, 2018. "The Meet-in-the-Middle Principle for Cutting and Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 646-661, November.
    3. Panos Xidonas & Haris Doukas & George Mavrotas & Olena Pechak, 2016. "Environmental corporate responsibility for investments evaluation: an alternative multi-objective programming model," Annals of Operations Research, Springer, vol. 247(2), pages 395-413, December.
    4. Francisco Trespalacios & Ignacio E. Grossmann, 2017. "Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem," Annals of Operations Research, Springer, vol. 258(2), pages 747-759, November.
    5. Erjavec, J. & Gradisar, M. & Trkman, P., 2012. "Assessment of stock size to minimize cutting stock production costs," International Journal of Production Economics, Elsevier, vol. 135(1), pages 170-176.
    6. Parreño, F. & Alvarez-Valdes, R., 2021. "Mathematical models for a cutting problem in the glass manufacturing industry," Omega, Elsevier, vol. 103(C).
    7. Bonet Filella, Guillem & Trivella, Alessio & Corman, Francesco, 2023. "Modeling soft unloading constraints in the multi-drop container loading problem," European Journal of Operational Research, Elsevier, vol. 308(1), pages 336-352.
    8. Gahm, Christian & Uzunoglu, Aykut & Wahl, Stefan & Ganschinietz, Chantal & Tuma, Axel, 2022. "Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning," European Journal of Operational Research, Elsevier, vol. 296(3), pages 819-836.
    9. François Clautiaux & Cláudio Alves & José Valério de Carvalho & Jürgen Rietz, 2011. "New Stabilization Procedures for the Cutting Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 530-545, November.
    10. Akang Wang & Christopher L. Hanselman & Chrysanthos E. Gounaris, 2018. "A customized branch-and-bound approach for irregular shape nesting," Journal of Global Optimization, Springer, vol. 71(4), pages 935-955, August.
    11. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    12. Russo, Mauro & Sforza, Antonio & Sterle, Claudio, 2013. "An improvement of the knapsack function based algorithm of Gilmore and Gomory for the unconstrained two-dimensional guillotine cutting problem," International Journal of Production Economics, Elsevier, vol. 145(2), pages 451-462.
    13. Gregory S. Taylor & Yupo Chan & Ghulam Rasool, 2017. "A three-dimensional bin-packing model: exact multicriteria solution and computational complexity," Annals of Operations Research, Springer, vol. 251(1), pages 397-427, April.
    14. Bayliss, Christopher & Currie, Christine S.M. & Bennell, Julia A. & Martinez-Sykora, Antonio, 2021. "Queue-constrained packing: A vehicle ferry case study," European Journal of Operational Research, Elsevier, vol. 289(2), pages 727-741.
    15. Caetani, Alberto Pavlick & Ferreira, Luciano & Borenstein, Denis, 2016. "Development of an integrated decision-making method for an oil refinery restructuring in Brazil," Energy, Elsevier, vol. 111(C), pages 197-210.
    16. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    17. López-Camacho, Eunice & Terashima-Marín, Hugo & Ochoa, Gabriela & Conant-Pablos, Santiago Enrique, 2013. "Understanding the structure of bin packing problems through principal component analysis," International Journal of Production Economics, Elsevier, vol. 145(2), pages 488-499.
    18. Marco Antonio Boschetti & Lorenza Montaletti, 2010. "An Exact Algorithm for the Two-Dimensional Strip-Packing Problem," Operations Research, INFORMS, vol. 58(6), pages 1774-1791, December.
    19. Volker Maag, 2015. "A collision detection approach for maximizing the material utilization," Computational Optimization and Applications, Springer, vol. 61(3), pages 761-781, July.
    20. Bortfeldt, Andreas & Wäscher, Gerhard, 2013. "Constraints in container loading – A state-of-the-art review," European Journal of Operational Research, Elsevier, vol. 229(1), pages 1-20.

    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:jcomop:v:44:y:2022:i:1:d:10.1007_s10878-021-00818-x. 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.