IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v190y2021icp1186-1205.html
   My bibliography  Save this article

A new trisection method for solving Lipschitz bi-objective optimization problems

Author

Listed:
  • Naffeti, Bechir
  • Ammar, Hamadi

Abstract

In this paper, we develop a branch and bounds algorithm to solve bound-construction bi-objective optimization problem. The proposed algorithm allows to determine an approximation of the Pareto optimal solutions sets in both spaces: decisions and objectives ones. By running α-dense space filling curves, we convert a multidimensional bi-objective optimization problem into a one-dimensional one. Hence it gets possible the implementation of the proposed algorithm when objectives depend on more than one decision variable. The proposed algorithm was applied on an engineering problem to find the working space of a robotic manipulator and the obtained results are promising.

Suggested Citation

  • Naffeti, Bechir & Ammar, Hamadi, 2021. "A new trisection method for solving Lipschitz bi-objective optimization problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 190(C), pages 1186-1205.
    • Handle: RePEc:eee:matcom:v:190:y:2021:i:c:p:1186-1205
    DOI: 10.1016/j.matcom.2021.07.011
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475421002615
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2021.07.011?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. Ziadi, Raouf & Bencherif-Madani, Abdelatif & Ellaia, Rachid, 2016. "Continuous global optimization through the generation of parametric curves," Applied Mathematics and Computation, Elsevier, vol. 282(C), pages 65-83.
    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. Ammar, Hamadi & Naffeti, Bechir, 2023. "A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 204(C), pages 181-201.

    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. Ziadi, Raouf & Bencherif-Madani, Abdelatif & Ellaia, Rachid, 2020. "A deterministic method for continuous global optimization using a dense curve," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 178(C), pages 62-91.

    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:eee:matcom:v:190:y:2021:i:c:p:1186-1205. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.