Highlights We propose a (d, c)-minimal paths based method to evaluate the reliability R (d,c). We develop two effective schemes to reduce the search space of (d, c)-minimal paths. Our method outperforms the existing methods in searching for (d, c)-minimal paths.

    Abstract This paper presents a (d, c)-minimal paths based algorithm to evaluate the reliability index R ( d,c ), defined as the probability that the source distributes a demand d successfully to the destination with the total distribution cost not exceeding budget constraint c. The proposed algorithm employs two schemes to reduce the search space of (d, c)-minimal paths: (1) by proposing some conditions, an improved method for solving (d, c)-minimal paths is developed; (2) an existing decomposition technique is applied to limit the search space. Computational results show a clear advantage of the proposed algorithm in seeking (d, c)-minimal paths.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    An efficient algorithm for evaluating logistics network reliability subject to distribution cost


    Beteiligte:
    Niu, Yi-Feng (Autor:in) / Lam, William H.K. (Autor:in) / Gao, Ziyou (Autor:in)


    Erscheinungsdatum :

    2014-04-18


    Format / Umfang :

    15 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch