IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v63y2025i6p2248-2267.html
   My bibliography  Save this article

Turret-index optimisation with mathematical programming and metaheuristic approaches

Author

Listed:
  • Adil Baykasoglu
  • Elif Yoruk
  • Seyda Topaloglu Yildiz

Abstract

This paper addresses the turret-index optimisation problem by proposing two mathematical programming approaches based on quadratic programming (QP) and constraint programming (CP). In addition, a metaheuristic algorithm based on weighted superposition attraction (WSA) is developed due to the combinatorial complexity of the problem. Despite attempting to linearise the QP formulation for problem resolution, both the QP and Linearized QP models prove ineffective for medium and larger-sized instances, providing solutions only for small-sized problems. In the second mathematical programming approach, a novel CP model is introduced in the literature. While CP can rapidly offer optimal solutions for small-sized problems, it only provides satisfactory solutions for medium and larger-sized problems within the predetermined computational time limits and does not guarantee optimal results. On the other hand, through computational analysis and relevant statistical tests, the proposed WSA algorithm provides the best solutions for all test problems within a reasonable computational time.

Suggested Citation

  • Adil Baykasoglu & Elif Yoruk & Seyda Topaloglu Yildiz, 2025. "Turret-index optimisation with mathematical programming and metaheuristic approaches," International Journal of Production Research, Taylor & Francis Journals, vol. 63(6), pages 2248-2267, March.
    • Handle: RePEc:taf:tprsxx:v:63:y:2025:i:6:p:2248-2267
    DOI: 10.1080/00207543.2024.2399711
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2024.2399711
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2024.2399711?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.

    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:taf:tprsxx:v:63:y:2025:i:6:p:2248-2267. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.