Advertisement

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

  • Camelia-M. PinteaEmail author
  • Anisoara Calinescu
  • Petrica C. Pop
  • Cosmin Sabo
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 527)

Abstract

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.

Notes

Acknowledgements

The study was conducted under the auspices of the IEEE-CIS Interdisciplinary Emergent Technologies TF.

References

  1. 1.
    Adlakha, V., Kowalski, K.: On the fixed-charge transportation problem. OMEGA Int. J. Manag. Sci. 27, 381–388 (1999)CrossRefGoogle Scholar
  2. 2.
    Arya, S., et al.: An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J. ACM 45(6), 891–923 (1998)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Calinescu, A., et al.: Applying and assessing two methods for measuring complexity in manufacturing. J. Oper. Res. Soc. 49(7), 723–733 (1998)zbMATHCrossRefGoogle Scholar
  4. 4.
    Chira, C., Dumitrescu, D., Pintea, C.-M.: Learning sensitive stigmergic agents for solving complex problems. Comput. Inf. 29(3), 337–356 (2010)zbMATHGoogle Scholar
  5. 5.
    Diaby, M.: Successive linear approximation procedure for generalized fixed charge transportation problems. J. Oper. Res. Soc. 42, 991–1001 (1991)zbMATHCrossRefGoogle Scholar
  6. 6.
    Deaconu, A., Ciurea, E.: A study on the feasibility of the inverse supply and demand problem. In: Proceedings 15th International Conference on Computers, pp. 485–490 (2011)Google Scholar
  7. 7.
    Fanea, A., Motogna, S., Diosan, L.: Automata-based component composition analysis. Studia Universitas Babes-Bolyai, Informatica 50(1), 13–20 (2006)MathSciNetzbMATHGoogle Scholar
  8. 8.
    Pintea, C.-M., Crisan, G.-C., Chira, C.: Hybrid ant models with a transition policy for solving a complex problem. Logic J. IGPL 20(3), 560–569 (2012)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Molla-Alizadeh-Zavardehi, S., et al.: Solving a capacitated fixed-charge transportation problem by artificial immune and genetic algorithms with a Prufer number representation. Expert Sys. Appl. 38, 10462–10474 (2011)CrossRefGoogle Scholar
  10. 10.
    Liu, H., Abraham, A., Snášel, V., McLoone, S.: Swarm scheduling approaches for work-flow applications with security constraints in distributed data-intensive computing environments. Inf. Sci. 192, 228–243 (2012)CrossRefGoogle Scholar
  11. 11.
    Pintea, C.-M., Pop, P.C.: An improved hybrid algorithm for capacitated fixed-charge transportation problem. Logic J. IGPL 23(3), 369–378 (2015)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Pintea, C.-M., Sitar, C.P., Hajdu-Macelaru, M., Petrica, P.: A hybrid classical approach to a fixed-charged transportation problem. In: Corchado, E., Snášel, V., Abraham, A., Woźniak, M., Graña, M., Cho, S.-B. (eds.) HAIS 2012. LNCS (LNAI), vol. 7208, pp. 557–566. Springer, Heidelberg (2012). doi: 10.1007/978-3-642-28942-2_50CrossRefGoogle Scholar
  13. 13.
    Pop, P.C., et al.: An efficient reverse distribution system for solving sustainable supply chain network design problem. J. Appl. Logic 13(2), 105–113 (2015)CrossRefGoogle Scholar
  14. 14.
    Pop, P.C., et al.: A hybrid based genetic algorithm for solving a capacitated fixed-charged transportation problem. Carpathian J. Math. 32(2), 225–232 (2016)MathSciNetzbMATHGoogle Scholar
  15. 15.
    Rice, J.B., Caniato, F.: Building a secure and resilient supply network. Supply Chain Manag. Rev. 7(5), 22–30 (2003)Google Scholar
  16. 16.
    Iantovics, B., Crainicu, B.: A distributed security approach for intelligent mobile multiagent systems. Stud. Comput. Intell. 486, 175–189 (2014)Google Scholar
  17. 17.
    Lee, H.L., Wolfe, M.: Supply chain security without tears. Supply Chain Manag. Rev. 7(3), 12–20 (2003)Google Scholar
  18. 18.
    Matei, O.: Evolutionary Computation: Principles and Practices. Risoprint, London (2008)Google Scholar
  19. 19.
    Mes, M., et al.: Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems. Eur. J. Oper. Res. 181(1), 59–75 (2007)MathSciNetzbMATHCrossRefGoogle Scholar
  20. 20.
    Nechita, E., et al.: Cooperative ant colonies for vehicle routing problem with time windows. A case study in the distribution of dietary products. WMSCI 5, 48–52 (2008)Google Scholar
  21. 21.
    Sivadasan, S., et al.: Advances on measuring the operational complexity of supplier–customer systems. Eur. J. Oper. Res. 171(1), 208–226 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  22. 22.
    Song, S., Hwang, K., Zhou, R., Kwok, Y.: Trusted P2P transactions with fuzzy reputation aggregation. IEEE Internet Comput. 9(6), 24–34 (2005)CrossRefGoogle Scholar
  23. 23.
    Song, S., Kwok, Y., Hwang, K.: Security-driven heuristics and a fast genetic algorithm for trusted grid job scheduling. Int. Parallel Distrib. Process. IEEE CS 65, 4–12 (2005)Google Scholar
  24. 24.
    Song, S., Hwang, K., Kwok, Y., et al.: Risk-resilient heuristics and genetic algorithms for security-assured grid job scheduling. IEEE Trans. Comp. 55(6), 703 (2006)CrossRefGoogle Scholar
  25. 25.
    Sun, M., et al.: A tabu search heuristic procedure for the fixed charge transportation problem. Eur. J. Oper. Res. 106(2), 441–456 (1998)zbMATHCrossRefGoogle Scholar
  26. 26.
    Venugopal, S., Buyya, R.: A deadline and budget constrained scheduling algorithm for escience applications on data grids. In: Hobbs, M., Goscinski, A.M., Zhou, W. (eds.) ICA3PP 2005. LNCS, vol. 3719, pp. 60–72. Springer, Heidelberg (2005). doi: 10.1007/11564621_7CrossRefGoogle Scholar
  27. 27.
    Vescan, A., Motogna, S.: Overview and architecture of a component modeling tool. Creative Math. Inf. 16, 159–165 (2007)zbMATHGoogle Scholar
  28. 28.
    Li, X., Chandra, C.: Toward a secure supply chain: a system’s perspective. Hum. Syst. Manag. 27(1), 73–86 (2008)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (http://creativecommons.org/licenses/by-nc/2.5/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.

Authors and Affiliations

  • Camelia-M. Pintea
    • 1
    Email author
  • Anisoara Calinescu
    • 2
  • Petrica C. Pop
    • 1
  • Cosmin Sabo
    • 1
  1. 1.North University Center at Baia-MareTechnical University Cluj-NapocaBaia-MareRomania
  2. 2.Department of Computer ScienceUniversity of OxfordOxfordUK

Personalised recommendations