Skip to main content
Log in

A simple algorithm to evaluate supply-chain reliability for brittle commodity logistics under production and delivery constraints

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper focuses on developing a network model to evaluate supply-chain reliability for the brittle commodity logistics, in which the network is composed of branches and vertices. A vertex denotes a supplier, a transfer center, or a customer and a branch connecting a pair of vertices denotes a carrier. In the brittle commodity logistics network, each supplier has limited production capacity and the production cost is counted in terms of the number of the provided goods. Moreover, the delivery capacity (e.g. number of containers) provided by any carrier is multistate because the partial capacities may be reserved for other customers, and the delivery cost is counted in terms of the consumed delivery capacity. In the brittle commodity delivery, the goods may be damaged by natural disasters, traffic accidents, collisions, and so on, such that the intact goods can not satisfy the customer demand. Hence the delivery damage should be considered while evaluating the performance of a logistics network. This paper proposes the supply-chain reliability, which is defined as the probability of the network to successfully deliver goods to the customer with the delivery damage, limited production capacity, and budget considerations, to be a performance index. In terms of minimal paths, an algorithm is developed to evaluate the supply-chain reliability. A practical case of flat glass logistics is employed to discuss the management implications of the supply-chain reliability.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  • Abbas, A., Nezhad, K., Roghanian, E., & Azadi, Z. (2013). A fuzzy goal programming approach to solve multi-objective supply chain network design problems. International Journal of Industrial Engineering Computations, 4, 315–324.

    Article  Google Scholar 

  • Al-Ghanim, A. M. (1999). A heuristic technique for generating minimal paths and cutsets of a general network. Computers & Industrial Engineering, 36, 45–55.

    Article  Google Scholar 

  • Azad, N., Saharidis, G. K. D., Davoudpour, H., Malekly, H., & Alireza, S. (2013). Strategies for protecting supply chain networks against facility and transportation disruptions: An improved Benders decomposition approach. Annals of Operations Research, 210, 125–163.

    Article  Google Scholar 

  • Chen, S. G. (2012). Fuzzy-scorecard based logistics management in robust SCM. Computers and Industrial Engineering, 62, 740–745.

    Article  Google Scholar 

  • Chopra, S. (2003). Designing the distribution network in a supply chain. Transportation Research Part E: Logistics and Transportation Review, 39, 123–140.

    Article  Google Scholar 

  • Chopra, S., & Meindl, P. (2012). Supply chain management: Strategy, planning, and operation (5th ed.). Englewood Cliffs: Prentice Hall.

    Google Scholar 

  • Creazza, A., Dallari, F., & Melacini, M. (2010). Evaluating logistics network configurations for a global supply chain. Supply Chain Management, 15, 154–164.

    Article  Google Scholar 

  • Ford, L. R., & Fulkerson, D. R. (1962). Flows in networks. Princeton, NJ: Princeton University Press.

    Google Scholar 

  • Hammami, R., & Frein, Y. (2013). An optimisation model for the design of global multi-echelon supply chains under lead time constraints. International Journal of Production Research, 51, 2760–2775.

    Article  Google Scholar 

  • Jacyna-Gołda, I. (2013). Chosen aspects of logistics network design method for production service companies. International Journal of Logistics Systems and Management, 15, 219–238.

    Article  Google Scholar 

  • Kobayashi, K., & Yamamoto, H. (1999). A new algorithm in enumerating all minimal paths in a sparse network. Reliability Engineering and System Safety, 65, 11–15.

    Article  Google Scholar 

  • Lin, J. S., Jane, C. C., & Yuan, J. (1995). On reliability evaluation of a capacitated-flow network in terms of minimal pathsets. Networks, 25, 131–138.

    Article  Google Scholar 

  • Lin, Y. K. (2007a). Performance evaluation for the logistics system in case that capacity weight varies from arcs and types of commodity. International Journal of Production Economics, 107, 572–580.

    Article  Google Scholar 

  • Lin, Y. K. (2007b). Reliability evaluation for an information network with node failure under cost constraint. IEEE Transactions On Systems, Man, And Cybernetics-Part A: Systems And Humans, 37, 180–188.

    Article  Google Scholar 

  • Lin, Y. K. (2009). Optimal routing policy of a stochastic flow network. Computers and Industrial Engineering, 56, 1414–1418.

    Article  Google Scholar 

  • Lin, Y. K. (2010). A stochastic model to study the system capacity for supply chains in terms of minimal cuts. International Journal of Production Economics, 124, 181–187.

    Article  Google Scholar 

  • Lin, Y. K., & Chang, P. C. (2013). Graphical-based reliability evaluation of multiple distinct production lines. Journal of Systems Science and Systems Engineering, 22, 73–92.

    Article  Google Scholar 

  • Lin, Y. K., & Yeh, C. T. (2010). Optimal carrier selection based on network reliability criterion for stochastic logistics networks. International Journal of Production Economics, 128, 510–517.

    Article  Google Scholar 

  • Lin, Y. K., & Yeh, C. T. (2011). Maximal network reliability for a stochastic power transmission network. Reliability Engineering and System Safety, 96, 1332–1339.

    Article  Google Scholar 

  • Liu, M., Lin, G.L., & Hu, Z. H. (2010). Study on multi-objective optimization model for fragile production logistics path selection based on risk and cost. In Proceedings of international conference of information science and management engineering (pp. 547–550).

  • Petridis, K. (2013). Optimal design of multi-echelon supply chain networks under normally distributed demand. Annals of Operations Research. doi:10.1007/s10479-013-1420-6.

  • Soleimani, H., Seyyed-Esfahani, M., & Shirazi, M. A. (2013). A new multi-criteria scenario-based solution approach for stochastic forward/reverse supply chain network design. Annals of Operations Research. doi:10.1007/s10479-013-1435-z.

  • Trienekens, J. H., Wognum, P. M., Beulens, A. J. M., & van der Vorst, J. G. A. J. (2012). Transparency in complex dynamic food supply chains. Advanced Engineering Informatics, 26, 55–65.

    Article  Google Scholar 

  • Yeh, W. C. (2011). A sequential decomposition method for estimating flow in a multi-commodity, multistate network. IEEE Transactions on Reliability, 60, 612–621.

    Article  Google Scholar 

  • Yeh, W. C., & El Khadiri, M. (2012). A new universal generating function method for solving the single (d, \(\tau \))-quick-path problem in multistate flow networks. IEEE Transactions on Systems, Man, and Cybernetics Part A: Systems and Humans, 42, 1476–1484.

  • Zuo, M. J., Tian, Z., & Huang, H. Z. (2007). An efficient method for reliability evaluation of multistate networks given all minimal path vectors. IIE Transactions, 39, 811–817.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yi-Kuei Lin.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lin, YK., Yeh, CT. & Huang, CF. A simple algorithm to evaluate supply-chain reliability for brittle commodity logistics under production and delivery constraints. Ann Oper Res 244, 67–83 (2016). https://doi.org/10.1007/s10479-014-1741-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-014-1741-0

Keywords

Navigation