Towards a Secure Two-Stage Supply Chain Network: A Transportation-Cost Approach

The robustness, resilience and security of supply chain transportation is an active research topic, as it directly determines the overall supply chain resilience and security. In this paper, we propose a theoretical model for the transportation problem within a two-stage supply chain network with security constraints called the Secure Supply Chain Network (SSCN). The SSCN contains a manufacturer, directly connected to several distribution centres DC, which are directly connected to one or more customers C. Each direct link between any two elements of Secure Supply Chain Network is allocated a transportation cost. Within the proposed model, the manufacturer produces a single product type; each distribution centre has a fixed capacity and a security rank. The overall objective of the Secure Supply Chain Network is 100 % customer satisfaction whilst fully satisfying the security constraints and minimizing the overall transportation costs. A heuristic solving technique is proposed and discussed.

[1]  Janet Efstathiou,et al.  Advances on measuring the operational complexity of supplier-customer systems , 2006, Eur. J. Oper. Res..

[2]  Janet Efstathiou,et al.  Applying and assessing two methods for measuring complexity in manufacturing , 1998, J. Oper. Res. Soc..

[3]  Petrica C. Pop,et al.  A Hybrid Classical Approach to a Fixed-Charged Transportation Problem , 2012, HAIS.

[4]  Shanshan Song,et al.  Trusted P2P transactions with fuzzy reputation aggregation , 2005, IEEE Internet Computing.

[5]  Bogdan Crainicu,et al.  A Distributed Security Approach for Intelligent Mobile Multiagent Systems , 2014, Advanced Intelligent Computational Technologies and Decision Support Systems.

[6]  F. Caniato,et al.  BUILDING A SECURE AND RESILIENT SUPPLY NETWORK. , 2003 .

[7]  Camelia-Mihaela Pintea,et al.  Hybrid ant models with a transition policy for solving a complex problem , 2012, Log. J. IGPL.

[8]  Martijn Mes,et al.  Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems , 2007, Eur. J. Oper. Res..

[9]  Sunil Arya,et al.  An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.

[10]  Eleonor Ciurea,et al.  A study on the feasibility of the inverse supply and demand problem , 2011 .

[11]  Moustapha Diaby,et al.  Successive Linear Approximation Procedure for Generalized Fixed-Charge Transportation Problems , 1991 .

[12]  Laura Diosan,et al.  AUTOMATA-BASED COMPONENT COMPOSITION ANALYSIS , 2006 .

[13]  Petrica C. Pop,et al.  An improved hybrid algorithm for capacitated fixed-charge transportation problem , 2015, Log. J. IGPL.

[14]  Xiangyang Li,et al.  Toward a secure supply chain: A system's perspective , 2008 .

[15]  Camelia-Mihaela Pintea,et al.  Learning Sensitive Stigmergic Agents for Solving Complex Problems , 2010, Comput. Informatics.

[16]  Shanshan Song,et al.  Security-driven heuristics and a fast genetic algorithm for trusted grid job scheduling , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[17]  Petrica C. Pop,et al.  An efficient Reverse Distribution System for solving sustainable supply chain network design problem , 2015, J. Appl. Log..

[18]  Rajkumar Buyya,et al.  A Deadline and Budget Constrained Scheduling Algorithm for eScience Applications on Data Grids , 2005, ICA3PP.

[19]  Minghe Sun,et al.  A tabu search heuristic procedure for the fixed charge transportation problem , 1998, Eur. J. Oper. Res..

[20]  Hau L. Lee,et al.  SUPPLY CHAIN SECURITY WITHOUT TEARS. , 2003 .

[21]  Václav Snásel,et al.  Swarm scheduling approaches for work-flow applications with security constraints in distributed data-intensive computing environments , 2012, Inf. Sci..

[22]  Reza Tavakkoli-Moghaddam,et al.  Solving a capacitated fixed-charge transportation problem by artificial immune and genetic algorithms with a Prüfer number representation , 2011, Expert Syst. Appl..

[23]  Shanshan Song,et al.  Risk-resilient heuristics and genetic algorithms for security-assured grid job scheduling , 2006, IEEE Transactions on Computers.

[24]  Veena Adlakha,et al.  On the fixed-charge transportation problem , 1999 .