IDEAS home Printed from https://ideas.repec.org/a/hin/jnlaor/9579343.html
   My bibliography  Save this article

Minimizing Cost Travel in Multimodal Transport Using Advanced Relation Transitive Closure

Author

Listed:
  • Rachid Oucheikh
  • Ismail Berrada
  • Lahcen Omari

Abstract

The optimization computation is an essential transversal branch of operations research which is primordial in many technical fields: transport, finance, networks, energy, learning, etc. In fact, it aims to minimize the resource consumption and maximize the generated profits. This work provides a new method for cost optimization which can be applied either on path optimization for graphs or on binary constraint reduction for Constraint Satisfaction Problem (CSP). It is about the computing of the “transitive closure of a given binary relation with respect to a property.” Thus, this paper introduces the mathematical background for the transitive closure of binary relations. Then, it gives the algorithms for computing the closure of a binary relation according to another one. The elaborated algorithms are shown to be polynomial. Since this technique is of great interest, we show its applications in some important industrial fields.

Suggested Citation

  • Rachid Oucheikh & Ismail Berrada & Lahcen Omari, 2018. "Minimizing Cost Travel in Multimodal Transport Using Advanced Relation Transitive Closure," Advances in Operations Research, Hindawi, vol. 2018, pages 1-7, August.
    • Handle: RePEc:hin:jnlaor:9579343
    DOI: 10.1155/2018/9579343
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/AOR/2018/9579343.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/AOR/2018/9579343.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2018/9579343?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
    ---><---

    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:hin:jnlaor:9579343. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.