APPLICATION OF N-DISTANCE BALANCED GRAPHS IN DISTRIBUTING MANAGEMENT AND FINDING OPTIMAL LOGISTICAL HUBS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

ALAEIYAN MEHDI; KHARAZI HASSAN

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

Journal Paper

Paper Information

Journal: Interdisciplinary Journal of Management Studies Year:2016 | Volume:9 | Issue:4 Page(s): 783-793

Download Full-Text

View:

202

Download:

157

Cites:

Information Journal Paper

Title

APPLICATION OF N-DISTANCE BALANCED GRAPHS IN DISTRIBUTING MANAGEMENT AND FINDING OPTIMAL LOGISTICAL HUBS

Author(s)

ALAEIYAN MEHDI | KHARAZI HASSAN | Issue Writer Certificate

Keywords

LOGISTICS NETWORK

N-DISTANCE BALANCED GRAPH

OPPORTUNITY INDEX

OPTIMIZATION OF NETWORK

SUPPLY CHAIN MANAGEMENT

Abstract

Optimization and reduction of costs in management of distribution and transportation of commodity are one of the main goals of many organizations. Using suitable models in supply chain in order to increase efficiency and appropriate location for support centers in logistical networks is highly important for planners and managers. Graph modeling can be used to analyze these problems and many others such as the management of municipal services and traffic control. To achieve these goals, we suggest some models based on structure of distance balanced graphs, and N-DISTANCE BALANCED GRAPHs. These graphs can be considered as a model in communication networks in order to avoid additional costs and maintain balance in networks.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

ALAEIYAN, MEHDI, & KHARAZI, HASSAN. (2016). APPLICATION OF N-DISTANCE BALANCED GRAPHS IN DISTRIBUTING MANAGEMENT AND FINDING OPTIMAL LOGISTICAL HUBS. IRANIAN JOURNAL OF MANAGEMENT STUDIES, 9(4), 783-793. SID. https://sid.ir/paper/728344/en

Vancouver: Copy

ALAEIYAN MEHDI, KHARAZI HASSAN. APPLICATION OF N-DISTANCE BALANCED GRAPHS IN DISTRIBUTING MANAGEMENT AND FINDING OPTIMAL LOGISTICAL HUBS. IRANIAN JOURNAL OF MANAGEMENT STUDIES[Internet]. 2016;9(4):783-793. Available from: https://sid.ir/paper/728344/en

IEEE: Copy

MEHDI ALAEIYAN, and HASSAN KHARAZI, “APPLICATION OF N-DISTANCE BALANCED GRAPHS IN DISTRIBUTING MANAGEMENT AND FINDING OPTIMAL LOGISTICAL HUBS,” IRANIAN JOURNAL OF MANAGEMENT STUDIES, vol. 9, no. 4, pp. 783–793, 2016, [Online]. Available: https://sid.ir/paper/728344/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops