مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

329
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

108
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

Information Journal Paper

Title

The network 1-median problem with discrete demand weights and traveling times

Pages

  69-92

Abstract

 In this paper, the 1-median location problem on an undirected network with discrete random demand weights and traveling times is investigated. The objective function is to maximize the probability that the expected sum of weighted distances from the existing nodes to the selected median does not exceed a prespecified given threshold. An analytical algorithm is proposed to get the optimal solution in small-sized networks. Then, by using the centrallimit theorem, the problem is studied in large-sized networks and reduced to a nonlinear problem. The numerical examples are given to illustrate the efficiency of the proposed methods.

Cites

  • No record.

    • References

  • No record.

    • Cite

    APA: Copy

    ABARESHI, M., & ZAFERANIEH, M.. (2019). The network 1-median problem with discrete demand weights and traveling times. IRANIAN JOURNAL OF NUMERICAL ANALYSIS AND OPTIMIZATION, 9(1 (15) ), 69-92. SID. https://sid.ir/paper/260831/en

    Vancouver: Copy

    ABARESHI M., ZAFERANIEH M.. The network 1-median problem with discrete demand weights and traveling times. IRANIAN JOURNAL OF NUMERICAL ANALYSIS AND OPTIMIZATION[Internet]. 2019;9(1 (15) ):69-92. Available from: https://sid.ir/paper/260831/en

    IEEE: Copy

    M. ABARESHI, and M. ZAFERANIEH, “The network 1-median problem with discrete demand weights and traveling times,” IRANIAN JOURNAL OF NUMERICAL ANALYSIS AND OPTIMIZATION, vol. 9, no. 1 (15) , pp. 69–92, 2019, [Online]. Available: https://sid.ir/paper/260831/en

    Related Journal Papers

    Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops





    Move to top