Search results

1 – 3 of 3
Per page
102050
Citations:
Loading...
Access Restricted. View access options
Article
Publication date: 25 September 2018

Vinay Surendra Yadav, Sarsij Tripathi and A.R. Singh

The purpose of this paper is to design a sustainable supply chain network (SCN) for omnichannel environment in order to provide better service to customers through flexible…

1246

Abstract

Purpose

The purpose of this paper is to design a sustainable supply chain network (SCN) for omnichannel environment in order to provide better service to customers through flexible distribution. Thus, there is a need to incorporate multiple-channel distribution in the network design of supply chains (SCs).

Design/methodology/approach

A multiple-channel distribution supply chain network (MCDSCN) has been proposed under omnichannel environment. This proposed model integrates online giants with local retailer’s distribution network in an uncertain environment with sustainability. To incorporate sustainability, an objective function is added to reduce carbon content along with other objectives of minimization of SC cost. The model turns out to be mixed-integer linear programming model which is coded in GAMS and solved using CPLEX solver.

Findings

The proposed MCDSCN model is compared with conventional SCN. Furthermore, it was found that the proposed MCDSCN model has achieved significant saving in SC cost and is also more sustainable than conventional SCN. The proposed model also enables online giants to integrate their distribution network with local retailer’s distribution network.

Practical implications

Through proposed model, customers are free to access product and services as per their choice of channels which increases their convenience, reach and satisfaction.

Originality/value

The proposed MCDSCN model is a novel approach to design flexible distribution systems. This would significantly help organizations to design their distribution network more effectively to meet global competition.

Details

Journal of Manufacturing Technology Management, vol. 30 no. 6
Type: Research Article
ISSN: 1741-038X

Keywords

Access Restricted. View access options
Article
Publication date: 7 February 2023

Riju Bhattacharya, Naresh Kumar Nagwani and Sarsij Tripathi

A community demonstrates the unique qualities and relationships between its members that distinguish it from other communities within a network. Network analysis relies heavily on…

451

Abstract

Purpose

A community demonstrates the unique qualities and relationships between its members that distinguish it from other communities within a network. Network analysis relies heavily on community detection. Despite the traditional spectral clustering and statistical inference methods, deep learning techniques for community detection have grown in popularity due to their ease of processing high-dimensional network data. Graph convolutional neural networks (GCNNs) have received much attention recently and have developed into a potential and ubiquitous method for directly detecting communities on graphs. Inspired by the promising results of graph convolutional networks (GCNs) in analyzing graph structure data, a novel community graph convolutional network (CommunityGCN) as a semi-supervised node classification model has been proposed and compared with recent baseline methods graph attention network (GAT), GCN-based technique for unsupervised community detection and Markov random fields combined with graph convolutional network (MRFasGCN).

Design/methodology/approach

This work presents the method for identifying communities that combines the notion of node classification via message passing with the architecture of a semi-supervised graph neural network. Six benchmark datasets, namely, Cora, CiteSeer, ACM, Karate, IMDB and Facebook, have been used in the experimentation.

Findings

In the first set of experiments, the scaled normalized average matrix of all neighbor's features including the node itself was obtained, followed by obtaining the weighted average matrix of low-dimensional nodes. In the second set of experiments, the average weighted matrix was forwarded to the GCN with two layers and the activation function for predicting the node class was applied. The results demonstrate that node classification with GCN can improve the performance of identifying communities on graph datasets.

Originality/value

The experiment reveals that the CommunityGCN approach has given better results with accuracy, normalized mutual information, F1 and modularity scores of 91.26, 79.9, 92.58 and 70.5 per cent, respectively, for detecting communities in the graph network, which is much greater than the range of 55.7–87.07 per cent reported in previous literature. Thus, it has been concluded that the GCN with node classification models has improved the accuracy.

Details

Data Technologies and Applications, vol. 57 no. 4
Type: Research Article
ISSN: 2514-9288

Keywords

Access Restricted. View access options
Article
Publication date: 9 July 2022

Riju Bhattacharya, Naresh Kumar Nagwani and Sarsij Tripathi

Social networking platforms are increasingly using the Follower Link Prediction tool in an effort to expand the number of their users. It facilitates the discovery of previously…

138

Abstract

Purpose

Social networking platforms are increasingly using the Follower Link Prediction tool in an effort to expand the number of their users. It facilitates the discovery of previously unidentified individuals and can be employed to determine the relationships among the nodes in a social network. On the other hand, social site firms use follower–followee link prediction (FFLP) to increase their user base. FFLP can help identify unfamiliar people and determine node-to-node links in a social network. Choosing the appropriate person to follow becomes crucial as the number of users increases. A hybrid model employing the Ensemble Learning algorithm for FFLP (HMELA) is proposed to advise the formation of new follower links in large networks.

Design/methodology/approach

HMELA includes fundamental classification techniques for treating link prediction as a binary classification problem. The data sets are represented using a variety of machine-learning-friendly hybrid graph features. The HMELA is evaluated using six real-world social network data sets.

Findings

The first set of experiments used exploratory data analysis on a di-graph to produce a balanced matrix. The second set of experiments compared the benchmark and hybrid features on data sets. This was followed by using benchmark classifiers and ensemble learning methods. The experiments show that the proposed (HMELA) method predicts missing links better than other methods.

Practical implications

A hybrid suggested model for link prediction is proposed in this paper. The suggested HMELA model makes use of AUC scores to predict new future links. The proposed approach facilitates comprehension and insight into the domain of link prediction. This work is almost entirely aimed at academics, practitioners, and those involved in the field of social networks, etc. Also, the model is quite effective in the field of product recommendation and in recommending a new friend and user on social networks.

Originality/value

The outcome on six benchmark data sets revealed that when the HMELA strategy had been applied to all of the selected data sets, the area under the curve (AUC) scores were greater than when individual techniques were applied to the same data sets. Using the HMELA technique, the maximum AUC score in the Facebook data set has been increased by 10.3 per cent from 0.8449 to 0.9479. There has also been an 8.53 per cent increase in the accuracy of the Net Science, Karate Club and USAir databases. As a result, the HMELA strategy outperforms every other strategy tested in the study.

Details

Data Technologies and Applications, vol. 57 no. 1
Type: Research Article
ISSN: 2514-9288

Keywords

1 – 3 of 3
Per page
102050