Weighted Marking, Clique Structure and Node-Weighted Centrality to Predict Distribution Centre’s Location in a Supply Chain Management

Abstract

Despite the importance attached to the weights or strengths on the edges of a graph, a graph is only complete if it has both the combinations of nodes and edges. As such, this paper brings to bare the fact that the node-weight of a graph is also a critical factor to consider in any graph/network’s evaluation, rather than the link-weight alone as commonly considered. In fact, the combination of the weights on both the nodes and edges as well as the number of ties together contribute effectively to the measure of centrality for an entire graph or network, thereby clearly showing more information. Two methods which take into consideration both the link-weights and node-weights of graphs (the Weighted Marking method of prediction of location and the Clique/Node-Weighted centrality measures) are considered, and the result from the case studies shows that the clique/node-weighted centrality measures give an accuracy of 18% more than the weighted marking method, in the prediction of Distribution Centre location of the Supply Chain Management.

Authors and Affiliations

Amidu Akanmu, Frank Wang, Fred Yamoah

Keywords

Related Articles

An Enhanced Malay Named Entity Recognition using Combination Approach for Crime Textual Data Analysis

Named Entity Recognition (NER) is one of the tasks in the information extraction. NER is used for extracting and classifying words or entities that belong to the proper noun category in text data such as person's name, l...

Holistic Evaluation Framework for Automated Bug Triage Systems: Integration of Developer Performance

Bug Triage is an important aspect of Open Source Software Development. Automated Bug Triage system is essential to reduce the cost and effort incurred by manual Bug Triage. At present, the metrics that are available in t...

Multicasting over Overlay Networks - A Critical Review

Multicasting technology uses the minimum network resources to serve multiple clients by duplicating the data packets at the closest possible point to the clients. This way at most only one data packets travels down a net...

Routing Discovery Algorithm Using Parallel Chase Packet

On demand routing protocols for ad hoc networks such as Ad Hoc On Demand Distance Vector (AODV) initiate a route discovery process when a route is needed by flooding the network with a route request packet. The route dis...

Tracking Systems as Thinging Machine: A Case Study of a Service Company

Object tracking systems play important roles in tracking moving objects and overcoming problems such as safety, security and other location-related applications. Problems arise from the difficulties in creating a well-de...

Download PDF file
  • EP ID EP111003
  • DOI 10.14569/IJACSA.2014.051217
  • Views 93
  • Downloads 0

How To Cite

Amidu Akanmu, Frank Wang, Fred Yamoah (2014). Weighted Marking, Clique Structure and Node-Weighted Centrality to Predict Distribution Centre’s Location in a Supply Chain Management. International Journal of Advanced Computer Science & Applications, 5(12), 120-128. https://europub.co.uk/articles/-A-111003