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

An efficient optimisation method based on weighted AND-OR trees for concurrent reconfigurable product design and reconfiguration process planning

Author

Listed:
  • Moustafa Gadalla
  • Deyi Xue

Abstract

A reconfigurable product can be used to replace multiple products through change of its configurations. Since multiple design candidates are usually considered based on design requirements, and multiple reconfiguration process candidates are usually considered to change between two product configurations, a method was developed in our previous research to identify both the optimal reconfigurable product design and its optimal reconfiguration process plan. This method was not effective when the numbers of design candidates and reconfiguration process candidates are large. To solve this problem, an efficient optimisation method is developed in this research based on weighted AND-OR trees for concurrent reconfigurable product design and reconfiguration process planning. First, the nodes in the product design and reconfiguration process AND-OR trees for modelling design and process candidates are associated with weights representing evaluation heuristics. Then a modified beam search method is developed to improve optimisation efficiency by pruning of the nodes in the AND-OR trees that are unlikely to achieve the optimal results. The created solutions modelled by design and reconfiguration process candidates are further ranked by heuristics. The top-ranked solutions are finally evaluated by numerical engineering functions to identify the optimal solution.

Suggested Citation

  • Moustafa Gadalla & Deyi Xue, 2023. "An efficient optimisation method based on weighted AND-OR trees for concurrent reconfigurable product design and reconfiguration process planning," International Journal of Production Research, Taylor & Francis Journals, vol. 61(3), pages 859-879, February.
  • Handle: RePEc:taf:tprsxx:v:61:y:2023:i:3:p:859-879
    DOI: 10.1080/00207543.2021.2018137
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2021.2018137
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2021.2018137?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:61:y:2023:i:3:p:859-879. 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.