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 15n"> -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.
Machine summary:
Application of n-distance balanced graphs in distributing management and finding optimal logistical hubs Mehdi Alaeiyan, Hassan Kharazi School of Mathematics, Iran University of Science and Technology, Tehran, Iran (Received: July 31, 2016; Revised: October 29, 2016; Accepted: November 3, 2016) Abstract Optimization and reduction of costs in management of distribution and transportation of commodity are one of the main goals of many organizations.
Keywords Logistics network, n-distance balanced graph, Opportunity index, Optimization of network, Supply chain management.
Using suitable models in supplying chain in order to increase efficiency and reduce costs (Wagner & Neshat, 2010) and appropriate location for support centers in logistical networks (Chang & Lin, 2015) are an important and noticeable problem for managers and planners (Zhong, 2014).
Graph modeling methodology can be used for these problems, and many other similar problems such as the traffic problems in a city (Dave & Jhala, 2014), and the management of municipal services (Maity et al.
For example, removal link of n-distance balanced graphs for some values n, do not destroy its property.
Therefore, using of distance balanced structures help managers and planners to design suitable networks for optimization and reduction of costs.
Cost-effective ratio index is other measurement scale that defined as CER(network) = (total distance)/(cost) (Dixon & Lundeen, 2004).
The constancy of total distance of all nodes in distance balanced graphs leads to optimization of computations in order to achieve the rate of cost- effective (Vanhook, 2007).
Equal opportunity networks, distance-balanced graphs, and Wiener game.