IDEAS home Printed from https://ideas.repec.org/a/ids/ijpdev/v9y2009i1-2-3p111-139.html
   My bibliography  Save this article

Automating morphological chart exploration: a multi-objective genetic algorithm to address compatibility and uncertainty

Author

Listed:
  • Santosh Tiwari
  • Sudhakar Teegavarapu
  • Joshua D. Summers
  • Georges M. Fadel

Abstract

A novel approach using a Genetic Algorithm (GA) is presented for extracting globally satisficing (Pareto optimal) solutions from a morphological chart, where the evaluation and combination of 'means to subfunctions' is modelled as a combinatorial multi-objective optimisation problem. A fast and robust GA is developed to solve the resulting optimisation problem. Customised crossover and mutation operators that are specifically tailored to solve this combinatorial optimisation problem are discussed. Proof-of-concept simulation results on industrial design problems, viz. work-cell fixture design and automobile headlamp design, are presented, analysed, and compared with the solutions obtained by the design team. The described genetic algorithm incorporates features to prevent the redundant evaluation of identical solutions and a method for handling the compatibility matrix (feasible/infeasible combinations) and addressing desirable/undesirable combinations. The proposed approach is limited by its reliance on the user-specified metrics for evaluating the objectives and existence of a mathematical representation of the combined solutions. A method motivated from robust optimisation techniques is presented to reduce the effect of these limitations by addressing the sensitivity to variation in the input parameters. The optimisation architecture is designed to be a scalable and flexible procedure which can be easily modified to accommodate a wide variety of design methods that are based on the morphological chart.

Suggested Citation

  • Santosh Tiwari & Sudhakar Teegavarapu & Joshua D. Summers & Georges M. Fadel, 2009. "Automating morphological chart exploration: a multi-objective genetic algorithm to address compatibility and uncertainty," International Journal of Product Development, Inderscience Enterprises Ltd, vol. 9(1/2/3), pages 111-139.
  • Handle: RePEc:ids:ijpdev:v:9:y:2009:i:1/2/3:p:111-139
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=26176
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijpdev:v:9:y:2009:i:1/2/3:p:111-139. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=36 .

    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.