Losses in Transportation—Importance and Methods of Handling

A smart supply network must be immune against the situations like losing the goods during the transportation process. Such losses may raise the necessity of increasing the number of deliveries and thus the use of fuel and pollution. The importance of this problem has been proved by the results of a quantitative research performed among Polish companies. A solution to this problem is to design a smart supply network with appropriate DSS (decision support system), based on relevant mathematical models and algorithms, that allow to reduce the number of multiple deliveries.

[1]  Andrew V. Goldberg,et al.  Combinatorial algorithms for the generalized circulation problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[2]  Stavros A. Zenios,et al.  Data parallel computing for network-structured optimization problems , 1994, Comput. Optim. Appl..

[3]  Anna Nagurney,et al.  Competitive Food Supply Chain Networks with Application to Fresh Produce , 2012 .

[4]  William S. Jewell,et al.  OPTIMAL FLOW THROUGH NETWORKS WITH GAINS , 2016 .

[5]  Stavros A. Zenios,et al.  Proximal minimizations with D-functions and the massively parallel solution of linear network programs , 1993, Comput. Optim. Appl..

[6]  Amir H. Masoumi,et al.  A Supply Chain Generalized Network Oligopoly Model for Pharmaceuticals under Brand Differentiation and Perishability , 2012 .

[7]  Kevin D. Wayne.  A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow , 2002, Math. Oper. Res..

[8]  Reeta Gupta.  Solving the Generalized Transportation Problem with Constraints , 1978 .

[9]  R. Akkerman,et al.  An optimization approach for managing fresh food quality throughout the supply chain , 2011 .

[10]  Yair Censor,et al.  Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems , 1991, SIAM J. Optim..

[11]  S. Zanoni,et al.  Chilled or frozen? Decision strategies for sustainable food supply chains , 2012 .

[12]  David P. Williamson,et al.  A simple GAP-canceling algorithm for the generalized maximum flow problem , 2006, SODA '06.

[13]  Amir H. Masoumi,et al.  Networks Against Time: Supply Chain Analytics for Perishable Products , 2013 .

[14]  Fred W. Glover,et al.  Basic Dual Feasible Solutions for a Class of Generalized Networks , 1972, Oper. Res..

[15]  D. Waters.  Supply Chain Risk Management: Vulnerability and Resilience in Logistics , 2007 .

[16]  A. Nagurney,et al.  Sustainable Fashion Supply Chain Management Under Oligopolistic Competition and Brand Differentiation , 2011 .

[17]  Fred Glover,et al.  A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems , 1974 .

[18]  Anna Nagurney,et al.  Medical Nuclear Supply Chain Design: A Tractable Network Model and Computational Approach , 2012 .

[19]  Jesus René Villalobos,et al.  Application of planning models in the agri-food supply chain: A review , 2009, Eur. J. Oper. Res..

[20]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[21]  T. Choi,et al.  Mean-downside-risk and mean-variance newsvendor models: Implications for sustainable fashion retailing , 2012 .

[22]  C. Dangalchev.  Partially-linear transportation problems , 1996 .

[23]  E. Balas.  The Dual Method for the Generalized Transportation Problem , 1966 .

[24]  Michael Patriksson,et al.  A survey on the continuous nonlinear resource allocation problem , 2008, Eur. J. Oper. Res..

[25]  Paul Tseng,et al.  Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems , 1988, Oper. Res..

[26]  F. Glover,et al.  A Note on Computational Simplifications in Solving Generalized Transportation Problems , 1973 .

[27]  William S. Jewell.  New Methods in Mathematical Programming---Optimal Flow Through Networks with Gains , 1962 .

[28]  E. Balas,et al.  On the Generalized Transportation Problem , 1964 .

[29]  Janice R. Lourie,et al.  Topology and Computation of the Generalized Transportation Problem , 1964 .

[30]  Liqun Qi,et al.  The A-Forest Iteration Method for the Stochastic Generalized Transportation Problem , 1987, Math. Oper. Res..

[31]  Steven Nahmias,et al.  Perishable Inventory Theory: A Review , 1982, Oper. Res..

[32]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[34]  Anna Nagurney,et al.  Supply chain network operations management of a blood banking system with cost and risk minimization , 2011, Comput. Manag. Sci..

[35]  Donald Goldfarb,et al.  Combinatorial interior point methods for generalized network flow problems , 2002, Math. Program..

[36]  Ellis L. Johnson,et al.  Networks and Basic Solutions , 1966, Oper. Res..

[37]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[38]  Amir H. Masoumi,et al.  Networks Against Time , 2013 .

[39]  Fred W. Glover,et al.  A Strongly Convergent Primal Simplex Algorithm for Generalized Networks , 1979, Math. Oper. Res..

[40]  Gerald L. Thompson,et al.  Solution of constrained generalized transportation problems using the pivot and probe algorithm , 1986, Comput. Oper. Res..

[41]  Edith Cohen,et al.  New algorithms for generalized network flows , 1994, Math. Program..

[42]  Anna Nagurney,et al.  Supply Chain Network Design of a Sustainable Blood Banking System , 2011 .

[43]  John Rowse,et al.  Solving the generalized transportation problem , 1981 .